Scribd
Upload
36 views3 pages

EC8393-Fundamentals of Data Strucutres in C

The document is a sample question paper for a third semester exam in Electronics and Communication Engineering on the topic of fundamentals of data structures in C. It contains 16 questions divided into three parts: Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 13 marks each. Part C contains 1 long answer question worth 15 marks. The questions cover topics such as C data types, strings, structures, unions, linked lists, stacks, queues, trees, sorting, searching and hashing.

Uploaded by

syed1188
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
36 views3 pages

EC8393-Fundamentals of Data Strucutres in C

The document is a sample question paper for a third semester exam in Electronics and Communication Engineering on the topic of fundamentals of data structures in C. It contains 16 questions divided into three parts: Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 13 marks each. Part C contains 1 long answer question worth 15 marks. The questions cover topics such as C data types, strings, structures, unions, linked lists, stacks, queues, trees, sorting, searching and hashing.

Uploaded by

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

Reg.

No

Question Paper

B.E./B.TECH. DEGREE MODEL EXAMINATION


Third Semester
ELECTRONICS AND COMMUNICATION ENGG
EC8393 – FUNDAMENTALS OF DATA STRUCTURES IN C
Regulation-2017
Time: Three hours Maximum: 100 marks
Answer ALL questions
Part A – (10 x 2 = 20 marks)

1. List the primary data types in C.

2. What are the string operation defined in C?

3. Define Preprocessor directives and List out few wxamples.

4. Differentiate between structure and Union..

5. What are the advantages and disadvantages of linked list over array?

6. What are the ways to implement priority queues?

7. What are double ended queues?

8. Mention the types of rotation performed on AVL trees.

9. When is a binary search tree a heap? Justify..

10. Write routine for hash function of a string.

Part B – (5 x 13 = 65 marks)

11. (a) (i) Write a C program to get two strings and display the result of at least 5 string
operations. (7)

(ii) Write a C program to get a five digit number and display the reverse of the same
number. (6)
Or

(b) Write a C program to find the following, where A, B, C are the matrices whose orders are
M*N, M*N and N*N respectively. A=A+B*C.

12. (a) (i) Differentiate the data types, structures with unions. (7)

(ii) Write a C Program to get 10 students details using structure from the user and display
these details on the screen. (6)

Or
(b) (i) Write a C Program to find the factorial of the given number using recursive function.(6)

(ii) Differentiate call by value and call by reference with example program for each. (7)

13. (a) Write an algorithm to perform each of the following operations

(i) Reverse a list, so that the last element comes first and so on. (4)

(ii) Return the sum of integers in a list. (5)

(iii) Delete every third element from a list. (4)

Or

(b) (i) Write a C program to perform multiplication of two polynomials using linked list. (7)

(ii) Define the procedure to convert infix expression to postfix. Convert the
given expression a + ( b * c - ( d / e ^ f ) * g ) * h into postfix.
(6)

14. (a) Distinguish between BFS and DFS with an example. (13)

Or

(b) (i) Draw the result of inserting 20, 10 and 24 one by one into the AVL tree given
below. Draw the tree after each insertion. Explain the operations of the AVL tree.
(13)

15. (a) Explain separate chaining with its algorithm. (13)

Or

(b) (i) Explain rehashing with its algorithm. (6)

(ii) Explain radix sort algorithm with an example. (7)


Part C – (1 x 15 = 15 marks)

16 (a) (i) Sort the following sequence using quick sort. (8)

3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5

(ii) Write a C program to search a number with a given set of unsorted number using
binary search. (7)
or

(b) Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x
(mod 10), show the resulting

(i) open hash table

(ii) closed hash table using linear probing

(iii) closed hash table using quadratic probing

(iv) closed

You might also like