CS 14: Introduction to Data Structures and Algorithms

Winter 2018

Announcements

General Info

Instructor: Vagelis Hristidis

Description: Description: Description: Description: Description: Description: Description: Description: U:\public_html\email.JPG

Lecture time: MWF 12:10 p.m. - 1:00 p.m

Location: WCH 138

Office hour: Monday 11-12 pm

TAs:
Harry Chasparis (2 sessions), Office hour: M 4 pm - 5 pm, WCH 110
Ryan Rivas (1 session), Office hour: F 10 am-11 am, WCH 110

Grading

15% lab exercises, worst two don't count

15% assignments

15% quizzes (worst two don't count) and participation

20% midterm

35% final

Course Description

  • Review of C++
  • linked list, queue, and stack.
  • Introduction to algorithm and its analysis.
  • Sorting
  • Trees
  • Graphs
  • Hashing
  • Assignments

    Assignments will be posted in iLearn.

    Late submissions, submitted before assignments are graded, will receive a 20% score reduction.

    Tentative Lectures' Schedule

    Date

    Topic

    Book Chapters

    Slides
    Jan 8, 10 (guest), 12 Class Intro, C++ Overview 1 intro
    Jan 17 (guest), 19, 22 (guest) Algorithm Analysis 2 algorithm analysis
    Jan 24, 26 (guest), 29 Lists, Stacks, Queues 3 list-stack-queue
    Jan 31 (guest), Feb 2, 5,7 Heaps, Sorting 6.1-6.4, 7.1,7.2,7.5,7.6,7.7,7.11 sorting
    Feb 9 Review Session   review
    Feb 12 MIDTERM    
    Feb 14, 16, 21, 23 Trees, BST, AVL Tree, B Tree 4.1-4.4,4.6,4.7 trees
    Feb 26, 28, Mar 2 Hashing 5.1-5.6 hashing
    Mar 5, 7, 9, 12, 14 Graphs 9.1-9.3 graphs
    Mar 16 Review Session   final review
    Friday, March 23, 2018, 8 – 11am Winston Chung Hall 138  FINAL    

    Textbook

    Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Addison Wesley, ISBN-10: 013284737X | Edition: 4

    (can rent the eBook for $34.00 through www.vitalsource.com)

    Policies

    Academic Integrity: http://conduct.ucr.edu/policies/academicintegrity.html