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 Jayan_78
3
answers
1
Test Series Question on Second Chance page Replacement
Demand paging uses a second chance page replacement policy (clock). It uses one use bit to give every page one more chance in FIFO replacement. Whenever a page is referenced its use bit set to 0. Whenever it is need to replace by other page for ... 0, 1, 2, 0, 3, 0, 4, 2, 3 The number of page faults occur using clock algorithm are ___________.
Demand paging uses a second chance page replacement policy (clock). It uses one use bit to give every page one more chance in FIFO replacement. Whenever a page is referen...
2.9k
views
commented
Feb 4, 2020
Operating System
page-replacement
operating-system
+
–
1
answer
2
Operating System Demand Paging
In a demand-paged system, it takes 100 nanoseconds to access memory. The page table has 8 entries and is held in registers. It takes 10 milliseconds to service a page fault if an empty frame is available or if the victim frame is not ... is dirty 80% of the time, find the maximum page fault rate for which the effective memory access time remains within 200 nanoseconds
In a demand-paged system, it takes 100 nanoseconds to access memory. The page table has 8 entries and is held in registers. It takes 10 milliseconds to service a page fau...
1.7k
views
commented
Feb 2, 2020
Operating System
operating-system
demand-paging
memory-management
+
–
2
answers
3
Synchronous transmission
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bps, what is the bit rate of receiver ?
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bps, what is the bit rate of receiv...
1.7k
views
comment edited
Jan 18, 2020
Computer Networks
synchronous-data
+
–
2
answers
4
MadeEasy Test Series 2019: Computer Networks - Sliding Window
Assume 2 computers are connected via a network. The network uses GB-7 sliding window protocol for flow control.It is observed that every 5th packet that has been sent is lost. The number of extra packets needs to resend Number of total packets transmitted by sender for sending 10 packets .
Assume 2 computers are connected via a network. The network uses GB-7 sliding window protocol for flow control.It is observed that every 5th packet that has been sent is ...
4.0k
views
commented
Dec 22, 2019
Computer Networks
made-easy-test-series
computer-networks
go
go-back-n
+
–
2
answers
5
Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minim...
4.3k
views
answered
Dec 14, 2019
Algorithms
merge-sort
algorithms
numerical-answers
+
–
1
answer
6
MadeEasy Subject Test: Algorithms - Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?
Which of the following statements is true?Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tre...
3.2k
views
commented
Dec 12, 2019
Algorithms
made-easy-test-series
algorithms
graph-algorithms
dijkstras-algorithm
+
–
1
answer
7
MadeEasy Subject Test: CO & Architecture - Io Handling
488
views
commented
Dec 11, 2019
CO and Architecture
made-easy-test-series
co-and-architecture
io-handling
+
–
2
answers
8
MadeEasy Test Series: CO & Architecture - IO Handling
A CPU scans the status of output I/O device every 20ms. The interface for the I/O device includes two different parts one for status and other for data output. Assume the clock rate of CPU is 8MHz and every instruction takes 10 cycles. What is the time taken(in microseconds) to scan and service the I/O device by CPU? A)4.5 B)3.75 C)1.25 D)2.5
A CPU scans the status of output I/O device every 20ms. The interface for the I/O device includes two different parts one for status and other for data output. Assume the...
1.1k
views
answered
Dec 11, 2019
CO and Architecture
made-easy-test-series
co-and-architecture
io-handling
+
–
3
answers
9
B+ Tree Records
2.1k
views
commented
Nov 22, 2019
Databases
databases
b-tree
bplustrees
+
–
0
answers
10
applied course
How to convert above E-R diagram to Relations? Sorry for adding image instead of typing..
How to convert above E-R diagram to Relations?Sorry for adding image instead of typing..
582
views
commented
Nov 21, 2019
Databases
databases
er-diagram
+
–
1
answer
11
forouzan 5 th edition
A host has the address 581E: 1456:2314:ABCD::1211. If the node identification is 48 bits, find the address of the subnet to which the host is attached.
A host has the address 581E: 1456:2314:ABCD::1211. If the node identification is48 bits, find the address of the subnet to which the host is attached.
1.2k
views
answered
Jun 21, 2019
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register