21 views

Uploaded by Shruthi Bhat

You are on page 1of 5

KINGS

COLLEGE OF ENGINEERING

1. Define Algorithm 2. Define efficiency of an algorithm 3. How will calculate the space requirement of an algorithm? 4. How will calculate the time taken by a program? 5. Define Big Oh notation 6. Define Big Theta notation 7. Define Amortized analysis 8. List out the limitation of asymptotic notation. 9. List common running times for algorithms based on big-oh notations. 10. Define Potential method 11. What are the methods available for amortized analysis? 12. Define amortized test 13. Define dynamic table 14. What are the properties to be considered in table contraction? PART B 1. a. Explain briefly about analysis of algorithm. b. Derive worst case and average case analysis of insertion sort. 2. Explain in detail about asymptotic notation. 3. Derive time complexity for matrix addition. 4. Explain amortized analysis along with their methods. 5. Explain Performance Analysis. (8) (8) (16) (16) (16) (16)

studentseee.jimdo.com

CS1201-Data Structures 2 UNIT II FUNDAMENTALS OF DATA STRUCTURES PART A(2 marks) 1. Define ADT 2. Define arrays. 3. List out the operations of the list ADT. 4. Define Deque. 5. Define push & pop in a stack. 6. Convert the infix expression a*b/c+d to its equivalent postfix expression. 7. List out the applications of stack. 8. Define circular queue. 9. What are the different types of Linked list? 10. List out the applications of queue. 11. Define priority Queue. 12. List the advantages of circular linked list. 13. Define Structure. PART B 1. Write a program in C to return the position of an element X in a Linked List. C with example. b. Define structure and union and their implementation with example. it. 4. Explain how queues can be implemented using Arrays 5. a. Write a c program to add two polynomials. b. Write a C program to implement push operation in stack. 6. Explain the various applications of stacks. (16) (8) (8) (16) (16) (8) (8) (16) 2. a. Explain the various types of arrays and their manipulation of data using

studentseee.jimdo.com

CS1201-Data Structures 3 UNIT III TREES PART A(2 marks) 1. Define tree 2. Define Binary tree. 3. What are the types of binary tree? 4. What are the different binary tree traversal techniques? 5. What are the tasks performed while traversing a binary tree? 6. Define a binary search tree. 7. What are the basic operations performed in a binary search tree? 8. Define sorting. 9. What are the factors to be considered while choosing a sorting technique? 10. List out some of the stable and unstable sorting techniques. 11. Mention the limitations of insertion sort. 12. Define Searching. 13. Define hash function. 14. Define hashing PART B 1. Construct an expression tree for the expression A+(B-C)*D+(E*F). an element X in it. 3. Explain in detail about Open Addressing. b. State & explain the algorithm to perform Insertion Sort. 6. Write a Huffman coding with example. algorithm. algorithm. (16) (16) (16) (8) (16) (16) (16)

2. Write a program in C to create an empty binary search tree & search for

4. a. Write a function to delete the minimum element from a binary heap. (8) 5. Write a recursive algorithm for binary tree traversal with an example. (16) 7. Write a C program to perform Merge sort & analyze time complexity of the 8. Write a C program to perform Quick sort & analyze time complexity of the

studentseee.jimdo.com

CS1201-Data Structures 4 UNIT IV GRAPHS AND THEIR APPLICATIONS PART A(2 marks) 1. Define a graph. 2. Define undirected graph. 3. Define directed graph. 4. Define a path in a graph. 5. Define weighted graph. 6. Define Minimum Spanning Tree. 7. What is Transitive Closure? How it is implemented? 8. What is a connected component? 9. Define Shortest Path Problem of a graph. 10. What is the use of modified Warshalls Algorithm? 11. What is the use of Dijkstras Algorithm? 12. How can you minimum spanning trees from graphs? 13. State the different ways of traversing a graph. PART B

1.

Formulate an algorithm to find the shortest path using Dijkstras algorithm and explain with example. (16) (8) (8) (16) (16) (16) (16) (a) Explain the Warshalls algorithm. (b) Explain shortest path algorithm. Explain depth-First traversal and breadth-first traversal. Explain the Minimum Spanning Trees & prims algorithm. Explain an Application of Scheduling. What is meant by flow problem? Explain with an example. UNIT V STORAGE MANAGEMENT PART A (2 marks)

2.

3. 4. 5. 6.

1. What are types of automatic list management? 2. How the reference count method works? 3. What is mean by garbage collection? 4. Explain the term compaction.

studentseee.jimdo.com

