Register
Filter

Questions by Bikram

2.1k
views
3 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 35
Consider the following possible data structures for a set of $n$ distinct integers.A min-heapAn array of length $n$ sorted in increasing orderA balanced binary search treeFor ... time in the worst case?I and IIIII and IIII and IIII only
968
views
1 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 34
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte ... basic inverted page table, including page numbers and overhead bits is ________ $bytes$.
445
views
2 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 33
Let A represent the below matrix:$\begin{pmatrix} 1 & 0 & 3 \\ 2 & 1 & -1 \\ 1 & -1 & 1 \end{pmatrix}$Then which among these four options are correct :$A^{3}$ $+ 3$ $A^{2}$ ... 3$ $A^{2}$ $+ A + 9I = 0$A^{3}$+ 3$ $A^{2}$- A + 9I = 0$
350
views
1 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 32
Suppose that six keys are inserted into an unbalanced binary search tree in the following order: $4, 6, 3, 8, 2$, and $5$.Then which of the following statements is ... to the tree.I and II onlyI and III onlyII and III onlyI, II, and III
1.3k
views
2 answers
3 votes
Test by Bikram | Mock GATE | Test 2 | Question: 31
Consider the disk drive with the following specification:$16$ surfaces, $1024$ tracks/surface, $1024$ sectors/track, $1KB/sector$ ... . The percentage of processor time consumed for the transfer operation is ________.
887
views
2 answers
4 votes
Test by Bikram | Mock GATE | Test 2 | Question: 30
Which of the following statements are true?Every totally ordered set is a latticeEvery lattice has a least element and a greatest elementAll totally ordered posets are also well ordered posets.i onlyii and iiii onlyii onlyi, ii and iii
925
views
1 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 29
Given a graph $G$ with vertex set $V$ and edge set $E$, which of the following statements is/are correct about graph $G$?If $G$ is directed and acyclic ... and cross edges (all other remaining links).I onlyIII onlyI and II onlyI, II and III
813
views
2 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 28
Consider the following constraints on a relation schema:A student can register for at most $t$ courses and each course can have at most $p$ students.Each student is enrolled to at ... 1$Z \leqslant t \times L$L > p \times Z$L \leqslant 10$
861
views
2 answers
3 votes
Test by Bikram | Mock GATE | Test 2 | Question: 27
Let $T$ be a depth-first search tree of a connected undirected graph $G$. For each vertex $v$ of $T$,Let pre$\left ( v \right )$ be the number of nodes visited up to ... $u$ and $v$ in $T$, then $w = u$.II onlyIII onlyI and IIII and III
674
views
2 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 26
The designers of a computer must select a cache system. They have two options.In first design they uses a direct-mapped cache containing $2$ words per cache line. It would have an instruction ... $D1 = 0.70, D2 = 0.48$
291
views
1 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 25
Which of the following sorting algorithms has the lowest best-case asymptotic algorithmic complexity?Selection sortMerge sortInsertion sortHeap sort
555
views
2 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 24
Which of the following expressions evaluates to the largest number?The prefix expression $+ $*$ - 2 3 5 7$The postfix expression $2 3 + 5 $*$ 7 -$ ... $2$ $3$ + $5$ $7$ $-$ *
369
views
2 answers
0 votes
Test by Bikram | Mock GATE | Test 2 | Question: 23
Suppose a user turns on a computer, starts a browser, types http://www.google.com, and hits ENTER.Which of the following protocols would probably not be used at any point to serve this request?$IP$TCP$UDP$SMTP$
530
views
1 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 22
A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track.Consider the following statements:The average latency ... statements is/are true?II and III onlyI, II, and IIII and II onlyII only
903
views
1 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 21
Which of the following statements are false?The order of any finite group is always divisible by the order of the subgroups.Intersection of two subgroups of a group ... proper and improper subgroups.III and IVII and IVI and IIII, III, IV
499
views
2 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 20
Given a binary search tree $T$, what is the path from $a$ node $x$ to its successor $y$, assuming that both $x$ and $y$ exist in $T$?if $x$ has a right child, ... $y$ is the parent of $x's$ first ancestor $z$ such that $z$ is a left child
686
views
2 answers
1 votes
Test by Bikram | Mock GATE | Test 2 | Question: 19
Consider a language $L$ that is recognized by a machine $M$. Which of the following statements might not be true?If $M$ is a deterministic finite ... $M$ is a non-deterministic pushdown automaton, then $L$ is recursively enumerable.
810
views
3 answers
5 votes
Test by Bikram | Mock GATE | Test 2 | Question: 18
Which of the following statements is/are true?Floating point addition is always associative.Shifting a twos-complement integer right by one bit, and filling from the left ... II onlyII and III onlyAll are falseI, II, and III all are true
877
views
2 answers
6 votes
Test by Bikram | Mock GATE | Test 2 | Question: 17
A Multinational software vendor needs to choose two sorting algorithm implementations $S1$ and $S2$ to built a software for it's offshore clients.$S1$ will be used in ... for $S2$. Insertion sort for $S1$ and selection sort for $S2$.
610
views
1 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 16
While designing a memory management subsystem, a computer hardware manufacturer must decide whether to utilize a partitioning, segmentation, or demand paging strategy.Which of the ... I and III only I, II, and III all are correct
Page: