Scribd
Upload
149 views3 pages

COMP 610 Syllabus: Course Description

This syllabus outlines a course on data structures and algorithms that introduces key concepts like time/space complexity, core data structures like arrays and linked lists, and algorithms like sorting and searching. Students will complete weekly quizzes, assignments, exams, and a final project. The course aims to help students understand fundamental data structures and algorithms, master common structures, analyze algorithm efficiency, and apply techniques like recursion and dynamic programming. The syllabus lists 16 weekly topics that will be covered over the semester.

Uploaded by

Jatin 7866
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
149 views3 pages

COMP 610 Syllabus: Course Description

This syllabus outlines a course on data structures and algorithms that introduces key concepts like time/space complexity, core data structures like arrays and linked lists, and algorithms like sorting and searching. Students will complete weekly quizzes, assignments, exams, and a final project. The course aims to help students understand fundamental data structures and algorithms, master common structures, analyze algorithm efficiency, and apply techniques like recursion and dynamic programming. The syllabus lists 16 weekly topics that will be covered over the semester.

Uploaded by

Jatin 7866
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

COMP 610 Syllabus

Course description:

Data Structures and Algorithms: This course introduces students to design strategies for data structures
and algorithms, theoretical limits to space and time requirements, time/space trade offs, and open
problems in the field.

Course objective(s) and learning outcomes:

- Understand the concepts, theory and fundamentals of data structures and algorithms
- Master the core data structures including arrays, linked lists, hash tables, stacks and queues, and
trees and graphs
- Acquire and apply the knowledge of algorithms complexity and running time analysis and
memory footprint
- Practice key programming techniques such as recursion and dynamic programming
- Compare and contrast the basic sorting and searching algorithms
- Establish a bridge towards the practical and hands-on experience with application and system
programming
- Have fun and learn :-)

Text book:

No textbooks are required or mandatory for this course


Topics and grading:

Wk Primary Topics/ Weekly Lectures Assignments Pts

1 - Introduction

- Quiz 15
2 - C++ Basics
- Assignment 50

- Quiz 15
3 - Algorithms Complexity
- Assignment 50

- Quiz 15
4 - Arrays
- Assignment 50

- Quiz 15
5 - Linked Lists
- Assignment 50

- Quiz 15
6 - Hash Tables
- Assignment 50

- Quiz 15
7 - Stacks and Queues
- Assignment 50

8 - Exam 1 100

9 - Spring Break :-)

- Quiz 15
10 - Trees and Graphs
- Assignment 50

- Quiz 15
11 - Recursion
- Assignment 50

- Quiz 15
12 - Dynamic Programming
- Assignment 50

- Quiz 15
13 - Sorting and Searching
- Assignment 50

14 - Exam 2 100

15
- Course Project
150
16

TOTAL: 1000

● Quizzes: 10 x 15 = 150 (15%) ● Grade A: >= 90%


● Assignments: 10 x 50 = 500 (50%) ● Grade B: >=80%
● Exams: 2 x 100 = 200 (20%) ● Grade C: >=70%
● Project: 1 x 150 = 150 (15%) ● Grade D: >=60%
● Total: 1000 (100%) ● Grade F: < 60%
Contact information:

- Instructor’s name: Mohammed Alkateb


- Office hours and location: upon request / online
- CSUN email address: [email protected]

You might also like