SENGUNTHAR ENGINEERING COLLEGE

(Autonomous)
TIRUCHENGODE
QP Code 2 3 1 2 0 0 Register Number

End Semester Examinations – Nov/Dec 2023 Regulations–2019

Programme B.E. – ECE & Medical Semester III Max. Marks 100 Duration 3 Hrs
Electronics

Course Code & Title 19CSE303 - DATA STRUCTURES USING C

Part – A (10 x 2 = 20
Marks)
Answer All Questions
1. List the different memory units.
Primary Memory
Secondary Memory

2. What is BIOS? Mention its functions.

BIOS (basic input/output system) are the program a computer's microprocessor uses to start the
computer system after it is powered on. It also manages data flow between the computer's
operating system (OS) and attached devices, such as the hard disk, video adapter, keyboard,
mouse and printer.

3. What is the size of a generic pointer?

A generic pointer, also known as a void* pointer, has a size of either 4 bytes or 8 bytes
4. Write any two pre-processor Directives in C.
#define: It substitutes a preprocessor using macro.
#include: It helps to insert a certain header from another file.

5. Write the procedures for insertion, deletion and traversal of a queue.

procedure add(item : items); {add item to the global stack stack; top is the current top of stack.
and n is its maximum size} ...
procedure addq (item : items); {add item to the queue q} begin. if rear=n then queuefull. ...
procedure deleteq (var item : items); {delete from the front of q and put into item} begin .
6. State the difference between arrays and linked lists.
An array is a grouping of data elements of equivalent data type. A linked list is a group of entities
called a node. The node includes two segments: data and address.
7. What do you mean by the level of a tree?
The depth(or level) of a node is its distance(i.e. no of edges) from tree's root node. The height is number
of edges between root node and furthest leaf.
8. What do you mean by articulation point?
A vertex whose removal from the graph increases its number of connected components.
9. Define bubble sort.
Bubble sort is a basic algorithm for arranging a string of numbers or other elements in the correct order.
The method works by examining each set of adjacent elements in the string, from left to right, switching
their positions if they are out of order.
10. Define hashing function.
A hash function is a mathematical function or algorithm that simply takes a variable number of characters
(called a ”message”) and converts it into a string with a fixed number of characters