Scribd
Upload
20 views

Data Structures Final Exam MCQ PMSCS Examination Spring 2020

The document is a practice exam for a PMSCS examination containing 15 multiple choice questions covering topics related to data structures and algorithms including: 1) linked lists, arrays, and pointers, 2) time complexity analysis, 3) data structure operations like push/pop and stacks, 4) algorithm efficiency measures, 5) binary search properties, and 6) list types like stacks, queues, and trees.

Uploaded by

Likhi Hossain
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Data Structures Final Exam MCQ PMSCS Examination Spring 2020

The document is a practice exam for a PMSCS examination containing 15 multiple choice questions covering topics related to data structures and algorithms including: 1) linked lists, arrays, and pointers, 2) time complexity analysis, 3) data structure operations like push/pop and stacks, 4) algorithm efficiency measures, 5) binary search properties, and 6) list types like stacks, queues, and trees.

Uploaded by

Likhi Hossain
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

PMSCS Examination Spring 2020

MCQ Section

Answer all questions. Time: 10 Minutes. Marks: 15

11. Which of the following statements is false?

Data elements in linked list need not be stored in adjacent space in memory

Arrays are dense lists and static data structure

Pointers store the next data element of a list

Linked lists are collection of the nodes that contain information part and next pointer

5. The complexity of Binary search algorithm is

O(nlogn)

O(n)

O(n2)

O(log n)

8. The terms "push" and "pop" are related to

Stacks

Arrays

Lists

All

/
2. The time factor when determining the efficiency of algorithm is measured by

Counting microseconds

Counting the number of key operations

Counting the number of statements

Counting the kilobytes of algorithm

3. Each data item in a record may be a group item composed of sub-items; those
items which are indecomposable are called..

Scalars

All of these

Elementary items

Atoms

4. The Worst case occurs in linear search algorithm when

Item is the last element in the array

Item is the last element in the array or is not there at all

Item is somewhere in the middle of the array

Item is not in the array at all

13. The situation when in a linked list START=NULL is

Underflow

Saturated

Housefull

Overflow

/
12. Which of the following is not the required condition for binary search
algorithm?

There must be mechanism to delete and/or insert elements in list

There should be the direct access to the middle element in any sublist

None of these

The list must be sorted

10. Two main measures for the efficiency of an algorithm are

Time and space

Complexity and capacity

Data and space

Processor and memory

7. When new data are to be inserted into a data structure, but there is no
available space; this situation is usually called

Overflow

Houseful

Saturated

Underflow

14. Which of the following is two-way list?

Grounded header list

None of these

Circular header list

Linked list with header and trailer nodes

/
1. The operation of processing each element in the list is known as ..

Traversal

Merging

Sorting

Inserting

15. AVL trees have a faster -------.

Retrieval

Updation

Insertion

Deletion

9. A data structure where elements can be added or removed at either end but
not in the middle

Deque

Queues

Stacks

Linked lists

6. Arrays are best data structures . .

for relatively permanent collections of data

for the size of the structure and the data in the structure are constantly changing

for both of above situation

for none of above situation

Back Submit
/
Never submit passwords through Google Forms.

This form was created inside of Jahangirnagar University. Report Abuse

 Forms

You might also like