Scribd
Upload
4 views

Competitive Coding LAB Index

The document outlines a series of programming assignments for a Competitive Coding Lab course, focusing on Python programming tasks. Each assignment includes multiple programming challenges such as finding the second largest number in an array, implementing data structures like stacks and queues, and solving algorithmic problems. The assignments are scheduled with specific due dates and cover a range of topics from basic programming to advanced algorithms.

Uploaded by

yashikakaimwaal123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Competitive Coding LAB Index

The document outlines a series of programming assignments for a Competitive Coding Lab course, focusing on Python programming tasks. Each assignment includes multiple programming challenges such as finding the second largest number in an array, implementing data structures like stacks and queues, and solving algorithmic problems. The assignments are scheduled with specific due dates and cover a range of topics from basic programming to advanced algorithms.

Uploaded by

yashikakaimwaal123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

School Of Engineering & Technology

COMPETITIVE CODING
LAB
(COURSE CODE: SEC036)

Submitted To: Submitted By:


Dr. Manish Kumar Yashika Kaimwaal
Assistant Professor Roll No. 2301840012
SOET B.Sc.(H) Data Science
INDEX
S.No.
Title Date Remarks
Assignment 1:
1.
I. Write a program in python to find the second largest number in an 16.01.25
array.
II. Write a program in python to find the sum of digits of a number. 16.01.25
III. Write a program in python to reverse a string. 21.01.25
IV. Write a program in python to check if a number is prime.
21.01.25
V. Write a program in python to calculate the factorial of a number.
23.01.25

Assignment 2:
2. 23.01.25
I. Write a program in python to implement a stack using an array. 23.01.05
II. Write a program in python to implement a queue using two stacks.
III. Write a program in python to implement binary search. 30.01.25
IV. Write a program in python to perform basic operations on a linked list. 30.01.25
V. Write a program in python to traverse a binary tree (inorder, preorder,
04.02.25
postorder).

Assignment 3:
3. 04.02.25
I. Write a program in python to implement and compare Bubble Sort
and Quick Sort.
II. Write a program in python to compare iterative vs recursive
06.02.25
Fibonacci sequence.
III. Write a program in python to analyze the time complexity of a 06.02.25
given function.
11.02.25
IV. Write a program in python to implement and analyze insertion sort.
V. Write a program in python to measure execution time of different 11.02.25
algorithms.

Assignment 4:
4. 13.02.25
I. Write a program in python to Solve the Tower of Hanoi problem.
II. Write a program in python to implement the N-Queens problem. 13.02.25
III. Write a program in python to Solve the 0/1 Knapsack problem
18.02.25
using dynamic programming.
IV. Write a program in python to implement the Coin Change problem. 18.02.25
V. Write a program in python to Solve the LCS problem.
20.02.25
Assignment 5:
5. 20.02.25
I. Write a program in python to implement a Min Heap and Max
Heap. 25.02.25
II. Write a program in python to implement a Priority Queue.
25.02.25
III. Write a program in python to implement a Trie for searching words.
IV. Write a program in python to implement a Segment Tree for range 27.02.25
sum queries.
27.02.25
V. Write a program in python to find the shortest path in a weighted
graph using Dijkstra’s Algorithm.

Assignment 6:
6. 20.03.25
I. Write a program in python to implement Depth-First Search (DFS).
II. Write a program in python to implement Breadth-First Search
(BFS).
20.03.25
III. Write a program in python to implement Dijkstra’s Algorithm for
shortest paths. 25.03.25
IV. Write a program in python to detect cycles in an undirected graph.
27.03.25
V. Write a program in python to find strongly connected components
using Tarjan’s Algorithm. 27.03.25

You might also like