QP.

CODE

B.E / B.Tech. LABORATORY EXAMINATIONS, OCTOBER / NOVEMBER 2018

Third Semester
Electronics and Communication Engineering
EC8381 - Fundamentals of Data Structures in C Laboratory
(Common to Electronics and Telecommunication Engineering)
(Regulations - 2017)
Time : 3 Hours Max. Marks 100

Aim / Algorithm Program Output & Viva-Voce Record Total

Result
100
20 30 30 10 10

1. a. Write a C program to generate the Armstrong numbers from 1 – 1000 (50)

b. Write a program in C to evaluate Prefix expression using stack (50)

2. a. Write a C program to implement Binary search. (50)

b. Write a program in C to implement Queue using an array. (50)

3. a. Write a C program to implement linear search. (50)

b. Write a program in C to evaluate Postfix expression using stack. (50)

4. a. Write a C program to sort the values 5, 8, 3, 1, 9 using quick sort. (60)

b. Write a C Program to swap two numbers using call by value. (40)

5. a. Write a C program to sort the values 5, 8, 3, 1, 9 using merge sort. (60)

b. Write a C Program to swap two numbers using call by reference. (40)

6. a. Write a function program to perform the following operations on a doubly linked list
i. Create a list
ii. Insert an element to the list
iii. Delete a specific element from the list
iv. Display the content of the list
v. Find the number of elements in the list. Write a main function to demonstrate the
above.

7. a. Write a C program to implement a Queue using Linked List to create a Queue, (60)
 b. Write the routine for insert operation which represents a function enqueue(X) performed
at the end of the list, delete operation which represents a function dequeue(Q) performed
at the front of the list. Test your program with at least 5 elements and provide the output
(40)

8. a. Convert the given infix expression (5*4)+6/2-3+1 into postfix expression by

implementing the above using stack. (70)
b. Write a Program in C to find the sum of ‘n’ numbers. (30)

9. a. Write a function to read an expression and which is stored in

X=(A+B)*D+E/(F+A*D)+C as infix format.

Write an algorithm to transform an infix expression X into its postfix equivalent and also write a
function to evaluate the postfix expression. Write a main method to demonstrate the above
functions. Assume that the infix expression X is terminated by a character $.

10. a. Write a Program in C to convert infix to postfix expression. (50)

b. Write a Program in C to implement Binary Search Tree. (50)

11. a. Write a function program to perform the following operations on a singly linked list
i. Create a list
ii. Find the smallest element from the list
iii. Insert an element if it is not a duplicate element
iv. Display the elements in reverse order

Write a main method to demonstrate the above functionalities.

12. a. Develop a ‘C’ program for evaluating postfix expression using array implementation of a
stack. (50)
b. Write a C program in C to print the Armstrong numbers upto 100. (50)

13. a. Write a program in C to implement Collision resolution in Hash table using linked list.
(70)
b. Write a program in C to find the factorial of the given number. (30)

14. a. Write a program in C to sort the following elements using Insertion Sort (60)
b. Write a program in C to perform matrix subtraction. (40)

15. a. Write a program in C to convert the following infix expression to its postfix form using
 push and pop operations of a Stack
i) A/B^C+D*E-F*G
ii) (B^2-4*A*C)^(1/2) (100)

16. a. Write a program in C to evaluate the following expression using operations on a Stack
i) 234+*5*
ii) 4 5 + 7 2 - * (100)

17. a. Write a program in C to implement the concept of Linear Search. (60)

b. Write a program in C to find the biggest of three numbers. (40)

18. a. Define a structure called student that will describe the following information:

Register Number
Student Name
Section Name
Average.
Using student, declare an array students with ‘N’ elements and develop a ‘C’ program to read
the information about all the ‘N’ students and print a section wise list containing names of
students with their average. (50)
b. Develop a ‘C’ program for implementing a stack using arrays. Illustrate the operations
that can be performed on the same. (50)

19. a. Develop a ‘C’ program to find the sum of the digits of a given number using while
statement. (40)
b. Develop a ‘C’ program to sort an array of ‘N’ numbers using merge sort. (60)

20. a. Develop a ‘C’ program using function to compute the factorial of a given number. (40)
b. Develop a ‘C’ program to sort an array of ‘N’ numbers using merge sort. (60)