Scribd
Upload
9 views1 page

3rd Assignment BCA-202

This document outlines an assignment for the BCA 2nd Semester at M.M. Institute of Computer Technology & Business Management, focusing on Data Structures. It includes a series of questions related to searching and sorting algorithms, queues, and their complexities, along with expected learning outcomes and course objectives. The assignment is to be submitted by April 1, 2025, and covers various aspects of algorithm analysis and data structure understanding.

Uploaded by

aaravmishra0107.arerajkyp
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
9 views1 page

3rd Assignment BCA-202

This document outlines an assignment for the BCA 2nd Semester at M.M. Institute of Computer Technology & Business Management, focusing on Data Structures. It includes a series of questions related to searching and sorting algorithms, queues, and their complexities, along with expected learning outcomes and course objectives. The assignment is to be submitted by April 1, 2025, and covers various aspects of algorithm analysis and data structure understanding.

Uploaded by

aaravmishra0107.arerajkyp
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/ 1

M.M.

Institute of Computer Technology & Business Management Assignment:03


(Deemed to be University), Mullana
Session:2024-2025(Even) Class/Semester: BCA –2nd Semester (Section – H)
Subject Code: BCA-202 Subject Name: Data Structure
Lecture: 4 Tutorial:0
Max.MarksTheory: 60 Max.MarksSessional:40 Credits:4.0
Assigned Date: 21.04.2025 SubmissionDate:01.04.2025 Distribution Date:

Q.No. Questions Marks


(Total Marks - 30)
1. What is a searching algorithm? 01
2. What is the worst-case time complexity of Quick Sort? 01
3. What is best-case of the time and space complexity of Linear Search? 01
01
4. What is best-case time complexity of Binary search?
What is the difference between comparison-based and non-comparison-based 01
5.
sorting algorithms.
6. Why is sorting algorithm important? 01
7. Which sort algorithm works best on mostly sorted data? 02
8. Explain what the ideal Sorting algorithm is. 02
9. Explain how merge sort works with the algorithm. 04
10. What is Queue? Explain all the types of queues. 04
What is Double-Ended Queue? How the insertion and deletion performed at the 06
11.
beginning of Deque, illustrate with example.
12. Classify sorting algorithm with merits and demerits of Radix sort. 06

Assignment Outcome (AO):


i) Learn about stack and linked list data structure.
ii) Understand the algorithms of insertion in circular linked list, Insertion/deletion in stack.
iii) Understand the stack notation.
Course Outcome (CO): After completion of this course, student is able to:
1. Ability to analyze algorithms and algorithm correctness.
2. Ability to summarize searching and sorting techniques
3. Learn different typed of sorting techniques.
4. Ability to have knowledge of best sorting algorithms.
Bloom’s Taxonomy Level (BTL):
1. Remembering 2. Understanding 3. Applying 4. Analyzing 5.Evaluating 6. Creating

Question wise Mapping Matrix (with AO, CO, BTL) Weightage (in %age)
Q. No. 1 2 3 4 5 6 7 8 9 10 11 12 AO 1:50%, 2:25%, 3.25%
AO No. 1 2 2 1 2 1 2 1 2 2 3 2 CO 1:46%, 2:54%
CO No. 1 1 1 1 2 1 1 1 1 3 4 5 BTL 1:66%, 2:20%, 3:14%
BTL 1 1 1 1 2 2 2 1 1 3 4 5
Marks 1 1 1 1 1 1 2 2 4 4 5 5

You might also like