Scribd
Upload
24 views4 pages

Extracted Text

This document is a model paper for the Data Structures course for the I B. TECH II Semester regular examinations scheduled for July 2024. It includes a structured question format divided into two parts, with Part-A consisting of compulsory questions and Part-B requiring answers from various units covering topics like algorithms, linked lists, stacks, queues, and binary search trees. The paper assesses knowledge on time and space complexity, sorting algorithms, and data structure operations.

Uploaded by

Swathi Balusupati
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
24 views4 pages

Extracted Text

This document is a model paper for the Data Structures course for the I B. TECH II Semester regular examinations scheduled for July 2024. It includes a structured question format divided into two parts, with Part-A consisting of compulsory questions and Part-B requiring answers from various units covering topics like algorithms, linked lists, stacks, queues, and binary search trees. The paper assesses knowledge on time and space complexity, sorting algorithms, and data structure operations.

Uploaded by

Swathi Balusupati
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/ 4

Open navigation menuClose suggestionsSearchSearchenChange

LanguageUploadSavedUser SettingsDownload free for 30 days0 ratings0%


found this document useful (0 votes)3K views2 pagesr23 Data Structures
Model Paper I - II Semdata structures model paper I -II semFull
descriptionUploaded bygnanaprasuna1911on Jul 27, 2024AI-enhanced
titleDocument Informationclick to expand document informationdata
structures model paper I -II semDownload nowDownloadDownload as pdf
or txtSave r23 data structures model paper I -II sem For
LaterDownloadSaveSave r23 data structures model paper I -II sem For
Later0%0% found this document useful, undefined0%,
undefinedEmbedSharePrintReport0 ratings0% found this document useful
(0 votes)3K views2 pagesr23 Data Structures Model Paper I - II Semdata
structures model paper I -II semFull descriptionUploaded
bygnanaprasuna1911on Jul 27, 2024AI-enhanced titleDocument
Informationclick to expand document informationdata structures model
paper I -II semDownload nowDownloadDownload as pdf or txtSave r23
data structures model paper I -II sem For LaterCarousel PreviousCarousel
NextSaveSave r23 data structures model paper I -II sem For Later0%0%
found this document useful, undefined0%,
undefinedEmbedSharePrintReport var container =
document.getElementById('pdf_document_scroll_container'); var width =
container ? Math.min(1272, container.offsetWidth) : 1272; var padding =
window.innerWidth <= 512 ? 0 : 48; window.defaultViewWidth = width -
padding; window.docManager.setPageWidths(width - padding);
docManager.setupTestElements(); Code No: I B. TECH II SEMESTER
REGULAR EXAMINATIONS, JULY-2024 DATA STRUCTURES (COMMON TO
CSE, IT & ALLIED BRANCHES) Time: 3 Hours Max. Marks: 70
_____________________________________________________________
_________________ Note: 1. The question paper consists of two parts
(Part-A and Part-B) 2. All the questions in Part-A are Compulsory 3.
Answer ONE Question from Each Unit in Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ PART – A (20 Marks)
1. a) Define Time and Space Complexity. [2M] b) Define ADT. (Abstract
Data Type) [2M] c) List advantages of linked list over arrays. [2M] d)
Discuss operations performed with polynomials. [2M] e) Write the
differences between stack and queue. [2M] f) What are the disadvantages
of representing a stack using Arrays [2M] g) Write the applications of
queues. [2M] h) Define Double Ended Queue (deque). [2M] i) Define
Sibling. [2M] j) Write about hash functions. [2M] PART – B (50 Marks)
UNIT-I 2. a) Apply the insertion sort for given numbers: 34, 8, 14, 61, 4, 53,
81, 47. [5 M] b) Illustrate the step-by-step procedure for sorting the
following unordered list of elements 52, 37, 63, 14, 17, 8, 6, 25 using Quick
sort technique. [5 M] (OR) 3. a) Define Algorithm. Explain time complexity
and space complexity of an algorithm. [5 M] b) Discuss merge sort
algorithm with a suitable example. [5 M] UNIT-II 4. a) Explain the steps to
implement the following operations of singly-linked list without head
node using illustrative examples? [6M] R23 5 adDownload to read ad-free
(i) removing at front (ii) removing at end (iii) removing node before a
specified node b) Provide an example of a real-life scenario where the use
of a doubly linked list would be appropriate. [4M] (OR) 5. a) Discuss the
steps involved in searching for an element in a single linked list. [5 M] b)
Illustrate how a polynomial can be represented using linked list. Write an
algorithm for adding two polynomials represented by linked lists. [5 M]
UNIT-III 6. a) Convert following expression X+ (Y * Z) – ((N * M +O)

Convert following expression X+ (Y * Z) - ((N * M +0) /Q) in to


postfix form.

Explain the procedure to evaluate postfix expression. Evaluate


the following Postfix expression 734+-245/+*6/7+.

(OR)
Explain the basic operations of stack with pseudo code.(L2)
Write an algorithm to push and pop an element from linked
stack.

UNIT-IV
Compare the advantages and disadvantages of array-based
and
linked list based implementations for queues.
Give the structure of Queue. Explain the operations in it.

(OR)
Write an algorithm to insert and delete a key from circular
queue.

Define Deque. Explain the operations in it.


UNIT-V

Construct Binary Search Tree by inserting the following key


elements: 10, 12, 5, 4, 20, 8, 7, 6, 15.

Explain pre-order, in-order and post-order traversals of


Binary tree.

(OR)
What is hashing? Briefly explain various hashing methods.
Summarize various Collision Resolution Techniques?

errs

III O <

[4M]

[5M
15M

15M

[SM

[5M
[5M

You might also like