Вы находитесь на странице: 1из 3

Model Test Paper 2013 BCA-I

Algorithm and Data Structure


Objective Part I 1. The variables which can be accessed by all modules in a program are known as: (a) Local variables (b) Internal variables (c) Global variables (d) Auto variables (a) Stack (b) Queue (c) Linked list (d) Tree (a) 3. Worst case complexity of heap sort is: (a) O (n2) (b) O (n log2 n) (c) o (n) (d) O (log2n) ( ) (b) 4. A linear list in which elements can be added or removed at either end but not in the middle is called: (a) Queue (b) Dequeue (c) Stack (d) Linked list (a) edge (b) vertex (c) tree (d) none of the above (a) int (b) floating (c) float (d) char (a) Searching (b) Sorting (c) Traversing (d) All of the above (d) (c) 7. Which of the following is data structure operation? (a) 6. Floating point data types are represented by the word: (b) 5. A connection between two vertices is called: (c) 2. POP is the term used to delete an element from a:

8. The process memory allocation at run time is known as: (a) Dynamic memory allocation (b) Static memory allocation (c) Compaction (d) fragmentation (a) edge (b) vertex (c) tree (d) none of the above (a) 10. Which of the following is a non linear data structure? (a) Tree only (b) Graph only (c) Array (d) Both tree and graph (d) 11. If there are n vertices in the graph then how many edges are needed to construct a minimum spanning tree? (a) n (b) n+1 (c) n-1 (d) n2 (a) PUSH (b) POP (c) Both A and B (d) None of the above (c) 13. Which of the following is not a type of tree? (a) Binary (b) Binary Search (c) AVL (d) Insertion (a) lead node (b) root node (c) parent node (d) none of the above (a) Bubble (b) Binary (c) Radix (d) Insertion (a) A union (b) A structure (c) A graph (b) 16. The collection of same type of data is called: (d) 15. Which of the following is not a sorting technique? (d) 14. A node that has no children is called: (c) 12. The fundamental operations used on a stack are: (a) 9. A connection between two vertices is called:

(d) None of the above

(d)

17. If every edge in the graph is assigned some data, it is called: (a) Multi graph (b) Directed graph (c) Tree (d) weighted graph (d) Descriptive Part II Q1: (a) Explain the traversal algorithms for a binary tree by taking suitable example. (b) Short the following list by using heap sort algorithm. 52,7,41,72,23,92,48,15 Q2:Write short notes on any three of the following. (a) Data Abstraction (b) Priority Queue (c) Radix Sort (example) (d) Threaded Binary Tree (Threads) Q3: (a) What are the criteria to measure the efficiency of any algorithm? (b) Write the pseudo code with flowchart diagram for calculating factorial? Q4: (a) Explain array representation of stacks and queues. (b) Define infix, postfix and prefix notations giving examples of each. Q5: a) What is the difference between external and internal sorting? (b) Explain briefly using a simple example the logic of the quick sort algorithm. . Q.6 (a) Discuss linear and non linear implementation of queues. (b) Write an algorithm for inserting an item into a linked list.

Вам также может понравиться