Scribd
Upload
3 views2 pages

CC PR List

The document outlines a teaching and examination scheme for a course, detailing the internal evaluation and end-semester examination structure. It includes a comprehensive list of practical programming tasks related to data structures and algorithms, such as stack operations, tree traversals, and hash functions. Additionally, it provides a list of recommended textbooks for further study in algorithms and data structures.

Uploaded by

chetansonawane1260
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
3 views2 pages

CC PR List

The document outlines a teaching and examination scheme for a course, detailing the internal evaluation and end-semester examination structure. It includes a comprehensive list of practical programming tasks related to data structures and algorithms, such as stack operations, tree traversals, and hash functions. Additionally, it provides a list of recommended textbooks for further study in algorithms and data structures.

Uploaded by

chetansonawane1260
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/ 2

g.

Teaching & Examination Scheme:

Teaching Scheme Evaluation Scheme

L T P C Internal Evaluation ESE


Total
T P CE Theory P

- - 4 2 - 20 - - 30 50

L- Lectures; T- Tutorial; P- Practical; C- Credit; MSE- Mid-Semester Evaluation;


CE- Continuous Evaluation; ESE- End Semester Examination

h. List of Practicals:

1. Write a program for implementing a MINSTACK which should support oper-


ations like push, pop, overflow, underflow, display.
i. Construct a stack of N-capacity
ii. Push elements
iii. Pop elements
iv. Top element
v. Retrieve the min element from the stack
2. Write a program to deal with real-world situations where Stack data structure
is widely used. Evaluation of expression: Stacks are used to evaluate expres-
sions, especially in languages that use postfix or prefix notation. Operators
and operands are pushed onto the stack, and operations are performed based
on the LIFO principle.
3. Write a program for finding the Next Greater Element (NGE) from an array.
4. Write a program to design a circular queue (k) which should implement the
following functions:
i. Enqueue
ii. Dequeue
iii. Front
iv. Rear
5. Write a program for an infix expression, and convert it to postfix notation. Use
a queue to implement the Shunting Yard Algorithm for expression conversion.
6. Write a program for finding the Product of the three largest Distinct Elements.
Use a Priority Queue to efficiently find and remove the largest elements.
7. Write a program to Merge two sorted linked lists.
8. Write a program to find the Merge point of two sorted linked lists.
9. Write a program to Swap Nodes pairwise in a linked list.
10. Write a program for building a function ISVALID to validate a Binary Search
Tree (BST).
11. Write a program to Build a BST.
12. Write a program to determine the depth of a given Tree by implementing
MAXDEPTH.
13. Write a program to understand and implement Tree traversals, i.e., Pre-Order,
Post-Order, In-Order.
14. Write a program to perform Boundary Traversal on a BST.
15. Write a program for Lowest Common Ancestors (LCA) in a BST.
16. Write a program to verify and validate mirrored trees.
17. Write a program for a basic hash function in a programming language of your
choice. Demonstrate its usage to store and retrieve key-value pairs.
18. Implement a hash table using separate chaining for collision handling. Perform
operations like insertion, deletion, and search on the hash table.
19. Write a program to implement Two Sums using a HashMap.
20. Write a program to implement search, insert, and remove operations in a Trie.
21. Write a program to implement Huffman coding.
22. Write a program to find distinct substrings in a string.
23. Write a program to find the number of words in a Trie.
24. Write a program to view a tree from the left view.
25. Write a program to traverse a tree using Level Order Traversal.

i. Text Books:

1. Robert Sedgewick and Kevin Wayne, Algorithms, Part I and II, Addison-
Wesley.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
Introduction to Algorithms, MIT Press.
3. Steven S. Skiena, The Algorithm Design Manual, Springer.
4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Addison-
Wesley.
5. Sahni, A. and Horowitz, E., Fundamental Data Structures, McGraw-Hill.

You might also like