CSC 302 Data Structures and Algorithms with C++

Transcription

1 CSC 302 Data Structures and Algorithms with C++ COURSE PARTICULARS Course Code: CSC 302 Course Title: Data Structures and Algorithms with C++ No. of Units: 3 Course Duration: Two hours of theory per week for 15 weeks. Status: Compulsory Course Address: montoyaan@yahoo.com Course Webpage: Prerequisite: NIL COURSE INSTRUCTORS Dr. S. A. Oluwadare Department of Computer Science, Federal University of Technology, Akure, Nigeria. Phone: saoluwadare@futa.edu.ng and Dr. (Mrs.) O. C. Agbonifo Department of Computer Science, Federal University of Technology, Akure, Nigeria. Phone: ocagbonifo@futa.edu.ng COURSE DESCRIPTION This course introduces students to the underlying principles of data structures and algorithms. It also helps to develop students understanding of the basic concepts of object-oriented programming using C++. This course also provides practical knowledge and hands-on experience in designing and implementing data structures and algorithms and their manipulation. Topics to be covered include introduction to C++ programming language, pointers and arrays, classes, recursion, stacks, queues, lists, tables, trees, binary trees, search trees, heaps and priority queues; sorting, hashing, garbage collection, storage management; and the rudiments of the analysis of algorithms. 1

2 COURSE OBJECTIVES The objectives of this course are to: develop students knowledge and understanding of the fundamental principles of data structures. develop students skills in analyzing data structures. build up students capacity to evaluate different algorithmic techniques. build up students capacity to write programs for developing simple applications. COURSE LEARNING OUTCOMES / COMPETENCIES Upon successful completion of this course, the student will be able to: (Knowledge based) describe the basic operations on arrays, lists, stacks and queue data structures. explain the notions of hashing, trees and binary search trees. describe the efficiency of algorithms with respect to the choice of data structures. explain the basic concepts of object-oriented programming. develop C++ programs for simple applications. (Skills) develop an efficient algorithm of a particular problem domain with respect to the choice of data structures translate the algorithms to application written in C++ GRADING SYSTEM FOR THE COURSE This course will be graded as follows: Class Attendance 5% Assignments 15% Test(s) 20% Final Examination 60% TOTAL 100% GENERAL INSTRUCTIONS Attendance: It is expected that every student will be in class for lectures. Attendance records will be kept and used to determine each person s qualification to sit for the final examination. In case of illness or other unavoidable cause of absence, the student must communicate as soon as possible with any of the instructors, indicating the reason for the absence. Academic Integrity: Violations of academic integrity, including dishonesty in assignments, examinations, or other academic performances are prohibited. You are not allowed to make copies of another person s work and submit it as your own; that is plagiarism. All cases of 2

3 academic dishonesty will be reported to the University Management for appropriate sanctions in accordance with the guidelines for handling students misconduct as spelt out in the Students Handbook. Assignments and Group Work: Students are expected to submit assignments as scheduled. Failure to submit an assignment as at when due will earn you zero for that assignment. Only under extenuating circumstances, for which a student has notified any of the instructors in advance, will late submission of assignments be permitted. Code of Conduct in Lecture Rooms and Laboratories: Students should turn off their cell phones during lectures. Students are prohibited from engaging in other activities (such as texting, watching videos, etc.) during lectures. Food and drinks are not permitted in the laboratories. READING LIST 1 Hubbard, J.R. (2000). Data Structures and Algorithms, Schaum s Outlines. McGraw-Hill, New York, USA, 407p. 1 Lewis, H.R., Denenberg, L., (1991). Data Structures and their Algorithms. Published by Addison-Wesley, UK. 509p. 2 Oluwadare, S.A., Agbonifo, O.C. (2013). Fundamentals of Data Structures and Algorithms. Lecture Notes 1- Available in Departmental Library 2- Lecture Note 3

4 COURSE OUTLINE Week Topic Remarks 1 An overview of C++ programming language: basic terms and operations 2 An overview of C++ programming language: basic terms and operations contd. 3 Data structures: definition of basic terms (data types, abstract data types and data structure. Importance of data structures in computer programming 4 Types of data structure: linear and non-linear data structure; Array: declaration, classification, application of arrays 5 List: operations, list implementation (array list, linked list), singly, doubly linked list, sorted list 6 Stack: operation, static and dynamic stacks, application of stacks 7 Queues: operations of queues, storing queues in static or dynamic data structures 8 Mid semester test Students are taken through the rudiments of the C++ programming language so that they could apply it to the study of data structures Students will be given simple programming assignments in C++ programming language Student should be sufficiently familiar with the basic terminologies used in data structure. Students should be able to appreciate the different data structures. Array data structure are treated in greater details on the practical application of lists on the practical application of stack on the practical application of stack 9 Trees: binary search trees, trees transversal (inorder, postorder, and preorder) 10 Common operations on a tree, application of trees in computer programming 11 Hashing and hash table, garbage collection, storage management 12 Analysis of algorithm, synergy between data structures and algorithm 13 Factors to be considered in the choice of data structures and algorithms 14 Practical implementation of linear data structures in C++ Practical applications of trees data in computer networking will be used as case study Assignment will be given to students on practical application of trees data structure The importance of hashing and garbage collection in memory management will be stressed The need for due consideration of the synergy between data structures and algorithms in data processing would be emphasized Students are to develop competency in the choice of data structures and algorithms in any given situation Various assignments on the practical implementation of data structures and algorithms that are due for submission should be completed and submitted during the 4

5 week 15 Revision General revision and evaluation of the course prior to examination. 5