question answers
Saturday, June 29, 2013
Write an algorithm to insert a new node at the end of a singly linked list.
›
Conditions: · ‘SingleNode’ is the node representation of singly linked list, where, struct my_node{ //structure name...
4 comments:
Write an algorithm to insert a new node at the beginning of a singly linked list.
›
Conditions: · ‘SingleNode’ is the node representation of singly linked list, where, struct my_node{ //structure name...
2 comments:
Define a structure in C language to represent singly linked list.
›
struct my_node{ //structure name ‘my_node’ int data; //data field struct my_node *n...
When do page fault occur? Describe the actions taken by an OS when a page fault occur?
›
Any computations and executions take place only when the program is resided in the main memory and it is getting the CPU time. This sta...
5 comments:
. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the Optimal Page replacement? Remember all frames are Initially empty, so your first unique pages will all cost one fault each.
›
For Optimal Page replacement algorithm: :: for 3 page frames Request 1 2 3 4 2 ...
‹
›
Home
View web version