List of top Computer Science & Information Technology Questions

Which phase of the SDLC typically consumes the most resources?
The maximum number of keys in a B-tree of order 5 with height 3 is _______ .
A _______ architecture assigns only a few essential functions to the kernel, including address spaces, Interprocess communication (IPC), and basic scheduling.
In general, there will be _______ inodes than directories in Unix File system.
To ensure that the _______ condition never occurs in the system, we must guarantee that, whenever a process requests a resource, it does not have any other resource.
Which of the following component of program state is shared across threads in a multithreaded process?
Which of the following frees the CPU from having to deal with transfer of memory to or from I/O device?
A currently running process can be put on a ready queue or one of the I/O queues by each of the following except _______ .
Among priority inversion between two processes, one with high priority and other with low priority that share a critical section will cause which of the following problem?
In FCFS, I/O bound processes may have to wait long in the ready queue waiting for a CPU bound job to finish. This is known as _______ .
A program uses environment variables to _______ .
Which is not a CPU scheduling criterion?
Which of the following is not shared among threads in the same process?
The primary advantage of user-level threads over kernel-level threads is _______ .
Which of the following is not a three-address code statement?
The output of a syntax-directed translation scheme is _______ .
Subset Construction method refers to _______ .
The language \( L = \{M | M \text{ halts on all inputs}\} \) is _______ .
Inherited attributes in SDTs are used for _______ .
The time complexity to compute the 15\(^\text{th}\) Fibonacci number using dynamic programming is _______ .
A problem is NP-complete if it is _______ .
One way to build a heap is to start at the end of the array (the leaves) and push each new value up to the root. Its time complexity is _______ .
If the recursive call keeps calculating the same things over and over again, we can use _______ which stores partial results already calculated and to be used again.
The _______ process updates the costs of all the vertices \(V\), connected to a vertex \(U\), if we could improve the best estimate of the shortest path to \(V\) by including \((U,V)\) in the path to \(V\).
A threaded binary tree is a binary tree in which every node that does not have right child has a thread to its _______.