Data Structure(Computer Science ) Questions and Answers

Question 1. _____________ specifies how we enter data into our programs and what type of data we enter
  1.    data type
  2.    data
  3.    datum
  4.    all of above
Explanation:-
Answer: Option A. -> data type
Question 2. What advantage does a linked list have over an array?
  1.    Size of the list doesn't need to be mentioned at the beginning of the program
  2.    You can add or remove elements from the middle of the list.
  3.    The linked list doesn't have a size limit
  4.    All of these are true.
Explanation:-
Answer: Option D. -> All of these are true.
Question 3. Every stack has a variable _________ associated with it
  1.    TOP
  2.    BOT
  3.    POT
  4.    none of the above
Explanation:-
Answer: Option A. -> TOP
Question 4. A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes
  1.    vertices, edges
  2.    edges, vertices
  3.    vertices, paths
  4.    graph node, edges
Explanation:-
Answer: Option A. -> vertices, edges
Question 5. It is a method of solving problems that involves breaking a problem down into smaller and smaller sub problems until you get to a small enough problem that it can be solved trivially
  1.    Recursion
  2.    Iteration
  3.    Looping
Explanation:-
Answer: Option A. -> Recursion
Question 6. Which of the following abstract data types can be used to represent a many to-many relation?
  1.    Op 1: Tree
  2.    Op 2: Stack
  3.    Op 3: Graph
  4.    Op 4: Queue
Explanation:-
Answer: Option C. -> Op 3: Graph
Question 7. Choose the correct statement
  1.    A data structure is a specialised format for organising and storing data
  2.    A data structure is a specialised format for organising and storing information
  3.    A data structure is a format for organising and storing only one data type
  4.    A data structure is too complicated to truly understand or use
Explanation:-
Answer: Option A. -> A data structure is a specialised format for organising and storing data
Question 8. In Queue we can not insert an element in between the elements that are already inserted but we can delete it
  1.    True
  2.    False
Explanation:-
Answer: Option B. -> False
Question 9. If for an algorithm time complexity is given by O(n) then complexityof it is:
  1.    A. constant
  2.    B. linear
  3.    C. exponential
  4.    D. none of the mentioned
Explanation:-
Answer: Option B. -> B. linear
Question 10. Example of linear data structure except
  1.    array
  2.    tree
  3.    queue
  4.    stack
Explanation:-
Answer: Option B. -> tree
© Lakshya_Education.com, All Right Reserved.
Contact Us services