Scribd
Upload
63 views1 page

DSA-IA-1-Student Copy-Version A

Uploaded by

vandana u
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
63 views1 page

DSA-IA-1-Student Copy-Version A

Uploaded by

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

>

USN

SHRI MADHWA VADIRAJA INSTITUTE OF TECHNOLOGY & MANAGEMENT, BANTAKAL

Department: AI IA- I Academic Year: 2023-24

Class: AI- A Course: Data Structures and Applications Course Code: BCS304

Date: 19-12-2023 Duration: 60 minutes Max. Marks: 25

QP Version: A

Note: Answer the following questions choosing one complete question from each part

Qn.No Question Marks PI* BL* CO*

PART-A

1a What is Data Structure. What are the various types of Data Structure. 6 1.2.1 L2 CO1
List the different operations that can be performed on a Data Structure.

1b Develop a Program in C for the following operations on Strings. 6 2.1.2 L3 CO1


a). Read a main String (STR), a Pattern String (PAT) and a Replace
String (REP) b). Perform Pattern Matching Operation: Find and
Replace all occurrences of PAT in STR with REP if PAT exists in STR.
Report suitable messages in case PAT does not exist in STR Support
the program with functions for each of the above operations. Don't
use Built-in functions.

OR

2a Give 2 differences between Static and Dynamic memory 6 1.3.1 L2 CO1


Allocation? Explain the Different functions that support Dynamic
Memory Allocation in detail.

2b Develop a C program to sort the given array using Bubble sort. 6 2.1.3 L3 CO1

PART-B

3a What is Polynomial? What is degree of polynomial? Consider 2 8 2.2.1 L2 CO1


polynomials, A(x)= 2x1000+1 and B(x)=x4+10x3+3x2+1 with a diagram to
show how these polynomials are stored in 1D Array.
Carry out the addition of the two polynomials.

3b Write a C recursive functions for Tower of Hanoi. 5 2.1.3 L3 CO1

OR

4a Define Stacks. List the different ADT’s available for stacks. Write the 8 2.1.2 L2 CO1
stack implementations for any 2 string operations using arrays.

4b Apply the algorithm of infix to postfix conversion and covert the following 5 2.1.3 L3 CO1
expression to postfix form.
A^B*C-D+(E/F)
BL* Bloom’s Taxonomy Level; CO* Course Outcome; PI- Performance Indicator

You might also like