3rd-sem-lab-programs for RV College of Engineering

---

Data Structures and Applications

List of Programs

1. Use Stack operations to do the following:
   • Assign to a variable name Y the value of the third element from the top of the stack and leave the stack undisturbed.
   • Given an arbitrary integer n pop out the top n elements. A message should be displayed if an unusual condition is encountered
   • Assign to a variable name Y the value of the third element from the bottom of the stack and keep the stack undisturbed.
2. Write a C program that parses Infix arithmetic expressions to Postfix arithmetic expressions using a Stack.
3. Write a C program to simulate the working of Messaging System in which a message is placed in a circular Queue by a Message Sender, a message is removed from the circular queue by a Message Receiver, which can also display the contents of the Queue.
4. Implement a program to multiply two polynomials using single linked list.
5. Write a C program to implement addition of long positive integers using circular single linked list with header node.
6. Design a doubly linked list to represent sparse matrix. Each node in the list can have the row and column index of the matrix element and the value of the element. Print the complete matrix as the output.
7. Write a C program to create Binary Tree and provide insertion and deletion operations and to traverse the tree using In-order, Preorder and Post order (recursively)
8. Given a String representing a parentheses-free infix arithmetic expression, implement a program to place it in a tree in the infix form. Assume that a variable name is a single letter. Traverse the tree to produce an equivalent postfix and prefix expression string.
9. Write a C program to implement Hashing using Linear probing. Implement insertion, deletion, search and display.
10. Write a C program to implement priority queue to insert, delete and display the elements.

---

Operating system

List of Programs

1. Implementation of basic UNIX commands using file APIs- Write a program to implement commands ls( -l option), cp, rm and mv using UNIX file APIs.
2. Process control system calls- Application to demonstrate use of fork, execve, wait, getpid, exit system calls
3. Thread creation and management using Pthread Library- Application to demonstrate use of pthread library functions to create and manage threads
4. Process scheduling and process priority – Modify the default scheduling algorithm for MINIX or XV6 operating system.
5. Process/Thread synchronization - Application to demonstrate process/thread synchronization using semaphores and mutex. Implement Dining philosophers problem, reader-writer and producer-consumer
6. Process/Thread synchronization for file access - Application to demonstrate process/thread synchronization using file locks.
7. Deadlock- Write a program that implements the Bankers’ algorithm for deadlock avoidance. The program should check for safe sequence and resource request algorithm.
8. Memory management- Write a program to simulate Buddy memory allocation algorithm.
9. Static and Shared libraries- Write a program to create and use static and shared libraries. Demonstrate the advantage of shared libraries over static libraries in terms of memory usage.