Computer Science Majors Examination ( 2021 Semester 4 ), Papers of Computer Science

Download Computer Science Majors Examination ( 2021 Semester 4 ) and more Papers Computer Science in PDF only on Docsity!

CSAL: B.TECH, (COMPUTER SCIENCE & ENGINEERING) SEMESTER- HL (Credit Based Evaluation and Grading System) CSL-231; DATA STRUCTURES & PROGRAMMING METHODOLOGY Time: 03 Hours M. Marks: 100 Note: Attempt any five questions. All Questions carry equal marks, Section A 1, a) What do you mean by complexity of algorithms? Explain different notations of measuring complexity using example. b) What is the need of different data structures? Explain by giving examples. 2. a) Write and explain the working of binary search algorithm using an example. b) Sort the given series using bubble sort algorithm, and show result at the end of each pass: 32, 51, 27, 85, 66, 23, 13, 57 Section B “ What is RPN? Write and explain an algorithm to convert an infix expression into RPN. Use suitable example to explain the working. 4. What are priority queues? What is there advantage? Explain the memory representation of priority queues. Section C 5. a) Discuss basic operations performed on strings. b) What is header linked list? Explain. 6. Give an algorithm to find and delete a node with given information in link list. Section D 7, What is Binary Search Tree? Discuss all the cases of deletion of a node from BST using suitable example. 8. a) What is path matrix? Explain the Warshall’s Algorithm to find path matrix. b) What is the need of hashing? Explain different hashing techniques with collision resolution.