UNIT-II

1. StructuresDefinition of StructuresDeclaration of structuresInitialization of structuresOne example program

2. Structures using arrayDefinition of StructuresExplanation of Structures using arrayDeclaration and initialization of structures using arrayStudent database program for both academic and personal details using array of structures

3. Structures using pointersDefinition of StructuresExplanation of structures using pointersDeclaration and initialization of structures using pointersStudent database program using array of pointers

4. UnionDefinition of UnionDeclaration and initialization of unionOne example programDifference between structures and union

5. File open in text mode and binary modeDefinition of fileSyntax for opening the fileExplain read, write and append mode in both text and binaryOne Example Program foe each

6. File manipulationsFopen()Fread()Fwrite()Fclose()Fcloseall()Ftell()Fseek()Rewind()Remove()

7.Reading and writing a FileGetc()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 arrayDefinition of ListCreation of ListInsertion 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 listCreation of a nodeCreation of singly linked listInsertion 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 listDefinition of doubly linked listCreation of a nodeCreation of doubly linked listInsertion 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 additionGeneral form of polynomial additionAlgorithm for Polynomial additionOne Example sum

UNIT-IV1. Explain stack operation using array(static allocation)

Definition of StackNeed and Explanation of stack using arrayBasic operation of StackExplain the operation of stack with algorithm

Push()Pop()Isempty()Isfull()

2.Explain stack operation using linked list(dynamic allocation)Definition of stackExplanation and advantages of stack using linked listBasic operation of stackExplain the operation of stack using linked list with algorithm

Push()Pop()

3.Explain queue operation using array(static allocation)(linear queue)Definition of queueExplanation of queue using arrayBasic operation of queueExplain the operation of queue with algorithm

Enqueue()Dequeue(0Isemty()Isfull()

4.Explain queue operation using linked list(Dynamic allocation)Definition of queueExplanation and advantages of queue using linked listBasic operation of queueExplain the operation of queue with algorithm

Enqueue()Dequeue()

5.Explain circular queue using arrayDefinition of circular queueBasic operation of Circular queueExplain the operation of circular queue with algorithm

Insertion of a elementDeletion of a element

Advantages of circular queue

6. Explain the application of stackEvaluating postfix expression (sum with algorithm)Converting infix to postfix expression (sum with algorithm)

7. Explain application of queuePolynomial manipulation (sum with algorithm)

8. Infix to postfix conversion