Scribd
Upload
36 views2 pages

Analysis of Algorithm and Data Structures

The document outlines the course curriculum for the Bachelor of Computer Applications (BCA) program for the session 2024-25, specifically focusing on the course 'Analysis of Algorithm and Data Structures.' It covers key topics such as algorithm design techniques, data structures including arrays, linked lists, stacks, queues, and trees, along with relevant textbooks and online resources. The course aims to enhance employability by equipping students with problem-solving skills and knowledge of software development tools.

Uploaded by

प्रधान जी
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
36 views2 pages

Analysis of Algorithm and Data Structures

The document outlines the course curriculum for the Bachelor of Computer Applications (BCA) program for the session 2024-25, specifically focusing on the course 'Analysis of Algorithm and Data Structures.' It covers key topics such as algorithm design techniques, data structures including arrays, linked lists, stacks, queues, and trees, along with relevant textbooks and online resources. The course aims to enhance employability by equipping students with problem-solving skills and knowledge of software development tools.

Uploaded by

प्रधान जी
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

Course Curriculum (for Session 2024-25)

Bachelor of Computer Applications (BCA)

BCAC 0026: ANALYSIS OF ALGORITHM AND DATA STRUCTURES


Objective: This course is designed to provide an introduction to the Analysis of Algorithm and Data
Structure.

Credits: 04 L–T–P: 4–0–0


Module Teaching
Content
No. Hours
Introduction: Basic Design and Analysis techniques of Algorithms, time and space
complexity, Correctness of Algorithm.
Algorithm Design Techniques: Iterative techniques, Divide and Conquer, Dynamic
Programming, Greedy Algorithms.
Arrays: Single and Multi-dimensional Arrays, Sparse Matrices.
I 30
Searching Techniques and Complexity Analysis: Linear and Binary search, Medians &
Order Statistics.
Sorting Techniques: Elementary sorting techniques-Bubble Sort, Insertion Sort,
Selection Sort, Merge Sort, Advanced Sorting techniques-Heap Sort, Quick Sort,
Sorting in Linear Time-Bucket Sort, Radix Sort and Count Sort.
Recursion: Developing Recursive Definition of Simple Problems and their
implementation; Advantages and Limitations of Recursion.
Linked Lists: Singly, Doubly and Circular Lists, representation of Stack and Queue as
Linked Lists.
II Stacks and Queues: Implementing stack using array and linked list, Prefix, Infix and 30
Postfix expressions, Utility and conversion of these expressions from one to another;
Array and Linked representation of Queue, De-queue, Priority Queues.
Trees: Introduction to Tree as a data structure; Binary Trees, Binary Search Tree,
(Creation, and Traversals of Binary Search Trees).

Text Book:
 Cormen T.H., Leiserson Charles E., Rivest Ronald L., Stein Clifford, Introduction to Algorithms, PHI Learning Pvt.
Ltd., 2009, 3rd Edition.
Reference Books:
 Basse Sara & A.V. Gelder, Computer Algorithm: Introduction to Design and Analysis, Pearson, 2000, 3rd Edition.
 Drozdek Adam, "Data Structures and algorithm in C++", Cengage Learning, 2012, Third Edition.
 Tenenbaum Aaron M., Augenstein Moshe J., Langsam Yedidyah, "Data Structures Using C and C++, PHI, 2009,
Second edition.
 Kruse Robert L., "Data Structures and Program Design in C++", Pearson.

Suggestive digital platforms web links or online course


 https://www.oercommons.org/authoring/14873-data-structure/view
 https://www.oercommons.org/courses/data-structure-and-algorithms
 https://onlinecourses.swayam2.ac.in/cec19_cs04/preview (online course)

Focus: This course focuses on Employability under CO1, CO2 and CO3.
Outcome: A student who successfully completes the course will have the ability to:
CO1: Understand that various problem solving categories exist such as; iterative technique, divide and conquer,
dynamic programming, greedy algorithms, and understand various searching and sorting algorithms.
CO2: Employ a deep knowledge of various data structures when constructing a program.
CO3: Design and construct simple object-oriented software with an appreciation for data abstraction and information
hiding.

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology


Course Curriculum (for Session 2024-25)
Bachelor of Computer Applications (BCA)

CO4: Effectively use software development tools including libraries, compilers, editors, linkers and debuggers to write
and troubleshoot programs.

Mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs):

COs POs/ PSOs

CO1 PO1,PO2 / PSO3

CO2 PO2/PSO1

CO3 PO3/PSO1,POS2

CO4 PO1,PO4/POS1,PSO3

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

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