{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DA07 - Algorithm Basics(Chapters 1 and 2 Notion of...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
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 Non-recursive algorithms Recursive algorithms
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
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
Background image of page 2
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
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
B.B. Karki, LSU 5 CSC 3102 Types Linear Lists Linked list, Stack, Queue Trees Balanced Trees (AVL and 2-3 Trees), B Trees Graphs Types, Graph traversals (DFS and BFS) Graph problems (e.g., Topological sorting) Sets Subsets, Union-find operations
Background image of page 4
B.B. Karki, LSU 6 CSC 3102 Linear Lists
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
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
Background image of page 6
B.B. Karki, LSU 8 CSC 3102 Linked Lists A linked list is an ordered collection of data in which each element contains the location of the next element.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}