Scribd
Upload
185 views3 pages

CSC 2302 Syllabus - Spring 2019

This document provides information about the Data Structures course offered in the spring 2019 term. It outlines details like the course number, class times, instructor information, intended learning outcomes, topics to be covered over the semester, textbook information, assessment breakdown, and important notes. The course is designed to teach fundamental data structures concepts like queues, stacks, trees and graphs using C language. Students will learn to analyze algorithms using Big O notation and apply concepts like dynamic memory allocation and recursion to data problems.

Uploaded by

Amine Naitlho
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
185 views3 pages

CSC 2302 Syllabus - Spring 2019

This document provides information about the Data Structures course offered in the spring 2019 term. It outlines details like the course number, class times, instructor information, intended learning outcomes, topics to be covered over the semester, textbook information, assessment breakdown, and important notes. The course is designed to teach fundamental data structures concepts like queues, stacks, trees and graphs using C language. Students will learn to analyze algorithms using Big O notation and apply concepts like dynamic memory allocation and recursion to data problems.

Uploaded by

Amine Naitlho
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/ 3

A.

The Course

Title : Data Structures Room : Build 05 Room 107


Course no : CSC2302 Term : Spring 2019
Class Hours : TR 12:30-13:50

B. The Instructor

Name : Kevin SMITH Room : Build 5 Room 4


E-mail : [email protected] Phone : 2114
Office Hours : M: 15:00 - 17:00
F: 11:00 - 13:00

C. Course Description
CSC2302 is a fundamental course designed for students who can already program in C
language.
The course introduces the Concept of “Data Structures” by examining its different instances
(queues, stacks, trees, graphs …) along with the fundamental associated operations
(Traversal, Deleting, updating ….)
One important concept that will be discussed is evaluating time and space complexity for an
algorithm. Big O notation will be used for this purpose.

D. Intended Learning Outcomes (ILOs)


Students successfully completing the course will be able to:
• Demonstrate an overall understanding of concepts of structuring data
• Create, open, read/write from text files
• Create, open, read/write from binary files
• Analyze simple code with Big-O notation
• Apply Dynamic Memory Allocation
• Create, search, add, delete from linked lists
• Create, insert, delete from queues
• Create, push, pop from stacks
• Implement simple recursive algorithms
• Create, search, add, delete from binary trees
• Create, search, add, delete from general trees
• Create, search, add, delete from heaps
• Create, search, traverse, add, delete from graphs
• Create, insert, look up from hash tables
E. Text books
Computing programming 1 book for the first chapters.
Electronic resources will be used throughout.

F. Course contents

Weeks Topics
1 Jan_14 • Syllabus Discussion
• Structures
2 Jan_21 • Structures
3 Jan_28 • Text/Binary Files
• Big-O and ADT
4 Feb_4 • Dynamic Memory
Allocation
• Linked Lists
5 Feb_11 • Linked Lists( Cont..)
6 Feb_18 • Linked Lists( Cont..)
Exam 1
7 Feb_25 • Queues
8 Mar_4 • Spring Break
9 Mar_11 • Stacks
• Recursion
10 Mar_18 • Trees
Mar_20: Last day to
drop a class with a W
11 Mar_25 • Trees (Cont)

12 Apr_1 • Heaps
• Exam2
13 Apr_8 • Graphs
14 Apr_15 • Graphs
15 Apr_22 • Hashing
16 Apr_29 Apr_30: Last Regular
Class Day

2
G. Pedagogic Methodology
Student grades will be based on two tests, a final exam, quizzes, set of homework, and
attendance.
Tests: Tests and exams will be given in-class. An excused absence for a test upon agreement
and provided before the test will allow the student to take a makeup for that test. Expect
makeup tests to be more difficult than the original test.
Quizzes: You will have a quiz every time we finish a chapter. Quizzes will be used to test
your understanding about the material covered and also your preparation for the exams. The
lowest quiz grade will be dropped and there will be no make up for any missed quiz.
Attendance Class attendance will be a critical part of this course. In addition to the
University penalty for absences, you will lose 1 point from your attendance grade (5/100) for
every non excused absence.
Assignments: You will have a set of 5 Homework throughout the semester and you need to
choose a partner to work with.

H. Assessment
Your final grade will be a combination of the following:

Exam 1 20%

Exam 2 20%

Final Exam 25%

Homework 15%

Quizzes 15%

Attendance 5%

I. Important Points
You need to be serious about this class; this means:
a. be disciplined inside class
b. You need to take notes during class time
c. Coding, not copy the code, outside class time
This syllabus is prone to change.

You might also like