Attribution Non-Commercial (BY-NC)

68 views

Attribution Non-Commercial (BY-NC)

- Avl Trees
- UNIT 7
- techqa
- Technical Aptitude Questions eBook
- lec3.pdf
- unit-III -
- back-matter
- linked list
- Data Structures
- ton01 IDMaps: Global Internet Host Distance Estimation Service HOPS (Host Proximity Service) “IDMaps” Service) SONAR/HOPS
- Decisision Trees (2)
- c,ds,rdbms bits(All in one)
- lec21
- hw4sol
- Tournament Trees
- solu4
- c Programs
- Bm Pars Tacs
- CS110-2010W2-MTCS
- slides17-modular.pdf

You are on page 1of 2

What is time complexity, space complexity? Explain the asymptotic notati ons for complexity of algorithms. 3. What is a linear array? How indexing is done in an array? 4. Why array is called a dense list or a static data structure? 5. Write a program to perform insertion, deletion and searching in an array and show the corresponding addresses also (using pointer as array). Write the c orresponding algorithms also. 6. Write a program to perform matrix multiplication and addition. 7. What is a linked list? Write algorithm to search an element is the list is unsorted and sorted. Write a program to perform insertion at the beginning, i nsertion after a given location, deletion and searching in a linked list. Write the corresponding algorithms also. 8. Why binary search algorithm cannot be applied to linked list or what is the main drawback of using linked list. 9. How garbage collection is done in a linked list. 10. What are the different types of linked list available? (circular linked list, doubly linked list, header linked list) 11. Write a program to perform insertion, deletion and search in a doubly li nked list. 12. Write a program to perform insertion, deletion and search in a circular linked list. 13. What is a stack? Give two real life examples of stack. Give two applicat ions of stacks. 2+4+4 14. Write an algorithm for the evaluation of postfix expression. Evaluate th e following expression and show the stack contents: 5, 6, 2, +, *, 12, 4, /, 15. Write an algorithm to transform infix expression into postfix expressi on. Transform the following infix expression into postfix and show the c ontents of the stack. ( D / E F ) * G ) * H A + ( B * C Translate the following postfix into infix notation 12, 7, 3, -, /, 2, 1, 5, +, *, + Evaluate the following parenthesis free arithmetic expressions: 5 + 3 2 8 / 4 * 3 +6 6 + 2 3 + 9 / 3 4 * 5 16. What is recursion? Mention the advantages and disadvantages of using recursion. Write recursive program and algorithm for the following: a. factorial of a number b. Fibonacci sequence 17. Write notes on the following: a. divide and conquer algorithm b. towers of Hanoi 18. Write a program to perform insertion and deletion in a stack using both array representation and linked representation. Write the corresponding alg orithms. 19. What is a queue? Give two real life examples of queue. 20. Write a program to perform insertion and deletion in a queue using both array representation and linked representation. Write the corresponding algo rithms also. 21. What is the advantage of using linked representation over array represen tation. 22. Write notes on deques and priority queues.

23. What is a binary tree, complete binary tree, extended binary tree or 2 t rees? 24. Write the preorder, postorder and inorder notation of the given tree:

25. Write algorithms for preorder, postorder and inorder traversal. 26. Draw the tree from the following sequences: Inorder: E A C K F H D B G Preorder: F A E K C D H G B 27. Draw the tree T which corresponds to the expression E= (2x + y) (5a b)^3 Find the prefix expression and the preorder of T. 28. Write notes on header nodes or threads. 29. What is a binary search tree? Construct a binary search tree from the follow ing nodes: 40, 60, 50, 33, 55, 11 30. Give an application of binary search tree or write an algorithm to find and delete all the duplicates present in a collection of elements. 31. Delete 44, 75 and 25 from the given binary search tree.

32. What is an AVL tree? Why is it needed? What is balance factor? 33. Construct an AVL search tree by inserting the following nodes: 64, 1, 44, 26, 13, 110, 98, 85 34. Delete 120, 64 and 130 from the following AVL tree. 35. What type of data structure is used to support retrieval and manipulation of data stored in external memory. 36. What is an m-way search tree? What is the goal of m-way search tree? 37. Construct a 3-way search tree from the following nodes: D, K, P, V, A, G Delete A and K in the above tree. 38. What is a B tree? Why is it needed? Explain with example the searching, inse rtion and deletion in a B-tree. 40. What is heap or maxheap and minheap? Draw a heap from the following sequential representation: 97,88,95,66,55,95,4 8,66,35,48,55,62,77,25,38,18,40,30,26,24 41. Build a heap from the following list of numbers: 44, 30, 50, 22, 60, 55, 77, 55 42. Suppose n data items A1, A2, ,An are already sorted. a. Assuming the items are inserted in order into an empty binary search tr ee, describe the final tree. b.What is the depth D of the tree? c. Compare D with the average depth AD of a binary search tree with n node s for (1) n=50 (2) n=100 (3) n=500 43. What is hashing? What is hash function? Discuss the popular hash functions. 44. What is collision resolution? Discuss the collision resolution techniques.

- Avl TreesUploaded bySumanta Datta
- UNIT 7Uploaded bybadboy_rockss
- techqaUploaded byapi-3844579
- Technical Aptitude Questions eBookUploaded byPrem Chander
- lec3.pdfUploaded byALEX SAGAR
- unit-III -Uploaded bymayank yadav
- back-matterUploaded bysonara28
- linked listUploaded byRamesh Sangaraju
- Data StructuresUploaded bysureshrockz
- Decisision Trees (2)Uploaded bymyra
- c,ds,rdbms bits(All in one)Uploaded bySricharan Gummadi
- lec21Uploaded byEhsan Spencer
- ton01 IDMaps: Global Internet Host Distance Estimation Service HOPS (Host Proximity Service) “IDMaps” Service) SONAR/HOPSUploaded byEco Economic Heartbeat
- hw4solUploaded byBožo Perić
- Tournament TreesUploaded byvinitha_reddy
- solu4Uploaded byDestinifyd Mydestiny
- c ProgramsUploaded byharshabalam
- Bm Pars TacsUploaded byLuis Morales
- CS110-2010W2-MTCSUploaded byErnest Cheung
- slides17-modular.pdfUploaded by252966576
- Chapter7 ( Page 16 to 94)Uploaded bytbijle
- Data_Structures-1.docUploaded byRaja Kushwah
- GENEREAL QA.odtUploaded byMary Jansi
- Spec2FabUploaded byLuke Parry
- Assignment 2 Algorithms and Data Types.docxUploaded byArash Singh
- Bc a Model PaperUploaded byMuzeef Shaik
- Quiz3-2017Uploaded bynorbihaver
- Data structureUploaded byAjay
- Size Balanced Tree - PEGWiki SourceMayNotBeFullyAuthentic but Description Ok (1)Uploaded byFrankie Liu
- Technical Interview PrepUploaded byAlina R

