Recent questions tagged tbb-mockgate-2 / GATE Overflow for GATE CSE

2 votes

3 answers

31

Test by Bikram | Mock GATE | Test 2 | Question: 35
Consider the following possible data structures for a set of $n$ distinct integers. A min-heap An array of length $n$ sorted in increasing order A balanced binary search tree For which of these data structures, the number of steps needed to find and remove ... element in $0 (\log n)$ time in the worst case? I and III II and III I and II II only

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 tre...

Bikram

1.9k views

Bikram asked Jan 24, 2017

2 votes

1 answer

32

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-addressable physical address space. The system manages an inverted page table, where ... ). Then the size of the basic inverted page table, including page numbers and overhead bits is ________ $bytes$.

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-addressable physical ad...

Bikram

869 views

Bikram asked Jan 24, 2017

2 votes

2 answers

33

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}$ $+ A – 9I = 0$ $A^{3}$ $- 3$ $A^{2}$ $- A + 9I = 0$ $A^{3}$ $- 3$ $A^{2}$ $+ A + 9I = 0$ $A^{3}$+ 3$ $A^{2}$- A + 9I = 0$

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...

Bikram

415 views

Bikram asked Jan 24, 2017

1 votes

1 answer

34

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$ ... without adding another level to the tree. I and II only I and III only II and III only I, II, and III

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/are co...

Bikram

329 views

Bikram asked Jan 24, 2017

3 votes

2 answers

35

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$, rotation speed is $3000 rpm$ and the disk is operated in burst Mode. The processor runs at ... the size of transferred data is $20KB$. The percentage of processor time consumed for the transfer operation is ________.

Consider the disk drive with the following specification:$16$ surfaces, $1024$ tracks/surface, $1024$ sectors/track, $1KB/sector$, rotation speed is $3000 rpm$ and the di...

Bikram

1.2k views

Bikram asked Jan 24, 2017

1 votes

1 answer

36

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, the asymptotic algorithmic complexity of topological sort on $G$ is $O$\left ... ancestors to descendants), and cross edges (all other remaining links). I only III only I and II only I, II and III

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, the asymptotic al...

Bikram

861 views

Bikram asked Jan 24, 2017

4 votes

2 answers

37

Test by Bikram | Mock GATE | Test 2 | Question: 30
Which of the following statements are true? Every totally ordered set is a lattice Every lattice has a least element and a greatest element All totally ordered posets are also well ordered posets. i only ii and iiii only ii only i, ii and iii

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 al...

Bikram

816 views

Bikram asked Jan 24, 2017

1 votes

2 answers

38

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 least one course and each course has at least one student. The schema is ... NOT possible? $Z = 1$ $Z \leqslant t \times L$ $L > p \times Z$ $L \leqslant 10$

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 enrol...

Bikram

763 views

Bikram asked Jan 24, 2017

3 votes

2 answers

39

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 and including $v$ during a preorder traversal of $T$ ... is the lowest common ancestor of $u$ and $v$ in $T$, then $w = u$. II only III only I and II II and III

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 and ...

Bikram

792 views

Bikram asked Jan 24, 2017

2 votes

2 answers

40

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 miss rate of $3%$ and a data miss rate of $8%$. In second design they uses a $2$- ... $D1 = 0.70, D2 = 0.40$ $D1 = 1.10, D2 = 0.40$ $D1 = 0.70, D2 = 0.48$

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 woul...

Bikram

647 views

Bikram asked Jan 24, 2017

1 votes

1 answer

41

Test by Bikram | Mock GATE | Test 2 | Question: 25
Which of the following sorting algorithms has the lowest best-case asymptotic algorithmic complexity? Selection sort Merge sort Insertion sort Heap sort

Which of the following sorting algorithms has the lowest best-case asymptotic algorithmic complexity?Selection sortMerge sortInsertion sortHeap sort

Bikram

273 views

Bikram asked Jan 24, 2017

2 votes

2 answers

42

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 -$ The infix expression $\left ( 2+3 \right )$ * $\left ( 5-7 \right )$ The postfix expression $2$ $3$ + $5$ $7$ $-$ *

