CS 501 Fundamentals of Computer Science I
Course outline
CS253 Data Structures
CS 253 Data Structures
Course outline
Lecture notes and demos
Lecture 1 notes
and examples -- example 1
version 1
and
version 2
, example 2
version 1
and
version 2
.
Lecture 2 notes
and the
bubble sort example
.
For examples to read from / write to a text file see:
example 1
,
example 2
,
example 3
,
example 4
, and the
data file
that goes with them.
Lecture 3 notes
and examples -- stack example
version 1
and
version 2
.
Lecture 4 notes
.
Lecture 5 notes
.
Lecture 6 notes
anda
linked list example
. Also see
the stack example (linked list version)
,
the queue example (linked list version)
, and
a doubly linked list example
.
Lecture 7 notes
and a
positional sequence doubly linked list example
.
Lecture 8 notes
.
Lecture 9 notes
.
Lecture 10 notes
.
Lecture 11 notes
.
Lecture 12 notes
.
Lecture 13 notes
.
234 tree example from the book
.
Red-Black tree example from the book
.
Lecture 14 notes
.
Lecture 15 notes
.
Lectures 15 and 16 examples
.
Lecture 16 notes
.
Lecture 17 notes
.
Lecture 17 examples
.
Assignments and announcements
Homework 1
. Deadline: June 2, 2020.
Homework 2
. Deadline: June 9, 2020.
Homework 3
. Deadline: June 17, 2020.
Homework 4
. Deadline: June 25, 2020.
Test questionary for the final exam
Final exam questions
.
Return to Zlatareva's Home Page