Dark Mode

Recent questions tagged testbook-test-series

0 votes

0 answers

1

TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57

Sahil_Lather asked in Databases Jan 29

by Sahil_Lather

115 views

0 votes

1 answer

2

TestBook TestSeries Finding number of records under join of 2 tables
Assume a relation R' having 200 records. These records are stored in blocks having block factor as 20. Consider another relation S' having 120 records and all these records are stored in 30 blocks. These two tables have to be joined ... the total number of block access required to join R and S ? A. 2430 B. 6010 C. 6120 D. 1230

Sahil_Lather asked in Databases Jan 29

by Sahil_Lather

77 views

0 votes

0 answers

3

TestBook TestSeries Optimal Binary Search Tree Question
Construct OBST with the identifier set (a1, a2, a3) =(end , goto, print) with p(1..3) = (0.05, 0.2, 0.1) and q(0..3) = (0.2, 0.1,0.2, 0.05) What is the cost of a OBST ? What are the nodes present in the 2nd level of OBST if the root is present in level one ? 2.55 , print , goto 2.45 , goto , end 2.15, end, print 2.7, end, goto

Sahil_Lather asked in Algorithms Jan 28

by Sahil_Lather

92 views

0 votes

1 answer

4

TestBook testseries question to find max weight of MST
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G. What can be the maximum weight of minimum spanning tree for graph G?

Sahil_Lather asked in Algorithms Jan 28

by Sahil_Lather

138 views

0 votes

0 answers

5

TestBook TestSeries question to find number of paths in directed graph
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1. Number of paths from A to K are __

Sahil_Lather asked in Algorithms Jan 28

by Sahil_Lather

71 views

0 votes

0 answers

6

TestBook testSeries dynamic programming and np problem question
Consider the following statements, which of the statement(s) is/are FALSE? The running time of dynamic programming algorithm is always θ (p) where p is number of subproblems When a recurrence relation has cyclic dependency, it is ... memorization If a problem X can be reduced to a known NP hard problem, then X must be NP-hard

Sahil_Lather asked in Algorithms Jan 28

by Sahil_Lather

68 views

1 vote

0 answers

7

TestBook graph theory question
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?

Sahil_Lather asked in Graph Theory Jan 27

by Sahil_Lather

127 views

0 votes

0 answers

8

TestBook graph theory questions
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30) A 13 B 17 C n(n−1)2−13×17 D n(n−1)2−2

Sahil_Lather asked in Graph Theory Jan 27

by Sahil_Lather

89 views

0 votes

1 answer

9

Testbook poset question
Which of the following is/are correct about the number of edges and number of vertices respectively in the Hasse diagram of POSET [P(A); ⊆] where P(A) is the power set and A = {a , b , c} ? 1 number of vertices = 12 2 number of vertices = 8 3 number of edges = 12 4 number of edges = 8

Sahil_Lather asked in Set Theory & Algebra Jan 27

by Sahil_Lather

100 views

1 vote

2 answers

10

Testbook group theory question
Let G be a group of order 49. Then G is abelian G is cyclic G is non-abelian Centre of G has order 7

Sahil_Lather asked in Set Theory & Algebra Jan 27

by Sahil_Lather

83 views

0 votes

0 answers

11

Testbook Relations in discrete maths
Which of the following statement is not true? 1 If a relation on a set A is symmetric and transitive then R is reflexive. 2 If a relation R on a set A is irreflexive and transitive then R is antisymmetric. 3 If R is antisymmetric relation then R ꓵ S ... If R and S are transitive relation on a set A then R U S need not be transitive and R ꓵ S are also transitive.

Sahil_Lather asked in Mathematical Logic Jan 27

by Sahil_Lather

68 views

0 votes

0 answers

12

amit166 asked in Computer Networks Jan 19

63 views

1 vote

1 answer

13

#testbook
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$

amit166 asked in Algorithms Jan 5

94 views

0 votes

1 answer

14

Testbook test series
Can anyone please solve this?

Shoto asked in CO and Architecture Jan 14, 2022

by Shoto

274 views

1 vote

0 answers

15

Testbook Test Series
Consider the following statements 4 : 16 decoder can be constructed (with enable input). Which of the following statements is/are correct? (MSQ) a. Using four 2 : 4 decoders (each with an enable input) only b. Using five 2 : 4 decoders (each with an enable ... : 8 decoders (each with an enable input) only d. Using two 3 : 8 decoders (each with an enable input) and an inverter

rsansiya111 asked in Digital Logic Dec 28, 2021

245 views

0 votes

0 answers

16

Testbook Test Series

rsansiya111 asked in Programming Dec 26, 2021

217 views

0 votes

1 answer

17

Testbook Test Series

rsansiya111 asked in Programming Dec 26, 2021

153 views

0 votes

1 answer

18

Testbook Test Series

rsansiya111 asked in Programming Dec 26, 2021

143 views

0 votes

0 answers

19

Testbook Test Series

rsansiya111 asked in Mathematical Logic Dec 26, 2021

122 views

0 votes

0 answers

20

Testbook Test Series

rsansiya111 asked in Programming Dec 26, 2021

115 views

0 votes

0 answers

21

Testbook Test Series

rsansiya111 asked in Digital Logic Dec 26, 2021

194 views

1 vote

1 answer

22

Testbook Test Series

rsansiya111 asked in Digital Logic Dec 26, 2021

158 views

2 votes

0 answers

23

Testbook Test Series

rsansiya111 asked in Digital Logic Dec 26, 2021

170 views

1 vote

1 answer

24

Testbook Test Series

rsansiya111 asked in Digital Logic Dec 26, 2021

164 views

0 votes

1 answer

25

Testbook Test Series

rsansiya111 asked in Digital Logic Dec 26, 2021

187 views

0 votes

2 answers

26

Testbook Test Series
In designing a computer’s cache system,

rsansiya111 asked in CO and Architecture Dec 23, 2021

219 views

0 votes

1 answer

27

Testbook Test Series

rsansiya111 asked in Digital Logic Dec 23, 2021

175 views

0 votes

1 answer

28

Testbook Test Series
Consider the following C program: #include <stdio.h> int r( ){ static int num = 7; return num--; } int main ( ) { for (r( ) ;r ( ) ;r ( ) ) printf(“ % d”, r( ) ); return 0; } Which one of the following values will be displayed on execution of the programs? 41 52 63 630

rsansiya111 asked in DS Dec 20, 2021

260 views

0 votes

1 answer

29

Testbook Test Series

rsansiya111 asked in DS Dec 19, 2021

151 views

1 vote

1 answer

30

Testbook Test Series

rsansiya111 asked in Graph Theory Dec 18, 2021

257 views

Page:

1
2
3
4
5
6
...
11
next »

Recent questions tagged testbook-test-series