53 - Information Technology - UG
53 - Information Technology - UG
(DEGREE STANDARD)
C Programming:
Python Programming:
Linear Data Structures – Abstract Data Types (ADTs) – List ADT – array
based implementation – linked list implementation – singly linked lists –
circularly linked lists – doubly-linked lists – applications of lists –
Polynomial Manipulation – All operation (Insertion, Deletion, Merge,
Traversal) – Stack ADT – Evaluating arithmetic expressions – other
applications – Queue ADT – circular queue implementation – Double
ended Queues – Priority Queues - application of queues – Trees: Binary
Tree - Binary Search Tree-Tree Traversals –Operations- AVL Tree-Splay
Tree-Red Black Tree- Binary Heap- Skew Heap- Leftist Heap - Binomial
Heap-Fibonacci Heap- Sorting algorithms: Insertion sort – Selection sort
– Shell sort – Bubble sort – Quick sort – Merge sort – Radix sort – Heap
Sort - Searching: Linear search – Binary Search - Hashing: Hash
Functions – Separate Chaining – Open Addressing – Rehashing –
Extendible Hashing – Graph Algorithms: Minimum Spanning Tree –
Shortest Path Algorithms - Graph Traversals -Directed Acyclic Graph-
Topological Ordering-All Pair Shortest Path Algorithms- Floyd Warshall
algorithm- Bellman Ford Algorithm-Network Flow Algorithms- Ford
Fulkerson Algorithm-Amortized Analysis of Algorithms - Algorithm
Analysis: Asymptotic Analysis-Solving Recurrence Equations-Algorithm
Design Techniques-Greedy Algorithms-Dynamic Programming-Divide and
Conquer- Back Tracking-Complexity classes – P, NP, NP Complete, NP
Hard.