Scribd
Upload
4 views

Assignment01 Data Structure

The document outlines an assignment for students at Acharya Institute of Technology, focusing on evaluating expressions and implementing data structures such as stacks and queues. It includes various types of questions, including descriptive, numerical, multiple-choice, and problem-solving types, along with guidelines and rules regarding submission and plagiarism. The assignment aims to enhance students' understanding of data structures and their applications.

Uploaded by

Priyanka G.N
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
4 views

Assignment01 Data Structure

The document outlines an assignment for students at Acharya Institute of Technology, focusing on evaluating expressions and implementing data structures such as stacks and queues. It includes various types of questions, including descriptive, numerical, multiple-choice, and problem-solving types, along with guidelines and rules regarding submission and plagiarism. The assignment aims to enhance students' understanding of data structures and their applications.

Uploaded by

Priyanka G.N
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/ 5

ACHARYA INSTITUTE OF TECHNOLOGY,

BENGALURU 560107
Assignment 1
Handout Date: 04/03/23 Submission Date: 17/03/23
Objective (CO1):
Evaluate the Expressions like postfix and prefix conversions.
Implementing various data structures viz. Stacks, Queues.

Outcome (PO1):
A student should be able to evaluate infix, postfix, and prefix expressions.
Students are able to understand the basic data Structure and use of them.

Based on Module 1

Type 1: Descriptive Type

What are some applications of Data Structure? 3 Marks


Describe the types of data structures? 5 Marks
What is Stack Data Structure? What are the applications of Data Structure? 5 Marks
Difference between file structure and storage structure? 3 Marks
Write the steps involved in inserting and deleting an element in the stack? 8 Marks
How are the elements of a 2D array stored in the memory? 4 Marks

Acharya Institute of Technology (MCA) Page 1 of 5


Type 2: Numerical Type

A. Convert the following infix expression into postfix & Prefix expression using
Application Stack: - [10 Marks] {Arithmetic way also} 10 Marks

a. A + (B*C-(D/E^F)*G)*H
b. A+ (B*C+D)/E

B. Convert the following Postfix expression into an infix expression using


Application Stack :- ( Arithmetic way also )
10 Marks

a. ABCDEF^/*G*H*+

Type 3: MCQ Type ( Please write a line Explanation of why you choose the option)

A. Which the following is/are the levels of implementation of data structure 1 Marks
a. Abstract level.
b. Application level.
c. Implementation level.
d. All of the above.

B._____________ is not the component of data structure.


a. Operations.
b. Storage Structures.
c. Algorithms.
d. None of the above.

C.__________ is very useful in situations when data has to be stored and then retrieved in reverse
order.
a. Stack
b. Queue
c. List
d. Link list

D. Which of the following data structures can’t store the non-homogeneous data elements?
a. Arrays
b. Records
c. Pointers
d. Stacks

Acharya Institute of Technology (MCA) Page 2 of 5


Type 4: Problem-Solving Type

a. Write an algorithm to convert infix to postfix expression: 05 Marks

Based on Module 2

Type 1: Descriptive Type

A. What is Recursion? Advantages of Using recursion in Data Structure? 5 Marks


B. What is Queue? Explain Various types of Queues and operations performed on it. 10 Marks
C. Define Circular Queue? Write down the Advantages of a Singular Queue: - 8 Marks
D. Explain the priority Queue with proper explanation: - 5 Marks

Type 2: MCQ Type ( Please write a line Explanation of why you choose the option)

A. Circular Queue is also called ________ 1 Marks


a) Square Buffer
b) Ring Buffer
c) Rectangle Buffer
d) Curve Buffer
e) None of these
B. Which elements not in middle but can be inserted or deleted at/from both the ends?
a) Circular queue
b) Priority queue
c) Queue
d) DE queue
e) All of these

C. Major role of queue server in ______________


a) Simulation of heapsort
b) Simulation of arbitrary linked list
c) Simulation of limited resource allocation
d) Simulation of recursion
Acharya Institute of Technology (MCA) Page 3 of 5
e) Both a & b
D. Which is not the type of queue?
a) Single-ended queue
b) Ordinary queue
c) Circular queue
d) Priority queue
e) Both c & d
E. Which of the following problems can’t be solved using recursion?
a) Factorial of a number
b) Nth fibonacci number
c) Length of a string
d) Problems without base case

Type 3: Problem-Solving Type

A. Implement the Tower of Hanoi Problem using C. 8 Marks


B. Write a Recursion algorithm for Fibonacci Series. 5 Marks
C. Write a algorithm for performing insert and delete using Circular Queue. 5 Marks

Instruction:

➢ Answer all the given questions/tasks.


Guidelines

Follow the guidelines mentioned below for your assignment.

➢ Handwritten assignments ONLY will be accepted


➢ The assignment should have the following information.
▪ Assignment Name
▪ Class
▪ Section
▪ Student name
▪ Student AUID/USN
Acharya Institute of Technology (MCA) Page 4 of 5
➢ Use page numbers
➢ Use Diagrams and Examples to explain your topic.
Rules & Regulations

• If any topic or diagram of an assignment is found copied from the other then marks will
be deducted from both assignments.
• Assignments with 3 or more identical topics will be awarded 0 Marks.
• The purpose of assignment is to do some research work so you can consult books in
Library or use internet or computer magazines or any other source.

Plagiarism Policy
Plagiarized documents, in parts or whole, submitted by the students will be rejected. However, if
the plagiarism is found to be accidental the student may be advised to re-submit the work only
once within one week from the date of rejection.

A penalty of 25% of the total marks on the specific coursework assessment component will
be imposed on the re-submitted work. If the re-submitted work is also found to be plagiarized the
student will be awarded a zero mark in the respective assessment. If the work submitted is found
to be intentionally plagiarized to gain an unfair advantage in any form, such work will be
automatically rejected and a mark of zero will be awarded. If the student is found to consistently
submit plagiarized work it will be dealt with seriously and may warrant suspension for a period or
expulsion as may be recommended by the committee set for the purpose.

Late Submission

Penalty for late submission - 5% of the maximum mark specified for the assessment will be
deducted for each working day. Assessment documents submitted beyond a period of one week
after the last date of submission will not be accepted and will be marked as zero for that assessment.

Note: Must follow assignments instructions.

__________________________

(Signature of Subject Coordinator)

Acharya Institute of Technology (MCA) Page 5 of 5

You might also like