Computer Science Of Engineering

Develop a program to simulate a simple printer queue system in C

Implement Travelling Sales Person problem using Branch and Bound approach.

Use Backtracking strategy to solve 0/1 Knapsack problem.

Implement N-Queens Problem Using Backtracking.

Write a program to solve 0/1 Knapsack problem Using Dynamic Programming.

Implement Job Sequencing with deadlines using Greedy strategy.

Compare the performance of Single Source Shortest Paths using Greedy method when the graph is represented by adjacency matrix and adjacency lists.

Implement Quick sort and Merge sort and observe the execution time for various input sizes (Average, Worst and Best cases).

Write a program for finding the biconnected components in a given graph.

Implement BFT and DFT for given graph, when graph is represented by a) Adjacency Matrix b) Adjacency Lists

Construct Min and Max Heap using arrays, delete any element and display the content of the Heap.

Construct B-Tree an order of 5 with a set of 100 random elements stored in array. Implement searching, insertion and deletion operations.

Construct an AVL tree for a given set of elements which are stored in a file. And implement insert and delete operation on the constructed tree. Write contents of tree into a new file using in-order.

Implement a doubly linked list and perform various operations to understand its properties and applications in C

Implement a circular linked list and perform insertion, deletion, and traversal in C

Implement a stack using linked lists in C

Implement a stack using arrays in C

Write a C program to evaluate a postfix expression using a stack.