Scribd
Upload
30 views

Fundamentals of Data Structure in C Assessment Question Paper 2

The document is an internal assessment test for a data structures course. It contains questions assessing various concepts like data types in C, arrays, strings, structures, unions, linked lists, stacks, queues, trees, graphs, sorting, and hashing. The test has 3 parts - short answer questions worth 20 marks, longer answer questions worth 65 marks and one 15 mark question.

Uploaded by

kumar
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
30 views

Fundamentals of Data Structure in C Assessment Question Paper 2

The document is an internal assessment test for a data structures course. It contains questions assessing various concepts like data types in C, arrays, strings, structures, unions, linked lists, stacks, queues, trees, graphs, sorting, and hashing. The test has 3 parts - short answer questions worth 20 marks, longer answer questions worth 65 marks and one 15 mark question.

Uploaded by

kumar
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Register No:

GNANAMANI COLLEGE OF TECHNOLOGY


NAMAKKAL-637018
Affiliated to Anna University, Chennai
Internal Assessment Test-III
Programme &
B.E- BIOMEDICAL ENGINEERING Year/Semester II/04
Branch
Course Code & EC8393 & FUNDAMENTALS OF
Date
Name DATASTRUCTURES IN C
Examination Three
Maximum Marks 100
Duration Hours

PART - A
Answer ALL the questions (10*2 = 20 Marks)
Q. No. COs BL Questions Marks
1 CO1 L1 Write the basic structure of C program. 2
2 CO1 L1 What is variable in C? Give an example. 2
3 CO2 L5 Differentiate: Structure and Union 2
4 CO2 L4
L1 Define – Null pointer. 2
5 CO3 L1 What is the use of priority queue? 2
6 CO3 L1 Define Stack. List it operations. 2
77 CO4 L1 What is tree and sub trees? 2
8 CO4 L1 What is graph and vertices? 2
9 CO5 L4 How binary search works? 2
10 CO56
CO5 L1 What is a overflow condition in hashing? 2
PART – B
Answer ALL Questions (5*13=65 Marks)
L1 (i)Explain the various data types available in C with example.
11.(a) CO1 (ii)List all the operators in c with an example for each. (7+6)
L1
(or)

L6 (i) How two-dimensional arrays are created in C? Write a C


program- to generate a population survey having citizen’s records
11.(b) CO1 stored as a collection of year-wise population. (6+7)
(ii) List the various string handling functions and write C code of your
L6 own to perform any two operations in it.

Illustrate Pass by value and Pass by reference in function with suitable


12.(a) CO2 L1 example. 13

(or)

Illustrate the representation of structure and unions for an employee


12.(b) record having empid, empname, DoB, basicpay, allowance, deductions,
CO2 L6 13
grosspay and netpay. Examine their memory allocation.
What is linked list? Examine the various types of linked list creations
13.(a) CO3 L1 13
with their operation in C
(or)
13.(b) CO3 L4 How expression evaluation is done using stacks? Illustrate with an 13
example.
14.(a) CO4 L1 What is binary tree? Examine all binary tree traversals with an example. 13
(or)
14.(b) CO4 L1 Examine any one of the graph traversal algorithms with an example. 13
Apply bubble sort and selection sort algorithm to sort a given set of
15.(a) CO5 L3 13
numbers.
(or)
How 2-way merge sort helps in sorting a given set of numbers in an
15.(b) CO5 L5 efficient manner? Evaluate it for the following list: 13
30,10,49,34,69,12,96,53,2,43,80

PART – C
Answer ALL Questions (1*15=15 Marks)
Analyze the functionality of hash tables and hashing functions in storing
16.(a) CO5 L4 and retrieving data efficiently. 15

(or)
Write a program that takes an array of pointers to store a two dimensional
16.(b) CO1 L6 array and perform matrix multiplication using it. 15

Subject Incharge IQAC Coordinator Course Coordinator HoD

You might also like