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
Recent activity by sourojit
1
answer
1
Made easy test series
314
views
asked
Jan 7, 2017
DS
data-structures
avl-tree
time-complexity
made-easy-test-series
+
–
0
answers
2
Ace test series
Which of the following problem is recursive but not CSL? a> Equality of NFA b> Equality of DFA c> Emptiness of Extended Regular Expression d> None of the above
Which of the following problem is recursive but not CSL?a Equality of NFAb Equality of DFAc Emptiness of Extended Regular Expressiond None of the above
254
views
retagged
Jan 6, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
3
MadeEasy Subject Test: Operating System - Disks
Consider a typical disk that rotates at 30000 rotations per minute(RPM) and has a transfer rate of 40Mbps.If the average seek time of the disk is twice the average rotational delay and the controller's transfer time is 8 times the ... following way-: time taken=seek time+rotational latency+transfer time+controller time =2+1+0.0512+0.4096 =3.4608
Consider a typical disk that rotates at 30000 rotations per minute(RPM) and has a transfer rate of 40Mbps.If the average seek time of the disk is twice the average rotati...
1.5k
views
commented
Dec 27, 2016
Operating System
operating-system
made-easy-test-series
disk
+
–
1
answer
4
Ace Test Series: Digital Logic - Digital Counter
299
views
asked
Dec 24, 2016
Digital Logic
ace-test-series
digital-logic
digital-counter
clock-frequency
+
–
1
answer
5
made easy test series
334
views
answer selected
Dec 24, 2016
Databases
databases
+
–
1
answer
6
MadeEasy Subject Test: Databases - Joins
I think the answer should be 300 because in relation Q, C and E collectively distinguish a tuple from another tuple.So there can be duplicate values in C and then the natural join of P and Q will give 300 tuples.Same case can be considered when we natural join P,Q with R. Am I correct??
I think the answer should be 300 because in relation Q, C and E collectively distinguish a tuple from another tuple.So there can be duplicate values in C and then the nat...
243
views
asked
Dec 24, 2016
Databases
made-easy-test-series
databases
joins
+
–
1
answer
7
MadeEasy Subject Test: Algorithms - Asymptotic Notations
run(n) { if(n<=2) return 1; else return run(log(n)+log(n)); } Which of the following represents the running time for run(n) function? a> O(log n) b> O(log log(n)) c> O(log * n) d> O(n) Can someone provide a detailed solution?
run(n) { if(n<=2) return 1; else return run(log(n)+log(n)); }Which of the following represents the running time for run(n) function?a O(log n)b O(log log(n))c O(log * ...
405
views
asked
Dec 21, 2016
Algorithms
asymptotic-notation
made-easy-test-series
algorithms
+
–
5
answers
8
Ace test series
Which of the following scheduling algorithms can cause indefinite blocking of a process? a>FIFO b>SRTF c>Round Robin d>Priority scheduling According to me answer should be B and D.Am I correct??
Which of the following scheduling algorithms can cause indefinite blocking of a process?a>FIFOb>SRTFc>Round Robin d>Priority scheduling According to me answer should be B...
1.8k
views
commented
Dec 20, 2016
Operating System
operating-system
process-scheduling
+
–
1
answer
9
MadeEasy Test Series: Operating System - Memory Management
Consider a system using segmented paging architecture.The segment is divided into 1K pages.Each page having 128 entries.Segment table is divided into 512 pages and each page having 1024 entries.The size of page table entries are 2 ... answer given is 1024 while I am getting 2048. Can anyone provide a detailed explanation if I am wrong?
Consider a system using segmented paging architecture.The segment is divided into 1K pages.Each page having 128 entries.Segment table is divided into 512 pages and each p...
1.1k
views
commented
Dec 20, 2016
Operating System
made-easy-test-series
operating-system
memory-management
+
–
0
answers
10
Ace test series
A DRAM chip is designed with capacity of 512MBytes with row size of 32 bits each, one refresh operation takes one nanosecond time.Total refresh time to refresh the DRAM chip once is _______________ milliseconds. My answer is 134.22 milliseconds while the answer given is 128 milliseconds.
A DRAM chip is designed with capacity of 512MBytes with row size of 32 bits each, one refresh operation takes one nanosecond time.Total refresh time to refresh the DRAM c...
280
views
commented
Dec 13, 2016
CO and Architecture
co-and-architecture
+
–
9
answers
11
GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...
23.9k
views
commented
Dec 13, 2016
Operating System
gatecse-2004
operating-system
virtual-memory
page-replacement
normal
isro2007
+
–
1
answer
12
Computer Networks Doubt
What will be the formula for the efficiency of a link in stop and wait protocol when acknowledgements are piggybacked??? My guess is $2*T/(2*T+2*P)$ where T=Transmission delay P=propagation delay And frames sent by sender and reciever are of equal size
What will be the formula for the efficiency of a link in stop and wait protocol when acknowledgements are piggybacked???My guess is $2*T/(2*T+2*P)$where T=Transmission d...
606
views
answer selected
Dec 2, 2016
Computer Networks
computer-networks
stop-and-wait
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register