Scribd
Upload
315 views2 pages

Question Bank (Chapter 1 and 2)

This document contains questions from chapters 1, 2, and 3 of a data structures question bank. Chapter 1 covers linear and non-linear data structures, operations on data structures, algorithms, time and space complexity, data structure classification, abstract data types, and Big O notation. Chapter 2 covers sorting and searching types like bubble sort, quick sort, radix sort, and linear, binary, and sequential searches. Example questions demonstrate these algorithms. Chapter 3 covers stacks and operations like PUSH and POP. It asks about overflow and underflow, stack representations using arrays and linked lists, and examples of PUSH and POP operations on a stack.

Uploaded by

khantaukirhasan
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
315 views2 pages

Question Bank (Chapter 1 and 2)

This document contains questions from chapters 1, 2, and 3 of a data structures question bank. Chapter 1 covers linear and non-linear data structures, operations on data structures, algorithms, time and space complexity, data structure classification, abstract data types, and Big O notation. Chapter 2 covers sorting and searching types like bubble sort, quick sort, radix sort, and linear, binary, and sequential searches. Example questions demonstrate these algorithms. Chapter 3 covers stacks and operations like PUSH and POP. It asks about overflow and underflow, stack representations using arrays and linked lists, and examples of PUSH and POP operations on a stack.

Uploaded by

khantaukirhasan
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

QUESTION BANK CHAPTER 1, 2 AND 3

Chapter 1
Answer the following question (2 marks)
1. Differentiate between linear and non-linear data structures on any two parameters?
2. Write any four operations that can be performed on data structure?
3. Define the term algorithm with properties?
4. Explain the term: time complexity and Space Complexity?
5. What is data structure and give its classification?
6. What is the Abstract data type with example?
7. Give any two applications or real-life examples of Data structure?
8. What is Big O notation?

Chapter 2
Answer the following question (2 marks)
1. Define sorting and give its type?
2. Define searching and give its type?
3. Difference between linear search and binary search on any two parameters?
4. Write an algorithm of bubble sort?
5. Write an algorithm of Quick Sort?

Answer the following question (4 Marks)


1. Sort the given number in ascending order using Radix sort: 348, 14, 641, 3851, 74
2. Describe the working of the Bubble sort method with an example?
3. Describe working of linear search with an example?
4. Differentiate between binary search and sequential search (linear search)?
5. Find the position of element 30 using Binary search method in array
A = {10, 5, 20, 25, 8, 30, 40}
6. Describe the working of Selection Sort Method. Also sort the given input list in
ascending order using selection sort.
Input list: 50, 24, 5, 12, 30
7. Sort the following numbers in ascending order using quick sort. Given numbers
50, 2, 6, 22, 3, 39, 49, 25, 18, 5
8. Sort the following number using Bubble sort 13,32,26,35,10
9. Write a C program for linear search (input array should be 10,7,3,5,1)?
10. Write a C program for Bubble Sort (input array should be 13,32,26,35,10)?
Chapter 3
Answer the following question (2 marks)
1. Define the term overflow and underflow with respect to stack.
2. Write algorithm for POP operation
3. Write algorithm for PUSH operation
4. Show the memory representation of the stack using an array with the help of a
diagram.

Answer the following question (4 Marks)


1. Show the effect of PUSH and POP operation on the stack of size 6. PUSH(10)
PUSH(20),PUSH(30),POP(30), PUSH(40)
2. Difference between memory representation of stack using array and Linked list

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