Scribd
Upload
2 views5 pages

Model QP-Data Structures and Algorithms

This document is a model question paper for the Master of Computer Applications (MCA) program, specifically for the Data Structure and Algorithm course in the second semester. It includes multiple choice questions, short answer questions, and long answer questions covering various topics such as linked lists, binary trees, sorting algorithms, and algorithm complexity. The structure is designed to assess students' understanding of fundamental concepts in data structures and algorithms.

Uploaded by

koreapubgkhelam
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
2 views5 pages

Model QP-Data Structures and Algorithms

This document is a model question paper for the Master of Computer Applications (MCA) program, specifically for the Data Structure and Algorithm course in the second semester. It includes multiple choice questions, short answer questions, and long answer questions covering various topics such as linked lists, binary trees, sorting algorithms, and algorithm complexity. The structure is designed to assess students' understanding of fundamental concepts in data structures and algorithms.

Uploaded by

koreapubgkhelam
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/ 5

Centre for Distance and Online Education

Model Question Paper


PROGRAMME MASTER OF COMPUTER APPLICATIONS (MCA)

SEMESTER II

COURSE CODE & Data Structure and Algorithm


NAME
Section A
Multiple Choice Questions (2 Marks each)
[Please answer all the questions]

1 What is the main characteristic of a linear data structure?


a. Non-contiguous memory
b. Sequential arrangement
c. Hierarchical relation
d. Random access

2 Which data structure uses LIFO (Last In First Out) principle?


a. Queue
b. Stack
c. Array
d. Linked List

3 Which of the following is not a linear data structure?


a. Array
b. Queue
c. Tree
d. Stack

4 In a queue, elements are added at the ____ and removed from the ____.
a. rear, front
b. front, rear
c. top, bottom
d. beginning, end

5 Which data structure is most appropriate for implementing recursion?


a. Queue
b. Stack
c. Linked List
d. Tree

6 Which operation is performed to add an element to the top of a stack?


a. Insert
b. Enqueue
c. Push
d. Append

7 Which traversal technique is used in Binary Search Trees to retrieve data in sorted order?
a. Preorder
b. Postorder
c. Inorder
d. Level Order

8 What is the worst-case time complexity of searching in a binary search tree (unbalanced)?
a. O(n)
b. O(log n)
c. O(n log n)
d. O(1)
9 Which data structure is ideal for breadth-first traversal of a graph?
a. Stack
b. Priority Queue
c. Queue
d. Set

10. Which of the following is a self-balancing binary search tree?


a. Binary Heap
b. AVL Tree
c. Hash Tree
d. B-Tree

Section B
SHORT ANSWERS (5 Marks each)
[Please answer Any Four questions with 200-250 words per question] (4x5=20 Marks)’

1 What is a linked list? Explain the types of linked lists with examples.

2 What are the advantages of using the Quick Sort algorithm over Merge Sort?

3 Define a binary tree. Explain the different types of binary trees.

4 Explain the working of a queue. What are its applications in real-world scenarios?

5 What is an AVL tree? Explain how it maintains balance.

6 Compare DFS and BFS.


Section C
LONG ANSWERS (10 Marks each)
[Please answer Any Three questions with 400-500 words per question] (3x10=30 Marks)

1. What is a Binary Search Tree (BST)? Explain insertion, deletion, and traversal operations with examples.

2. Discuss the role of hashing in file structures. Explain collision resolution methods.

3. Explain the working of external sorting techniques like merge sort for large datasets.
4. What do you Understand by Algorithm Complexity? Discuss Time and Space Complexity in detail by taking suitable
examples

You might also like