List of top Computer Science Questions

Arrange the following steps in the correct order to understand the functioning of a 3 to 8 line decoder.
(A) The encoder enable input is set to 1.
(B) The decoder activates one of its 8 output lines based on the input code.
(C) The input binary code is applied to the decoder.
(D) The decoder converts the 3-bit binary input into 8 possible outputs.
Which of the following statement is true about IEEE754 representation of +0 and -0?
To provide a memory capacity of 32K X 16 how many address lines and data lines are required?

The following circuit generates the same output as? 

Consider a typical process P in the critical section. Arrange the following statements of code to make a valid general structure.
(A). Critical section
(B). Remainder section
(C). Entry section
(D). Exit section

Consider the following Karnaugh Map (K-map). Minimal Function generated by this Karnaugh map is: 

Consider a page reference string as: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2. Assume that there are 3-page frames available. Calculate the total number of page faults for the above reference string if LRU policy is used for page replacement.
In case of Binary Search Tree, which of the following procedure's running time is distinct among all?
In an examination, a student scores 4 marks for every correct answer and loses 1 mark for every wrong answer. If she/he attempts all 60 questions and secures 130 marks, the number of questions she/he attempts wrongly are?
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
Out of 5 consonants and 4 vowels, how many words of 3 consonants and 3 vowels can be made?
What should be the output of the following boolean expression after simplifying it to a minimum number of variables? \[ a'b' + ab + a'b \]
Which CPU scheduling algorithm prefers the process with the shortest burst time?
What is the result of the following operation defined by IEEE754?
\[ \text{(NaN == NaN)} \]
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 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
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.
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:

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 
 

If \( a, b, c \) are in Geometric Progression and \( a^x = b^y = c^z \), then \( x, y, z \) are in:
The center and radius for the circle \( x^2 + y^2 + 6x - 4y + 4 = 0 \) respectively are:
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:
Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{FCFS} & (III)\ \text{Often long average waiting time} \\ \hline (B)\ \text{Round Robin} & (I)\ \text{FCFS + preemption} \\ \hline (C)\ \text{Multi-level queue scheduling} & (IV)\ \text{Permanent assignment of processes to one specific queue} \\ \hline (D)\ \text{Multi-level Feedback Queue} & (II)\ \text{Allows the processes to move between queues} \\ \hline \end{array}\] Choose the correct answer from the options given below:
Which of the following is not an application of DFS?
The Dining Philosopher problem can be solved by: