Scribd
Upload
59 views2 pages

Data Structure 2

The document is an examination paper for a Data Structures course, consisting of three pages and a total of 80 marks. It includes a compulsory question and requires students to attempt four additional questions from different units, covering topics such as string operations, algorithm complexity, linked lists, priority queues, recursion, tree traversal, and sorting methods. Each question carries equal marks and emphasizes the understanding of various data structures and their applications.

Uploaded by

Gaurav Sharma
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
59 views2 pages

Data Structure 2

The document is an examination paper for a Data Structures course, consisting of three pages and a total of 80 marks. It includes a compulsory question and requires students to attempt four additional questions from different units, covering topics such as string operations, algorithm complexity, linked lists, priority queues, recursion, tree traversal, and sorting methods. Each question carries equal marks and emphasizes the understanding of various data structures and their applications.

Uploaded by

Gaurav Sharma
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/ 2

Total Pages : 03

PMMC/M.I7 10075
DATA STRUCTLIRES
CS-DE-I3
Time : Tkee Hours] [Maximum Marks : 80

Notc : Attempt Five questions in all. Q. No. I is compulsory.


Attempt four more questions selecting orre question
from each Unit. All questions carry equal marks.

1. Answer ttre following questions in brief :


(a) Ddscribe eny one sting operation with example.
(b) What do you mean by algorithm complexity.
(c) Describe one important application of linked list.
(d) What is a priority qurue ?
(e) What do you mqrn by recursion ?
(f) Describe any one method of tr€e traversal.
(g) How is sorting done using Bubble sort ?
(h) How is a graph represcnted using adjacency
matrix ?

Unit I
7. Y/hat are data sq-uctur-es ? How are primitive and
composite data skuctures distinguished ? Give two
examples of each type to highlight their distinction.
(247t6) L_1(m75 P.T.O.
3. What is the importance of
m rray m a dora sfuchrre io Unit IV
solving problerns ? Wh€n is a tq,odimsional aray
used for solving problems ? Explain with the help of a
8. (a) Describe the Warshall's algorithm as applied on

suitable example. grapls.


(b) What do you mean by'Traversing a graph' ?
Unit II Describe one method for traversing a graph.

4- Dcscribe the following : 9- Distinguish between :

(a) Inserting an elernert in Linked list (a) Linear search and Binary search
(b) Two-way iisL (b) Radix sort and N{erger sort.

5. List the operations that can be perfonned on a stack. AIso


describe the linl.ed and array rep,res€otatioe of sracks.

Unit Il
6. (a) What is Polish lrlotation ? Use an exarrple to show
how a stack can be used for waluating polish
Notation ?
O) What is a tlreadcd bhary hce ? What is its
adrrantage ?

7. (a) Iilhat is a Binary Search Tree ? llorv is hs€rtk]n


and deletion perfomea in a Binary Search Tree ?
o) Describe Heap sort using m unsorEd lis of elernem
of your choice.

I-10075 2 Q47m L-too7' J 600

You might also like