This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: B.B. Karki, LSU 2 CSC 3102 Algorithm Basics (Chapters: 1 and 2) Notion of algorithm Fundamentals of algorithmic problem solving Important problem types Analysis of algorithmic efficiency Nonrecursive algorithms Recursive algorithms B.B. Karki, LSU 3 CSC 3102 Fundamental Data Structures ( Chapter 1  Section 4, and other parts of the textbook) (Reference books in C and Java) Linear lists Trees Graphs B.B. Karki, LSU 3 CSC 3102 Fundamental Data Structures ( Chapter 1  Section 4, and other parts of the textbook) (Reference books in C and Java) Linear lists Trees Graphs Sets B.B. Karki, LSU 4 CSC 3102 Data Structure: Definition Data structure can be defined as a particular scheme of organizing related data items Algorithms operate on data A data structure can be implemented as ADT (abstract data type) Declaration of data and operations ADT consists of two parts: a set of data and the operations that can be performed on the data Encapsulation Different aspects of each data structure Basic concept Structure Algorithms or methods Applications ADT B.B. Karki, LSU 5 CSC 3102 Types Linear Lists Linked list, Stack, Queue Trees Balanced Trees (AVL and 23 Trees), B Trees Graphs Types, Graph traversals (DFS and BFS) Graph problems (e.g., Topological sorting) Sets Subsets, Unionfind operations B.B. Karki, LSU 6 CSC 3102 Linear Lists B.B. Karki, LSU 7 CSC 3102 Linear Lists: Concepts A linear list is a list in which each element has a unique successor Types of lists General: data can be inserted and deleted anywhere in the list Unordered or random Ordered: data are arranged according to a key Restricted: data can be inserted or deleted at the ends of the list LIFO (stack) FIFO (queue) Four basic operations associated with linear lists are: Insertion, deletion, retrieval and traversal Item 1 Item 2 Item 3 Item 4 Item 5 B.B. Karki, LSUB....
View
Full
Document
This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.
 Fall '08
 Kraft,D
 Algorithms

Click to edit the document details