Scribd
Upload
25 views4 pages

CourseOutline 0613-2107

Uploaded by

rahman.safayet999
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
25 views4 pages

CourseOutline 0613-2107

Uploaded by

rahman.safayet999
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/ 4

Course Code (BNQF): 0613-2107 Course Title: Data Structure Credits: 3.

Rationale of the Course: Data structure analysis is an important element of computer science. In a computer,
a data structure is a logical and mathematical model for storing and arranging data in a certain way. The
methodologies and techniques of data structures are frequently employed in system programming and application
programming. Students may construct logical and organized programs by studying data structure.

Course Contents: Concepts and examples of elementary data objects. Elementary data structures. Arrays. List,
stacks, queues. Trees. Graphs. Memory management. Sorting and searching. Hash techniques. Files: Files
queries, Sequential organizations. Indexing Techniques: Cylinder and surface indexing, hashed indexes, B trees,
tree indexing. Symbol tables. Hash tables.

Course Outcomes (COs) and Mapping of COs with Bloom’s Taxonomy Level:

By the end of this course, students will be expected to


Bloom’s
Sl. No. COs Taxonomy
C A P
Illustrate the fundamental Data Structures including array, linked-lists, trees,
CLO1 Binary Search Trees, and AVL trees, stacks, queues, Graph, priority queues, C4
hash-tables and sorting.
CLO2 Explain the algorithmic complexity. C2
CLO3 Analyze the algorithmic complexity of simple, non-recursive programs C4
Select appropriate data structures and algorithms for problems and to justify that
CLO4 C4
choice.

Mapping Course Learning Outcomes (CLOs) with the PLOs


PLOs
CLOs 1 2 3 4 5 6 7 8 9 10 11 12
CLO1 √
CLO2 √
CLO3 √
CLO4 √
Teaching-Learning Strategy (TLS):
TL
Lectures on different topics twice a week using multimedia
S1
TL
Active discussion in class regarding efficient solving of critical problems.
S2
TL
Group discussion and presentation regarding diverse problems and corresponding lectures.
S3
TL
Evaluation of class performances to reach each student in a class for every topic.
S4

Mapping Course Learning Outcomes (CLOs) with the Teaching-Learning & Assessment
Strategy
CLO Teaching-Learning Strategy Assessment Strategy
Class Performance, Quiz, Assignment, Spot Test,
CLO1 TLS1, TLS2, TLS3, TLS4
Presentation, Viva, Mid Term, Semester Final

CLO2 TLS1, TLS2, TLS3, TLS4 Class Performance, Quiz, Mid Term

Class Performance, Quiz, Assignment, Viva, Mid Term,


CLO3 TLS1, TLS2, TLS4
and Semester Final
Class Performance, Quiz, Assignment, Spot Test,
CLO4 TLS1, TLS2, TLS3, TLS4
Presentation, Viva, Mid Term, and Semester Final

Tentative Planning:
Week Topic

1 Introduction and Overview, Elementary Data Organization

Basic Data Structure Operations

Abstract Data Types (ADTs)

2 Introduction to Array

3 Array search and Sorting


4 Asymptotic notation

5 Linked list

6 Stack and its Application

7 Stack and its Application

8 Queue
Applications of Queues

9 Queue
Applications of Queues

10 Tree

11 Tree

12 Graph-01

13 Graph-02

14 Sorting Techniques

15 Sorting Techniques

Part-B

Assessment and Evaluation

1) Assessment Strategy: Class Performance, Quiz, Assignment, Project, Report,


Spot Test, Presentation, Viva, Mid Term, and Semester Final
2) Marks distribution:

Components Grading

Attendance 10%

Presentation 10%

Homework/Project/Assignment 10%

Quizzes 10%

Mid-term Examination 20%

Final Examination 40%

Part C
Learning Materials
1. Lipschutz, Seymour, and G. A. Pai. "Data Structures." Tata McGraw-Hill Publishing
Company Limited, 2008.
2. Kernighan, Brian W., and Dennis M. Ritchie. The C programming language.
(2006).
3. Dr. E. Balagurusamy. Programming In Ansi C. Tata McGraw-Hill Education,
2002.

You might also like