Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatebook-mt2
2
votes
1
answer
1
Gatebook_Mocktest2(DS)
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes. for ( int x = 2; x < N ... a natural number n < N is prime. (A) I only (B) I and II only (C) II and III only (D) I, II, and III
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only...
smartmeet
518
views
smartmeet
asked
Feb 8, 2017
DS
gatebook-mt2
data-structures
space-complexity
time-complexity
asymptotic-notation
+
–
1
votes
0
answers
2
Gatebook_Mocktest2(DS)
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) defined to be some element x in the current set such that|x-y| ≤ |xi-y| for all xi in the current set. Let where denotes the worst-case time ... to use in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) defined to be some element x in the curren...
smartmeet
366
views
smartmeet
asked
Feb 8, 2017
DS
gatebook-mt2
data-structures
avl-tree
+
–
0
votes
1
answer
3
GB Gatebook_Mocktest2(OS)
Which of the following statements is FALSE? (A) Each thread has own stack (B) Starvation implies deadlock (C) Smaller page size increases the page table size (D) User level process can not modify its own page table entries
Which of the following statements is FALSE?(A) Each thread has own stack(B) Starvation implies deadlock(C) Smaller page size increases the page table size(D) User level p...
smartmeet
526
views
smartmeet
asked
Feb 8, 2017
Operating System
gatebook-mt2
operating-system
+
–
0
votes
1
answer
4
Gatebook_MockTest2(Aptitude)
There are two examinations rooms A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A, then the number of students in A is double the number of students in B. The number of students in room A is: (A) 20 (B) 80 (C) 100 (D) 200
There are two examinations rooms A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A...
smartmeet
373
views
smartmeet
asked
Feb 8, 2017
Quantitative Aptitude
gatebook-mt2
+
–
1
votes
3
answers
5
Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair of nodes, which of ... = 10, m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any g...
Shradha
1.9k
views
Shradha
asked
Feb 8, 2017
Graph Theory
gatebook-mt2
+
–
8
votes
3
answers
6
Gatebook mock
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number of processors. (The speedup is defined as the ratio of the time taken to perform a set of tasks on a single ... same time, what is the efficiency of this precedence graph on $S$? $25\%$ $33\:1/3\%$ $50\%$ $100\%$
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number o...
Rahul Jain25
1.6k
views
Rahul Jain25
asked
Feb 8, 2017
CO and Architecture
gatebook-mt2
co-and-architecture
speedup
+
–
1
votes
4
answers
7
GB Mock 2
Lucky sunda
953
views
Lucky sunda
asked
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
0
votes
3
answers
8
GateBook Mock 2
According to me option B is correct.
According to me option B is correct.
Lucky sunda
736
views
Lucky sunda
asked
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
1
votes
2
answers
9
GB Mock 2
Lucky sunda
625
views
Lucky sunda
asked
Feb 7, 2017
CO and Architecture
gatebook-mt2
co-and-architecture
+
–
1
votes
2
answers
10
Gatebook_Mocktest2(Propositional Logic)
Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p1,p2,p3,p4 and the connectives ∧ ∨, (without ¬ ) ? I. At least three of p1,p2,p3,p4 are true. II. Exactly three of p1,p2,p3,p4 are true. III. An even number ofp1,p2,p3,p4are true. (A) I only (B) II only (C) III only (D) I and III
Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p1,p2,p3,p4 and the connectives ∧ ∨, (without ¬ ) ?I. At least three...
smartmeet
794
views
smartmeet
asked
Feb 7, 2017
Mathematical Logic
gatebook-mt2
mathematical-logic
propositional-logic
+
–
4
votes
1
answer
11
GateBook_MockTest2(Programming)
# include < stdio.h > main ( ) { float total 0.0, q = 1.0, p = 2.0; while (p/q> 0.001) { q = q + q ; total = total + p/q ; print f (“% f\n”, total) ; } } Which one of the following is the integer that best approximates the last number printed ? (A) 0 (B) 1 (C) 2 (D) 3
# include < stdio.h >main ( ){float total 0.0, q = 1.0, p = 2.0;while (p/q 0.001){q = q + q ;total = total + p/q ;print f (“% f\n”, total) ;}}Which one of the followi...
smartmeet
926
views
smartmeet
asked
Feb 7, 2017
Programming in C
programming-in-c
gatebook-mt2
+
–
5
votes
1
answer
12
GateBook Mock Test_2(Compilers)
Consider these three grammars. Which of the following statements is not true? (A) If w can be generated by G1, then it can be generated by G2. (B) If w can be generated by G2, then it can be generated by G3. (C) If w can be generated by G3, then it can be generated by G1. (D) If w can be generated by G2, then it can be generated by G1.
Consider these three grammars.Which of the following statements is not true?(A) If w can be generated by G1, then it can be generated by G2.(B) If w can be generated by G...
smartmeet
918
views
smartmeet
asked
Feb 7, 2017
Compiler Design
gatebook-mt2
compiler-design
grammar
gatebook-test-series
+
–
4
votes
3
answers
13
GateBook Mock Test_2(TOC)
Given TMs and L = {x/Every halts on input x } which of the following is true about L? (A) L is recursively enumerable but not recursive (B) L is Recursive but not Context free (C) L is Not Recursively Enumerable (D) L is regular
Given TMs and L = {x/Every halts on input x } which of the following is true about L?(A) L is recursively enumerable but not recursive(B) L is Recursive but not Context...
smartmeet
806
views
smartmeet
asked
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
decidability
turing-machine
+
–
2
votes
1
answer
14
GateBook Mock Test_2(B-tree)
A B-tree of order m is a tree which satisfies the following properties: Every node has at most m children. Every node (except root) has at least ⌈m/2⌉ children maximium no of internal nodes an order 4 B tree can have with 20 keys.
A B-tree of order m is a tree which satisfies the following properties:Every node has at most m children.Every node (except root) has at least ⌈m/2⌉ children maximi...
smartmeet
925
views
smartmeet
asked
Feb 7, 2017
Databases
gatebook-mt2
data-structures
databases
b-tree
+
–
0
votes
0
answers
15
GateBook Mock Test_2(Algorithms)
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes. for ( int x = 2; x ... number n < N is prime. (A) I only (B) I and II only (C) II and III only (D) I, II, and III
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only...
smartmeet
476
views
smartmeet
asked
Feb 7, 2017
Algorithms
gatebook-mt2
data-structures
algorithms
space-complexity
time-complexity
+
–
0
votes
1
answer
16
GateBook Mock Test_2(Data Structure)
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) defined to be some element x in the current set such that|x-y| ≤ |xi-y| for all xi in the current set. Let where denotes the ... use in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) defined to be some element x in the curren...
smartmeet
457
views
smartmeet
asked
Feb 7, 2017
DS
data-structures
avl-tree
gatebook-mt2
+
–
8
votes
5
answers
17
GateBook Mock-Test-2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how m...
smartmeet
7.7k
views
smartmeet
asked
Feb 7, 2017
Computer Networks
computer-networks
gatebook-mt2
ip-packet
+
–
0
votes
1
answer
18
What is the value of ssthresh at the 24 th transmission round?
(A) 18 (B) 13 (C) 21 (D) 8
(A) 18 (B) 13 (C) 21 (D) 8
smartmeet
1.1k
views
smartmeet
asked
Feb 7, 2017
Computer Networks
thrashing
computer-networks
gatebook-mt2
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
