Syllabus

Unit I Introduction to C and Algorithm [8Hrs] Constants, variables and keywords in C, operators and control structure in c(decision, loop and case), functions, macros, arrays and string manipulation, structure, union, enumeration, bitwise operations Functions: Parameter passing call by value and call by reference, scope rules, functions and pointers, function returning pointer, pointer to function, String manipulations using Arrays, pointer to pointer, Dynamic memory management. Analysis of algorithm: frequency count and its importance in analysis of an algorithm, Time complexity & Space complexity of an algorithm, Big ‘O’ notation

Unit II Searching and Sorting [8Hrs] Need of searching and sorting, why various methods of searching and sorting, Sorting methods: Linear, binary search and Fibonacci Search. Sorting methods: Bubble, insertion, selection, merge, Time complexity of each searching and sorting algorithm, Hashing Techniques.

Unit III Stack and Queues [7Hrs]  Stacks: Concept, Basic Stack operations, Array representation of stacks, Stack as ADT, Stack Applications: Reversing data, Arithmetic expressions conversion and evaluation. Queues: Concept, Queue operations, Array representation of queues, Queue as ADT, Circular queues, Application of queues: Categorizing data, Simulation of queues.

Unit IV Linked List [7Hrs] Concept of linked organization, singly linked list, stack using linked list, queue using linked list, doubly linked list, circular linked list, Linked list as ADT. Representation and manipulations of polynomials using linked lists, ,comparison of sequential linked organization with linked organization

Unit V Trees [7Hrs] Introduction to trees: Basic Tree Concepts, Binary Trees:Concept & Terminologies, Representation of Binary Tree in memory, Traversing a binary tree, Binary Search Trees (BST): Basic Concepts, BST operations.

Unit VI Graphs [7Hrs] Basic Concepts & terminology, Sequential representation of graphs; Adjacency matrix, Path matrix, Linked representation of a graph, Operations on graph, Traversing a graph, Spanning trees; Minimum Spanning tree, Kruskal’s Algorithm, Prim’s Algorithm. Dijkstra's Shortest Path Algorithm