CS301 Midterm Past Paper

Studocu is not sponsored or endorsed by any college or university

Cs301 midterm paper

Data Structures (Virtual University of Pakistan)

Studocu is not sponsored or endorsed by any college or university

Cs301 midterm paper

Data Structures (Virtual University of Pakistan) IDTERM EXAMINATION CS301Data Structures Time: 60 min M a r k s: 38

Which one of the following statement is NOT correct .

1. In linked list the elements are necessarily to be contiguous
2. In linked list the elements may locate at far positions in the memory
3. In linked list each element also has the address of the element next to it
4. In an array the elements are contiguous

In a program a reference variable, say x, can be declared as

1. int &x ;
2. int *x ;
3. int x ;
4. None of the given options

Linked lists are collections of data items "lined up in a row" , insertions and deletions can be made only at the front and the back of a linked list.

1. True
2. False

A Linear Data Structure is the data structure in which data elements are arranged in a sequence or a linear list. Which of the following is Non Linear Data Structure?

1. Arrays
2. LinkLists
3. Binary Search Trees
4. None of these
5. A queue where the de-queue operation depends not on FIFO, is called a priority queue eslaF
6. True

Which one of the following statements is correct?

1. Array size is fixed once it is created.
2. Link List size is fixed
3. once it is created.
4. Binary Search Tree size is
5. fixed once it is created
6. AVL Tree size is fixed
7. once it is created

Which one of the following is correct about pointers?

1. They always point to
2. different memory locations
3. They may point to a single
4. memory location
5. The address of two pointer variables is same
6. None of these