CS1201-Data Structures 5 5. Define first fit. 6. Define Breadth First Traversal. 7. How the garbage collection is done in automatic list management? 8. List the disadvantage of reference count method. PART B 1. Explain the linked list Representation of a list with an example. 2. Explain Reference Count Method with an example. 3. Explain Garbage collection with their variations. (16) (16) (16)

studentseee.jimdo.com

- AlgorithmsUploaded bymuthuramrr
- DSUploaded byShamik Tiwari
- Update MCA Batch 2012 Syllabus--21!07!2014Uploaded bymunish0875
- hm titorialsUploaded byniteshwan
- udg60Uploaded byScott Emmanuel
- Trees (Part 1)Uploaded bygdskumar
- Mementopython3 EnglishUploaded byGabriele Gatti
- Amazon questions.docxUploaded bysatyam
- 6 - 3 - Sorting Complexity (905)Uploaded byeshwaar1
- Well Written PaperUploaded byYuri Vishnevsky
- Hyp VarianceUploaded byparmitchoudhury
- 8-IJCSE-02452Uploaded byArtiana
- AlgorithmUploaded byAstrit Krasniqi
- Red Black TreesUploaded byhonkytonkz
- dsa ch1 introductionUploaded byapi-394738731
- ReportUploaded bySameera Rao
- Lec18Cpsc331Uploaded byTalha Habib
- AVL tree 2Uploaded byAnkurBajaj27
- AIAA-2011-1518Uploaded byவசந்தன் தணிகைவேல்
- java10Uploaded byKutluk Yıldırım
- 13069_Home work 3Uploaded byNeha Verma
- CS301MIDTERMSOLVEDMCQSWITHREF.BYMOAAZ_IRFANAWAISUploaded bySyed Shafqat Irfan
- 04024389Uploaded bySatyajitMohapatra
- 11597Uploaded byKarthik Keyan
- 2010 09 17 Mid Sem Question PaperUploaded byKaushal Kumar
- ODS1e_Algorithms.pdfUploaded byArthur Wang
- dsa 2 marksUploaded byAvina Ash
- Fa Sh EngUploaded byanuj988gupta
- 00288278Uploaded byExvard
- XtraTreeListNewFeaturesUploaded bya7451t

- Project UML diagramUploaded byShruthi Bhat
- The Origin of SpeciesUploaded byNederlandse Naam
- 8th sem syllabusUploaded byShruthi Bhat
- IT SyllabusUploaded bygracianissi
- Test on 04-01-2013Uploaded byShruthi Bhat
- itUploaded byRaghavendra Prasad
- qtnppr-1Uploaded byShruthi Bhat
- ES-QB-Unit test IUploaded byShruthi Bhat
- PCOMUploaded byShruthi Bhat

- DSASUBUploaded byshreya14
- Java Lab ManualUploaded byPratapAdimulam
- IT_3rd4thSem_2010_11Uploaded bylambajitu
- Sorting and Searching AlgorithmsUploaded bySubathra Devi Mourougane
- CS C363Uploaded byAravind Kondamudi
- Search AlgorithmsUploaded byAbdul Ghaffar Jaafar
- basic conceptUploaded byPraveen Kumar
- Exercises 1.2Uploaded byMahdi Hallak
- MAUNAL_Change1Uploaded bysakthisrinivass
- DS(Data Structure)-MCQsUploaded byrkeranga
- r059211201 Advanced Data Structures and AlgorithmsUploaded bySRINIVASA RAO GANTA
- Back of EnvelopeUploaded bygeo_uno
- leetss-code questionsUploaded byShawnJerryNemo
- iteratorsUploaded byqthermal
- Data Structures22Uploaded byRahil Khan
- Sap Abap Algorithm for Processing Huge Volumes of Data in Sap R3 - John ShaneUploaded byAnandakrishnan Sundaresan
- Array Geeks AnalysisUploaded byrajesh kumar
- C Programming ExamplesUploaded byKarthikeyan Ramajayam
- ds1Uploaded byDV Krish
- scnditUploaded bySurya Kumar
- Computer Science Project for class 12thUploaded bymohsin
- Data StructuresUploaded byapi-3817493
- June, 2014 Exam SolUploaded byعبداللهأحمد
- Linear and Binary SearchUploaded byshinde_jayesh2005
- Class 12 Computer science(C++ and My SQL) Important Programs Part 3Uploaded byHritam Sharma
- System Programing LabUploaded byIqbal Hassan
- Searching Methods (Hashing)Uploaded byMAYA
- quiz section 6.docxUploaded byMarija Nikolic Jokanovic
- Binary Search Trees data structureUploaded byAbdullah
- nongatebook (1)Uploaded byLakshay Kakkar