Sei sulla pagina 1di 4

UNIT-II

1. Structures
Definition of Structures
Declaration of structures
Initialization of structures
One example program
2. Structures using array
Definition of Structures
Explanation of Structures using array
Declaration and initialization of structures using array
Student database program for both academic and personal details using array of structures
3. Structures using pointers
Definition of Structures
Explanation of structures using pointers
Declaration and initialization of structures using pointers
Student database program using array of pointers
4. Union
Definition of Union
Declaration and initialization of union
One example program
Difference between structures and union
5. File open in text mode and binary mode
Definition of file
Syntax for opening the file
Explain read, write and append mode in both text and binary
One Example Program foe each
6. File manipulations
Fopen()
Fread()
Fwrite()
Fclose()
Fcloseall()
Ftell()
Fseek()
Rewind()
Remove()
7.Reading and writing a File
Getc()
Putc()
Gets()
Puts()
Getchar()
Putchar()
Getw()
Putw()
Fscanf()
Fprintf()
8. Program to copying one file to another
Program to create employee details using file
Program to Compare two files

UNIT-III

1. Linear list using array
Definition of List
Creation of List
Insertion of a element in to the list(first,last,middle)
Deletion of the element from the list(first,last,middle)
Traverse the list
2. Singly linked list(Linear linked list)
Definition of singly linked list
Creation of a node
Creation of singly linked list
Insertion of a node into the list(first,last,middle)
Deletion of a node from the list(first,last,middle)
Traverse the list
3. Doubly linked list
Definition of doubly linked list
Creation of a node
Creation of doubly linked list
Insertion of a node into the list(first,last,middle)
Deletion of a node from the list(First,last,middle)
Traverse the List
4. Application of List(Polynomial manipulation)
Definition of polynomial addition
General form of polynomial addition
Algorithm for Polynomial addition
One Example sum

UNIT-IV
1. Explain stack operation using array(static allocation)
Definition of Stack
Need and Explanation of stack using array
Basic operation of Stack
Explain the operation of stack with algorithm
Push()
Pop()
Isempty()
Isfull()
2.Explain stack operation using linked list(dynamic allocation)
Definition of stack
Explanation and advantages of stack using linked list
Basic operation of stack
Explain the operation of stack using linked list with algorithm
Push()
Pop()
3.Explain queue operation using array(static allocation)(linear queue)
Definition of queue
Explanation of queue using array
Basic operation of queue
Explain the operation of queue with algorithm
Enqueue()
Dequeue(0
Isemty()
Isfull()
4.Explain queue operation using linked list(Dynamic allocation)
Definition of queue
Explanation and advantages of queue using linked list
Basic operation of queue
Explain the operation of queue with algorithm
Enqueue()
Dequeue()
5.Explain circular queue using array
Definition of circular queue
Basic operation of Circular queue
Explain the operation of circular queue with algorithm
Insertion of a element
Deletion of a element
Advantages of circular queue
6. Explain the application of stack
Evaluating postfix expression (sum with algorithm)
Converting infix to postfix expression (sum with algorithm)
7. Explain application of queue
Polynomial manipulation (sum with algorithm)
8. Infix to postfix conversion