Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged nielit2017oct-assistanta-cs
0
votes
1
answer
31
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 7
The number of the edges in a regular graph of degree $’d’$ and $’n’$ vertices is Maximum of $n,d$ $n+d$ $nd$ $nd/2$
admin
asked
in
Graph Theory
Apr 1, 2020
by
admin
567
views
nielit2017oct-assistanta-cs
discrete-mathematics
graph-theory
degree-of-graph
2
votes
3
answers
32
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 8
Consider the following C code segment: int Ls Prime(n) { int i,n; for(i=2;i<=sqrt(n);i++) if(n%i ==0) { printf( NOT Prime.\n ); return 0; } return 1; } Let $T(n)$ denote the number of times the for loop is executed by the program on input $n.$ ... $T(n) = \Omega (1)$ $T(n) = O(n)$ and $T(n) = \Omega (\sqrt{n})$ None of these
admin
asked
in
Algorithms
Apr 1, 2020
by
admin
854
views
nielit2017oct-assistanta-cs
algorithms
time-complexity
0
votes
1
answer
33
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 9
A language $L$ for which there exists a $TM\;\;’T’,$ that accepts every word in $L$ and either rejects or loops for every word that is not in $L,$ is said to be Recursive Recursively enumerable NP-HARD None of the above
admin
asked
in
Theory of Computation
Apr 1, 2020
by
admin
552
views
nielit2017oct-assistanta-cs
theory-of-computation
recursive-and-recursively-enumerable-languages
0
votes
1
answer
34
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 10
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above
admin
asked
in
Compiler Design
Apr 1, 2020
by
admin
3.2k
views
nielit2017oct-assistanta-cs
compiler-design
context-free-grammar
first-and-follow
4
votes
4
answers
35
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 11
Synthesized attribute can easily be simulated by an LL grammar ambiguous grammar LR grammar none of the above
admin
asked
in
Compiler Design
Apr 1, 2020
by
admin
1.3k
views
nielit2017oct-assistanta-cs
compiler-design
syntax-directed-translation
3
votes
2
answers
36
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 12
The logic of pumping lemma is a good example of the pigeon-hole principle the divide and conquer technique recursion iteration
admin
asked
in
Theory of Computation
Apr 1, 2020
by
admin
937
views
nielit2017oct-assistanta-cs
theory-of-computation
pumping-lemma
1
vote
3
answers
37
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 13
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$ $R$ has no duplicates and $S$ is non-empty $R$ and $S$ have no duplicates $S$ has no duplicates and $R$ is non-empty $R$ and $S$ has the same number of tuples
admin
asked
in
Databases
Apr 1, 2020
by
admin
835
views
nielit2017oct-assistanta-cs
databases
sql
1
vote
1
answer
38
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 14
E-R model uses this symbol to represent weak entity set? Dotted rectangle Diamond Doubly outlined rectangle None of these
admin
asked
in
Databases
Apr 1, 2020
by
admin
900
views
nielit2017oct-assistanta-cs
databases
relational-model
0
votes
1
answer
39
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 15
By open domain CASE tools we mean tools available in open domain software packages which can be downloaded from the internet software packages to aid each phase of the systems analysis and design which can be downloaded free of cost from the internet source codes of CASE tools
admin
asked
in
IS&Software Engineering
Apr 1, 2020
by
admin
560
views
nielit2017oct-assistanta-cs
non-gate
is&software-engineering
1
vote
2
answers
40
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 16
If $P$ is risk probability, $L$ is loss, then Risk Exposure $(RE)$ is computed as. $RE = P/L$ $RE = P + L$ $RE = P \ast L$ $RE = 2 \ast P \ast L$
admin
asked
in
Probability
Apr 1, 2020
by
admin
1.6k
views
nielit2017oct-assistanta-cs
engineering-mathematics
probability
1
vote
1
answer
41
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 17
A can is filled with $5$ paise coins. Another can is filled with $10$ paise coins. Another can is filled with $25$ paise coins. All the cans are given wrong labels. If the can labeled $25$ paise is not having the $10$ paise coins, what will the can, labeled $10$ paise have? $25$ paise $5$ paise $10$ paise cannot be determined
admin
asked
in
Quantitative Aptitude
Apr 1, 2020
by
admin
940
views
nielit2017oct-assistanta-cs
general-aptitude
quantitative-aptitude
2
votes
1
answer
42
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 18
What is the maximum value of the function $f(x) = 2x^{2} – 2x + 6$ in the interval $[0,2]?$ $6$ $10$ $12$ $5,5$
admin
asked
in
Calculus
Apr 1, 2020
by
admin
642
views
nielit2017oct-assistanta-cs
engineering-mathematics
calculus
maxima-minima
0
votes
1
answer
43
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 19
The value of the Integral $I = \displaystyle{}\int_{0}^{\pi/2} x^{2}\sin x dx$ is $(x+2)/2$ $2/(\pi-2)$ $\pi – 2$ $\pi + 2$
admin
asked
in
Calculus
Apr 1, 2020
by
admin
472
views
nielit2017oct-assistanta-cs
engineering-mathematics
calculus
definite-integral
8
votes
3
answers
44
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 20
The possible number of Boolean function of $3$ variables $X,Y$ and $Z$ such that $f(X,Y,Z) = f(X’,Y’,Z’)$ $8$ $16$ $64$ $32$
admin
asked
in
Digital Logic
Apr 1, 2020
by
admin
1.3k
views
nielit2017oct-assistanta-cs
digital-logic
boolean-algebra
1
vote
3
answers
45
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 21
What is the modality of relationship, if there is no explicit need for relationship to occur? Zero Two Three One
admin
asked
in
Databases
Apr 1, 2020
by
admin
1.0k
views
nielit2017oct-assistanta-cs
databases
relational-model
1
vote
4
answers
46
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 22
If the original size of data is $40$ then after adding error detection redundancy bit the size of data length is $26$ $36$ $46$ $56$
admin
asked
in
Computer Networks
Apr 1, 2020
by
admin
6.8k
views
nielit2017oct-assistanta-cs
computer-networks
error-detection
0
votes
1
answer
47
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 23
Which of the following would not be specified in a communication protocol? Header contents Trailer contents Error Checking Data content of message
admin
asked
in
Computer Networks
Apr 1, 2020
by
admin
1.6k
views
nielit2017oct-assistanta-cs
computer-networks
network-protocols
1
vote
2
answers
48
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 24
Bit stuffing refers to Inserting a $’0’$ in user data stream to differentiate it with a flag Inserting a $’0’$ in flag stream to avoid ambiguity Appending a nibble to the flag sequence Appending a nibble to the user data stream
admin
asked
in
Computer Networks
Apr 1, 2020
by
admin
730
views
nielit2017oct-assistanta-cs
computer-networks
bit-stuffing
0
votes
3
answers
49
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 25
A micro programmed control unit Is faster than a hardwired unit Facilitates easy implementation of a new instruction Is useful when small programs are to be run All of the above
admin
asked
in
CO and Architecture
Apr 1, 2020
by
admin
908
views
nielit2017oct-assistanta-cs
co-and-architecture
control-unit
microprogramming
0
votes
2
answers
50
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 26
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel? $16.15$ kbps $23.24$ kbps $40.12$ kbps $24.74$ kbps
admin
asked
in
Computer Networks
Apr 1, 2020
by
admin
1.2k
views
nielit2017oct-assistanta-cs
computer-networks
0
votes
0
answers
51
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 27
At $100\%$ modulation, the power in each sideband is _______ of that of carrier. $50\%$ $40\%$ $60\%$ $25\%$
admin
asked
in
Digital Signal Processing
Apr 1, 2020
by
admin
349
views
nielit2017oct-assistanta-cs
non-gate
0
votes
1
answer
52
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 28
The capacity relationship is given by $C = W\log_{2}(1+S/N)$ $C = 2W\log_{2}(1+S/N)$ $C = W\log_{2}(1-S/N)$ $C = W\log_{10}(1+S/N)$
admin
asked
in
Information Theory
Apr 1, 2020
by
admin
555
views
nielit2017oct-assistanta-cs
non-gate
0
votes
2
answers
53
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29
Which of the following algorithm solve the all-pair shortest path problem? Dijakstra’s algorithm Floyd’s algorithm Prim’s algorithm Warshall’s algorithm
admin
asked
in
Algorithms
Apr 1, 2020
by
admin
1.0k
views
nielit2017oct-assistanta-cs
algorithms
graph-algorithm
1
vote
3
answers
54
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 30
An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$
admin
asked
in
Algorithms
Apr 1, 2020
by
admin
998
views
nielit2017oct-assistanta-cs
algorithms
time-complexity
1
vote
2
answers
55
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 31
Which of the following definitions generates the same languages as $L,$ where $L = \{x^{n}y^{n},n \geq 1\}$ $E \rightarrow xEy \mid xy$ $xy \mid x^{+}xyy^{+}$ $x^{+}y^{+}$ $(i)$ $(i)$ and $(ii)$ only $(ii)$ and $(iii)$ only $(ii)$ only
admin
asked
in
Theory of Computation
Apr 1, 2020
by
admin
619
views
nielit2017oct-assistanta-cs
theory-of-computation
context-free-language
0
votes
1
answer
56
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 32
Choose the correct statements. A total recursive function is also a partial recursive function A partial recursive function is also a total recursive function A partial recursive function is also a primitive recursive function None of the above
admin
asked
in
Theory of Computation
Apr 1, 2020
by
admin
1.1k
views
nielit2017oct-assistanta-cs
theory-of-computation
recursion
0
votes
1
answer
57
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 33
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
admin
asked
in
Operating System
Apr 1, 2020
by
admin
2.0k
views
nielit2017oct-assistanta-cs
operating-system
demand-paging
page-fault
1
vote
1
answer
58
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 34
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
admin
asked
in
Databases
Apr 1, 2020
by
admin
1.8k
views
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
0
votes
3
answers
59
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 35
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6\text{ ms}$ per cylinder. The total seek time, if the disk arm scheduling algorithm is first-come-first-served is $900$ ms $850$ ms $360$ ms $876$ ms
admin
asked
in
Operating System
Apr 1, 2020
by
admin
1.0k
views
nielit2017oct-assistanta-cs
operating-system
disk-scheduling
2
votes
1
answer
60
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 36
Table employees has $10$ records. It has a non-NULL SALARY column which is also UNIQUE. The SQL statement SELECT COUNT(*) FROM EMPLOYEE WHERE SALARY > ALL (SELECT SALARY FROM EMPLOYEE); $10$ $9$ $5$ $0$
admin
asked
in
Databases
Apr 1, 2020
by
admin
1.6k
views
nielit2017oct-assistanta-cs
databases
sql
Page:
« prev
1
2
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged nielit2017oct-assistanta-cs
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...