Register
Filter

Answers by Bikram

2 votes
561
Test by Bikram | General Aptitude | Test 2 | Question: 12
A number $1$5 is divided into three parts which are in A.P. and the sum of their squares is $83$. The highest part is: $3$ $5$ $6$ $7$
A number $1$5 is divided into three parts which are in A.P. and the sum of their squares is $83$.The highest part is:$3$$5$$6$$7$
3 votes
563
Test by Bikram | Compiler Design | Test 1 | Question: 21
Which one of the following can be handled by predictive parsers? Left recursion Left factors Ambiguity Non-determinism
Which one of the following can be handled by predictive parsers?Left recursionLeft factorsAmbiguityNon-determinism
1 votes
566
Test by Bikram | Data Structures | Test 2 | Question: 11
The concatenation of $2$ lists is to be performed in $O(1)$ time. Which of the following implementations should be used? array implementation of list doubly linked list singly linked list circular doubly linked list
The concatenation of $2$ lists is to be performed in $O(1)$ time. Which of the following implementations should be used?array implementation of listdoubly linked listsing...
6 votes
570
Test by Bikram | Computer Networks | Test 1 | Question: 26
Consider a sliding window protocol that uses Selective Repeat, the sender sliding window size is $32$. The sequence number of the frame to be sent after sending $200$ frames ___________
Consider a sliding window protocol that uses Selective Repeat, the sender sliding window size is $32$. The sequence number of the frame to be sent after sending $200$ fra...
9 votes
573
Test by Bikram | General Aptitude | Test 2 | Question: 2
Find the missing letter in the following table: $\begin{array}{|c|c|c|} \hline N & 126 & R \\ \hline T & 100 & Y \\ \hline Y & 50 & P \\ \hline K & 12 & L \\ \hline G & 13 & ? \\ \hline \end{array}$ Y X Q Z
Find the missing letter in the following table:$$\begin{array}{|c|c|c|} \hline N & 126 & R \\ \hline T & 100 & Y \\ \hline Y & 50 & P \\ \hline K & 12 & L \\ \hline G & 1...
0 votes
576
Test by Bikram | Data Structures | Test 2 | Question: 25
Consider an array of elements $6 \ 4 \ 5 \ 3 \ 7 \ 1$. The contents of the array after three passes when we apply Bubble Sort on it is $3 \ 4 \ 1 \ 5 \ 6 \ 7$ $3 \ 4 \ 5 \ 1 \ 6 \ 7$ $3 \ 1 \ 4 \ 5 \ 6 \ 7$ $3 \ 4 \ 5 \ 6 \ 1 \ 7$
Consider an array of elements $6 \ 4 \ 5 \ 3 \ 7 \ 1$. The contents of the array after three passes when we apply Bubble Sort on it is$3 \ 4 \ 1 \ 5 \ 6 \ 7$$3 \ 4 \ 5 \ ...
1 votes
580
Test by Bikram | Digital Logic | Test 2 | Question: 1
A minimum sum-of-products expression of the function $F(w, x, y,z) = \Sigma m ( 0, 2, 5, 8, 10, 13, 14 )$ using Karnaugh map is: $x'z+xy+yxz$ $x'z' + xy'z + wyz'$ $x'z' + xy'z + wyz$ $x'z' + xy'z' + wyz$
A minimum sum-of-products expression of the function $F(w, x, y,z) = \Sigma m ( 0, 2, 5, 8, 10, 13, 14 )$ using Karnaugh map is:$x'z+xy+yxz$$x'z' + xy'z + wyz'$$x'z' + xy...
1 votes
581
Test by Bikram | Databases | Test 1 | Question: 24
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
2 votes
586
Test by Bikram | Compiler Design | Test 1 | Question: 9
___________ parsers build parse trees starting from the root node and work down to the leaves. LR LL SLR LALR
___________ parsers build parse trees starting from the root node and work down to the leaves.LRLLSLRLALR
2 votes
587
Test by Bikram | Compiler Design | Test 1 | Question: 7
The number of proper prefixes for a string of length $n$ are ___________. $n+1$ $n(n+1)/2$ $n-1$ $(n-1)/2$
The number of proper prefixes for a string of length $n$ are ___________.$n+1$$n(n+1)/2$$n-1$$(n-1)/2$
2 votes
588
Test by Bikram | Compiler Design | Test 1 | Question: 2
The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce dependent on a situation
The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce depen...
Page: