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 Dulqar
2
votes
0
answers
21
NPTEL-Design and Analysis of Algorithms-Week1-Quiz 1
In the code fragment below, first and last are integer values and composite(x) is a function that returns true if x is not a prime number and false otherwise. i := 0; j := 0; k := 0; for (m := last; m >= first; m := m ... > i+j The relationship between i, j and k depends on the values of first and last im getting option 2 , is it correct ?
In the code fragment below, first and last are integer values and composite(x) is a function that returns true if x is not a prime number and false otherwise.i := 0; j :=...
4.9k
views
asked
Jan 24, 2017
Algorithms
algorithms
nptel-quiz
+
–
2
votes
0
answers
22
Floating Point Representation Without Normalization
Mantissa is a pure fraction in signed magnitude form .What is the reprentation of decimal number 12.6255*102 12.6255*23 with Normalization and Without Normalization
Mantissa is a pure fraction in signed magnitude form .What is the reprentation of decimal number12.6255*10212.6255*23with Normalization and Without Normalization
1.6k
views
asked
Jan 23, 2017
CO and Architecture
floating-point-representation
+
–
2
votes
1
answer
23
MadeEasy CBT 2017: Digital Logic - Ieee Representation
1.0k
views
asked
Jan 23, 2017
Digital Logic
made-easy-test-series
cbt-2017
co-and-architecture
ieee-representation
+
–
5
votes
2
answers
24
MadeEasy CBT 2017: CO & Architecture - Pipelining
1.4k
views
asked
Jan 22, 2017
CO and Architecture
made-easy-test-series
cbt-2017
co-and-architecture
pipelining
+
–
3
votes
1
answer
25
MadeEasy CBT 2017: CO & Architecture - Cache Memory
900
views
asked
Jan 22, 2017
CO and Architecture
made-easy-test-series
cbt-2017
co-and-architecture
cache-memory
+
–
2
votes
1
answer
26
MadeEasy CBT 2017: Algorithms - Graph Algorithms
613
views
asked
Jan 22, 2017
Algorithms
made-easy-test-series
cbt-2017
algorithms
graph-algorithms
+
–
2
votes
2
answers
27
MadeEasy CBT 2017:Computer Networks - Routing
742
views
asked
Jan 22, 2017
Computer Networks
cbt-2017
made-easy-test-series
computer-networks
routing
+
–
1
votes
2
answers
28
MadeEasy CBT 2017: CO & Architecture - Dma
655
views
asked
Jan 22, 2017
CO and Architecture
made-easy-test-series
cbt-2017
co-and-architecture
dma
+
–
4
votes
0
answers
29
MadeEasy CBT 2017:Digital Logic - K Map
516
views
asked
Jan 22, 2017
Digital Logic
made-easy-test-series
cbt-2017
digital-logic
k-map
+
–
1
votes
1
answer
30
MadeEasy CBT 2017:Operating System - Process Synchronization
847
views
asked
Jan 22, 2017
Operating System
made-easy-test-series
cbt-2017
operating-system
process-synchronization
+
–
5
votes
2
answers
31
CN - Fragmentation Offset [Modified Gate Question]
A host X send a message to host Y having two intermediate networks in between them.A TCP message consisting of 2100 bytes is passed to IP for delivery across two hosts. In first network has MTU of 1200 bytes second ... Assume that IP overhead per packet is 20 bytes. What is the fragmentation offset for the Last fragment that reaches destination
A host X send a message to host Y having two intermediate networks in between them.A TCP message consisting of 2100 bytes is passed to IP for delivery across two hosts. ...
4.4k
views
asked
Jan 20, 2017
Computer Networks
computer-networks
fragmentation
tcp
+
–
4
votes
1
answer
32
TCP Data Transfer Rate [modified Gate Question]
Consider three IP networks A,B and C. Host $H_A$ in network A sends messages each containing 200 bytes of application data to a host $H_C$ in network C. This passes through an intermediate network B . The maximum packet size ... is the rate at which application data is transferred to host $H_C$ ? Ignore errors, acknowledgements, and other overheads.
Consider three IP networks A,B and C. Host $H_A$ in network A sends messages each containing 200 bytes of application data to a host $H_C$ in network C. This passes throu...
515
views
asked
Jan 20, 2017
Computer Networks
computer-networks
tcp
+
–
0
votes
3
answers
33
Protocols
Which protocol is most appropriate for the situation described below . High Defnition Video streaming TCP UDP FTP SMTP
Which protocol is most appropriate for the situation described below . High Defnition Video streamingTCPUDPFTPSMTP
736
views
asked
Jan 19, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
34
Virtual Gate Test Series: Programming & DS - Define
#define THIS 0 #define THAT 0 #include <stdio.h> int main(int argc, char const *argv[]) { #ifdef THIS && THAT printf("if\n"); #else printf("else\n"); #endif return 0; } What is the output? What happens if the first two lines are not initializing. i.e., #define THIS #define THAT
#define THIS 0 #define THAT 0 #include <stdio.h int main(int argc, char const *argv[]) { #ifdef THIS && THAT printf("if\n"); #else printf("else\n"); #endif return 0; }Wha...
289
views
asked
Jan 15, 2017
Programming in C
programming-in-c
virtual-gate-test-series
+
–
0
votes
0
answers
35
How to know 1:1 or n:n participation
By looking into er table how do we know it is 1:1 or N:N relation
By looking into er table how do we know it is 1:1 or N:N relation
250
views
asked
Jan 14, 2017
Databases
databases
+
–
2
votes
1
answer
36
CO Moemory Hierarchy
Consider a 3 Level Memory System with the following specifications (H1,H2,H3) = (0.8,0.9,1) (T1,T2,T3) = (2,100,500) nano sec / word IF there is miss at L1 and Hit at L2 .A 2-Word block must be transfered from L2 to L1 IF there is miss at both ... Taken Given that the data width between L1 to L2 and L2 to L3 is 4 Word block is Tavg-2 What is the ratio of Tavg-1 to Tavg-2
Consider a 3 Level Memory System with the following specifications(H1,H2,H3) = (0.8,0.9,1)(T1,T2,T3) = (2,100,500) nano sec / wordIF there is miss at L1 and Hit at L2 .A...
1.3k
views
asked
Jan 13, 2017
CO and Architecture
co-and-architecture
memory-hierarchy
cache-memory
+
–
0
votes
0
answers
37
Justify the statement
Deadlock avoidance is less restrictive than deadlock prevention
Deadlock avoidance is less restrictive than deadlock prevention
144
views
asked
Jan 12, 2017
Operating System
operating-system
+
–
0
votes
2
answers
38
OS Test -1
A computer has 20 tape drivers, with n processes competing for them. Each process may need five drivers. What is the maximum value of n for the system to be deadlock free?
A computer has 20 tape drivers, with n processes competing for them. Each process may need five drivers. What is the maximum value of n for the system to be deadlock free...
322
views
asked
Jan 12, 2017
CO and Architecture
test-series
+
–
1
votes
0
answers
39
How to Simplify ?
$\frac{1}{10^{9}}[30*10^{-3}]+(1-\frac{1}{10^{9}})[300*10^{-9}]$ Answer should be in nano seconds
$\frac{1}{10^{9}}[30*10^{-3}]+(1-\frac{1}{10^{9}})[300*10^{-9}]$ Answer should be in nano seconds
275
views
asked
Jan 12, 2017
Quantitative Aptitude
test-series
+
–
1
votes
2
answers
40
How Q1 and Q2 are Equal ?
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2
Please Explain How Q1 and Q2 are equal using state Minimization TechniqueState Equivalance AlgorithmTable Filling Algorithm abQ1Q2Q1Q2Q1Q2
975
views
asked
Jan 9, 2017
Theory of Computation
theory-of-computation
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
