AKTU Python Programming (KNC302) Question Paper 2021-22

Note: Attempt all Sections. If you require any missing data, then choose suitably.

Section A

Q1. Attempt all questions in brief · 2 × 5 = 10 marks

1. Explain the Programming Cycle for Python in detail.
2. What will be the output of the following Python code?
   i = 0
while i< 3:
print(i)
i += 1
else:
print(0)
3. What will be the output of the following Python code?
   def cube(x):
return x * x * x
x = cube(3)
print x
4. How do we define an Interface for an ADT?
5. How do you perform a search in Python?

Section B

Q2. Attempt any three of the following · 5 × 3 = 15 marks

1. What do you mean by Python IDE? Explain in detail.
2. How can you randomize the items of a list in place in Python?
3. Explain Tuples and Unpacking Sequences in Python Data Structure.
4. What are File input and output operations in Python Programming?
5. Solve the Tower of Hanoi problem for n= 3 disk and show all the steps.

Section C

Q3

Attempt any one part of the following · 5 × 1 = 5 marks

1. Write a program in Python to execute the Selection sort algorithm.
2. Explain why python is considered an interpreted language.

Q4

Attempt any one part of the following · 5 × 1 = 5 marks

1. Write a Python program to construct the following pattern, using a nested for loop.
   *
* *
* * *
* * * *
* * * * *
* * * *
* * *
* *
*
2. Write a program to produce Fibonacci series in Python.

Q5

Attempt any one part of the following · 5 × 1 = 5 marks

1. Write a Python program to change a given string to a new string where the first and last chars have been exchanged.
2. Write a Python program to add an item in a tuple.

Q6

Attempt any one part of the following · 5 × 1 = 5 marks

1. How to create and import a module in Python?
2. Explain the algorithm Sieve of Eratosthene used in Python Programming.

Q7

Attempt any one part of the following · 5 × 1 = 5 marks

1. Write a Recursive function in python BinarySearch(Arr,l,R,X) to search the given element X to be searched from the List Arr having R elements, where l represent slower bound and R represents the upper bound.
2. Explain the terms Merge List and Merge Sort in Python Programming.

Short on time? See the most repeated AKTU Python Programming questions across all years.

Other years

More AKTU Python Programming papers on LearnAIFast.

This paper is reproduced for study purposes only. Copyright belongs to AKTU. Source: the question paper bank of ABES Institute of Technology, an AKTU-affiliated college. If you own the copyright and want it removed, email learnwithskillnest@gmail.com and we will take it down.