KunyaThing

Showing posts with the label SY SEM - IIShow all

Build the Binary Search Tree that has the Least Search Cost.

Build the Binary Search Tree that has the Least Search Cost.

Implement the Heap/Shell Sort Algorithm.

Implement the Heap/Shell Sort Algorithm.

Implement all the functions of a dictionary (ADT) using hashing.

Implement all the functions of a dictionary (ADT) using hashing.

Perform DFS and BFS : Graph using adjacency matrix/list.

Perform DFS and BFS : Graph using adjacency matrix/list.

Use adjacency list representation of the graph or use adjacency matrix representation of the graph.

Use adjacency list representation of the graph or use adjacency matrix representation of the graph.

Hash Table Implementation : Create Telephone book database.

Hash Table Implementation : Create Telephone book database.

Construct Dictionary Program : Use Binary Search Tree for implementation.

Construct Dictionary Program : Use Binary Search Tree for implementation.

Construct binary search tree by inserting values in order.

Construct binary search tree by inserting values in order.

Construct a tree and print the nodes.

Construct a tree and print the nodes.

Use Index Sequential File to Maintain the Data.

Use Index Sequential File to Maintain the Data.

Department maintains a Student Information : Use sequential file to maintain data.

Department maintains a Student Information : Use sequential file to maintain data.

Use Height Balance Tree and fins complexity for finding keyword.

Use Height Balance Tree and fins complexity for finding keyword.