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 SeemaTanwar
0
answers
1
MadeEasy Full Length Test 2019: Programming & DS - Recursion
Number of times # will be printed on foo(7) ?
Number of times # will be printed on foo(7) ?
871
views
commented
Feb 1, 2019
Programming in C
programming
recursion
made-easy-test-series
+
–
1
answer
2
dma cycle and burst mode
hard disk with transfer rate of 1 KBps is constantly transferring data to memory using DMA. The size of data transfer is 16 bytes. The processor runs at 400 kHz clock frequency. The DMA controller requires 10 cycles for initialization of operation and transfer takes 2 ... N? a)2.26 b)3.45 c)2.35 d)2.35 My solution plz verify if not correct plz give detailed explanation
hard disk with transfer rate of 1 KBps is constantly transferring data to memory using DMA. The size of data transfer is 16 bytes. The processor runs at 400 kHz clock fre...
2.2k
views
commented
Jan 19, 2019
1
answer
3
MadeEasy Test Series: Complier Design - Intermediate Code
someone please share detailed rules for this along with solution- would be of great help. and we usually dont take start and end state- arent they extra here? coz count comes different
someone please share detailed rules for this along with solution- would be of great help.and we usually dont take start and end state- arent they extra here? coz count co...
768
views
answered
Jan 17, 2019
Compiler Design
compiler-design
made-easy-test-series
intermediate-code
+
–
0
answers
4
Doubt -OS process scheduling
If arrival time of a process is same as the end time of quantum slice for a process in round robin schedule then in what order we must place the processes in ready queue?
If arrival time of a process is same as the end time of quantum slice for a process in round robin schedule then in what order we must place the processes in ready queue?...
501
views
asked
Dec 20, 2018
1
answer
5
MadeEasy Test Series 2018: CO & Architecture - Cache Memory
Consider a 16-way set associative cache which holds 64 KB of data. The size of physical address is of 40 bits. A cache block consist of 4 words. Every data word is of 32 bits. Assuming that all cache entries are ... (in hexadecimal) are supplied to the cache in the sequence given below : The number of compulsory misses are ________.
Consider a 16-way set associative cache which holds 64 KB of data. The size of physical address is of 40 bits. A cache block consist of 4 words. Every data word is of 32 ...
870
views
commented
Dec 16, 2018
CO and Architecture
co-and-architecture
cache-memory
madeeasy-testseries-2018
made-easy-test-series
+
–
0
answers
6
avl tree-AAI exam
304
views
asked
Dec 11, 2018
1
answer
7
Leaky Bucket
710
views
asked
Nov 26, 2018
1
answer
8
P&C examples : finding no of ways
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls , 5 identical yellow balls and 3 identical blue balls are_______ .
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls , 5 identical yellow balls and 3 identical blue balls are_______ .
2.3k
views
commented
Nov 9, 2018
Others
combinatory
see-later
+
–
0
answers
9
Made Easy test series
246
views
asked
Oct 5, 2018
0
answers
10
clock cycles to access ALU and Register in Base Index addressing mOde
How many cycles will be required to fetch an operand if we are using "BASE INDEX' addressing mode, and ALU computation takes 2 cycles, register reference takes 1 cycle and memory reference takes 4 cycles each respectively ?
How many cycles will be required to fetch an operand if we are using "BASE INDEX' addressing mode, and ALU computation takes 2 cycles, register reference takes 1 cycle an...
487
views
commented
Jan 28, 2018
1
answer
11
Clock frequency required for proper operation of ripple counter
An 8 stage ripple counter uses a flip flop with propagation delay of 75 ns. The pulse width of strobe is 50ns. The frequency of input signal which can be used for proper operation of counter is? (A) 1 MHz (B) 500 MHz (C) 1.5 MHz (D) 2 MHz
An 8 stage ripple counter uses a flip flop with propagation delay of 75 ns. The pulse width of strobe is 50ns. The frequency of input signal which can be used for proper ...
7.9k
views
commented
Jan 24, 2018
Digital Logic
digital-logic
clock-frequency
digital-counter
+
–
0
answers
12
shift register
451
views
asked
Jan 6, 2018
0
answers
13
cache memory
A 2-way set associative write back cache with true LRU replacement requires 15 * 29 bits to implement its tag store per set (including bits for valid, dirty and LRU). The cache is virtually indexed, physically tagged. The virtual address space is 1 MB, page size ... , cache block size is 8 bytes and is byte addressable. What is the maximum size of the data store of the cache in bytes?
A 2-way set associative write back cache with true LRU replacement requires 15 * 29 bits to implement its tag store per set(including bits for valid, dirty and LRU). The ...
187
views
asked
Dec 26, 2017
1
answer
14
Memory Access Time
Consider a memory system consists of a single external cache with an access time of 20ns and a hit rate of 0.92, and a main memory with an access time of 60ns. Now we add virtual memory to the system. The TLB is implemented internal to the processor ... table hit ratio is 50%. What is the effective memory access time of the system with virtual memory? 27.3ns 28.2ns 29ns 29.44ns
Consider a memory system consists of a single external cache with an access time of 20ns and a hit rate of 0.92, and a main memory with an access time of 60ns. Now we add...
2.4k
views
commented
Dec 26, 2017
0
answers
15
memory access time
Consider a computer system in which cache memory write hit takes 10 ns and and miss takes 100 ns. Cache memory read hit takes 5ns and miss takes 55 ns. The cache is having 90% hit. The system received 1000 fetch instructions out of which, 500 operand fetch operations and 500 operand write operations. The average time taken to execute above 1000 instructions is_
Consider a computer system in which cache memory write hit takes 10 ns and and miss takes 100 ns. Cache memory read hittakes 5ns and miss takes 55 ns. The cache is having...
297
views
commented
Dec 26, 2017
0
answers
16
cache hit latency computation
Consider 32 KB 4-way set associative cache with 32 byte block size. CPU generates 32 bits physical address . A 4 to1 multiplexer has a latency of 1 ns while a k bit comparator has a latency of 2k ns. The hit latency of the cache organization is?
Consider 32 KB 4-way set associative cache with 32 byte block size. CPU generates 32 bits physical address . A 4 to1multiplexer has a latency of 1 ns while a k bit compar...
427
views
asked
Dec 26, 2017
0
answers
17
hit ratio computation
Consider a 4-way set associative cache that has 8 lines,with perfect LRU cache replacement and supports a block size of 16 bytes. For the following memory access pattern (shown as byte addresses), find the hit ratio? 3, 5, 6, 21, 32, 14, 5, 10, 11, 12 ?
Consider a 4-way set associative cache that has 8 lines,with perfect LRU cache replacement and supports a block size of16 bytes.For the following memory access pattern (s...
319
views
commented
Dec 26, 2017
0
answers
18
Ace test series question on scheduling policy
which scheduling policy is starvation free? A) LIFO B) FIFO C) SJF D)PRIORITY
which scheduling policy is starvation free?A) LIFOB) FIFOC) SJFD)PRIORITY
586
views
commented
Dec 25, 2017
0
answers
19
pre-emptive scheduling
22. Given the jobs with the following characteristics: job A: 5ms CPU , 25 ms IO , 5 ms CPU job B: 20ms CPU, 15 ms IO job C: 40 ms cpu Determine the turnaround time, waiting time and response time of Job B while the CPU runs these jobs. Assume the schedule is preemptive and the CPU quantum is 5 ms
22. Given the jobs with the following characteristics:job A: 5ms CPU , 25 ms IO , 5 ms CPUjob B: 20ms CPU, 15 ms IOjob C: 40 ms cpuDetermine the turnaround time, waiting ...
248
views
commented
Dec 25, 2017
0
answers
20
Round Robin scheduling policy
The I/O wait percentage p of a process is the percentage of time the process wait for an IO to completion when executed in a monoprogramming environment . on a system using round robin with n process ,all having same IO . what percentage of time cpu will be idle in term of (p) ?
The I/O wait percentage p of a process is the percentage of time theprocess wait for an IO to completion when executed in amonoprogramming environment . on a system using...
243
views
asked
Dec 24, 2017
1
answer
21
EKT-423: OPERATING SYSTEM TUTORIAL 01
4. A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 20 ns are required to access it. If it is in main memory but not in the cache, 60 ns are needed to load it ... main-memory hit ratio is 0.6 (60%) . What is the average time in ns required to access a referenced word on this system?
4. A computer has a cache, main memory, and a diskused for virtual memory. If a referenced wordis in the cache, 20 nsare required to access it. If it is in main memory bu...
437
views
commented
Dec 22, 2017
1
answer
22
Test series question............
In a 6 bit ripple counter the MOD of up counting is 14, then MOD of down counting is?
In a 6 bit ripple counter the MOD of up counting is 14, then MOD of down counting is?
363
views
asked
Dec 20, 2017
7
answers
23
GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...
28.2k
views
commented
Dec 7, 2017
Computer Networks
gatecse-2003
computer-networks
sliding-window
normal
+
–
0
answers
24
MP481 Review Problems Turing Machines and (Un)Decidability Luay K. Nakhleh
L1={<M>|M is a TM and |L(M)|<=3} L2={<M>|M is a TM and |L(M)|>=3} L3={<M>|M is a TM and L(M) is finite} How can we judge which language is rec, R. E or not R. E?
L1={<M>|M is a TM and |L(M)|<=3}L2={<M>|M is a TM and |L(M)|>=3}L3={<M>|M is a TM and L(M) is finite}How can we judge which language is rec, R. E or not R. E?
268
views
reshown
Dec 29, 2016
1
answer
25
decidability
Decidability of M is a TM and L(M) is a regular language ?
Decidability of M is a TM and L(M) is a regular language ?
406
views
commented
Dec 29, 2016
Theory of Computation
decidability
theory-of-computation
turing-machine
+
–
1
answer
26
decidability
Consider the following languages- L1={<M>| there exists x,y belonging to (sigma*) such that either x belongs to L(M) or y does not belong to L(M)}. Answer- Recursive, This is the language of all turing machines L2={<M1,M2>| L(M1) < L(M2)} Answer- Not even recursively enumerable. Arjun sir plzz explain these languages.
Consider the following languages-L1={<M>| there exists x,y belonging to (sigma*) such that either x belongs to L(M) or y does not belong to L(M)}.Answer- Recursive, This ...
2.1k
views
commented
Dec 27, 2016
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register