Register

Recent questions tagged ugcnetcse-dec2018-paper2

0 votes
2 answers
2
UGC NET CSE | December 2018 | Part 2 | Question: 2
Match List-I with List-II and choose the correct answer from the code given below : ... -(iii), (b)-(iv), (c)-(ii), (d)-(i) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
​​​​​Match List-I with List-II and choose the correct answer from the code given below :$\begin{array}{|c|c|c|c|} \hline & \textbf{List I} & & \textbf{List II} ...
User Avatar
0 votes
2 answers
7
UGC NET CSE | December 2018 | Part 2 | Question: 7
The boolean expression $\overline{A} \cdot B + A \cdot \overline{B}+ A \cdot B$ is equivalenet to $\overline{A} \cdot B$ $\overline{A+B}$ $A \cdot B$ $A+B$
The boolean expression $\overline{A} \cdot B + A \cdot \overline{B}+ A \cdot B$ is equivalenet to$\overline{A} \cdot B$$\overline{A+B}$$A \cdot B$$A+B$
User Avatar
1 votes
1 answer
8
UGC NET CSE | December 2018 | Part 2 | Question: 8
In PERT/CPM, the merge event represents _____ of two or more events. completion beginning splitting joining
In PERT/CPM, the merge event represents _____ of two or more events.completionbeginningsplittingjoining
User Avatar
0 votes
1 answer
10
UGC NET CSE | December 2018 | Part 2 | Question: 10
In computers, subtraction is generally carried out by $9$’s complement $1$’s complement $10$’s complement $2$’s complement
In computers, subtraction is generally carried out by$9$’s complement$1$’s complement$10$’s complement$2$’s complement
User Avatar
0 votes
2 answers
12
UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$
User Avatar
0 votes
2 answers
17
UGC NET CSE | December 2018 | Part 2 | Question: 17
Find the boolean expression for the logic circuit shown below: $A \overline{B}$ $\overline{A} B$ $AB$ $\overline{A} \overline{B}$
Find the boolean expression for the logic circuit shown below:$A \overline{B}$$\overline{A} B$$AB$$\overline{A} \overline{B}$
User Avatar
1 votes
3 answers
21
UGC NET CSE | December 2018 | Part 2 | Question: 21
The solution of recurrence relation: $T(n) = 2T (\sqrt{n}) + \lg(n)$ is $O(\lg(n))$ $O(n \lg (n))$ $O(\lg (n) \lg (n))$ $O(\lg (n) \lg(\lg (n)))$
The solution of recurrence relation:$T(n) = 2T (\sqrt{n}) + \lg(n)$ is$O(\lg(n))$$O(n \lg (n))$$O(\lg (n) \lg (n))$$O(\lg (n) \lg(\lg (n)))$
User Avatar
1 votes
1 answer
23
UGC NET CSE | December 2018 | Part 2 | Question: 23
Consider two sequences $X$ and $Y$ : $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
Consider two sequences $X$ and $Y$ :$X=<0, 1, 2, 1, 3, 0, 1>$$Y=<1, 3, 2, 0, 1, 0>$The length of longest common subsequence between $X$ and $Y$ is$2$$3$$4$$5$
User Avatar
0 votes
2 answers
25
UGC NET CSE | December 2018 | Part 2 | Question: 25
A binary search tree is constructed by inserting the following numbers in order : $60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$ The number of nodes in the left subtree is $5$ $6$ $7$ $3$
A binary search tree is constructed by inserting the following numbers in order :$60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$The number of nodes in the left subtree ...
User Avatar
0 votes
2 answers
26
UGC NET CSE | December 2018 | Part 2 | Question: 26
In a ternary tree, the number of internal nodes of degree $1, 2, $ and $3$ is $4, 3$, and $3$ respectively. The number of leaf nodes in the ternary tree is $9$ $10$ $11$ $12$
In a ternary tree, the number of internal nodes of degree $1, 2, $ and $3$ is $4, 3$, and $3$ respectively. The number of leaf nodes in the ternary tree is$9$$10$$11$$12$...
User Avatar
0 votes
1 answer
27
UGC NET CSE | December 2018 | Part 2 | Question: 27
Match $\text{List I}$ with $\text{List II}$ ... $\text{(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)}$
Match $\text{List I}$ with $\text{List II}$ and choose the correct answer from the code given below.$\begin{array} {clcl} & \textbf{List I} & & \textbf{List II} \\ & \...
User Avatar
1 votes
2 answers
29
UGC NET CSE | December 2018 | Part 2 | Question: 29
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list? $O(n \lg \: n)$ $O(n)$ $O(\lg \: n)$ $O(1)$
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list?$O(n ...
User Avatar
0 votes
0 answers
30
UGC NET CSE | December 2018 | Part 2 | Question: 30
The second smallest of $n$ elements can be found with ____ comparisons in the worst case. $n-1$ $\lg \: n$ $n + ceil(\lg \: n)-2$ $\frac{3n}{2}$
The second smallest of $n$ elements can be found with ____ comparisons in the worst case.$n-1$$\lg \: n$$n + ceil(\lg \: n)-2$$\frac{3n}{2}$
User Avatar
Page: