Quiz Mid Semester Examination 2

Seminars University Examination

Problem Based Learning (PBL) Short Answer Questions (SAQ)
Journal Club Long Answer Question (LAQ)

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 C04

Quiz ✓ ✓ V I
Assignment / Presentation ✓ V V V
Unit test V V ✓ V
Mid Semester Examination 1 ✓ V V V
Mid Semester Examination 2 V V V V
University Examination ✓ ✓ V I

Feedback Process Student's Feedback

References: 1. Levin, R.I. and Rubin D.S., Statistics for Management, Pearson Education.

2. Gupta, S.P. and Gupta, M.P., Business Statistics, Sultan Chand and Sons.

3. Sharma, J.K., Business Statistics, Vikas Publication House Pvt. Ltd.

Faculty of Engineering and Technology

Name of the Department Computer Science & Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data Structure and Algorithms using C
IL
 Academic Year I
Semester II
Number of Credits 3
Course Prerequisite
Programming Fundamentals
Course Synopsis
In this course, students will learn about a variety of data structures
such as hash tables, search trees, tries, heaps, graphs, and analyze
the algorithms to determine the time and computation complexity.
Course Outcomes:

At the end of the course students will be able to:

CO1
Analyze the algorithms to determine the time and computation complexity
and justify the correctness
CO2
Write algorithms concerning various data structures like Stack, Queue, Linked list,
Graph search and traversal techniques
CO3
Introduces a variety of data structures such as hash tables, search trees,heaps, graphs
CO4
Introduces sorting and pattern matching algorithms.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs P01 P02 P03 PO4 P05 P06
P07 P08 PS01 PSO2 PSO3
CO1 3 2 2 2 1 1
CO2 3 2 2
3 1
CO3 3 2 3 2
1
C04 3 3 2 2 2 1 1
Average 3 1.2 2 1 2 0.7 1 1
Course Content:

L (Hours/Week) T P (Hours/Week) Total Hour/Week

(Hours/Week)
3
3
Unit
Content & Competencies
1 Introduction:

Definition of data structures and abstract data types, Static and Dynamic
implementations, Examples and real-life applications (Cl: Knowledge)

Construct Arrays: ordered lists, representation of arrays, sparse matrices, polynomial

arithmetic (C6: Synthesis)

Running time:
Analysis of Algorithms and their complexities: Time Complexities, Big — Oh -
notation, Running Times, Best Case, Worst Case, Average Case, Factors depends on
running time (C4: Analysis)
Implement Recursion (C3: Application)
Implement Divide and Conquer Algorithm, Time & Space Trade-off (C3:
Application)

Queues and Lists:

Construct Linked Lists: Singly linked lists (C6: Synthesis)
Analyze the Representation of linked lists in memory (C4: Analysis)
Apply Traversing, Searching, Insertion into, Deletion from linked list
(C3: Application)

0;,
 2 The Stacks:

Evaluate ADT Stack and its operation (C5: Evaluation)

Apply Array based implementation of stacks (C3: Application)

Apply Linked List based implementation of stacks (C3: Application)

Examples: Infix, postfix, prefix representation, Conversions, Applications, Algorithms

and their complexities
3 Trees:

Basic Terminology (Cl: Knowledge)

Construct Binary Trees and their representation, expression evaluation, Complete

Binary trees, Extended binary trees, traversing binary trees (C6: Synthesis)

Graphs:

Describe Terminology and Representations (C2: Comprehension)

Design Graphs & Multigraphs, Directed Graphs, Sequential representation of graphs

(C6: Synthesis)
4 Sorting Algorithms:

Introduction to sorting algorithms (Cl: Knowledge)

Implement Sorting by exchange, selection sort, insertion sort, Bubble sort, Straight
selection sort, Efficiency of above algorithms (C3: Application)

Apply Merge sort, Quick sort Algorithm analysis, heap sort: Heap Construction, Heap
sort, bottom — up, Top — down (C3: Application)

Analyze Heap sort approach (C4: Analysis)

Design Searching Algorithms: Straight Sequential Search, Binary Search (C6:

Synthesis)
Teaching Learning Strategies and Contact Hours

Learning Strategies Contact Hours

Lecture 32
Practical
Seminar/Journal Club 2
Small group discussion (SGD) 2
Self-directed learning (SDL) / Tutorial 1
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) 2
Revision 4
Others If any:
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Quiz Mid Semester Examination 2
Seminars University Examination
Problem Based Learning (PBL) Short Answer Questions (SAQ)
Journal Club Long Answer Question (LAQ)

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 C04

Quiz ✓ ✓ ✓ ✓
Assignment / Presentation ✓ ✓ ✓ ✓
Unit test ✓ ✓ V ✓
Mid Semester Examination 1 ✓ ✓ ✓ ✓
Mid Semester Examination 2 ✓ ✓ ✓ ✓
University Examination ✓ ✓ ✓ ✓
Feedback Process
Student's Feedback

References:
1.E. Horowitz and S. Sahani, "Fundamentals of Data Structures",
Galgotia Book source Pvt. Ltd.
2.R. L. Kruse, B. P. Leung, C. L. Tondo, "Data Structures and program
design in C", PHI
3. Schaum's outline series, "Data Structure", McGraw Hills.
 Faculty of Engineering and Technology
Name of the Department Computer Science & Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data Structure and Algorithms using C Lab
Academic Year I
Semester II
Number of Credits 1
Course Prerequisite Programming Fundamentals
Course Synopsis In this course, students will learn to design and implement data
structure algorithms using C.
Course Outcomes:
At the end of the course students will be able to:
CO1 Analyze the algorithms to determine the time and computation complexity
and justify the correctness.
CO2 Implement a given Search problem (Linear Search and Binary Search).
CO3 Write algorithms concerning various data structures like Stack, Queue, Linked list,
Graph search and traversal techniques and analyze the same to determine the time and
computation complexity
C04 Write an algorithm for Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge
Sort, Heap sort and compare their performance in terms of Space and time complexity.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs P01 P02 P03 PO4 P05 P06 P07 P08 PSO1 PSO2 PSO3

CO1 2 2 3 1 2 - 1 - 1 2 -

CO2 2 - 3 - 2 - - - - - -

CO3 2 - 3 - 2 - - - 3 - -

C04 2 2 3 3 2 - 3, - 2 1 -

Average 2 1 3 1 2 - 1 - 1.5 0.75 -

I
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week)
Total Hour/Week
2 2
Unit
Content & Competencies
1
Write a program for multiplication and transpose of array (Cl: Knowledge)
2
Write a program to compute the transpose of a sparse matrix (Cl: Knowledge)
3
Implement a program to implement push and pop operation in Stack (C3: Application)
4
Write a program to convert an Infix notation to postfix notation using stacks (Cl:
Knowledge)
5
Develop a program to evaluate postfix notation using stacks (C6: Synthesis)
6
Write a program to implement a linear queue (Cl: Knowledge)
7
Demonstrate a program for swapping two numbers using call by value and call by
reference strategies (C3: Application)
8
Develop a program to insert and delete a node in the linked list. The number of nodes
to inserted and deleted should be governed by user (C6: Synthesis)
9
Write a program to implement a linear search arrays and linked list (CI : Knowledge)
10
Using iteration and recursion concepts write programs for finding the element in the
array using the Binary search method (C6: Synthesis)
11
Write the programs to implement bubble sort (Cl: Knowledge)
12
Write a program using iteration and recursion concepts for quicksort (Cl: Knowledge)
13
Write a program to implement the tree traversal methods (Cl: Knowledge)
14
Write a program that implements the following i) Insertion sort ii) Merge sort iii) Heap
sort (Cl: Knowledge)
15
Write a program to perform the following operations: a) Insert an element into a AVL
tree. b) D3lete an element from a AVL tree. c) Search for a key element in a AVL tree.
(C 1: Knc wledge)
Teaching - Learning Strategies and Contact Hours

Teaching - Learning Strategies Contact Hours

Lecture --
Practical 30
Seminar/Journal Club --
Small group discussion (SGD) 20
Self-directed learning (SDL) / Tutorial --
Problem Based Learning (PBL) 10
Case/Project Based Learning (CBL) --
Revision --
Others If any: --
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) --
Viva-voce Practical Examination & Viva-voce
Objective Structured Practical Examination University Examination
(OSPE)
Quiz --
Seminars --
Problem Based Learning (PBL) --
Journal Club --

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 C04

Quiz
VIVA ✓ ✓ ✓ ✓
Assignment / Presentation
Unit test
Practical Log Book/ Record Book ✓ ✓ ✓ ✓

ul/
Mid-Semester Examination 1
Mid-Semester Examination 2
University Examination

Feedback Process
Student's Feedback

References:
I.E. Horowitz and S. Sahani, "Fundamentals of Data Structures",
Galgotia Book source Pvt. Ltd.
2.R. L. Kruse, B. P. Leung, C. L. Tondo, "Data Structures and
program design in C", PHI
3. Schaum's outline series, "Data Structure", McGraw Hills.