Scribd
Upload
31 views2 pages

EC8381 ND18 Set4

Uploaded by

Mr.SURESH P.M
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views2 pages

EC8381 ND18 Set4

Uploaded by

Mr.SURESH P.M
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

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

Output &
(Aim / Algorithm) Program Viva-Voce Record Total
Result
100
20 30 30 10 10

1. a. Write a Program in C to represent a polynomial as linked list.

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


implementing the Above using stack.

3. 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 $.

4. 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 quick sort. (60)

5. a. Develop a ‘C’ program for evaluating postfix expression using linked list implementation
of a stack.

6. a. Develop a ‘C’ program to find the greatest of ’N’ numbers stored in an array. (50)
b. Develop a ‘C’ program for implementing linear search on a sorted array of ‘N’ numbers.
(50)

7. a. Develop a ‘C’ program to check whether a string is a palindrome. (40)


b. Develop a ‘C’ program for implementing a queue using arrays. Illustrate the operations
that can be performed on the same. (60)

8. a. Develop a ‘C’ program to reverse a given string. (40)


b. Develop a ‘C’ program for implementing a queue using linked list. Illustrate the
operations that can be performed on the same. (60)

9. a. Write a program in C to find the largest number using dynamic memory allocation
10. a. Write a program in C to evaluate Postfix expression using stack

11. a. Write a program in C to evaluate infix expression using stack

12. a. Write a program in C to implement stack using array.

13. a. Write a program in C to implement Collision resolution in Hash table using linked list.

14. 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)

15. a. Write a program in C to implement Queue using array.

16. a. Write a program in C to implement Binary Search Tree.

17. a. Write a C Program to swap two numbers using call by reference and call by value.
b. Write a program in C to implement Linear Search.

18. a. Develop a ‘C’ program to sort an array of ‘N’ numbers using insertion sort. (60)
b. Write a program in C to implement Binary Search Tree. (40)

19. a. b. Develop a ‘C’ program to sort an array of ‘N’ numbers using Merge sort. (60)
b. Write a program in C to implement Binary Search Tree. (40)

20. 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)

You might also like