Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Akanksha Kesarwani
2
votes
1
answer
1
Application layer
Assume a hypothetical computer network in which the protocol hierarchy has 10 layer .The application layer generates a 200KB message.What is the size of the header if 20% of the network bandwidth is filled with header.
Assume a hypothetical computer network in which the protocol hierarchy has 10 layer .The application layer generates a 200KB message.What is the size of the header if 20%...
1.4k
views
asked
Mar 6, 2017
Computer Networks
computer-networks
+
–
0
votes
3
answers
2
MadeEasy Subject Test: Operating System - Virtual Memory
485
views
asked
Jan 13, 2017
Operating System
made-easy-test-series
operating-system
virtual-memory
+
–
0
votes
2
answers
3
MadeEasy Subject Test: Digital Logic - Circuit Output
407
views
asked
Jan 11, 2017
Digital Logic
digital-logic
made-easy-test-series
circuit-output
+
–
0
votes
0
answers
4
Max Frequency
For synchronous series counter of modulus 256 , the propagation delay for each flip flop is 25 nano second and propogation delay of each two input AND gate is 5 ns. What is the maximium frequency of the MOD-256 counter?
For synchronous series counter of modulus 256 , the propagation delay for each flip flop is 25 nano second and propogation delay of each two input AND gate is 5 ns. What ...
410
views
asked
Jan 11, 2017
Digital Logic
digital-logic
made-easy-test-series
+
–
0
votes
2
answers
5
MadeEasy Subject Test: Theory of Computation - Identify Class Language
512
views
asked
Jan 8, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
0
votes
1
answer
6
MadeEasy Subject Test: Databases - Timestamp Ordering
521
views
asked
Jan 6, 2017
Databases
made-easy-test-series
databases
time-stamp-ordering
+
–
1
votes
1
answer
7
MadeEasy Subject Test: Databases - B Tree
358
views
asked
Jan 6, 2017
Databases
made-easy-test-series
databases
b-tree
+
–
0
votes
1
answer
8
MadeEasy Subject Test: Databases - Transactions
351
views
asked
Jan 5, 2017
Databases
databases
made-easy-test-series
transaction-and-concurrency
+
–
0
votes
0
answers
9
MadeEasy Subject Test: Compiler Design - Parsing
443
views
asked
Jan 4, 2017
Compiler Design
compiler-design
made-easy-test-series
parsing
+
–
0
votes
0
answers
10
Grammar is
406
views
asked
Jan 3, 2017
Compiler Design
compiler-design
grammar
+
–
0
votes
0
answers
11
Inexing
135
views
asked
Dec 13, 2016
Databases
databases
+
–
2
votes
1
answer
12
MadeEasy Test Series: Databases - Indexing
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is called a. Dense b. Sparse c. CLustered d. Unclustered
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is calleda. Denseb. Sparsec. CLust...
396
views
asked
Dec 12, 2016
Databases
made-easy-test-series
databases
indexing
+
–
4
votes
2
answers
13
Difference between record & block pointer
What is the difference between record & block pointer and any resource with diagram to know more about it? Keys and records are same or not ?
What is the difference between record & block pointer and any resource with diagram to know more about it?Keys and records are same or not ?
5.1k
views
asked
Dec 10, 2016
Databases
databases
+
–
18
votes
1
answer
14
left biasing and right biasing in B+ tree insertion
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
6.5k
views
asked
Dec 10, 2016
Databases
databases
b-tree
tree
+
–
3
votes
1
answer
15
Solving Recrrence
Consider the following recurrence T(n) = 3T(n/5) + lgn * lgn What is the value of T(n)? (A) (B) (c) (D)
Consider the following recurrence T(n) = 3T(n/5) + lgn * lgn What is the value of T(n)? (A) (B) (c) (D)
3.3k
views
asked
Aug 28, 2016
Algorithms
recurrence-relation
+
–
5
votes
6
answers
16
Size of senders window ?
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and a Maximum Segment Size (MSS) of 2 kB. The receiver’s advertised window is initially 32 kB. The first transmission ... timeouts on attempt number 4. Which of the following represents size of sender’s congestion window at attempt number 10?
Consider a TCP connection using the slow start congestion control scheme with an initial threshold value of 64 kB and a Maximum Segment Size (MSS) of 2 kB. The receiver&r...
2.6k
views
asked
Feb 2, 2016
Computer Networks
tcp
computer-networks
+
–
0
votes
1
answer
17
MadeEasy Test Series: Computer Networks - Network Communication
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bits/sec, what is the bit rate of receiver (in bits per sec)?
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bits/sec, what is the bit rate of r...
627
views
asked
Feb 2, 2016
Computer Networks
made-easy-test-series
computer-networks
network-communication
+
–
2
votes
1
answer
18
MadeEasy Test Series: Computer Networks - Flow Control Methods
Bandwidth of a link is 1000 Mbps and round trip time is given as 250 μ sec. If frame size is 500 bits, the utilization (in percentage) of channel when STOP and WAIT ARQ is used is _______.
Bandwidth of a link is 1000 Mbps and round trip time is given as 250 μ sec. If frame size is 500 bits, the utilization (in percentage) of channel when STOP and WAIT ARQ ...
1.4k
views
asked
Feb 1, 2016
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
stop-and-wait
+
–
2
votes
1
answer
19
Statement Follows
In these question there are 3 statements followed by $4$ conclusions numbered as $(a), (b), (c)$ and $(d)$. Assume the given 3 statements to be true even if they are at variance with commonly known facts. S1: Some clouds are girls. S2: ... . Identify the conclusion which follows from the given 3 statements. None follow. Only C4 follows. Only C1 follows. Both C1 and C4 follows.
In these question there are 3 statements followed by $4$ conclusions numbered as $(a), (b), (c)$ and $(d)$. Assume the given 3 statements to be true even if they are at v...
598
views
asked
Jan 27, 2016
Analytical Aptitude
verbal-aptitude
analytical-aptitude
logical-reasoning
statements-follow
+
–
1
votes
2
answers
20
Binary Search tree
A binary search tree was constructed by inserting following elements into an initially empty binary tree. 50, 27, 16, 88, 34, 65, 52, 77, 93, 4, 12, 29, 44, 92 Preorder and postorder traversals of the resultant binary search tree were stored in arrays ... present in these to array A and B ___________. Everything is ok here,, But not getting how length of LCS is calculated here.
A binary search tree was constructed by inserting following elements into an initially empty binary tree. 50, 27, 16, 88...
3.6k
views
asked
Jan 23, 2016
Programming in C
data-structures
binary-search-tree
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register