Register

These questions are basic level ones and can be answered in less than a minute if you have seen the topic.

Recent questions tagged easy

0 votes
3 answers
151
NIELIT 2017 DEC Scientist B - Section B: 32
The collection of Turing recognizable languages are closed under: Union Intersection Complement Concatenation Star Closure (i) Only Both (i),(iv) (i),(ii),(iv)and(v) All of the options
The collection of Turing recognizable languages are closed under:UnionIntersectionComplementConcatenationStar Closure(i) OnlyBoth (i),(iv)(i),(ii),(iv)and(v)All of the op...
User Avatar
0 votes
1 answer
152
UGC NET CSE | December 2006 | Part 2 | Question: 22
Binary search tree is an example of : Divide and conquer technique Greedy algorithm Back tracking Dynamic Programming
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming
User Avatar
0 votes
1 answer
153
UGC NET CSE | December 2004 | Part 2 | Question: 20
Match the following : ... -d i-d, ii-c, iii-a, iv-b i-d, ii-c, iii-b, iv-a i-a, ii-b, iii-c, iv-d
Match the following :$\begin{array}{ll}\text{(i) 2NF} &\text{(a) Transitive dependencies eliminated} \\ \text{(ii) 3NF} &\text{(b) Multivalued attribute removed} \...
User Avatar
0 votes
6 answers
154
UGC NET CSE | January 2017 | Part 3 | Question: 36
Match the following with respect to algorithm paradigms : ... $\text{a-ii, b-i, c-iii, d-iv}$ $\text{a-iii, b-ii, c-i, d-iv}$
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{a.} & \text{Merge sort} & \text{i.} & \te...
User Avatar
1 votes
1 answer
155
GATE Civil 2020 Set 1 | GA Question: 3
Select the word that fits the analogy: Fuse : Fusion :: Use : ______ Usage User Uses Usion
Select the word that fits the analogy:Fuse : Fusion :: Use : ______UsageUserUsesUsion
User Avatar
1 votes
1 answer
156
GATE Civil 2020 Set 1 | GA Question: 4
If $0,1,2,\dots,7,8,9$ are coded as $O,P,Q,\dots,V,W,X$, then $45$ will be coded as ______. $TS$ $ST$ $SS$ $SU$
If $0,1,2,\dots,7,8,9$ are coded as $O,P,Q,\dots,V,W,X$, then $45$ will be coded as ______.$TS$$ST$$SS$$SU$
User Avatar
15 votes
4 answers
159
GATE CSE 2020 | Question: 18
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
User Avatar
6 votes
5 answers
160
ISRO2020-55
If $x+2y=30$, then $\left(\dfrac{2y}{5}+\dfrac{x}{3} \right) + \left (\dfrac{x}{5}+\dfrac{2y}{3} \right)$ will be equal to $8$ $16$ $18$ $20$
If $x+2y=30$, then $\left(\dfrac{2y}{5}+\dfrac{x}{3} \right) + \left (\dfrac{x}{5}+\dfrac{2y}{3} \right)$ will be equal to$8$$16$$18$$20$
User Avatar
3 votes
3 answers
162
ISRO2020-38
Which of the following is true? Every subset of a regular set is regular Every finite subset of non-regular set is regular The union of two non regular set is not regular Infinite union of finite set is regular
Which of the following is true?Every subset of a regular set is regularEvery finite subset of non-regular set is regularThe union of two non regular set is not regularInf...
User Avatar
2 votes
4 answers
163
ISRO2020-37
Context free languages are closed under union, intersection union, kleene closure intersection, complement complement, kleene closure
Context free languages are closed underunion, intersectionunion, kleene closureintersection, complementcomplement, kleene closure
User Avatar
5 votes
12 answers
164
ISRO2020-50
If every non-key attribute functionally dependent on the primary key, then the relation will be in First normal form Second normal form Third normal form Fourth Normal form
If every non-key attribute functionally dependent on the primary key, then the relation will be inFirst normal formSecond normal formThird normal formFourth Normal form
User Avatar
5 votes
4 answers
165
ISRO2020-14
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done during second pass first pass and second pass respectively second pass and first pass respectively first pass
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done duringsecond passfirst pass and second pass respectivelysecond...
User Avatar
3 votes
3 answers
166
ISRO2020-13
The number of tokens in the following C code segment is switch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; } $27$ $29$ $26$ $24$
The number of tokens in the following C code segment isswitch(inputvalue) { case 1 : b =c*d; break; default : b =b++; break; }$27$$29$$26$$24$
User Avatar
3 votes
2 answers
168
ISRO2020-21
The master theorem assumes the subproblems are unequal sizes can be used if the subproblems are of equal size cannot be used for divide and conquer algorithms cannot be used for asymptotic complexity analysis
The master theoremassumes the subproblems are unequal sizescan be used if the subproblems are of equal sizecannot be used for divide and conquer algorithmscannot be used ...
User Avatar
2 votes
3 answers
169
ISRO2020-19
What is the in-order successor of $15$ in the given binary search tree? $18$ $6$ $17$ $20$
What is the in-order successor of $15$ in the given binary search tree?$18$$6$$17$$20$
User Avatar
3 votes
1 answer
170
ISRO2020-76
If $A=\{x,y,z\}$ and $B=\{u,v,w,x\}, $ and the universe is $\{s,t,u,v,w,x,y,z\}$. Then $(A \cup \overline{B}) \cap (A \cap B)$ is equal to $\{u,v,w,x\}$ $\{ \: \}$ $\{u,v,w,x,y,z\}$ $\{u,v,w\}$
If $A=\{x,y,z\}$ and $B=\{u,v,w,x\}, $ and the universe is $\{s,t,u,v,w,x,y,z\}$. Then $(A \cup \overline{B}) \cap (A \cap B)$ is equal to$\{u,v,w,x\}$$\{ \: \}$$\{u,v,w,...
User Avatar
1 votes
3 answers
171
ISRO2020-75
A grammar is defined as $A \rightarrow BC$ $B \rightarrow x \mid Bx$ $C \rightarrow B \mid D$ $D \rightarrow y \mid Ey$ $E \rightarrow z$ The non terminal alphabet of the grammar is $\{A,B,C,D,E\}$ $\{B,C,D,E\}$ $\{A,B,C,D,E,x,y,z\}$ $\{x,y,z\}$
A grammar is defined as$A \rightarrow BC$$B \rightarrow x \mid Bx$$C \rightarrow B \mid D$$D \rightarrow y \mid Ey$$E \rightarrow z$The non terminal alphabet of the gram...
User Avatar
4 votes
3 answers
173
ISRO2020-25
What is compaction refers to a technique for overcoming internal fragmentation a paging technique a technique for overcoming external fragmentation a technique for compressing the data
What is compaction refers toa technique for overcoming internal fragmentationa paging techniquea technique for overcoming external fragmentationa technique for compressin...
User Avatar
2 votes
2 answers
174
ISRO2020-29
An aid to determine the deadlock occurrence is resource allocation graph starvation graph inversion graph none of the above
An aid to determine the deadlock occurrence isresource allocation graphstarvation graphinversion graphnone of the above
User Avatar
2 votes
1 answer
175
ISRO2020-28
Dispatch latency is defined as the speed of dispatching a process from running to the ready state the time of dispatching a process from running to ready state and keeping the CPU idle the time to stop one process and start running another one none of these
Dispatch latency is defined asthe speed of dispatching a process from running to the ready statethe time of dispatching a process from running to ready state and keeping ...
User Avatar
2 votes
1 answer
176
ISRO2020-27
Which of the following algorithms defines time quantum? shortest job scheduling algorithm round robin scheduling algorithm priority scheduling algorithm multilevel queue scheduling algorithm
Which of the following algorithms defines time quantum?shortest job scheduling algorithmround robin scheduling algorithmpriority scheduling algorithmmultilevel queue sche...
User Avatar
0 votes
0 answers
178
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 12 (Page No. 82)
Which of the following instructions should be allowed only in kernel mode? Disable all interrupts. Read the time-of-day clock. Set the time-of-day clock. Change the memory map
Which of the following instructions should be allowed only in kernel mode?Disable all interrupts.Read the time-of-day clock.Set the time-of-day clock.Change the memory ma...
User Avatar
4 votes
4 answers
179
CMI2018-A-1
Which of the words below matches the regular expression $a(a+b)^{\ast}b+b(a+b)^{\ast}a$? $aba$ $bab$ $abba$ $aabb$
Which of the words below matches the regular expression $a(a+b)^{\ast}b+b(a+b)^{\ast}a$?$aba$$bab$$abba$$aabb$
User Avatar
Page: