Computer Science Of Engineering

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.

Write a python program to sum all the items in a given dictionary.

Write a python program to add a new key-value pair to an existing dictionary.

Write a python program to check if a given key exists in a dictionary or not.

Write a python program to count the number of vowels in a string (No control flow allowed).

Write a python program to create tuples (name, age, address, college) for at least two members and concatenate the tuples and print the concatenated tuples.