Scribd
Upload
87 views2 pages

Assignment No-1 Submission Date: 08-10-2021: Subject: Data Structure and Algorithms (PCC-CSE-203-G) Cse 3 Semester

The document contains instructions for Assignment No-1 on data structures and algorithms. It lists 25 questions to be answered in order related to key concepts like data types, linear and non-linear data structures, searching and sorting algorithms, time and space complexity, stacks, infix to postfix conversion, and evaluation of postfix expressions. It also provides contact information for the instructor, Dr. Mohd Shahid, and specifies that assignments should be submitted on Google Classroom by the due date of 08-10-2021.

Uploaded by

Dipanshu Aggarwal
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
87 views2 pages

Assignment No-1 Submission Date: 08-10-2021: Subject: Data Structure and Algorithms (PCC-CSE-203-G) Cse 3 Semester

The document contains instructions for Assignment No-1 on data structures and algorithms. It lists 25 questions to be answered in order related to key concepts like data types, linear and non-linear data structures, searching and sorting algorithms, time and space complexity, stacks, infix to postfix conversion, and evaluation of postfix expressions. It also provides contact information for the instructor, Dr. Mohd Shahid, and specifies that assignments should be submitted on Google Classroom by the due date of 08-10-2021.

Uploaded by

Dipanshu Aggarwal
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/ 2

Assignment No-1

Submission Date: 08-10-2021


Subject: Data Structure and Algorithms (PCC-CSE-203-G)
CSE 3rd Semester
Instructions:
• You will submit (upload) this assignment in Google Classroom. Email/paper submissions
will not be accepted.
• There are 25 questions in this assignment.
• Assignment submitted after due date will not be evaluated and a score of zero will be
awarded for this assignment.
• Questions must be answered in the given order.
• Name this document as A1_2021_Mohd_Shahid.pdf in case your name is Mohd Shahid.

1) Explain the following terms:


Data, Information, Data Type, Abstract Data Type (ADT), Entity, File, Record
Insertion, Deletion, Traversing
2) What is a Data Structure?
3) What is Algorithm? What are the properties of algorithm?
4) What are Linear Data Structures and Non-Linear Data Structures?
5) What are the various operations that can be performed on different Data
Structures?
6) Differentiate between Linear Search and Binary Search?
7) Given an array of n elements, write an algorithm to search a given element x in the
array.
23, 45, 2, 56, 0, 93, 29, 37, 84
8) What is algorithm? What are the characteristics of algorithm?
9) Differentiate between Space and Time Complexity.
10) Write algorithm to find the root of quadratic equations?
11) What is Stack?
12) What are the basic operations performed on a stack?
13) How do you represent a stack in C?
14) Why stack is called a LIFO data structure?
15) What is the significance of the top in a stack?
16) When do you say stack is full and stack is empty?
17) Write algorithm to perform push and pop operations.
18) List the application of the stack in computers.
19) Write algorithm for converting infix expression to postfix expression.
20) Write algorithm to evaluate a postfix expression

Dr. Mohd Shahid | shahid27.jmi@gmail.com | 9625855594


21) Evaluate the following expression AB + C * D if A = 2, B = 3, C = 4 and D =5.
22) Convert A + (B * C – (D / E – F) * G) * H into postfix form showing stack status after
every step.
23) Transform the following infix expression to their equivalent postfix expressions:
a) A - B / C
b) (A * B) + (C – D)
c) ((A / B)/C) + D
d) (A + B) * D + E / (F + G + D)
24) Write a c program to accomplish the following stack operations.
a) Push b) Pop c) Stack_empty d) Stack_full e) Display
25) Evaluate the following expressions in tabular form showing stack after every step.
a) 9 8 7 * +
b) 40 25 + 20 5 * 3 +
c) 21 18 8 ^ / 9 +
d) 7 6 + 4 * 4 10 - ^ 5 +
e) 5 6 2 + * 12 4 / -

Dr. Mohd Shahid | shahid27.jmi@gmail.com | 9625855594

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy