menu
search
Log In
Quick search syntax
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

Subjects

Recent questions tagged testbook-test-series

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged testbook-test-series

1 vote
1 answer
1
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 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!
asked Jan 28, 2019 in Operating System Abhipsa 188 views
0 votes
0 answers
2
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 bit integers are used. What is the maximum possible fize size in bytes? Thanks!
asked Jan 28, 2019 in Operating System Abhipsa 128 views
3 votes
1 answer
3
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 1. Starting at the origin (0,0), a string of command letters N, S, E, W generates a ... a closed path. Which of the following statements is TRUE? i) L is Regular. ii) L is context free. iii) L complement is context free. Thanks!
asked Jan 22, 2019 in Theory of Computation Abhipsa 144 views
1 vote
1 answer
5
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 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
asked Jan 18, 2019 in Computer Networks jatin khachane 1 330 views
1 vote
0 answers
6
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 asymmetric solution is implemented then $1^{st}$ philosopher picks up her right chopstick first while $6^{th}$ philosopher picks ... . Which of the above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above
asked Jan 6, 2019 in Operating System Soumya29 223 views
0 votes
1 answer
8
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 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$
asked Jan 6, 2019 in Computer Networks Soumya29 153 views
0 votes
0 answers
9
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 statement do { i = i + 1; } while ( a[i] < b ); The minimum number of variables required in the three address code of the above statement ?
asked Jan 1, 2019 in Compiler Design Shobhit Joshi 138 views
0 votes
1 answer
10
Testbook Test Series: Algorithms - Recurrence
…………………………..
…………………………..
asked Dec 27, 2018 in Algorithms Magma 211 views
0 votes
1 answer
11
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
asked Dec 27, 2018 in DS Magma 168 views
1 vote
1 answer
12
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\rightarrow E$ $D\rightarrow C$ $E\rightarrow F$ $G\rightarrow H$
asked Dec 27, 2018 in Databases jatin khachane 1 233 views
0 votes
0 answers
13
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 around for both the sequence numbers differs by 12562.77 sec .Calculate the Data rate(in KBps) for the second party
asked Dec 27, 2018 in Computer Networks jatin khachane 1 106 views
0 votes
0 answers
15
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 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] && b[j ... count[b[j]]++ 3 A: count [a[j++]]++ and B: count[b[j]]-- 4 A: count[a[j]]++ and B: count [b[j++]]--
asked Dec 26, 2018 in Programming Magma 118 views
0 votes
0 answers
17
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 push delete : pop from S2 (4 3) s1 (5) 1 pop total : 6 POP , 5 PUSH where I’m wrong
asked Dec 26, 2018 in Programming Magma 89 views
0 votes
1 answer
18
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 the instruction is $-29?$
asked Dec 23, 2018 in CO and Architecture Lakshman Patel RJIT 320 views
0 votes
0 answers
19
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 time for both the sequence numbers differ by 12562.77 sec. Calculate the data rate(in KB) for the second party.
asked Dec 23, 2018 in Computer Networks Aarvi Chawla 202 views
0 votes
0 answers
20
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 the shooter to give him more than half-chance of winning the game$?$ $A)5$ $B)6$ $C)7$ $D)8$
asked Dec 23, 2018 in Probability Lakshman Patel RJIT 296 views
0 votes
0 answers
21
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.$The maximum possible value of the general-purpose register is _________
asked Dec 23, 2018 in CO and Architecture Lakshman Patel RJIT 379 views
0 votes
0 answers
22
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 a solution of $ d^2y/dx^2 = 0$ What does that mean?
asked Dec 18, 2018 in Mathematical Logic shreyansh jain 109 views
0 votes
0 answers
23
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 are not MANAGER so emp 2,3,4 are ruled out. But since it includes comparison with NULL so it will ... ,4,NULL} will return false. So NOT IN will give true and number of rows returned will be 1. Answer given is 0. Please clarify.
asked Dec 17, 2018 in Databases shreyansh jain 223 views
0 votes
0 answers
26
Testbook Test Series: Probability - Probability
Chandler is selling tickets for \$1 per ticket. In the queue for tickets, there are m people with a single \$ ... (m+1) (b) 2 / (m+1) (c) 18 / (m)(m+1)(m+2) (d) (m-2) / (m+2)
Chandler is selling tickets for \$1 per ticket. In the queue for tickets, there are m people with a single \$ ... ) (m-1) / (m+1) (b) 2 / (m+1) (c) 18 / (m)(m+1)(m+2) (d) (m-2) / (m+2)
asked Dec 8, 2018 in Probability Rajat Agrawal007 76 views
0 votes
0 answers
27
Testbook Test Series: General Aptitude: Numerical Aptitude
On a grid of 6*5 ,how many ways exist to get from Top-Left corner to the Bottom-Right corner if You can only move one unit Right or One unit Down at a time.
On a grid of 6*5 ,how many ways exist to get from Top-Left corner to the Bottom-Right corner if You can only move one unit Right or One unit Down at a time.
asked Dec 8, 2018 in Quantitative Aptitude Rajat Agrawal007 101 views
0 votes
0 answers
28
testbook test series
None of these according to me.
None of these according to me.
asked Dec 7, 2018 in Set Theory & Algebra Utkarsh Joshi 89 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...