Which of the following expressions evaluates to the largest number?The prefix expression $+ $*$ - 2 3 5 7$The postfix expression $2 3 + 5 $*$ 7 -$The infix expression ...

Bikram

510 views

Bikram asked Jan 24, 2017

0 votes

2 answers

43

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$

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...

Bikram

344 views

Bikram asked Jan 24, 2017

2 votes

1 answer

44

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 of the drive is under $6$ $milliseconds$. The burst data rate of the drive is ... . Which of the above statements is/are true? II and III only I, II, and III I and II only II only

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 of the d...

Bikram

505 views

Bikram asked Jan 24, 2017

1 votes

1 answer

45

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 $G$, may or may not be a subgroup of $G$. Proper subgroup of an ... infinite. Prime order group has both proper and improper subgroups. III and IV II and IV I and II II, III, IV

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 $G$, ...

Bikram

843 views

Bikram asked Jan 24, 2017

1 votes

2 answers

46

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, then $y$ is the right child of $x$; otherwise, $y$ is the parent of $x$ ... $y$ is the parent of $x$; otherwise, $y$ is the parent of $x's$ first ancestor $z$ such that $z$ is a left child

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, then $y$ is...

Bikram

472 views

Bikram asked Jan 24, 2017

5 votes

3 answers

47

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 with $0$, is always equivalent to dividing by $2$. An integer's ones ... twos-complement representation. I and II only II and III only All are false I, II, and III all are true

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...

Bikram

768 views

Bikram asked Jan 24, 2017

1 votes

2 answers

48

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 automaton, then $L$ can be represented by a regular expression. If $M$ is ... represented by a context-free grammar. If $M$ is a non-deterministic pushdown automaton, then $L$ is recursively enumerable.

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 automaton, then $L$ can ...

Bikram

624 views

Bikram asked Jan 24, 2017

6 votes

2 answers

49

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 situations where item exchanges cost nothing but item comparisons remain ... for $S1$ and insertion sort for $S2$. Insertion sort for $S1$ and selection sort for $S2$.

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 sit...

Bikram

806 views

Bikram asked Jan 24, 2017

2 votes

1 answer

50

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 following statements is/are correct regarding the scenario ? I. Partitioning ... fragmentation. I only I and II only I and III only I, II, and III all are correct

While designing a memory management subsystem, a computer hardware manufacturer must decide whether to utilize a partitioning, segmentation, or demand paging strategy.Whi...

Bikram

583 views

Bikram asked Jan 24, 2017

1 votes

2 answers

51

