List of top Questions asked in CUET (PG)

Which of the following algorithms have time order of complexity?
• [A.] Insertion sort
• [B.] Worst case Search in Binary Search tree
• [C.] Insertion in Stack
• [D.] Quick sort worst case
Choose the correct answer from the options given below:

Arrange the following time complexities in increasing order:
• [A.] Linear search worst case
• [B.] Quick sort expected running time
• [C.] Binary search best case
• [D.] Bubble sort worst case
Choose the correct answer from the options given below:

Consider a procedure LIST-SEARCH (L, K) finds the first element with key K in list L by simple linear search, returning a pointer to its element. Arrange the following according to correct order of execution.
• [A.] x = L.head
• [B.] while x $\neq$ NIL and x.key $\neq$ K
• [C.] return x
• [D.] x = x.next
Choose the correct answer from the options given below:

Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R). Assertion (A): Deadlocks occur in a multi programming environment when each thread in a set is waiting for an event that can be caused only by another thread in the same set. Reason (R): A thread must always request a resource before using it and release it after using it. If requested resources are not available, the thread enters a waiting state until the resources become free. In the light of the above statements, choose the most appropriate answer from the options given below:

In a ______ linked list, the last node's link field points to the first node of the list.

Which of the following is NOT an application of stack?

A true word to represent arithmetic expressions is called _____.

In a ______ search, we begin search at a starting node, and when we come across a dead end we backtrack.

In modern systems, management scheme that permits the physical address space of a process to be non-contiguous is:

Which state occurs when two or more processes are waiting indefinitely for an event that can be caused only by one of the waiting processes?

Arrange the following semaphore operations in the correct sequence for producer process in bounded-buffer problem using semaphores (empty, full and mutex).
• [A.] Signal (full) -- indicating that the new item has been produced and added to the buffer
• [B.] Wait (empty) -- checks if there is space in the buffer
• [C.] Produce an item and store it in the buffer
• [D.] Wait (mutex) -- enters the critical section to insert the item safely
• [E.] Signal (mutex) -- leaves the critical section after inserting the item
Choose the correct answer from the options given below:

Sequence the following to compute the effective access time needed to service a page fault.
• [A.] Receive an interrupt from the disk I/O subsystem
• [B.] Trap the operating system and save the user registers and process state
• [C.] Determine that the interrupt was a page fault
• [D.] Correct the page table and other tables to show that the desired page is now in memory
• [E.] Restore the user registers, process state and new page table, and then resume the interrupted instruction
Choose the correct answer from the options given below:

Which of the following requirement must be satisfied to solve a critical section problem?
• [A.] Mutual Exclusion
• [B.] Race Condition
• [C.] Progress
• [D.] Bounded Waiting
Choose the correct answer from the options given below:

The occurrence of an event is usually signaled by an interrupt from software by executing a special instruction which is called:

The target thread periodically checks whether it should terminate, allowing it an opportunity to terminate itself in an orderly fashion. This is known as:

Cooperating processes require an Interprocess Communication mechanism. This works on which of the following fundamentals?
• [A.] Shared Memory
• [B.] Cascading Termination
• [C.] Message Passing
• [D.] Cooperating

Which of the following statement are false about two circles whose equations are given below? \[ x^2 + y^2 - 10x - 10y - 41 = 0 \] \[ x^2 + y^2 - 22x - 18y + 137 = 0 \]
• [A.] Circles have no common point
• [B.] Circles have one common point
• [C.] Circles have two common points
• [D.] Circles have infinitely many points

Let \(S\) and \(T\) be symmetric matrices of the same order, which of the following statements are true?
• [A.] \(S + T\) is a symmetric matrix
• [B.] \(ST\) is a symmetric matrix
• [C.] \(ST = TS\) is a symmetric matrix
• [D.] \(ST - TS\) is a symmetric matrix