# Questions by VS

2 votes
2 answers
1
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 _________.
2 votes
1 answer
2
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
1 vote
0 answers
3
1 vote
0 answers
4
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?
3 votes
2 answers
5
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7
3 votes
0 answers
6
L={ (an)m bn | n,m>=1 }
1 vote
1 answer
7
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
1 vote
0 answers
8
Consider the following recursive function which is used by dynamic programming: T(n)= 0 ;if n<1 = 1;if n=1 =T(n-1)+T(n-2)+1 ;if n>1 Assume for every function call T(i) it checks the table first, if its value is already computed it retrieves ... value of n' so that overflow cannot occur ________. (Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
0 votes
0 answers
9
.......
2 votes
0 answers
10
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are present in the graph, if present then calculate the minimum distance between them?
2 votes
1 answer
11
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
2 votes
0 answers
12
Consider the basic block given below: b=b+c d=b+d b=b-d e=d+b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are:
4 votes
1 answer
13
True/False : 1)Several threads can share same physical address space. 2)Several threads can share same virtual address space.
5 votes
1 answer
14
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case? (Please mention the algorithm followed)
1 vote
0 answers
15
a) Shifting a Unsigned integer right by one bit, and filling from the left with 0, is always equivalent to dividing by 2. (True/False) b) Shifting a Unsigned integer left by one bit, and filling from the right with 0, is always equivalent to multiplying by 2. (True/False)
1 vote
1 answer
16
Suppose L = { {} } , N = {1, 2, 3}. Now what does the set N × L contain ?
2 votes
1 answer
17
~ $\forall$ x [ P(x) -> (Q(x) v P(x) ) ]
1 vote
1 answer
18
I am confused with what exactly Starvation mean ? AFAIK Considering Process Scheduling eg SRTF and SJF , Starvation can be considered when some process is getting preempted by other high priority processes and hence not getting a chance to execute on CPU and hence ... solving do we consider a Single processor system or a Multiprocessor i.e. when we have multiple processing cores or CPUs available?
2 votes
0 answers
19
In standard ethernet with transmission rate of 20 Mbps, the length of the cables is 2500 m and the size of frame is 512 bits. The propagation speed of a signal in a cable is 2 × 108 m/s. The percentage of the time channel is idle or not used by a station is _________ (in approximate integer value).
3 votes
1 answer
20
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 24 KB. Assume that 3 duplicate ACK are received during the 5th transmission what is the congestion window size at the end of 10th transmission?