# Data Structures and Algorithms Practice Tests – Set 01 :: Computer Science Engineering

Are you guys looking for computer science MCQ Questions with Answers PDF Free Download as per computer science new exam pattern? You came to the right page. This may assist you to understand and check your knowledge about the Subjects. Students also can take a free test of the Multiple Choice Questions of computer science. Each question has four options followed by the right answer. These computer science MCQ Questions are selected supported by the newest exam pattern.

## Q1. The logical or mathematical model of a particular organization of data is called a __

(A) Data structure
(B) Data arrangement
(C) Data configuration
(D) Data formation

## Q2. State True or False.(i) An undirected graph which contains no cycles is called forest.

``(ii) A graph is said to be complete if there is an edge between every pair of vertices.``

(A) True, True
(B) False, True
(C) False, False
(D) True, False

## Q3. Match the following.(a) Completeness (i) How long does it take to find a solution

``````(b) Time Complexity (ii) How much memory need to perform the search.

(c) Space Complexity (iii) Is the strategy guaranteed to find the solution when there in one.``````

(A) a-iii, b-ii, c-i
(B) a-i, b-ii, c-iii
(C) a-iii, b-i, c-ii
(D) a-i, b-iii, c-ii

## Q4. Which of the following is not the type of queue?

(A) Ordinary queue
(B) Single ended queue
(C) Circular queue
(D) Priority queue

(A) Strings
(B) Lists
(C) Stacks
(D) Tree

(A) Antinel
(B) Sentinel

## Q7. Inserting an item into the stack when stack is not full is called __ Operation and deletion of item form the stack, when stack is not is called _______operation.

(A) Push, pop
(B) Pop, push
(C) Insert, delete
(D) Delete, insert

## Q8. Operations on a data structure may be __

(A) Creation
(B) Destruction
(C) Selection
(D) All of the above

Answer: (D) All of the above

## Q9. A __ is a graph that has weights of costs associated with its edges.

(A) Network
(B) Weighted graph
(C) Both A and B
(D) None A and B

Answer: (C) Both A and B

(A) 5
(B) 6
(C) 4
(D) None

## Q11. A __ is an acyclic digraph, which has only one node with in-degree 0, and other nodes have in-degree 1.

(A) Directed tree
(B) Undirected tree
(C) Dis-joint tree
(D) Direction oriented tree

## Q12. Stack is also called as

(A) Last in first out
(B) First in last out
(C) Last in last out
(D) First in first out

Answer: (A) Last in first out

## Q13. Which isare the application(s) of stack

(A) Function calls
(B) Large number Arithmetic
(C) Evaluation of arithmetic expressions
(D) All of the above

Answer: (D) All of the above

## Q14. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

(A) Input restricted deque
(B) Output restricted queue
(C) Priority queues
(D) Stack

(A) Unary tree
(B) Binary tree
(C) Trinary tree
(D) Both B and C