Register
Filter

Questions by hacker16

0 votes
1 answer
41
back-substitution
T(n) = 1 + T(n-1) + T(n-2); Given T(0) = 1, T(1) = 2 ; T(2) = 4; Express T(n) in terms of n ?
T(n) = 1 + T(n-1) + T(n-2);Given T(0) = 1, T(1) = 2 ; T(2) = 4;Express T(n) in terms of n ?
3 votes
1 answer
42
Circular Linked List
In circular singly linked list, insertion of node requires modification of how many pointers? 1 pointers 2 pointers 3 pointers 4 pointers
In circular singly linked list, insertion of node requires modification of how many pointers?1 pointers2 pointers3 pointers 4 pointers
5 votes
1 answer
43
Linked List (Time Complexity)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? O(n) O(1) θ(n2) θ(n)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?O(n)O(1)θ(n2)θ...
2 votes
3 answers
45
Ace Test Series: Operating System - Process Schedule
Which scheduling policy is most suitable for Real time operating systems? FCFS LCFS Round Robin Priority
Which scheduling policy is most suitable for Real time operating systems?FCFSLCFSRound RobinPriority
3 votes
0 answers
47
Turn Variable
Turn is shared variable but the values are not shared. Explain?
Turn is shared variable but the values are not shared.Explain?
1 votes
3 answers
48
Bounded Waiting
how this solution does not satisfy bounded waiting? // initially turn = 0 while (turn != 0); turn = 1 CS turn = 0
how this solution does not satisfy bounded waiting?// initially turn = 0 while (turn != 0); turn = 1 CS turn = 0
2 votes
1 answer
49
Bounded Waiting
Bounded waiting does not allow: Starvation Busy Waiting A process to wait indefinitely for CS All of Above Ans - d) Explain Option 1 and 2 ?
Bounded waiting does not allow:StarvationBusy WaitingA process to wait indefinitely for CSAll of AboveAns - d)Explain Option 1 and 2 ?
1 votes
2 answers
50
Multi Processing OS
In Multi Processing OS Maximum CPU Utilization can be achieved. Maximum throughput is achieved. which of the following is true ? a) 1 only b) 2 only c) both d) none ANS - A) 2 only Please explain it ?
In Multi Processing OSMaximum CPU Utilization can be achieved.Maximum throughput is achieved.which of the following is true ?a) 1 only b) 2 only c) both d) noneANS - A...
0 votes
1 answer
51
Average Waiting Time
Which of the algorithm gives longest average waiting time ? 1.FCFS 2. RR
Which of the algorithm gives longest average waiting time ?1.FCFS 2. RR
Page: