CS 14: Introduction to Data Structures and Algorithms

Winter 2013

Announcements

General Info

Instructor: Vagelis Hristidis

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

Lecture time: TR 02:10 p.m. - 03:30 p.m

Location: SPR 2340 (Sproul Hall)

Office hours: Tuesday 3:30-4:30 pm

TA: Eduardo Ruiz

Lab Sections:

LAB W 06:10 p.m. - 09:00 p.m. CHUNG 129; or

LAB R (cancelled)

Office hour: M 4-6 pm, WCH 363

Grading

15% lab exercises, worst two don't count

15% assignments

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

25% midterm

30% 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 Class Intro, C++ Overview 1 intro
    Jan 15,17 Algorithm Analysis 2 algorithm analysis
    Jan 22 Lists, Stacks, Queues 3 list-stack-queue
    Jan 24 No Class - Instructor at Workshop    
    Jan 29 cont'd    
    Jan 31, Feb 5,7 Heaps, Sorting 6.1-6.4, 7.1,7.2,7.5,7.6,7.7,7.9 sorting
    Feb 12 Review Session   review
    Feb 14 MIDTERM    
    Feb 19,21, 26 Trees, BST, AVL Tree, B Tree 4.1-4.4,4.6,4.7 trees
    Feb 28, Mar 5 Hashing 5.1-5.5 hashing
    Mar 7,12 Graphs 9.1-9.3 graphs
    Mar 14 Review Session   final review
    Mar 21 FINAL 08:00A.M. - 11:00A.M.   

    Textbook

    Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Addison Wesley,  032144146X  978-0321441461 3
  •  Policies

  • Academic Integrity:  http://conduct.ucr.edu/learnPolicies/Pages/AcademicIntegrity.aspx

    Standards of Conduct: http://conduct.ucr.edu/learnPolicies/Pages/StandardsofConduct.aspx