Scribd
Upload
24 views

Data Structure and Algoritms Course Outline

The document outlines the course content for a data structures and algorithms class. It is divided into chapters that will be covered throughout the semester, culminating in a final exam. The early chapters introduce fundamental concepts like data representation and different data structure types, such as arrays, linked lists, stacks, and queues. Later chapters cover more advanced topics like binary trees, tree traversals, and their applications.

Uploaded by

BENJIE ZARATE
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

Data Structure and Algoritms Course Outline

The document outlines the course content for a data structures and algorithms class. It is divided into chapters that will be covered throughout the semester, culminating in a final exam. The early chapters introduce fundamental concepts like data representation and different data structure types, such as arrays, linked lists, stacks, and queues. Later chapters cover more advanced topics like binary trees, tree traversals, and their applications.

Uploaded by

BENJIE ZARATE
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structure and Algorithm Course Outline

Prelim

Chapter I Introduction to Data Structure and Algorithms


a. What is Data Structure? ………………………………………………………… 7
b. Characteristic of Data Structure…………………………………………………. 8
c. Need for Data Structure………………………………………………………… 8
d. What is Algorithms? …………………………………………………………… 8
e. How write an algorithms………………………………………………………… 9
f. Algorithm complexity…………………………………………………………… 11
g. Classification of Data Structures………………………………………………… 13
h. Primitive data structure………………………………………………………….. 14
i. Data Representation……………………………………………………………... 15
j. Goals of computer data representation 15
k. Memory Representation………………………………………………………… 15

Midterm

Chapter 2 Non Primitive Data Types


a. Array ……………………………………………………………………………. 23
b. Memory Address Types…………………………………………………………. 24
c. Declaring Arrays…………………………………………………………………. 25
d. Accessing an array element……………………………………………………… 26
e. Coding Guidelines………………………………………………………………… 27
f. Addressing Methods……………………………………………………………… 29
g. Computed Addressing Method…………………………………………………... 29
1 dimensional array…………………………………………………………. …. 29
2 dimensional array, byte addressable………………………………………… 31
h. Applications of Array…………………………………………………………….. 33
i. What is sparse matrix? …………………………………………………………… 34

Chapter 3 Link Addressing Methods


a. Linked List………………………………………………………………………… 40
b. Types of Linked List………………………………………………………………. 40
c. Comparison between array and link list………………………………………….. 41
d. Singly-linked lists…………………………………………………………………. 42
e. Doubly Linked List………………………………………………………………... 44
f. Circular Linked List………………………………………………………………... 45
Semi – Finals

Chapter 4 Stacks
a. What is stacks...…………………………………………………………………... 48
b. Uses of Stacks .…………………………………………………………………… 48
c. Operations.………………………………………………………………………. 49
d. Stack Implementation .…………………………………………………………... 50
e. Stack Application: Evaluation of Infix, Postfix and Prefix Expressions…………… 50
f. Rules in converting from infix to postfix and vice versa………………………….. 52

Chapter 5
Queue
a. Queue……………………………………………………………………………... 57
b. The Queue Operations…………………………………………………………….. 57
c. Storing a queue in a static data structure…………………………………………… 60
d. Storing a queue in a dynamic data structure………………………………………… 60
e. Adding a node (Add) in a dynamic data structure……………………………………. 61
f. Removing a node (Remove) in a dynamic data structure……………………………... 61

Finals

Chapter 6 Binary Trees


a. Trees……………………………………………………………………………… 64
b. Terminologies…………………………………………………………………….. 65
c .Binary Search Trees………………………………………………………………. 66
d. Types of Binary Tree……………………………………………………………… 67
e. Insertion and Searching Algorithm………………………………………………. 68
f. How to search a binary search tree………………………………………………. 68
g. How to create or insert binary tree……………………………………………… 69
h. Tree Traversals…………………………………………………………………… 70
i. Expression Trees………………………………………………………………….. 73

You might also like