Scribd
Upload
47 views3 pages

EC8381 ND18 Set1

This document outlines 20 programming assignments for a Fundamentals of Data Structures in C laboratory course. The assignments involve developing C programs that implement various data structures like arrays, stacks, queues, and trees. They also include sorting, searching, and other algorithmic programs. Students are evaluated based on output, results, viva voce, and record keeping for each assignment.

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
47 views3 pages

EC8381 ND18 Set1

This document outlines 20 programming assignments for a Fundamentals of Data Structures in C laboratory course. The assignments involve developing C programs that implement various data structures like arrays, stacks, queues, and trees. They also include sorting, searching, and other algorithmic programs. Students are evaluated based on output, results, viva voce, and record keeping for each assignment.

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/ 3

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. Develop a ‘C’ program to find the greatest of ’N’ numbers stored in an array. (50)
b. Develop a ‘C’ program to implement linear search on a sorted array of ‘N’ numbers. (50)

2. a. Develop a ‘C’ program to implement a simple calculator using switch case statement. (50)
b. Develop a ‘C’ program to sort an array of ‘N’ numbers using bubble sort. (50)

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

4. a. Develop a ‘C’ program for evaluating postfix expression using array implementation of a
stack. (50)
b. Write a program in C to find the addition of two matrices. (50)

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

6. a. Write a program in C to implement a Queue using linked list. (50)


b. Write a program in C to add two complex numbers using structures. (50)

7. a. Write a program in C to check whether the given string is Palindrome or not. (50)
b. Write a Program to implement Binary Search Tree. (50)
8. a. Write a C Program to swap two numbers using call by value. (50)
b. Write a Program to implement Linear Search. (50)

9. a. Develop a ‘C’ program to sort an array of ‘N’ numbers using insertion sort. (50)
b. Develop a program to implement Binary search (50)

10. a. Define a structure called cricket that will describe the following information:
Player Code
Player Name
Team Name
Batting Average.
Using cricket, declare an array player with ‘N’ elements and develop a ‘C’ program to read the
information about all the ‘N’ players and print a team wise list containing names of players with
their batting average. (50)
b. Develop a ‘C’ program for implementing a stack using arrays. Illustrate the operations that
can be performed on the same. (50)

11. a. Develop a ‘C’ program for implementing a Queue using arrays. Illustrate the operations
that can be performed on the same. (60)
b. Write a Program in C to find the factorial of the given number. (40)

12. a. Write a program in C to implement a Queue using linked list. (60)


b. Write a program in C to sort the numbers in ascending order. (40)

13. a. Write a program in C to implement a stack using linked list. (50)


b. Write a program in C for in-order traversal of a Tree. (50)

14. a. Write a program in C to find the largest number using dynamic memory allocation. (60)
b. Write a program in C to swap two numbers using call by reference. (40)

15. a. Write a C program to read a one dimensional array, print sum of all elements along with
input as array elements using Dynamic Memory Allocation. (60)
b. Write a Program in C to find the biggest number in an array. (40)

16. a. Write a program in C to find the smallest number using dynamic memory allocation. (50)
b. Write a program in C to evaluate infix expression using stack. (50)

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


b. Write a Program in C to sort the names in alphabetical order. (50)

18. a. Write a program in C to evaluate infix expression using stack. (50)


b. Write a program in C to implement a stack using linked list. (50)
19. a. Write a program in C to evaluate Prefix expression using stack. (50)
b. Write a program in C to implement a stack using array. (50)

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


b. Write a program in C for in-order traversal of a Tree. (50)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy