Computer Science Of Engineering

Write a JAVA program using String Buffer to delete, remove character.

Write a JAVA program to sort for an element in a given list of elements using bubble sort.

Write a JAVA program to search for an element in a given list of elements using binary search mechanism.

Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate the discriminate D and basing on value of D, describe the nature of root.

Write a JAVA program to display default value of all primitive data type of JAVA.

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.