Recent questions tagged testbook-test-series / GATE Overflow for GATE CSE

((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .ca...

Rajib Datta Roy

214 views

Rajib Datta Roy asked Nov 2, 2023

0 votes

0 answers

4

Testbool test Series

Dadu

207 views

Dadu asked Oct 1, 2023

0 votes

0 answers

5

https://testbook.com/TS-nic-scientist-b/tests/640217b028c19ad10b7fed68?attemptNo=1#/lt-solutions
In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed write(X) successfully and R-t(X) denotes the ... TS(T₁) < W-t(X) then T₁ is rolled back All of the above. PS: Ans given as B

In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed...

_Shubham_.Singh_

247 views

_Shubham_.Singh_ asked Jul 10, 2023

0 votes

0 answers

6

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

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

Sahil_Lather

515 views

Sahil_Lather asked Jan 29, 2023

0 votes

1 answer

7

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

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

Sahil_Lather

351 views

Sahil_Lather asked Jan 29, 2023

0 votes

0 answers

8

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

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

Sahil_Lather

459 views

Sahil_Lather asked Jan 28, 2023

0 votes

1 answer

9

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?

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

Sahil_Lather

426 views

Sahil_Lather asked Jan 28, 2023

0 votes

0 answers

10

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 __

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

236 views

Sahil_Lather asked Jan 28, 2023

0 votes

0 answers

11

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

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

Sahil_Lather

382 views

Sahil_Lather asked Jan 28, 2023

1 votes

0 answers

12

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?

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

367 views

Sahil_Lather asked Jan 27, 2023

0 votes

0 answers

13

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

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)A13B17Cn(n−1)2−13×17Dn(n−1)2−2

Sahil_Lather

521 views

Sahil_Lather asked Jan 27, 2023

0 votes

1 answer

14

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

Which of the following is/are correct about the number of edges and number of vertices respectively in the Hasse diagram ofPOSET [P(A); ⊆] where P(A) is the power set a...

Sahil_Lather

526 views

Sahil_Lather asked Jan 27, 2023

1 votes

2 answers

15

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

Let G be a group of order 49. ThenG is abelianG is cyclicG is non-abelianCentre of G has order 7

Sahil_Lather

535 views

Sahil_Lather asked Jan 27, 2023

0 votes

0 answers

16

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.

Which of the following statement is not true?1If a relation on a set A is symmetric and transitive then R is reflexive.2If a relation R on a set A is irreflexive and tran...

Sahil_Lather

453 views

Sahil_Lather asked Jan 27, 2023

0 votes

0 answers

17

#testbook

amit166

244 views

amit166 asked Jan 19, 2023

1 votes

1 answer

18

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

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

amit166

301 views

amit166 asked Jan 5, 2023

0 votes

1 answer

19

Testbook test series
Can anyone please solve this?

Can anyone please solve this?

Shoto

431 views

Shoto asked Jan 14, 2022

1 votes

0 answers

20

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

Consider the following statements4 : 16 decoder can be constructed (with enable input). Which of the following statements is/are correct? (MSQ)a. Using four 2 : 4 decoder...

rsansiya111

526 views

rsansiya111 asked Dec 28, 2021

0 votes

0 answers

21

Testbook Test Series

rsansiya111

330 views

rsansiya111 asked Dec 26, 2021

0 votes

1 answer

22

Testbook Test Series

rsansiya111

231 views

rsansiya111 asked Dec 26, 2021

0 votes

1 answer

23

Testbook Test Series

rsansiya111

222 views

rsansiya111 asked Dec 26, 2021

0 votes

0 answers

24

Testbook Test Series

rsansiya111

180 views

rsansiya111 asked Dec 26, 2021

0 votes

0 answers

25

Testbook Test Series

rsansiya111

221 views

rsansiya111 asked Dec 26, 2021

0 votes

0 answers

26

Testbook Test Series

rsansiya111

384 views

rsansiya111 asked Dec 26, 2021

1 votes

1 answer

27

Testbook Test Series

rsansiya111

312 views

rsansiya111 asked Dec 26, 2021

2 votes

0 answers

28

Testbook Test Series

rsansiya111

281 views

rsansiya111 asked Dec 26, 2021

1 votes

1 answer

29

Testbook Test Series

rsansiya111

304 views

rsansiya111 asked Dec 26, 2021

0 votes

1 answer

30

Testbook Test Series

rsansiya111

283 views

rsansiya111 asked Dec 26, 2021

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