List of top Computer Science Questions

If $ x^2 = -16y $ is an equation of a parabola, then:

(A) Directrix is $ y = 4 $
(B) Directrix is $ x = 4 $
(C) Co-ordinates of focus are $ (0, -4) $
(D) Co-ordinates of focus are $ (-4, 0) $
(E) Length of latus rectum is 16

The points $ (K, 2 - 2K), (-K + 1, 2K) $ and $ (-4 - K, 6 - 2K) $ are collinear if:

(A) $ K = \frac{1}{2} $
(B) $ K = -\frac{1}{2} $
(C) $ K = \frac{3}{2} $
(D) $ K = -1 $
(E) $ K = 1 $

If $ x = \left( 2 + \sqrt{3} \right)^3 + \left( 2 - \sqrt{3} \right)^{-3} $ and $ x^3 - 3x + k = 0 $, then the value of $ k $ is:

Match List-I with List-II.\[\begin{array}{|c|c|} \hline \textbf{List-I} & \textbf{List-II} \\ \hline (A) \; \text{If } A = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}, \; \Delta \text{ is} & (I) \; 0 \\ \hline (B) \; \text{If } A = \begin{bmatrix} 2 & 1 \\ 4 & 2 \end{bmatrix}, \; \Delta \text{ is} & (II) \; 1 \\ \hline (C) \; \text{If } A = \begin{bmatrix} 1 & 0 \\ 0 & 2 \end{bmatrix}, \; |A^{-1}| \text{ is} & (III) \; -2 \\ \hline (D) \; \text{If } A = \begin{bmatrix} 1 & 1 \\ 1 & 2 \end{bmatrix}, \; a \text{ is} & (IV) \; 2 \\ \hline \end{array}\]

From the given sets, which is an infinite set:

Which figure comes next in the given series below?

In the following question, there is a certain relationship between two given words on one side of "::" and one word is given on another side of "::" while another word is to be found from the given options, having the same relation with this word as the words of the given pair bear. Choose the correct option to replace the '?'. Milk : Emulsion :: Butter : ?

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?

Identify the missing number (?) from the following figure.

Find the number of triangles in the given figure.

Find the next two terms of the series:
The given series is: $ A, C, F, J, ? $.

(A) O
(B) U
(C) R
(D) V
Choose the correct answer from the options given below:

What should be the output of the following boolean expression after simplifying it to a minimum number of variables? \[ a'b' + ab + a'b \]

To provide a memory capacity of 32K X 16 how many address lines and data lines are required?

All the elements that hash to the same slot are placed into the same linked list in:

The Quicksort and randomized Quicksort procedures differ in:

In ................. the search time is independent of the number of elements $n$.

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.

In case of Binary Search Tree, which of the following procedure's running time is distinct among all?

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

Arrange the following layers of MS DOS operating system starting from inner most to outer most.
(A). ROM BIOS Device drivers
(B). Resident System Program
(C). MS DOS Device Drivers
(D). Application Program

In a binary search tree, the worst case time complexity of inserting and deleting a key is:

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{BFS} & (IV)\ \text{Queue} \\ \hline (B)\ \text{DFS} & (I)\ \text{Stack} \\ \hline (C)\ \text{Heap Sort} & (III)\ \text{Priority Queue} \\ \hline (D)\ \text{Storage on secondary storage devices} & (II)\ \text{B Trees} \\ \hline \end{array}\] Choose the correct answer from the options given below:

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{Binary Search} & (I)\ T(n) = T(n/2) + c \\ \hline (B)\ \text{Merge Sort} & (II)\ T(n) = 2T(n/2) + \Theta(n) \\ \hline (C)\ \text{Quick Sort (worst case)} & (III)\ T(n) = T(n-1) + \Theta(n) \\ \hline (D)\ \text{Linear Search} & (IV)\ T(n) = T(n-1) + c \\ \hline \end{array}\] Choose the correct answer from the options given below:

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{Seek Time} & (IV)\ \text{Time taken for the disk arm to move the heads to the cylinder containing the desired sector} \\ \hline (B)\ \text{Access Time} & (III)\ \text{Seek Time + Rotational Latency} \\ \hline (C)\ \text{Rotational Latency} & (II)\ \text{Time taken for the disk to rotate the desired sector to the disk head} \\ \hline (D)\ \text{Disk Bandwidth} & (I)\ \text{Total number of bytes transferred, divided by the total time between the first request for service and the completion of the last transfer} \\ \hline \end{array}\] Choose the correct answer from the options given below: