EC-211 DATA STRUCTURES

LECTURE 1

LECTURE 1
INTRODUCTION

COURSE OUTLINE (1/2)

Text Book:
Y. Langsam, M. J. Augenstein, A. M. Tenenbaum, Data
Structures Using C and C++, Prentice Hall, 2009
Reference:
Mark Allen Weiss, Data Structures and Algorithm
Analysis in C, Addison Wesley, 2010.

COURSE OUTLINE (1/2)

Introduction to Data Structures

Abstract Data Types (ADTs)
Built-in Data Structures in C/C++
Linked Lists
Stack
Queues
Recursion

COURSE OUTLINE (2/2)

Trees
Searching/Sorting
Algorithm Analysis
Graphs
Hashing

MARKS DISTRIBUTION (Tentative)

Assignments/Discipline
Quiz
Exam
Project *
Lab
Final Exam

8%
12%
18%
12%
10%
40%

For project ideas consult

DS Lab Instructor
Previous degrees projects
Web sites like Microsoft Imagine Cup (www.imaginecup.com)
Me

INTRODUCTION TO DATA
STRUCTURES (1/3)
How information is organized in a computer
How it can be manipulated
How it can be utilized

INTRODUCTION TO DATA
STRUCTURES (2/3)
New data types, operations, and therefore
new capabilities for problem solving
More useful programming constructs than
lower level constructs

INTRODUCTION TO DATA
STRUCTURES (3/3)
Identify and develop useful abstract entities and
operations and to determine what classes of problems
can be solved by using these entities and operations
Determine concrete representations for those abstract
entities and to implement the abstract operations on
these concrete representations
Examples:
Rational numbers
Stack (LIFO structure)

Abstract Data Types (ADT)

A formalism for specifying the logical
properties (i.e. values and operations) of a
data type
Independent of implementation
Independent of efficiency concerns