LAB PROGRAMS

CSE I YEAR II SEM [R19] PYTHON LAB MANUAL

CSE I YEAR II SEM VIRTUAL LABS

II YEAR I SEM CSE(R19) LAB PROGRAMS

WEEK-1:

1.Fibonacci upto given no

B).Factorial of a given number 

  

C) GCD Computation

D) Towers of Hanoi

WEEK - 2

a) Write a Python program that use both recursive and non-recursive functions to perform linear search.

        RECURSIVE LINEAR SEARCH

       NON-RECURSIVE LINEAR SEARCH

b) Write a Python program that use both recursive and non-recursive functions to perform binary search.

        RECURSIVE BINARY SEARCH

          NON RECURSIVE BINARY

WEEK - 3

a) Write a Python program to implement Bubble sort.

b) Write a Python program to implement Insertion sort.

c) Write a Python program to implement Selection sort.

WEEK - 4

a) Write a Python program to implement Quick sort.

b) Write a Python program to implement Merge sort.

c) Write a Python program to implement Heap sort.

WEEK - 5

a)Write a Python program to implement Stack operations using arrays 

b) Write a Python program to implement Queue operation using arrays

WEEK - 6

Write a Python program to convert infix expression into postfix expression using Stack.

WEEK - 7

a) Write a Python program to implement Stack operation using Linked list. 

b) Write a Python program to implement Queue operations using Linked lists

WEEK - 8 

Write a Python program to implement the following operations on a singly linked using functions

 i) Insertion  ii) Deletion 

iii) Displaying 

 iv) Reversing

WEEK - 9 

a) Write a Python program to store a polynomial expression in memory using linked list 

b) Write a Python program to representation the given sparse matrix using arrays. 

WEEK - 10

 a) Write a Python program to implement following Operations on a Binary Tree 

i) Create ii) In-order traversal iii) Pre-order traversal iv) Post-order traversal 

b) Write a Python program to implement following Operations a Binary Search Tree i) Create

 ii) Insert 

iii) Delete 

WEEK - 11

 a) Write a Python program to compute the shortest path of a graph using Dijkstra’s algorithm 

b) Write a Python program to find the minimum spanning tree using Warshall’s Algorithm. 

WEEK - 12 

VIRTUAL LABS