Scribd
Upload
19 views

Assignment 1(m)

Uploaded by

darshangowda0525
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

Assignment 1(m)

Uploaded by

darshangowda0525
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Jyothy Charitable Trust®

Jyothy Institute of Technology


Tataguni, off Kanakapura road, Bengaluru-560082
Approved by The All India Council for Technical Education (AICTE) - New Delhi;
Affiliated to VisvesvarayaTechnological University(VTU), Belagavi;
Department of Information Science & Engineering
Accredited by National Board of Accreditation (NBA) -New Delhi.

ASSIGNMENT QUESTIONS

3rd SEMESTER

Semester 3rd Sem

Course Data Structures and Applications


Subject Code BCS304

Name of the Course


Ms. Shilpa Narayan Designation Assistant. Prof.
In charge

Assignment No: 01 Total marks:10


Date of Issue : 01st Nov 2024 Date of Submission : 06th Nov 2024

Note: All Questions Compulsory

Course RBT
Sl. No Assignment Questions Marks
Outcome Level

1. Mention different data structure operations and explain them in detail. CO1 L1 1
A ) Convert the given infix expression in to postfix expression.
2. CO2 L3 1
A + (B * C – ( D / E ^ F ) * G ) * H

B ) Write the Postfix form of the following using stack :

3. i) A*(B*C+D*E) +F CO2 L3 2
ii) (a + (b*c) / (d-e))

4. Write a program to perform binary search and linear search. CO1 L3 1

5. Write a program to insert , delete and display elements in queue. CO2 L3 1


6 Write a program to implement multiple stack (push, pop and display). CO2 L3 1

7 How arrays are different from structures explain in detail. CO1 L1 1

What are linear queues. List its drawbacks. Also explain how to
8 CO2 L1
overcome with its drawbacks. 1

Write a program to implement circular queue using dynamic memory


9 CO2 L3
allocation. 1

10 ⁠Explain Linked List and types of linked list in detail with example. CO2 L1 1

Course In charge DAEC HOD

You might also like