Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged testbook-test-series
2
votes
0
answers
121
TestBook
In a Binary Search Tree, a key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9 not necessary in the same order. Lets P is the probability that 3rd element in the search path beginning from root is either 3 or 8, and N ... orders possible in which given nodes can be traversed before finding node with value 5. Find (N/10) + P Please someone explain the solution.
In a Binary Search Tree, a key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9 not necessary in the same order. Lets P is the probability that ...
Rajat Agrawal007
354
views
Rajat Agrawal007
asked
Dec 4, 2021
DS
testbook-test-series
data-structures
binary-search-tree
+
–
1
votes
1
answer
122
Testbook test Series
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 consecutive b’s, overlapping permitted}
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 co...
Rajat Agrawal007
2.2k
views
Rajat Agrawal007
asked
Nov 18, 2021
Theory of Computation
testbook-test-series
number-of-dfa
finite-automata
+
–
1
votes
1
answer
123
TestBook test series: Database
Consider two relations $R$ and $S$ of size $1200$ bytes and $1000$ bytes respectively. The size of a tuple in both relations is $20$ bytes. The block size of the system is $100$ Bytes. How many extra block transfers would be required, in the worst case, if nested loop join is used instead of block nested loop join technique to compute the natural join?
Consider two relations $R$ and $S$ of size $1200$ bytes and $1000$ bytes respectively. The size of a tuple in both relations is $20$ bytes. The block size of the system i...
Nishisahu
369
views
Nishisahu
asked
Oct 17, 2021
Databases
testbook-test-series
databases
+
–
0
votes
2
answers
124
textbook
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
T(n)=T(7n/8)+0.05solve this equation and find out the time complexity?
suneetha
505
views
suneetha
asked
Feb 5, 2019
Algorithms
recurrence-relation
testbook-test-series
+
–
1
votes
1
answer
125
Testbook Test Series: Operating System - File System
A file system with 300 GB uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 256 Bytes and the size of each disk block address is 16 Bytes. The maximum possible file size in this file system is? The answer given was 70KB. Thanks!
A file system with 300 GB uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is...
Abhipsa
581
views
Abhipsa
asked
Jan 28, 2019
Operating System
operating-system
file-system
testbook-test-series
+
–
0
votes
0
answers
126
Testbook Test Series: Operating System - Disks
A UNIX style i-node has 15 direct pointers and one single, one double and one triple indirect pointers. The disk block size is 1KB, disk block address is 64 bits and 48 bit integers are used. What is the maximum possible fize size in bytes? Thanks!
A UNIX style i-node has 15 direct pointers and one single, one double and one triple indirect pointers. The disk block size is 1KB, disk block address is 64 bits and 48 b...
Abhipsa
306
views
Abhipsa
asked
Jan 28, 2019
Operating System
testbook-test-series
operating-system
disk
+
–
3
votes
1
answer
127
Testbook Test Series: Theory of Computation - Identify Class Language
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers} Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by 1. Starting at the origin (0,0), a ... the following statements is TRUE? i) L is Regular. ii) L is context free. iii) L complement is context free. Thanks!
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers}Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by �...
Abhipsa
450
views
Abhipsa
asked
Jan 22, 2019
Theory of Computation
testbook-test-series
theory-of-computation
identify-class-language
+
–
0
votes
2
answers
128
Testbook Test Series: Compiler Design - Syntax Directed Translation
Suryank Tiwari
501
views
Suryank Tiwari
asked
Jan 19, 2019
Compiler Design
compiler-design
syntax-directed-translation
testbook-test-series
+
–
1
votes
1
answer
129
Testbook Test Series: Computer Networks - Sliding Window
Frames of 20000 bytes are sent over 10 MBps full duplex link between 2 hosts. Propagation is 45 ms.Suppose that the sliding window protocol is used with the sender window size of 16 and acknowledgements are piggybacked.After sending 35 frames , what is the minimum time sender will have to wait before starting transmission of the next frame
Frames of 20000 bytes are sent over 10 MBps full duplex link between 2 hosts. Propagation is 45 ms.Suppose that the sliding window protocol is used with the sender window...
jatin khachane 1
1.2k
views
jatin khachane 1
asked
Jan 18, 2019
Computer Networks
testbook-test-series
computer-networks
sliding-window
+
–
1
votes
1
answer
130
Testbook Test Series: Operating System - Process Synchronization
Que- Consider the following statements about the dining philosopher problem. 1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers. 2. If the asymmetric solution is implemented then $1^{st}$ philosopher picks up her right ... above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above
Que- Consider the following statements about the dining philosopher problem.1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers.2. If the asymme...
Soumya29
808
views
Soumya29
asked
Jan 6, 2019
Operating System
testbook-test-series
operating-system
process-synchronization
+
–
0
votes
0
answers
131
Testbook Test Series: Theory of Computation - Minimal State Automata
$Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______. Approach ?
$Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______.Approach ?
Soumya29
608
views
Soumya29
asked
Jan 6, 2019
Theory of Computation
testbook-test-series
theory-of-computation
minimal-state-automata
+
–
0
votes
1
answer
132
Testbook Test Series: Computer Networks - Stop And Wait
$Que-$ A sender uses a Stop-and-Wait protocol for transmission of $8000 \ K-bits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What will be the link utilization (%) if a probability of single frame error is $0.001?$ $\text{Note – Here Frame size is 8000 K- bits i.e 8}*10^6 \ bits$
$Que-$ A sender uses a Stop-and-Wait protocol for transmission of $8000 \ K-bits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What ...
Soumya29
618
views
Soumya29
asked
Jan 6, 2019
Computer Networks
testbook-test-series
computer-networks
stop-and-wait
+
–
0
votes
0
answers
133
Testbook Test Series: Compiler Design - Code Optimization
Consider the statement do { i = i + 1; } while ( a[i] < b ); The minimum number of variables required in the three address code of the above statement ?
Consider the statementdo {i = i + 1;}while ( a[i] < b );The minimum number of variables required in the three address code of the above statement ?
Shobhit Joshi
384
views
Shobhit Joshi
asked
Jan 1, 2019
Compiler Design
testbook-test-series
compiler-design
code-optimization
+
–
0
votes
1
answer
134
Testbook Test Series: Algorithms - Recurrence
…………………………..
…………………………..
Magma
653
views
Magma
asked
Dec 27, 2018
Algorithms
testbook-test-series
algorithms
recurrence-relation
+
–
0
votes
1
answer
135
Testbook Test Series: Programming & DS - Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
Magma
520
views
Magma
asked
Dec 27, 2018
DS
testbook-test-series
data-structures
hashing
+
–
2
votes
1
answer
136
Testbook Test Series: Databases - Database Normalization
The number of tables required to convert the relational schema $R(A, B, C, D, E, F, G, H)$ into $3NF$ with following functional dependency is ________ $A\rightarrow DG$ $AB\rightarrow E$ $D\rightarrow C$ $E\rightarrow F$ $G\rightarrow H$
The number of tables required to convert the relational schema $R(A, B, C, D, E, F, G, H)$ into $3NF$ with following functional dependency is ________$A\rightarrow DG$$AB...
jatin khachane 1
883
views
jatin khachane 1
asked
Dec 27, 2018
Databases
testbook-test-series
databases
database-normalization
+
–
0
votes
0
answers
137
TestBook[Full syllabus Test]
TCP opens a connection using an initial sequence number of 3500 and send data at 5MBps . The other third party opens the connection with sequence number of 1200. Wrap around for both the sequence numbers differs by 12562.77 sec .Calculate the Data rate(in KBps) for the second party
TCP opens a connection using an initial sequence number of 3500 and send data at 5MBps . The other third party opens the connection with sequence number of 1200. Wrap aro...
jatin khachane 1
351
views
jatin khachane 1
asked
Dec 27, 2018
Computer Networks
testbook-test-series
computer-networks
+
–
0
votes
0
answers
138
Testbook[Full syllabus Test]
jatin khachane 1
697
views
jatin khachane 1
asked
Dec 27, 2018
Programming in C
testbook-test-series
programming-in-c
+
–
1
votes
0
answers
139
TestBook_P&DS
The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s. int anagram (char *a, char *b){ int count [128], j; for (j = 0; j < 128; j++) count[j]=0; j = 0; while (a[ ... [j]]++ 3 A: count [a[j++]]++ and B: count[b[j]]-- 4 A: count[a[j]]++ and B: count [b[j++]]--
The following C function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the let...
Magma
460
views
Magma
asked
Dec 26, 2018
Programming in C
testbook-test-series
+
–
0
votes
1
answer
140
Testbook Test Series: Programming & DS - Programming In C
Please someone explain me properly
Please someone explain me properly
Magma
588
views
Magma
asked
Dec 26, 2018
Programming in C
testbook-test-series
programming
programming-in-c
+
–
0
votes
0
answers
141
TEST_BOOK_DS
DELELTE : 5 pop and 4 push require s2 (4 3 2) s1(empty) Insert (5) : s2(4 3 2) s1(5) 1 push delete : pop from S2 (4 3) s1 (5) 1 pop total : 6 POP , 5 PUSH where I’m wrong
DELELTE : 5 pop and 4 push require s2 (4 3 2) s1(empty)Insert (5) : s2(4 3 2) s1(5) 1 pushdelete : pop from S2 (4 3) s1 (5) 1 poptotal : 6 POP , 5 PUSHwhere I’m ...
Magma
266
views
Magma
asked
Dec 26, 2018
Programming in C
testbook-test-series
+
–
2
votes
1
answer
142
Testbook Test Series: CO & Architecture - Addressing Modes
A PC-related mode branch instruction is $8$Byte long. The address of the instruction,in decimal, is $548321.$Find the branch target address if the signed displacement in the instruction is $-29?$
A PC-related mode branch instruction is $8$Byte long. The address of the instruction,in decimal, is $548321.$Find the branch target address if the signed displacement in ...
Lakshman Bhaiya
866
views
Lakshman Bhaiya
asked
Dec 23, 2018
CO and Architecture
co-and-architecture
testbook-test-series
addressing-modes
+
–
1
votes
0
answers
143
Testbook Test Series: Computer Networks - Tcp
TCP opens a connection using an initial sequence number of 3500 and sends data at 5 MBps. The other party opens the connection with a sequence number of 1200. Wrap around time for both the sequence numbers differ by 12562.77 sec. Calculate the data rate(in KB) for the second party.
TCP opens a connection using an initial sequence number of 3500 and sends data at 5 MBps. The other party opens the connection with a sequence number of 1200. Wrap around...
Aarvi Chawla
658
views
Aarvi Chawla
asked
Dec 23, 2018
Computer Networks
testbook-test-series
tcp
computer-networks
+
–
0
votes
0
answers
144
Testbook Test Series: Probability - Probability
The probability of a shooter hitting the target is $\frac{1}{3}$ and three shots at the bull's eye are needed to win the game. What could be the least number of shots for the shooter to give him more than half-chance of winning the game$?$ $A)5$ $B)6$ $C)7$ $D)8$
The probability of a shooter hitting the target is $\frac{1}{3}$ and three shots at the bull's eye are needed to win the game. What could be the least number of shots for...
Lakshman Bhaiya
876
views
Lakshman Bhaiya
asked
Dec 23, 2018
Probability
testbook-test-series
engineering-mathematics
probability
+
–
1
votes
0
answers
145
Testbook Test Series: CO & Architecture - Instruction Format
A processor has $128$ distinct instructions. A $24-$bit instruction word has an opcode, register, and operand.The number of bits available for the operand field is $7.$The maximum possible value of the general-purpose register is _________
A processor has $128$ distinct instructions. A $24-$bit instruction word has an opcode, register, and operand.The number of bits available for the operand field is $7.$Th...
Lakshman Bhaiya
1.2k
views
Lakshman Bhaiya
asked
Dec 23, 2018
CO and Architecture
testbook-test-series
co-and-architecture
instruction-format
+
–
0
votes
0
answers
146
Testbook Test Series: Calculus - Differentiability
If $y = f(x)$ is a solution of $ d^2y/dx^2 = 0$ , with boundary conditions $y=8$ at $x=0$ and $dy/dx =4$ at $x=16$, Find the value of $f(-2)$ When they say, $y = f(x)$ is a solution of $ d^2y/dx^2 = 0$ What does that mean?
If $y = f(x)$ is a solution of $ d^2y/dx^2 = 0$ , with boundary conditions $y=8$ at $x=0$and $dy/dx =4$ at $x=16$, Find the value of $f(-2)$When they say, $y = f(x)$ is ...
shreyansh jain
318
views
shreyansh jain
asked
Dec 18, 2018
Mathematical Logic
testbook-test-series
differentiation
calculus
+
–
0
votes
1
answer
147
#TestBook-algo
The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash function h(x) = (ord(x) - ord(A) +1) If linear probing is used to resolve collisions, then the following insertion causes collision 1:Y 2:C 3:M 4:P The given ans is 3.. but what is the approach and what do we mean by ord?
The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash functionh(x) = (ord(x) - ord(A) +1)If linear probing is used...
anjali007
247
views
anjali007
asked
Dec 17, 2018
Algorithms
hashing
linear-probing
testbook-test-series
+
–
0
votes
0
answers
148
Testbook Test Series: Databases - Relational Algebra
The number of rows returned by sql query on given relation: SELECT * from emp where eno NOT IN (SELECT manager from emp) Query intends to find the number of employees who are not MANAGER so emp 2,3,4 are ruled out. But since it ... return false. So NOT IN will give true and number of rows returned will be 1. Answer given is 0. Please clarify.
The number of rows returned by sql query on given relation:SELECT * from emp where eno NOT IN (SELECT manager from emp)Query intends to find the number of employees who a...
shreyansh jain
797
views
shreyansh jain
asked
Dec 17, 2018
Databases
testbook-test-series
databases
relational-algebra
+
–
0
votes
1
answer
149
Testbook Test Series: Algorithms - Asymptotic Analysis
a , c , d all three are right answer please explain if i am wrong.
a , c , d all three are right answer please explain if i am wrong.
Abhishek Kumar 38
353
views
Abhishek Kumar 38
asked
Dec 15, 2018
Algorithms
testbook-test-series
algorithms
asymptotic-notation
+
–
0
votes
0
answers
150
TESTBOOK COA
Mayank Gupta 3
455
views
Mayank Gupta 3
asked
Dec 15, 2018
CO and Architecture
co-and-architecture
cache-memory
testbook-test-series
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register