C.V.
Raman global university
Bhubaneswar, Odisha
Department ………………………………………….
Laboratory……………………………………………
Name………………………………………………….
Branch………………………………………………..
Roll No. ……………………………………………….
Reg. No. ………………………………………………
INDEX
Sl. ASSIGNMENT Date of Date of Page
No. Assignment Submissio No.
n
1. 1. Write a program to find the sum and average of n
different integers.
2. Write a program to find largest and smallest
number in integer array.
3. Write a program to interchange the largest and
smallest element.
4. Write a program to find if the array contains
duplicate numbers. display the number that is
occurred more than once and its frequency.
2.
2.
3. 1. Write a menu driven program for push, pop, peep,
display operations of stack.
2. Write a program to find the reverse of a string. Test
your program for the input string as COMPUTER
SCIENCE AND ENGINEERING.
3. Write a menu driven program in C to perform
following operations on stack.
[1] Infix to Postfix conversion
[2] Postfix expression evaluation
[3] Exit the program
To implement this program,
I. Write functions for push and pop operation
of stack.
i. Write a function to convert an infix
expression to a postfix expression. Pass a one
dimensional character array to the function as
input (infix exp) and return character array i.e.
(postfix exp).
Test your program for following input :
Infix expression : ( A – (B / C ) * D + E ) * F + G
Postfix expression(P) : ABC/D*- E+F*G+
ii. Write a function for the evaluation of a
given postfix expression. For testing pass the
postfix expression P of part ii and supply the
following set of values. A = 90, B = 50, C = 2, D
= 3, E = 1, F = 2, G = 5.
4. Write a program to check the validity of an
expression containing nested parentheses.
Inputs: [119 - 5 * (6 + 4 ) ], { 2 + ( 2 * 3 )]
4.
5. Write a menu driven program to perform insertion,
deletion, and traversal operation on a single
LinkedList.
1. Create a single LinkedList.
2. Inserting a node at the beginning.
3. Inserting a node at the end of the list.
4. Inserting a new node at the specific
location.
5. Deletion of a node from the beginning of
the SLL.
6. Deletion of a node from the end of SLL.
7. Deleting a node at a specific location.
8. Traversal of the SLL.
9. Exit
6. 1. Write a program to find sum of all elements and
count the number of nodes in a single LinkedList.
2. Write a program to merge two single LinkedList.
3. Write a program to reverse a single LinkedList.
4. Write a program to find nth node in a single
LinkedList.
5. Write a program to move the last element to the
first position.