Scribd
Upload
118 views2 pages

Computational Problem Solving Quiz-1

This document contains 10 multiple choice questions about data structures. The questions cover topics like common data structure implementation strategies, data structure diagrams, memory allocation formulas for arrays, properties of different data structures like arrays, linked lists, trees and graphs. The correct answers are also provided.

Uploaded by

Khalid Mohammed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
118 views2 pages

Computational Problem Solving Quiz-1

This document contains 10 multiple choice questions about data structures. The questions cover topics like common data structure implementation strategies, data structure diagrams, memory allocation formulas for arrays, properties of different data structures like arrays, linked lists, trees and graphs. The correct answers are also provided.

Uploaded by

Khalid Mohammed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures

Q1. Data structures generally employ which of the following implementation strategies?
a) Contiguous Implementation
b) Linked Implementation
c) All of the mentioned
d) None of the mentioned

Q2. What is data structure diagram?


a) A simple graphical notation is traditionally used to depict data structures
b) It is a scheme for storing values in computer memory
c) All of the mentioned
d) None of the mentioned
Q3. The contiguous structures stores record in which of the field location?
a) The left sub-tree
b) The right sub-trees
c) The node
d) All of the mentioned
Q4. Which of the following are the heuristics for data structure diagram?
a) Label record fields only once
b) Use ellipses to simplify large, repetitive structures
c) Draw linked structures so that the pointers point down the page or from left to right
d) All of the mentioned
Q5. The memory address of fifth element of an array can be calculated by the formula
a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per
memory cell for the array
b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per
memory cell for the array
c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per
memory cell for the array
d. None of above
Q6. Which of the following data structure can't store the non-homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. None

Q7. Which of the following statement is false?


a. Arrays are dense lists and static data structure
b. data elements in linked list need not be stored in adjecent space in memory
c. pointers store the next data element of a list
d. linked lists are collection of the nodes that contain information part and next
pointer
Q8. Which of the following data structure is linear data structure?
A.Trees
B.Graphs
C.Arrays
D.None of above
Q9. The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF

Q10. In a graph if e=(u,v) means .......


A. u is adjacent to v but v is not adjacent to u.
B. e begins at u and ends at v
C. u is node and v is an edge.
D. both u and v are edges.

You might also like