Scribd
Upload
43 views

Data Structure and Algorithm

The document is a past exam paper for Data Structure and Algorithm. It contains 10 short answer questions worth 2 marks each on topics like data structure operations, applications of stacks, algorithm characteristics, infix expressions, deque, priority queue, and complexity of selection sort. It also has 4 short answer questions worth 5 marks each on asymptotic notation, converting infix to postfix notation, hashing, and adding a node to a doubly linked list. Finally, it contains 2 long answer questions worth 15 marks each on big O notation, circular queues, priority queues, and explaining the algorithms for BFS and DFS on a sample graph. Students are instructed to answer all questions in a single answer book and email their response to the provided email address

Uploaded by

Om Khandate
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Data Structure and Algorithm

The document is a past exam paper for Data Structure and Algorithm. It contains 10 short answer questions worth 2 marks each on topics like data structure operations, applications of stacks, algorithm characteristics, infix expressions, deque, priority queue, and complexity of selection sort. It also has 4 short answer questions worth 5 marks each on asymptotic notation, converting infix to postfix notation, hashing, and adding a node to a doubly linked list. Finally, it contains 2 long answer questions worth 15 marks each on big O notation, circular queues, priority queues, and explaining the algorithms for BFS and DFS on a sample graph. Students are instructed to answer all questions in a single answer book and email their response to the provided email address

Uploaded by

Om Khandate
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B. Sc.

IT Healthcare & BCA 2nd Semester Preliminary Examination Summer 2021


Sub – Data Structure and Algorithm
Paper - II
Time: 3.00 Hrs. Max. Marks 70

Instructions:-
 Number to the right indicates marks.
 Draw neat diagrams, wherever necessary.
 Use single answer book for answering both sections.

BAQ - 2 Marks each

1. State the major operations performed on Data Structure


2. List down the application of Stack
3. What are the characteristics of Algorithm?
4. What is Infix Expression?
5. Define DEqueue.
6. What is priority queue?
7. What is the complexity for Selection sort?
8. Give the Memory Representation of a doubly linked list
9. Draw the structure of Circular Doubly Linked List.
10. Define Red Black Tree.

SAQ - 5 Marks each


1. What is asymptotic notation? Also discuss time and space complexities with an
example.
2. Convert the following infix expression into postfix notation. Denote the stack used for it. A+
(CB-C*D)/E) + F-G/H
3. What is hashing? Explain division method of hashing to store the following values in hash table.
25,45,96,101,102,162,197,201
4. Explain the Algorithm to add a node at front for doubly link list.

LAQ - 15 Marks each


1. Write short notes on:-
a. Big O Notation
b. Circular queue.
c. Priority queue
2. Explain the Algorithm for BFS and DFS also find out DFS traversal of the following graph
starting at node

Note – Mail the PDF of Answer Sheet send to this Email Address –[email protected]

You might also like