MCQ 1 When does Top value of stack change in insertion process?

(A) Before insertion (B) After insertion (C) At the time of insertion (D) While checking overflow

MCQ 2 Deletion in the linked stack takes place by deleting ______________.

(A) a node pointed by the start process. (B) end of the list (C) beginning of the list (D) middle of the list

MCQ 3 What will be the value of top, if there is a size of stack STACK_SIZE is 5

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

MCQ 4 Why the elements of an array are stored successively in memory cells?

(A) Because bythis way computer can keep track only the address of the first element and the addresses of other elements can be calculated (B) Because the architecture of computer memory does not allow arrays to store other than serially (C) Both A and B (D) None of the above

MCQ 5 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 empty is called ___________ operation.

(A) push, pop (B) pop, push (C) insert, delete (D) delete, insert

MCQ 6 Which of the following statement is true?

1. i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
2. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
<

(A) i only (B) ii only (C) Both (i) and (ii) (D) None of the above

Correct Answer Choice C Both (i) and (ii)
See Answer

MCQ 7 Which of the following are the operations applicable an primitive data structures?

(A) create (B) destroy (C) update (D) All of the above

MCQ 8 A ____________ is a linear list in which insertions and deletions are made to from either end of the structure.

(A) circular queue (B) random of queue (C) priority (D) dequeue

MCQ 9 Operations on a data structure may be ______________.

(A) creation (B) destruction (C) selection (D) all of the above

MCQ 10 The time factor when determining the efficiency of algorithm is measured by

(A) Counting microseconds (B) Counting the number of key operations (C) Counting the number of statements (D) Counting the kilobytes of algorithm

MCQ 11 Finding the location of a given item in a collection of items is called ______________.

(A) discovering (B) finding (C) searching (D) mining

MCQ 12 Which of the following is an external sorting?

(A) Insertion Sort (B) Bubble Sort (C) Merge Sort (D) Tree Sort

MCQ 13 Partition and exchange sort is _____________ .

(A) quick sort (B) tree sort (C) heap sort (D) bubble sort

MCQ 14 The pointer associated with the stack is _____________.

(A) front (B) rear (C) top (D) link

MCQ 15 In Binary trees nodes with no successor are called _______________.

(A) End nodes (B) Terminal nodes (C) Final nodes (D) Last nodes

MCQ 16 The space factor when determining the efficiency of algorithm is measured by

(A) Counting the maximum memory needed by the algorithm (B) Counting the minimum memory needed by the algorithm (C) Counting the average memory needed by the algorithm (D) Counting the maximum disk space needed by the algorithm

MCQ 17 Each node in a linked list has two pairs of __________ and ___________.

(A) Link field and information field (B) Link field and avail field (C) Avail field and information field (D) Address field and link field

MCQ 18 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

MCQ 19 State true or false.

• i) The degree of root node is always zero.
• ii) Nodes that are not root and not leaf are called as internal nodes.
<

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

Correct Answer Choice C False, True
See Answer

MCQ 20 Which of the following data structure is non linear type?

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

MCQ 21 Process of inserting an element in stack is called ____________.

(A) Create (B) Push (C) Evaluation (D) Pop

MCQ 22 ___________ is not the operation that can be performed on queue.

(A) Insertion (B) Deletion (C) Retrieval (D) Traversal

MCQ 23 There is an extra element at the head of the list called a ______________

(A) Antinel (B) Sentinel (C) List header (D) List head

MCQ 24 The simplest type of data structure is ______________.

(A) Multidimensional array (B) Linear array (C) Two dimensional array (D) Three dimensional array

MCQ 25 Which of the following data structures are indexed structures?

(A) Linear arrays (B) Linked lists (C) Graphs (D) Trees