List of top Computer Science Questions asked in CUET (PG)

Consider the task of finding the shortest path in an unweighted graph by using BFS and DFS. Which of the following statements are true?
(A). BFS always finds the shortest path.
(B). DFS always finds the shortest path.
(C). DFS does not guarantee finding the shortest path.
(D). BFS does not guarantee finding the shortest path.
If the line through \( (3, y) \) and \( (2, 7) \) is parallel to the line through \( (-1, 4) \) and \( (0, 6) \), then the value of \( y \) is:
A fair coin is tossed three times. Let A be the event of getting exactly two heads and B be the event of getting at most two tails, then \( P(A \cup B) \) is:
The Quicksort and randomized Quicksort procedures differ in:
Arrange the following time complexities in increasing order.
(A). Bubble sort (worst case)
(B). Deleting head node in singly linked list
(C). Binary search
(D). Worst case of merge sort
Which of the following statements are TRUE, where $|E|$ represents the number of edges?
(A). In case of a directed graph, the sum of lengths of all the adjacency list is |E|
(B). For an undirected graph, the sum of the lengths of all the adjacency list is 2|E|
(C). For a dense graph, adjacency matrix representation is preferable
(D). The memory requirement of the adjacency matrix of a graph is dependent on the number of edges
What is the result of the following operation defined by IEEE754?
\[ \text{(NaN == NaN)} \]
The length of major axis and coordinate of vertices for the ellipse \( 3x^2 + 2y^2 = 6 \) respectively are:
Introducing a man to her husband, a woman said, "His brother's father is the only son of my grandfather." How is the woman related to this man?
Given the index i of a node in a heap, we can not compute: