Scribd
Upload
83 views2 pages

Programming - Data Structures and Algorithms Using Python KME056

Uploaded by

20ME082 Yash litoriya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
83 views2 pages

Programming - Data Structures and Algorithms Using Python KME056

Uploaded by

20ME082 Yash litoriya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Qe UL AVE TANIA OULU Printed Page: 1 of? AN 1 i : Roll No: o B. TECH, EM V) THEORY EXAMINATION 2021-22 PROGRAMMING, DATA STRUCTURES AND ALGORITHMS USING PYTHON Time: 3 Hours Total Marks: 100 Note: 1. Attempt all Sections. If require any missing data; then choose suitably. SECTION A. 1, Attempt all questions in brief, 2x10=20 Define range() function Explain the characteristics of python language Outline the features of tuple data structure? Explain the syntax of "for- loop" Write a short note on dictionary data type in Python? What are lambda functions in Python? Explain the List Slicing and List Mutability Calculate y if x = range(10) and y = x{::3] Describe Asymptotic Notation. FR mp aore Explain memorization. A secrign > . a os 2. Attempt any three of the following: XX 10x$ 30 a. Explain the importance cepa ‘and continue keyword with the sg Pin program. b. Apply quick sort its algorithm and its complexity ¢. Waite about Erors and Exception Handling in Python prqa¥oenming? 4. Create a binary search tree of the given list (12,87,23,1£29#6,13,76,54,32} and then delete 12 element from it . Show all the steps ce. Explain classes & objects in python; Also give ple. | 8 SECTION CO), Sv 10x41 iin in the list is.a7asco97 50m Also write 3. Attempt any one part of the followin (a) _ Give short note on the following? i) Python statement o ii) Multiline statement i) Python Indentation Gf iv) Python comm Oe (b) Explain -flter(),mapQreduce() functions with example 4, Attempt any one part of the following: 10x1=10 (@) Explain binary search. Also write the python code of it. (>) _ Explain the term sorting. Discuss and create a python program to implement merge sort. aet9n-2822 08 59.32) 1 Printed Subject Code: KME0S6 ee {TESTA 1 NP _ PAPER 4 900 ie ele] 5. Attempt any one part of the following: 10x 1=10 (a) Explain the List Accessing Methods and List Comprehension. (b) Describe about variable length arguments with suitable program. 6. Attempt any one part of the following: 10x1=10 (a) Explain Queue data structure with its operation (b) Explain stack data structure with its operation 7. Attempt any one part of the following: 10x1=10 (a) Describe dynamic programming. Also explain Longest common subsequence problem’s solution using dynamic programming (©) Explain simple GCD problem & ways to improve it,

You might also like