|
List of Practical
1. Graphs of standard functions such as absolute value function, inverse
function, logarithmic and exponential functions, flooring and ceiling functions,
trigonometric functions over suitable intervals.
2. Partial ordering sets, Hasse diagram and Lattices.
3. Recurrence relation.
4. Different counting principles.
5. Finite state Automata and Finite state machines.
6. Warshall’s Algorithm.
7. Shortest Path algorithms.
8. Operations on graph.
9. Breadth and Depth First search algorithms.
10. Concept of searching, inserting and deleting from binary search trees