Scribd
Upload
2 views2 pages

A2503 DATA STRUCTURES

This document outlines the syllabus and examination structure for the B.Tech II Semester (R19) Supplementary Examinations in Data Structures scheduled for June 2024. It includes compulsory questions in Part A and five units in Part B covering topics such as arrays, stacks, linked lists, sorting algorithms, and tree traversals. Each unit contains specific programming tasks and theoretical questions related to data structures.

Uploaded by

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

A2503 DATA STRUCTURES

This document outlines the syllabus and examination structure for the B.Tech II Semester (R19) Supplementary Examinations in Data Structures scheduled for June 2024. It includes compulsory questions in Part A and five units in Part B covering topics such as arrays, stacks, linked lists, sorting algorithms, and tree traversals. Each unit contains specific programming tasks and theoretical questions related to data structures.

Uploaded by

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

Code : A2503 R19

I B.Tech II Semester (R19) Supplementary Examinations June 2024


DATA STRUCTURES
Time : 3 hours (All Branches) Max. Marks: 70
PART- A
(Compulsory Question)
Answer the following: (10×02=20 Marks)

1 a What is the syntax of switch statement in c language?


b Differentiate between while and do-while loop statements in c language?
c What is a stack? And what are the operations performed on a stack?
d Define single and double linked list?
e What are the applications of a stack?
f How to insert a node at the beginning of the linked list?
g What are the worst case and best-case time complexities of Bubble sort and selection sort?
h What are the worst case and best-case time complexities of linear search and binary search?
i Define a binary tree with example?
j What is the syntax of switch statement in c language?
PART – B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT-1
2 a How to declare and initialize the two-dimensional array in c language?
b Write a c program for addition of two matrices?
OR
3 a Explain about basic data types in C language?
b Write a C program to find the factorial of a given number?
UNIT-II
4 a Write the algorithms for push and pop operations on a stack?
b What are the applications of a stack?
OR
5 a Write the algorithms for insertion and deletion operations on a queue?
b What are the applications of a queue?
UNIT-III
6 a Perform the following operations on a Single Linked List (SLL)
i) Insertion at Beginning
ii) Deletion from beginning
III) Insertion at a particular position

b What are the applications of linked list?


OR
7 a Perform the following operations on a Double Linked List (DLL)
i) Insertion at Beginning
ii) Deletion from beginning

b What are the differences between single and double linked list?
UNIT-IV
8 a Write an algorithm for quicksort?
b Write an algorithm for selection sort?
OR
9 a Write an algorithm for Binary search?
b Write an algorithm for linear search?
UNIT-V
10 a Write an algorithm for BFS traversal of a graph?
b Write an algorithm for DFS traversal of a graph?
OR
11 a Write the recursive algorithms for binary tree traversals?
b Define AVL tree? And what are the various rotations performed on AVL tree?

You might also like