Register
Filter

Questions by smartmeet

0 votes
1 answer
4
Hashing
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x is a) Less than 1 b) Less than n c) Less than m d) Less than n/2
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x isa) Less than 1...
0 votes
3 answers
5
Data Structure In-Order Predecessor
If a node in a BST has two children, then its in-order predecessor has a) No left child b) No right child c) 2 children d) no child
If a node in a BST has two children, then its in-order predecessor hasa) No left childb) No right childc) 2 childrend) no child
0 votes
1 answer
6
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...
3 votes
4 answers
8
Gatebook_Mocktest2(Operating Systems)
Process executes the following code for (i=0;i<5,i++) for (j=0;j<5,j++) fork(); The no of child processes created is ?
Process executes the following codefor (i=0;i<5,i++) for (j=0;j<5,j++) fork(); The no of child processes created is ?
4 votes
1 answer
10
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...
4 votes
3 answers
12
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...
2 votes
1 answer
13
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...
8 votes
5 answers
16
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...
0 votes
1 answer
18
OS-Common Doubt
In Priority scheduling algorithm, higher value of priority gets higher priority or lower value of priority gets higher priority? Means, Priorities: 1,2,3 for Processes-A,B,C Now, execution order will be A-B-C or C-B-A
In Priority scheduling algorithm, higher value of priority gets higher priority or lower value of priority gets higher priority? Means, Priorities: 1,2,3 for Processes-A...
0 votes
1 answer
19
VirtualGate Test Series: Discrete Mathematics - Graph Theory
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last vertex$?$ $3$ $0$ $5$ $4$
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last ver...
0 votes
1 answer
20
Lossless or Lossy (Explain with help of table drawing, if possible)
R(ABCDEG) and FD sets {AB->C, AC->B, AD->E, B->D, BC->A, E->G} D=( ABC, ACDE, ADG)
R(ABCDEG) and FD sets {AB->C, AC->B, AD->E, B->D, BC->A, E->G} D=( ABC, ACDE, ADG)
Page: