CUET (PG) Computer Science Questions

Arrange the following steps of calculating factorial in the correct order.

A. set fact := 1
B. if N = 0, then; set fact :=1, and Return
C. Repeat for k = 1 to N
D. Set fact : = k * fact

Option Orientation : Vertical

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R

Assertion A: The mutual-exclusions condition of deadlock must hold for non-sharable resources.

Reason R: Printer cannot be simultaneously shared by several processes.

In the light of the above statements, choose the most appropriate answer from the options given below

The first-fit and best-fit strategies for memory allocation suffers from ________.

1. Paging
2. Thrashing
3. Hashing
4. Memory fragmentation

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R

Assertion A: The queue data structure is based on FIFO order.

Reason R: Insertion and deletion can be performed on both sides of the dequeue.

In the light of the above statements, choose the most appropriate answer from the options given below

A Polynomial can be represented in a _________ by just storing the coefficient and exponent of each term.

1. Array
2. Linked list
3. Queue
4. Stack

Sequence the following with respect to different levels of file system from lowest to highest.

A. Devices
B. Application Programs
C. I/O control
D. logical file system
E. Basic file system and file organization module

Choose the correct answer from the options given below:

Which of the following data structure is/are non-linear.
A. Trees
B. Sets
C. Graphs
D. Linked List

Which of the following are correct ?

(1) A process is said to be thrashing if it is spending more time in paging than in execution.

(2) The scheme is pure demand paging when it brings a page in to memory even if it not required.

(3) An optimal page replacement algorithm suffers from Belady's anomaly.

(4) The virtual address space of a process refers to the logical view of how a process in stored in memory.

Choose the correct answer from the options given below:

A_______ queue is a collection of elements such that each element has been assigned a priority and the order in which elements are added and processed comes from certain rules.

1. Circular
2. Priority
3. Dequeue
4. Heap

Match the LIST-I with LIST-II

Choose the correct answer from the options given below:

Consider a problem 'P' associated with a set 'S'. Suppose 'A' which partitions 'S' into smaller sets such that the solution of the problem 'P' for 'S' is reduced to the solution of 'P' for one or more of the smaller sets. Then 'A' is called as : ________

1. Ackermann function
2. Divide and conquer algorithm
3. Recursion
4. Factorial function

If T is a binary tree and each node of T has the property - the value at node N is greater then every value in the left subtree of N and is less then every value in the right subtree of N, the T is called_________Tree.

1. Binary Search
2. Balanced
3. Complete
4. Threaded

Arrange the following steps in correct order for the safety Algorithm used in the Banker's Algorithm to check whether the system is in safe state.

A. Find a process $P_i$ whose need $\le$ work and which has Finish $[i]$ == false.
B. If such a process is found, set $work=work+Allocation[i]$ and Finish $[i]$ = true.
C. If all processes have Finish $[i]$ = true, the system is in a safe state
D. Initialize two vectors. $work=Available$ and Finish $[i]$ = false for all i.

Choose the correct answer from the options given below:

Arrange the following according to the decreasing number of pointers they contain.

A. A circular linked list of 8 nodes.
B. A linear linked list of 8 nodes.
C. A circular doubly linked list of 8 nodes.
D. A doubly linked list of 8 nodes.

Choose the correct answer from the options given below:

Which of the following is an example of non-preemptive scheduling?

Which of the following are the fundamental models of inter process communication for co operating process?

A. Message passing
B. Shared memory
C. Context switch
D. Schedulers

Choose the correct answer from the options given below:

_______ refers to a situation in which a process is ready to execute but is continuously denied access to a processor because of other process getting priority.

An address generated by the CPU is commonly referred to as :-

Match the LIST-I with LIST-II

Choose the correct answer from the options given below:

__________ is a common method used to store a graph.