Scribd
Upload
13 views

MQP Dsa Bca

This document contains a practice exam for a data structures and algorithms course. The exam has three sections: multiple choice questions, short answer questions, and long answer questions. The multiple choice section contains 10 questions about data structure topics like trees, graphs, sorting, and algorithms. The short answer section asks students to answer 4 out of 6 questions about data structures, stacks, graphs, search algorithms, and the traveling salesman problem. The long answer section asks students to answer 3 out of 4 questions about linked lists, tree conversions, greedy algorithms/knapsack problem, and divide and conquer strategies.

Uploaded by

atozblur0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

MQP Dsa Bca

This document contains a practice exam for a data structures and algorithms course. The exam has three sections: multiple choice questions, short answer questions, and long answer questions. The multiple choice section contains 10 questions about data structure topics like trees, graphs, sorting, and algorithms. The short answer section asks students to answer 4 out of 6 questions about data structures, stacks, graphs, search algorithms, and the traveling salesman problem. The long answer section asks students to answer 3 out of 4 questions about linked lists, tree conversions, greedy algorithms/knapsack problem, and divide and conquer strategies.

Uploaded by

atozblur0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

PROGRAMME BACHELOR OF COMPUTER APPLICATIONS (BCA)

SEMESTER II

COURSE CODE & NAME DCA1202 – DATA STRUCTURE AND ALGORITHM

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

1. The data structure which contains the hierarchical relationship between various elements is
called a ____________.
a) Linear Data Structure
b) Non-Linear Data Structure
c) Homogeneous Data Structure
d) Non-Homogeneous Data Structure

2. __________ is used in finding the location of the record with the given key value.
a) searching
b) traversing
c) sorting
d) deleting

3. Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is
not given, can we delete the node X from given linked list?
a) Possible if X is not last node
b) Possible if size of linked list is even
c) Possible if size of linked list is odd
d) Possible if X is not first node

4. ______ form of access is used to add and remove nodes from a queue.
a) LIFO, Last in First Out
b) FIFO, First in First Out
c) Both a and b
d) None of these

5. …….. form of access is used to add remove nodes from a stack.


a) Interface
b) Race condition
c) Mutual Inclusion
d) Mutual Exclusion

6. In the tree, the usual left pointer points to the ___________ of the node.
a) Root
b) First child
c) Leaf
d) Sibling

7. Which of the following is a true about Binary Trees?


a) Every binary tree is either complete or full
b) Every complete binary tree is also a full binary tree
c) Every full binary tree is also a complete binary tree
d) No binary tree is both complete and full

8. Which of the following is not a stable sorting algorithm?


a) Insertion sort
b) Selection sort
c) Bubble sort
d) Merge sort

9. If the number of records to be sorted is small, then _______sorting can be efficient.


a) Merge
b) Heap
c) Selection
d) Bubble

10. Which of the following sorting algorithms can be used to sort a random linked list with minimum
time complexity?
a) Insertion Sort
b) Quick Sort
c) Heap Sort
d) Merge Sort
Section B
SHORT ANSWERS (5 Marks each)
[Please answer Any Four questions in a separate page answer sheet especially provided for this purpose]

a) What is a data structure? Discuss briefly on types of data structures.


b) What type of memory allocation is referred for Stacks?
c) What are graphs and digraphs?
d) Discuss Sequential search algorithm.
e) Explain the Traveling Salesman Problem.
f) Discuss the characteristics and building blocks of an Algorithm.

Section C
LONG ANSWERS (10 Marks each)
[Please answer Any Three questions in a separate page answer sheet especially provided for this purpose]

1. Write algorithms for creating a singly link list and inserting a node at a given position of a singly
link list.
2. Write algorithm for conversion of General Tree to Binary Tree and also explain by giving a
suitable example.
3. Explain Greedy Method with an example. Discuss the Knapsack Problem.
4. Explain Divide and Conquer Strategy and give an example of its application in searching or
sorting methods.

You might also like