1. Unit-1
Overview of Data types, operators and expressions in C, Control flow in C, functions and program structure in C, inline functions & macros, arrays, structures, unions, enumerations, Bitwise operations
[5 Hrs]
2. Unit-2
Pointers in C and pointers to arrays, pointers to structures, input and output in C, Pointers to functions, command line arguments
[7 Hrs]
3. Unit-3
Introduction to files Searching and sorting techniques:
Linear, Fibonacci and binary search techniques
Sorting methods: Bubble, insertion, selection, merge, quick, bucket sort methods
Algorithm & characteristics of algorithm:
[5 Hrs]
4. Unit-4
Introduction to data structures:
Concept of data, Data types, Data Object, Data structure, Abstract Data types (ADT), realization of ADT in C
Linear data structures using sequential organization:
Concept of sequential organization, Concept of Linear data structures, arrays as ADT, Multidimensional arrays, Storage representations (row major and column major & their address calculation). Concept of ordered list and polynomial representation using arrays. Representation of sparse matrix using arrays, algorithm for sparse matrix addition, multiplication, simple and fast transpose for sparse matrix. strings manipulations using arrays [7 Hrs]
5. Unit-5
Linear data structures using linked organization:
Concept of linked organization, singly linked list, doubly linked list, circular linked list. Insertion, deletion and traversal on above data structures. Representation and manipulations of polynomials using linked lists, concept of skip list.
[8 Hrs]
6. Unit-6
Stacks and queues:
Concept of stack and queues as ADT. Implementation of stacks, linear queue, circular queue using linked and sequential organization. Application of stack for expression conversion, recursion, Concept of multistacks, multiqueues, dequeue and priority queue. Application of stacks & queues. [6 Hrs]
Reference http://www.unipune.ac.in/university_files/syllabi.htm
|
No responses found. Be the first to respond...
|