slide1 n.
Download
Skip this Video
Download Presentation
CENG 213 Data Structures

Loading in 2 Seconds...

play fullscreen
1 / 6

CENG 213 Data Structures - PowerPoint PPT Presentation


  • 303 Views
  • Uploaded on

CENG 213 Data Structures. Department of Computer Engineering Middle East Technical University Fall 2014. CENG 213 Data Structures. 1. CENG 213 Section 1. Instructor: Pınar KARAGÖZ A404 karagoz@ceng.metu.edu.tr Lecture Hours: Section 1: Mon. 13:40, 14:40 (BMB1); Thurs. 09:40 (BMB1)

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'CENG 213 Data Structures' - virginia-irwin


Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
slide1

CENG 213 Data Structures

Department of Computer Engineering

Middle East Technical University

Fall 2014

CENG 213 Data Structures

1

slide2

CENG 213 Section 1

Instructor: Pınar KARAGÖZ

  • A404
  • karagoz@ceng.metu.edu.tr

Lecture Hours:

  • Section 1: Mon. 13:40, 14:40 (BMB1); Thurs. 09:40 (BMB1)

Course Web Page:http://cow.ceng.metu.edu.tr/

Teaching Assistants:

  • Özcan Dülger,  
  • Fatih Semiz ,
  • Dilek Önal,
  • Batuhan Karagöz

CENG 213 Data Structures

2

slide3

Course Description

Course Objectives: To introduce abstract concepts for data organization and manipulation, to show how these concepts are useful in problem solving. 

Learning Outcomes: At the end of the course unit, the student is expected to be able to use appropriate data structures for the solution of the problem at hand. The student should be able to design and implement abstract data types which use efficient algorithms to manipulate these structures.

Prerequisite: CENG 140

Text Book

Mark Allen Weiss, Data Structures and Algorithm Analysis in C++ (3rd ed.), Addison Wesley, 2006.

CENG 213 Data Structures

3

slide4

Grading

  • Midterm I 20% November 13, 2014
  • Midterm II 20% December 18, 2014
  • Final 30%
  • Quiz and

Assignments 30% (1 quiz and 3 prog. homeworks)

CENG 213 Data Structures

4

slide5

Policies

  • Policy on missed exam:
    • make-up exam in case of formal excuse (submitted BEFORE exam)
  • Lateness policy:
    • On the total 7 days for late submission
    • You can can use at most 3 days per homework
  • A student can take the final exam if and only if s/he has at least 50% attendance and gets at least 30% points as the average first two assignments.
  • All assignments and programs are to be your own work. No group projects or assignments are allowed.

CENG 213 Data Structures

5

slide6

Course Outline

  • Overview of object-oriented programming with C++ [chapter 1]
  • Algorithm analysis [chapter 2]
  • Sorting [chapter 7]
  • Lists, stacks, queues [chapter 3]
  • Trees [chapter 4]
  • Hashing [chapter 5]
  • Priority queues [chapter 6]
  • Graphs [chapter 9]

CENG 213 Data Structures

6