Data Stru. & Algo


Course Profile

Course Name:-

Algorithms & Data Structures

Course Code:-

CEN 215

Academic Year:-

2014-2015

Semester:-

First

Course Overview

This course provides completely understanding of algorithm development, and use a good algorithms in related to the problems which we solve, including: abstract data type unsorted list and sorted list, abstract data type stack and queue, Sorting, linked structures which include (implementing stack, queue, unsorted list, sorted list, all as a linked structure). programming with recursion(programming with recursively, verifying recursive function, writing recursive functions, using recursion to simplify solutions, recursive linked list, recursive version of binary search), binary search tress(iterative insertion and deletion), priority queues and heaps and graphs and sets, Tree Data Structure.

Course Details

Level:-

6

Credit:-

3(2-0-2)

Pre-Requisites:-

CEN 212

Co- Requisites:-


Learning Outcomes of Course

After successful completion of this course, student will be able to-

1. Pointers

2. Dynamic memory allocation

3. Linked lists.

4. Stacks

5. Queues

6. Trees (including Binary Search Tress)

7. Hash Tables

8. Utilizing various sorting algorithms.

Course Assessment

Name of Assessment Task

Weight of Assessment

Week Due

1. Midterm Exam-1

15%

Week 8

2. Midterm Exam-2

15%

Week 12

3. Quizzes + Assignments

10%


4. Laboratory

20%

Week 14

5. Final Exam

40%

Week 15

Assessment Task and Learning Outcomes Alignment

Assessment Task Name

Course Learning Outcomes

1

2

3

4

5

6

7

8

1. Midterm Exam-1






2. Midterm Exam-2






3. Quizzes








4. Assignments







5. Laboratory






6. Final Exam

Teaching Contact Details

Name of Course Coordinator:-

Ahsan Ahmed

Email of Course Coordinator:-

[email protected]

Lab/Tutorial Instructor:-

Ahsan Ahmed

Email of Lab/Tutorial Instructor:-

[email protected]

Office Hours:-

MONDAY: 12:00 Noon - 02:00 PM

Office Number:-

R-024-1-19-1, First Floor, CCIS Building

Office Phone Number:-

00966-16404-2536

Details of Required Text Book

Book Name

Authors Name

Publisher

Year

Edition

Data Structures and Algorithms in C++

[ISBN-10 : 0470383275

ISBN-13 : 9780470383278]

MichaelT. Goodrich, Roberto Tamassia, David M. Mount

John Wiley& Sons

2011

2nd

Details of Required Reference Books

Book Name

Authors Name

Publisher

Year

Edition

C++ plus Data Structures

ISBN-13: 9780763704810

Nell Dale

Jones & Bartlett Learning

2003

3rd

C ++: How to Program

ISBN-13: 978-0273752769

Paul Deitel

Harvey Deitel

Pearson

2012

8th

IT Resources

The following IT Resources will requireto access-

· Web References and downloads:

o http://www.cplusplus.com

o http://www.cprogramming.com

o http://en.wikibooks.org/wiki/Data_Structures

o Saudi Digital Library

· Faculty Website: http://faculty.mu.edu.sa/a.ahmed

· College Computer Laboratory for Practical Implementation

Course Schedule

Course Topics

Book’s Chapter

Event Name

Week Due

C++ Review

C ++: How to Program, Chapter-4-Control Statements Part 1,Chapter-5- Control Statements Part 2,Chapter-6-Fnctions,Chapter-7-Arrays and vectors,Chapter-9-Classes Part1, Chapter-10-Classes Part2


Week-1& 2

Algorithms and Analysis

C++ plus Data Structures,

Chapter 2-Design and Implementation


Week-3

Pointer

C ++: How to Program, Chapter-8-Pointers,


Week-4

Linked List

C++ plus Data Structures, Chapter3-ADT Unsorted List, Chapter 4-ADT Sorted List, Chapter 6- List Plus

Assignment- Due (to be submitted at the beginning of this class)

Week-5&6

Stack

C++ plus Data Structures, Chapter5-ADTs Stack and Queue


Week-7



First Midterm Exam

Week-8

Queues

C++ plus Data Structures, Chapter6-ADTs Stack and Queue

