Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatebook-mt2
2
2 votes
1
1 answer
930
930 views
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 i...
smartmeet
930
views
asked
Feb 8, 2017
Data Structures
gatebook-mt2
data-structures
space-complexity
time-complexity
asymptotic-notations
+
–
1
1 vote
0
0 answers
524
524 views
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 ...
smartmeet
524
views
asked
Feb 8, 2017
Data Structures
gatebook-mt2
data-structures
avl-tree
+
–
0
0 votes
1
1 answer
972
972 views
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 p...
smartmeet
972
views
asked
Feb 8, 2017
Operating System
gatebook-mt2
operating-system
+
–
0
0 votes
1
1 answer
622
622 views
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...
smartmeet
622
views
asked
Feb 8, 2017
Quantitative Aptitude
gatebook-mt2
+
–
1
1 vote
3
answers
3 answers
3.1k
3.1k views
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 g...
Shradha
3.1k
views
asked
Feb 8, 2017
Graph Theory
gatebook-mt2
+
–
8
8 votes
3
answers
3 answers
2.5k
2.5k views
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 o...
Rahul Jain25
2.5k
views
asked
Feb 8, 2017
CO & Architecture
gatebook-mt2
co-and-architecture
speedup
+
–
1
1 vote
4
answers
4 answers
2.2k
2.2k views
GB Mock 2
Lucky sunda
2.2k
views
asked
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
0
0 votes
3
3 answers
1.9k
1.9k views
GateBook Mock 2
According to me option B is correct.
Lucky sunda
1.9k
views
asked
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
1
1 vote
2
answers
2 answers
1.1k
1.1k views
GB Mock 2
Lucky sunda
1.1k
views
asked
Feb 7, 2017
CO & Architecture
gatebook-mt2
co-and-architecture
+
–
1
1 vote
2
2 answers
1.4k
1.4k views
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 p...
smartmeet
1.4k
views
asked
Feb 7, 2017
Mathematical Logic
gatebook-mt2
mathematical-logic
propositional-logic
+
–
4
4 votes
1
1 answer
1.3k
1.3k views
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 i...
smartmeet
1.3k
views
asked
Feb 7, 2017
Programming in C
programming-in-c
gatebook-mt2
+
–
5
5 votes
1
answers
1 answer
1.8k
1.8k views
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 G...
smartmeet
1.8k
views
asked
Feb 7, 2017
Compiler Design
gatebook-mt2
compiler-design
grammar
gatebook-test-series
+
–
4
4 votes
3
answers
3 answers
1.6k
1.6k views
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...
smartmeet
1.6k
views
asked
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
decidability
turing-machine
+
–
2
2 votes
1
1 answer
1.7k
1.7k views
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 n...
smartmeet
1.7k
views
asked
Feb 7, 2017
Databases
gatebook-mt2
data-structures
databases
b-tree
+
–
0
0 votes
1
1 answer
678
678 views
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 i...
smartmeet
678
views
asked
Feb 7, 2017
Algorithms
gatebook-mt2
data-structures
algorithms
space-complexity
time-complexity
+
–
0
0 votes
2
2 answers
923
923 views
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 ...
smartmeet
923
views
asked
Feb 7, 2017
Data Structures
data-structures
avl-tree
gatebook-mt2
+
–
10
10 votes
5
answers
5 answers
13.3k
13.3k views
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 m...
smartmeet
13.3k
views
asked
Feb 7, 2017
Computer Networks
computer-networks
gatebook-mt2
ip-packet
+
–
0
0 votes
1
answers
1 answer
2.2k
2.2k views
What is the value of ssthresh at the 24 th transmission round?
(A) 18 (B) 13 (C) 21 (D) 8
smartmeet
2.2k
views
asked
Feb 7, 2017
Computer Networks
thrashing
computer-networks
gatebook-mt2
+
–
To see more, click for the
full list of questions
or
popular tags
.