Semister-II
Data Structure and Advance C
UNIT-I :
Introduction to Data structure, type of data structures, list, array,
stack and Queue; Algorithms of traversing, insertion and
deletion operation on it.
UNIT-II:
Linked list & its implementation, traversing, insertion, deletion
algorithms, circular Queue.
UNIT-III :
Tree : Binary, Binary search tree, tree Traversing : inorder,
preorder and postorder, sorting and searching Techniques :
Bubble sort, insertion sort and selection sort, linear search,
Binary search.
UNIT-IV :
Function : Definition, prototype, local & global variable, function
parameter, function calling and return, return values and their
types, function recursion Arrays : Declaration and initialization
of one and two dimensional arrays, function with array
UNIT-V :
: String Handling : Declaring and initialization of string variable
, operations on string : String copy comparison, concatenation.
Pointers : Declaration and initialization, pointer and address
arithmetic , Pointer comparison, Pointer and array.
UNIT-VI :
Structure : Definition and declaration , initialization, array of
structure , nested structure Union File Handing : Definition
and opening a file, closing a file , I/O Operations on file :fgetc(), fputc(), fputs(), fgets(), fputs(), fscanf(), fprintf(),
fread(), fwrite().
Practical : Minimum 16 Practical based on
A. Data structure using C Language
B. C language covering aspectus of syllabus .