Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
32 views

Data Struct

This document contains an exam for a data structures course consisting of 8 questions worth 100 marks total. Students must answer 5 questions. The questions cover topics like user-defined data types, arrays, stacks, queues, linked lists, trees, graphs, sorting algorithms, and complexity analysis. Example problems include describing operations on ordered lists, multi-dimensional arrays, linear and circular queues, doubly linked lists, binary trees, minimum spanning trees, quicksort, bubblesort, and binary search.

Uploaded by

api-3782519
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

Data Struct

This document contains an exam for a data structures course consisting of 8 questions worth 100 marks total. Students must answer 5 questions. The questions cover topics like user-defined data types, arrays, stacks, queues, linked lists, trees, graphs, sorting algorithms, and complexity analysis. Example problems include describing operations on ordered lists, multi-dimensional arrays, linear and circular queues, doubly linked lists, binary trees, minimum spanning trees, quicksort, bubblesort, and binary search.

Uploaded by

api-3782519
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

480

B. E. (Comp. Engg.) IIIrd Semester (New Scheme)


Examination

DATA STRUCTURES
Paper-CSE-20S-C
Time allowed: 3 houn Maximum Marks: 100

Note: Attempt any five questiolls. A/I questiolls cany equaL marks.

1. (a) Define data structures. Describe user-defined data


types with their importance and uses. 10
(b) List and explain various operations on ordered
list. 10

2. Describe the following with reference to arrays: (i)


Lower and upper bound
(ii) Multi-dimensional array
(iii) Addressing an element
(iv) Sparse Matrix. 20

3. (a) Develop an algorithm for applying push m:d pop

(b) Explain two important applications of stack in


computer science briefly.
10

4. (a) Describe various operations on linear queue with


examples. IO
(b) Differentiate between linear and circular queues with
their relative merits and demerits. ]0

480-800-P2-(Q-8) (03) PT.O.


5.

( 2 )

6. Describe the use, purpose and importance of following


operations on doubly linked list:
(i) getnode
(ii) freenode (iii)
deletenodc (iv)
insertleft
(v) insertright. 2
0
6. (a) How trees are used to represent postfix and prefix
expressions? Explain briefly with examples. 10
(b) Describe following types of Binary tree traversals with
examples :
(i) Infix
(ii) Postfix
(iii) Prefix. 1
0
7. (a) Explain the use and importance of minimum
spanning tree with an example. 10
(b) Explain the following:
(I) Depth First Traversal in a graph
(ii) Spanning Forests. 10
8. (a) Develop an algorithm to implement Quick sort. Also
discuss its complexity. 10
(b) Discuss the following with their complexity:
(i) Bubble sort
(ii) Binary search. 10

480-800

You might also like