KEMBAR78
KTBYTE - Data Structures and Algorithms | PDF | Applied Mathematics | Theoretical Computer Science
0% found this document useful (0 votes)
25 views2 pages

KTBYTE - Data Structures and Algorithms

The document outlines the policy and syllabus for an Intermediate Algorithms course, emphasizing the importance of completing assignments and reviewing lectures weekly. It includes a detailed lesson plan covering topics such as sorting algorithms, recursion, and linked lists, along with associated homework and quizzes. Students are encouraged to utilize office hours for homework help and must request make-up quizzes for missed classes within a week.

Uploaded by

jm
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
0% found this document useful (0 votes)
25 views2 pages

KTBYTE - Data Structures and Algorithms

The document outlines the policy and syllabus for an Intermediate Algorithms course, emphasizing the importance of completing assignments and reviewing lectures weekly. It includes a detailed lesson plan covering topics such as sorting algorithms, recursion, and linked lists, along with associated homework and quizzes. Students are encouraged to utilize office hours for homework help and must request make-up quizzes for missed classes within a week.

Uploaded by

jm
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/ 2

[CORE 6a] Intermediate Algorithms

policy
Students should complete the assignments and review the audio lectures every week before next week's class. For missed classes,
students can catch up by viewing class recordings. If the missed class is a in-class quiz, students must request a make-up quiz within
one week. Homework help office hours are available most days!

Syllabus
Lesson Classwork Homework Quiz Topic Recording Review

Selection Sort
n^2 Sorting
1 Selection Sort (and intro to Lesson
Algorithms
Insertion Sort)

Recursive Sorting
2 Insertion sort & more Insertion Sort Lesson Algorithms (1-3
only)

Recursive Sorting
Lesson
3 Binary Search + Sort Practice Binary Search Algorithms (4-8
HW Solution video
only)

See end of previous


video covering Merge
4 Merge Sort Merge Sort Sort. Try implementing See previous
a visualization of merge
sort using a stack!
5 Review: Sorting Sorting Review Card Game See previous
Water Tanks
Lesson Classwork Homework Quiz Topic Recording Review
Max Difference

6 Quiz: Sorting Quiz - Sorting None

Return to
7 Recursion Review TBD Recursion
Recursion

8 Even More Recursion


9 Flood fill
10 Breadth-First Search
11 Stacks, Queues, and Parsing
Recursion review:
12 Combinatoric actions, flood fill,
stacks/queues/parsing

Quiz: Quiz -
13 Recursion & Recursion and None None
Floodfill
Floodfill

Objects, References, and


14
Linked Lists
15 Linked Lists
16 Linked List Algorithms
17 Review: Linked Lists

Class Quiz: Linked Quiz - Linked


18 None
Feedback Lists Lists

You might also like