Class notes
Data structures and algorithms
- Course
- Institution
It is for data structures and algorithms
[Show more]
Seller
Follow
disha6
Content preview
BCS304Model Question Paper-I with effect from 2023-24 (CBCS Scheme)
USN
Third Semester B.E. Degree Examination
Data Structures and Applications
TIME: 03 Hours Max. Marks: 100
Note: 01. Answer any FIVE full questions, choosing at least ONE question from each MODULE.
*Bloom’s
Module -1 Taxonomy Marks
Level
Q.01 a Define data structures. With a neat diagram, explain the classification of
L2 5
data structures with examples.
b What do you mean by pattern matching? Outline the Knuth Morris Pratt
(KMP) algorithm and illustrate it to find the occurrences of the following
pattern. L3 8
P: ABCDABD
S: ABC ABCDAB ABCDABCDABDE
c Write a program in C to implement push, pop and display operations for
L3 7
stacks using arrays.
OR
Q.02 a Explain in brief the different functions of dynamic memory allocation. L2 5
b Write functions in C for the following operations without using built-in
functions
i) Compare two strings. L3 8
ii) Concatenate two strings.
iii) Reverse a string
c Write a function to evaluate the postfix expression.
Illustrate the same for the given postfix expression: L3 7
ABC-D*+E$F+ and assume A=6, B=3, C=2, D=5, E=1 and F=7.
Module-2
Q. 03 a Develop a C program to implement insertion, deletion and display
L3 10
operations on Linear queue.
b Write a program in C to implement a stack of integers using a singly
L3 10
linked list.
OR
Q.04 a Write a C program to implement insertion, deletion and display operations
L3 10
on a circular queue.
b Write the C function to add two polynomials. Show the linked
representation of the below two polynomials and their addition using a
circular singly linked list
P1: 5x3 + 4x2 +7x + 3 L3 10
P2: 6x2 + 5
Output: add the above two polynomials and represent them using the
linked list.
Page 01 of 03
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller disha6. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $8.39. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
75323 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now