Scribd
Upload
69 views6 pages

EE213 Course Outline Ver 2

This 3-sentence summary provides the key details about the course outline: The course outline is for a 3-credit, semester-long Data Structures and Algorithms course at the University of Management and Technology for undergraduate students in computer engineering. The course will cover fundamental data structures, algorithms analysis, and specific algorithms and data structures including linked lists, stacks, queues, trees, hashing, heaps, and sorting. Student evaluation will be based on quizzes, assignments, a midterm exam, attendance, and a final exam.

Uploaded by

pathmakerpk
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
69 views6 pages

EE213 Course Outline Ver 2

This 3-sentence summary provides the key details about the course outline: The course outline is for a 3-credit, semester-long Data Structures and Algorithms course at the University of Management and Technology for undergraduate students in computer engineering. The course will cover fundamental data structures, algorithms analysis, and specific algorithms and data structures including linked lists, stacks, queues, trees, hashing, heaps, and sorting. Student evaluation will be based on quizzes, assignments, a midterm exam, attendance, and a final exam.

Uploaded by

pathmakerpk
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/ 6

University of Management and Technology

Course Outline
Course code: EE213 Course title: Data Structures and Algorithms

Program BSEE

Credit Hours 3

Duration Semester (15 Weeks)

Prerequisites CS 143 Programming Fundamentals

Resource Person Muhammad Rizwan


Khalid Ijaz

Counseling Timing See office doors

(Office # SEN-501,
510 )

[email protected]
Contact [email protected]

Chairman/Director signature………………………………….

Dean’s signature…………………………… Date………………………………………….

Course Learning Outcomes:

Course Outline Page 1


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

CLO 1: Define and relate the fundamentals data structures such as lists, queues, trees, etc.
(Level C-1)
CLO 2: Illustrate the concept of algorithm complexity analysis (Level C-2)
CLO 3: Compare tradeoffs in the design and implementations of the data structures (Level C-
2)
CLO 4: Select appropriate algorithms to use in specific applications (Level C-3)
CLO 5: Analyze time and space complexities of data structures and algorithms (Level C-4)

Mapping of CLOs to Program Learning Outcomes (PLOs):


CLO’s/PLO’s CLO1 CLO2 CLO3 CLO4 CLO5
1: Engineering Knowledge
    
2:Problem Analysis
 
3:Designing Skills

4: Investigation

5: Modern Tool Usage

6: Engineering& Society

7: Env. &Sust.

8: Ethics Learning

9: Team Work

10: Communication Skills

11:Project Management

12. Lifelong Learning

Learning Methodology:
 Lectures-combining facts, principles, concepts and generalizations
 Interactive learning activity
 Audio and visual aids (ppt slides etc)
 Employing humor related to concepts
 Providing motivational cues

Course Outline Page 2


 Emphasizing on important issues related to subject
 Reinforcing learning and clarifying misconceptions
Grade Evaluation Criteria
Following is the criteria for the distribution of marks to evaluate final grade in a
semester.
Marks Evaluation Marks in percentage
Quizzes & Assignments 25%
Mid Term 25
Attendance & Class Participation Nil
Final exam 50%
Total 100
Recommended Text Book:
M. A. Weiss. Data Structures and Algorithm Analysis in C. Pearson Education, second edition,
2008
Reference Books:

Calendar of Course contents to be covered during semester

Course code: EE213 Course title: Data Structures and Algorithms

Week Course Contents Reference Chapter(s) CLO’S

1
 C++ classes Chapter 1
1  Member functions
 constructors

 Pointers Chapter 1

Course Outline Page 3


2

 Mathematical background Chapter 2

3  Model
 What to analyze
 Running time calculations

1, 3

 Abstract Data Types (ADTs) Chapter 3

4  Simple Array implementation

1, 3

 Simple linked lists Chapter 3

5  Double linked lists


 Circular linked lists

1, 3

 Stack model Chapter 3

6  Implementation of stack
 Applications

1, 3

 The Queue ADT Chapter 3

Course Outline Page 4


1,3

 Trees Chapter 4

9  Implementation of trees
 Binary trees

1, 3

 AVL trees Chapter 4

10

1, 3

 Hashing Chapter 5

10  Hash function
 Chaining
 Hash tables without linked list
 Rehashing
1, 3

 Heaps Chapter 6

11  Binary heaps

1, 4, 5

 Sorting Chapter 5 , Chapter 6

12  Insertion sort
 Merge sort

Course Outline Page 5


1, 4, 5

 Internal Sorting Chapter 7

13  insertion sort, Heap sort, Merge sort

1, 4, 5

 Quick sort Chapter 7

14

 Graph algorithms 1, 3, 5

 Topological sort Chapter 9

15  Shortest path algorithm

Mapping of CLOs to Direct Assessments


Direct Assessments

Final Exam
Midterm
Quiz 1

Quiz 2

Quiz 3

Quiz 4

Quiz 5

Quiz 6

Exam

CLOs▼

1     
2   
3     
4   
5  

Course Outline Page 6

You might also like