- Apti1Uploaded byShailendra Mishra
- Introduction to BitcoinUploaded byPapori Borgohain
- What is Smart CityUploaded byHarshit Jain
- Apsc DepartmentalUploaded byHomagni Bhattacharjee
- current affairs of AssamUploaded byPapori Borgohain
- introduction to image processingUploaded byPapori Borgohain
- Calendar 2019Uploaded byPapori Borgohain
- APSC Prelims 2016 Results Assams.infoUploaded byPapori Borgohain
- bjtUploaded byPapori Borgohain
- UntitledUploaded byPapori Borgohain
- GS PracticeUploaded byPapori Borgohain
- India Russia - FinalUploaded byNaveen Kumar Singh
- information theoryUploaded byPapori Borgohain
- GSUploaded byPapori Borgohain
- DIPPPTUNIT1Uploaded byKrishna Rama
- apscapUploaded byJeshi
- govt_schemes.docxUploaded byPapori Borgohain
- LecUploaded byPapori Borgohain
- Muj Academic CalenderUploaded byPapori Borgohain
- Signal ConstellationsertertUploaded byaboashoor
- MOS CapcitorUploaded byAkhil Mehta
- Classic FiltersUploaded byGurpreet Dhillon
- Pre SociologyUploaded byPapori Borgohain
- UntitledUploaded byPapori Borgohain
- UntitledUploaded byPapori Borgohain
- gate syllabiUploaded byPapori Borgohain
- avl_treeUploaded byPapori Borgohain
- 2011 BEL placement paperUploaded byPapori Borgohain

- Iot assiUploaded bylvrevathi
- rfm-dmUploaded byاحسان
- A Study on Data Mining Based Intrusion Detection SystemUploaded byIJIRAE
- Bubble SortUploaded byNiel Patrick Pallada
- Some New Relationships Between the Derivatives of First and Second Chebyshev WaveletsUploaded byInternational Association of Scientific Innovations and Research (IASIR)
- entropy-16-00138Uploaded bychuneshphysics
- Continuous.and.Discrete.time.Signals.and.Systems.(Mandal.&.Asif).Solutions.chap13Uploaded byRicardo Gálmez
- 4 DLL Error ControlUploaded byraj25com
- NS DifferencesUploaded byAmarjeet Kumar
- Presentation 49Uploaded byosmanatam
- Prog Assign 1Uploaded byAsad Karim
- Preface 1979 Numerical Solution of Differential EquationsUploaded bySukrit Ghorai
- VI-04 Parametric Methods_2007Uploaded byAamir Habib
- pre26Uploaded bycastrojp
- A Two Step Clustering Method for Mixed Categorical and Numerical DataUploaded byaparna_yedla
- 2. Transportation ModelUploaded byArpit Sahni
- K-CLIQUE p SUBgraf IsomorfismUploaded byOprea Cosmin-Dumitru
- 01051324.pdfUploaded byIjmret Journal
- Ch8(2)Handouts_4eUploaded byalchemist009
- UT Dallas Syllabus for opre7330.001.07f taught by Milind Dawande (milind)Uploaded byUT Dallas Provost's Technology Group
- The Principle of Virtual ForcesUploaded byaditya2053
- 7class&PredUploaded byYogesh Bansal
- PERFORMANCE ANALYSIS OF PARALLEL POLLARD’S RHO FACTORING ALGORITHMUploaded byAnonymous Gl4IRRjzN
- Lab Activity - Uncertainty in MeasurementUploaded byedwinleech
- SPAM FILTERING ALGORITHM.pptxUploaded byRajeev Hatwar
- Observer-Based ControlUploaded byKadir Cumali
- Leetcode Python SolutionsUploaded byJyoti Prakash maheswari
- itc144pppt4375Uploaded bysanjeevkunte
- Intrusion Detection_DM (1)Uploaded bySouadMaher
- InTech-Automotive Applications of Active Vibration ControlUploaded bySwapnil Jogal