Test by Bikram | Mock GATE | Test 2 | Question: 15
A certain computer has a $TLB$ cache, a one-level physically-addressed data cache, $DRAM$, and a disk backing store for virtual memory. The processor loads the instruction below and then begins to execute it. LW R3, 0(R4) $[$ LW ... one data cache miss can occur. If a page fault occurs, then a data cache miss definitely does not occur as well.

A certain computer has a $TLB$ cache, a one-level physically-addressed data cache, $DRAM$, and a disk backing store for virtual memory. The processor loads the instructio...

Bikram

748 views

Bikram asked Jan 24, 2017

5 votes

1 answer

52

Test by Bikram | Mock GATE | Test 2 | Question: 14
Consider the following code snippet. void first(int p, int t) { p += t; t += p; } main() { int p = 4; first(p , p); } What is the final value of $p$ in both call by value and call by reference respectively ? $4$ and $12$ $5$ and $12$ $12$ and $16$ $4$ and $16$

Consider the following code snippet.void first(int p, int t) { p += t; t += p; } main() { int p = 4; first(p , p); }What is the final value of $p$ in both call by value a...

Bikram

506 views

Bikram asked Jan 24, 2017

2 votes

1 answer

53

Test by Bikram | Mock GATE | Test 2 | Question: 13
Which of these statements is not true about a b-Tree $T$ with height $h$ and $n$ nodes, assuming that each node takes exactly $1$ $disk$ operation to read? Finding a node in $T$ cannot require more than $O\left ( h \right )$ ... total of $O \left ( n \times h \right )$ CPU operations. Rotations may be required during insertion to keep $T$ balanced.

Which of these statements is not true about a b-Tree $T$ with height $h$ and $n$ nodes, assuming that each node takes exactly $1$ $disk$ operation to read? Finding a node...

Bikram

623 views

Bikram asked Jan 24, 2017

5 votes

2 answers

54

Test by Bikram | Mock GATE | Test 2 | Question: 11
A certain architecture supports indirect, direct, and register addressing modes for use in identifying operands for arithmetic instructions. Which of the following cannot be achieved with a single instruction? Specifying a register number in the ... memory location which in turn contains the value of an operand that will be used by the instruction.

A certain architecture supports indirect, direct, and register addressing modes for use in identifying operands for arithmetic instructions.Which of the following cannot ...

Bikram

594 views

Bikram asked Jan 24, 2017

1 votes

2 answers

55

Test by Bikram | Mock GATE | Test 2 | Question: 12
Why might quick sort be preferred over insertion sort and merge sort? The worst-case asymptotic algorithmic complexity of quick sort is superior to that of insertion sort and merge sort. In situations where little temporary space is available, ... on a long tape, the average run time of quick sort is superior to that of insertion and merge sort.

Why might quick sort be preferred over insertion sort and merge sort?The worst-case asymptotic algorithmic complexity of quick sort is superior to that of insertion sort ...

Bikram

603 views

Bikram asked Jan 24, 2017

7 votes

1 answer

56

Test by Bikram | Mock GATE | Test 2 | Question: 10
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements ... equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection

Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of disti...

Bikram

1.0k views

Bikram asked Jan 24, 2017

3 votes

1 answer

57

Test by Bikram | Mock GATE | Test 2 | Question: 9
Consider these three grammars. ... by $G2$, then it can be generated by $G1$. If w can be generated by $G3$, then it can be generated by $G1$.

Consider these three grammars.$$\begin{array}{|c|c|c|} \hline \textbf{Grammar G1:} & \textbf{Grammar G2:} & \textbf{Grammar G3:} \\ \hline E\rightarrow E+T \mid T & E\r...

Bikram

835 views

Bikram asked Jan 24, 2017

1 votes

1 answer

58

Test by Bikram | Mock GATE | Test 2 | Question: 8
Suppose $L =$ $\left \{ \right \}$ , $N = $\left \{ 1,2,3 \right \}$ Now what does the set $N × L$ contain ? $\left \{ \right \}$ $\left \{ 1,2,3 \right \}$ $\left \{ \left ( 1 \right )\left ( 2 \right ) \left ( 3 \right )\right \}$ $\left \{ \left ( 3 \right )\left ( 2 \right ) \left ( 1 \right )\right \}$

Suppose $L =$ $\left \{ \right \}$ , $N = $$\left \{ 1,2,3 \right \}$Now what does the set $N × L$ contain ? $\left \{ \right \}$$\left \{ 1,2,3 \right \}$$\left \{...

Bikram

485 views

Bikram asked Jan 24, 2017

3 votes

1 answer

59

Test by Bikram | Mock GATE | Test 2 | Question: 7
While designing a preemptive job scheduling subsystem, an operating system manufacturer must select a scheduling strategy. Which of the following requirements is a reason why round-robin scheduling might be preferred over other scheduling strategies ? The ... must guarantee that if job $J1$ arrives before job $J2$, then $J1$ finishes before $J2$

While designing a preemptive job scheduling subsystem, an operating system manufacturer must select a scheduling strategy. Which of the following requirements is a reason...

Bikram

296 views

Bikram asked Jan 24, 2017

4 votes

3 answers

60

Test by Bikram | Mock GATE | Test 2 | Question: 6
The designers of a cache system wants to reduce the number of cache misses that occur in a certain group of programs. Which of the following statements is/are correct regarding what designers can do? If compulsory misses are most common, then ... provide more flexibility when a collision occurs. I, II, and III I and II only II and III only III only

The designers of a cache system wants to reduce the number of cache misses that occur in a certain group of programs.Which of the following statements is/are correct rega...

Bikram

588 views

Bikram asked Jan 24, 2017

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