Scribd
Upload
14 views

Data Structures and Algorithms2012

This document appears to be an exam for a data structures and algorithms course, consisting of 5 sections worth a total of 100 marks. It covers fundamental data types and structures like arrays, stacks, queues, linked lists, trees, binary search trees, and sorting algorithms like bubble sort and insertion sort. It also asks about concepts like data abstraction, time complexity analysis, and tree traversals. The exam asks students to explain, define, illustrate, differentiate, and list various data structures, algorithms, and their associated operations and applications.

Uploaded by

Stanly Kurian
Copyright
© Attribution Non-Commercial (BY-NC)
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
14 views

Data Structures and Algorithms2012

This document appears to be an exam for a data structures and algorithms course, consisting of 5 sections worth a total of 100 marks. It covers fundamental data types and structures like arrays, stacks, queues, linked lists, trees, binary search trees, and sorting algorithms like bubble sort and insertion sort. It also asks about concepts like data abstraction, time complexity analysis, and tree traversals. The exam asks students to explain, define, illustrate, differentiate, and list various data structures, algorithms, and their associated operations and applications.

Uploaded by

Stanly Kurian
Copyright
© Attribution Non-Commercial (BY-NC)
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

llll llll Iil]|il ffi ilIil ilil| lllll lillt

Reg.No. :
Name:........... ...,.....r...,

M 21 411

- lncluding lV SemesterB.Tech.(Regular/Supplementary/lmprovement Part Time) Degree Examination,May 2012 (2OOT Admn. Onwards) AND ALGORITHMS 2KOCS/IT 402: DATA STRUCTURES
Time: 3 Hours Answer all : datatypes. l. a) Explain the primitive datatypes. b) Writea noteon enumerated of OOPs. c) Listouttheconcepts on a stack. the operations d) Explain tree. binary treeandcomplete strictly binary e) Differentiate priority queues. f ) Explain method. g) Explain search withexample the binary method. search h) lllustrate thesequential Explain. ff. a) i) Defin e arrays. ? associated operations ii)Whatis a set ? Whatarethe different OR in detail aboutdataabstraction. b) i) Explain ? (8+7=15) timeofa program therunning oncalculating depend ii)What arethefactors of stack. the application lll, a) i) lllustrate on queue. thedifferent operations ii) Explain OR list. of linked anddemerits b) i) Listoutthe merits typesof linkedlist. the various ii) Briefly explain
(8+7=15)
P.T.O.

: 100 Max.Marks

(8x5=40)

(8+7=15)

(7+8=15)

tM 21411 lV. a) Explain withprocedure the different traversals tree. of binary OR b) Withexample illustrate thefollowing : i) BFS ii) DFS
(8+7=15) 15

ffil lilll llll |ilfffi iltilIil ffi Hlr


15

V. a) Define withit ? binary search tree.Whataretheoperations associated OR b) Explain thesorting techniques. i) Bubble sort ii) Insertsort

(8+7=15) (15x4=60)

You might also like