Quiz-1

Week-9 & 10

Trees

C++ plus Data Structures, Chapter8- Binary Search Trees


Week-11& 12



Second Midterm Exam

Week 12

Hash Tables

C++ plus Data Structures, Chapter9-Sorting and Searching Algorithms


Week 13

Graphs

C++ plus Data Structures, Chapter10-Priority Queues, Heaps, and Sets

Final Laboratory Exam

Week 14



Final Exam

Date and Time: TBA

Exam Week 15

Referencing Style

The American Psychological Association (APA) referencing style must be use for all submissions of this course.

Course Assessment Task

Assessment Name:-

Midterm Exam-1

Description of Task Assessment:-

This assessment is aligned to learning outcomes 1, 2 and 4. In that regard, the assignment contains questions that assess: 1) Pointers 2) Dynamic Memory Allocation 4) Stacks

Task Assessment Due Week/Date:-

Week8

Return Week/Date to Students:-

Week 9 (Evaluated copies will be shown to students)

Weight of Task Assessment:-

15%

List of Learning Outcomes Assessed:-

1. Pointers

2. Dynamic memory allocation

4. Stacks

Assessment Name:-

Midterm Exam-2

Description of Task Assessment:-

This assessment is aligned to learning outcomes 3, 4 and 5. In that regard, the assignment contains questions that assess: 3) Linked lists, 4) Stacks 5) Queues

Task Assessment Due Week/Date:-

Week12

Return Week/Date to Students:-

Week 13 (Evaluated copies will be shown to students)

Weight of Task Assessment:-

15%

List of Learning Outcomes Assessed:-

3. Linked lists

4. Stacks

5.Queues

Assessment Name:-

Quiz

Description of Task Assessment:-

This assessment is aligned to learning outcome 6. In that regard, the assignment contains questions that assess: 6) Trees

Task Assessment Due Week/Date:-

Week10

Return Week/Date to Students:-

Week 11 (Evaluated copies will be shown to students)

Weight of Task Assessment:-

5%

List of Learning Outcomes Assessed:-

6.Trees

Assessment Name:-

Assignment

Description of Task Assessment:-

This assignment is aligned to learning outcomes 1 and 2. In that regard, the assignment contains questions that assess: 1) Pointers and

2) Dynamic memory allocation

Task Assessment Due Week/Date:-

Week5

Return Week/Date to Students:-

Week 6 (Evaluated copies will be shown to students)

Weight of Task Assessment:-

5%

List of Learning Outcomes Assessed:-

1. Pointers

2. Dynamic memory allocation

Assessment Name:-

Final Exam

Weight of Task Assessment:-

40%

Duration:-

3 Hours

Warning:-

No Calculator Permitted

Exam Question Paper will be given to students.

Exam will be Closed Books.

List of Learning Outcomes Assessed:-

1. Pointers

2. Dynamic memory allocation

3. Linked lists

4. Stacks

5. Queues

6. Trees (including Binary Search Trees)

7. Hash Tables

8. Utilizing various sorting algorithms

الملفات المرفقة

  • Graphs (Graphs.pdf - B)
  • Tree (Tree in C++.pptx - B)

الساعات المكتبية

Sunday 10-12

Monday 9-10

Thursday 8-10

Final Exam

Final Exam

Starting soon...

Notice

Quiz Marks for IT 321 and IT 311 are displayed on Department Notice Board



Project

  • Human Resource Development Group: http://csirhrdg.res.in
  • Laxmi Devi Institute of Engineering and Technology: http://liet.org
  • Knowledge mapping System: Knowledge Repository
  • PaperLess Meeting Portal for Majmaah University college of Engineering
  • Employee Attendance System for Majmaah University

Seminar Conducted

  • AJAX and JSON: A New Approach to Web Applications
  • Knowledge Mapping System
  • Cloud Based CMS for Developers


Calendar



أرقام الاتصال

Ahsan Ahmed

Tel: 164046737 Ex. 6737

Fax: 064322785

[email protected]

Google


Calendar

إحصائية الموقع

عدد الصفحات: 29

البحوث والمحاضرات: 23

الزيارات: 7022