پاورپوینت آشنایی با ساختمان داده‌ها و الگوريتم

 

قالب بندی: پاورپوینت

تعداد اسلاید: 389 اسلاید

فهرست مطالب:

در مورد ساختمان داده

Perquisites

Sorting

Sort metods

اضافه کردن یکinsert an element

Insertion sort

Complexityیا پیچیدگی

شمارش مقایسه ای

Compration count

Worst-case Compration count

Step count

محاسبه پیچیدگی در مرتب سازی درجی

Faster Computer Vs Better Algorithm

انواع داده

Data object توضیحات تکمیلی

Data Structure

Linear (or Ordered) lists

مثالهایی از لیست های خطی

Linear list Oprations-size

Linear list Oprations-get(the index)

Linear list Oprations-indexof (the element)

Linear list Oprations-remove(the index)

Data structure specification

Liner List Abstaract Data Type

Data Representation Methods

Linear List Array Representation

Add/Remove An Element_2

Length of Array element

Liner List Abstaract Data Type

Linear List As Java abstract Class

Linked Representation

Memory Layout

Linked Representation

Normal Way To Draw A Linked List

Node Representation

Constructors Of ChainNode

Remove An Element

The Class Chain

Constructors

The Method is Empty

The Method size

The Method checkIndex

The Method get

The Method indexOf

Removing An Element

Remove An Element

One-Step add(0,’f’)

Two-Step add(3,’f’)

Chain With Header Node

Empty Chain With Header Node

Circular List

Doubly Linked List

Doubly Linked Circular List

Doubly Linked Circular List With Header Node

Empty Doubly Linked Circular List With Header Node

1D Array Representation In C, and C++

Space Overhead

2D Arrays

Rows Of A 2D Array

Columns Of A 2D Array

Columns Of A 2D Array

2D Array Representation In  C and C++

2D Array Representation In Java, C, and C++

Space Overhead

Row-Major Mapping

Sparse Matrices

Single Linear List Example

Array Linear List Representation

Single Chain

One Linear List Per Row

Orthogonal Lists

Stacks

Stack Of Cups

The Interface Stack

Parentheses Matching

Towers Of Hanoi/Brahma

Recursive Solution

Derive From A Linear List Class

Derive From ArrayLinearList

Derive From Chain

empty() And peek

push(theObject) And pop

Linked Stack From Scratch

Queues

Bus Stop Queue

The Interface Queue

Derive From ArrayLinearList

Derive From  ExtendedChain

Custom Array Queue

Add An Element

Remove An Element

Moving rear Clockwise

Empty That Queue

A Full Tank Please

Nature Lover’s View Of A Tree

Computer Scientist’s View

Linear Lists And Trees

Hierarchical Data And Trees

Binary Tree

Differences Between A Tree & A Binary Tree

Arithmetic Expressions

Operator Degree

Infix Form

Operator Priorities

Tie Breaker

Infix Expression Is Hard To Parse

Unary Operators

Postfix Evaluation

Merits Of Binary Tree Form

Binary Tree Properties & Representation

Minimum Number Of Nodes

Number Of Nodes & Height

Full Binary Tree

Numbering Nodes In A Full Binary Tree

Node Number Properties

Complete Binary Tree With n Nodes

Binary Tree Representation

Array Representation

Right-Skewed Binary Tree

Linked Representation

The Class BinaryTreeNode

Linked Representation Example

Binary Tree Traversal Methods

Binary Tree Traversal Methods

Binary Tree Traversal Methods

Preorder Traversal

Preorder Of Expression Tree

Inured Traversal

Postorder Traversal

Traversal Applications

Level-Order Example (visit = print)

Inorder And Preorder

Inorder And Postorder

Inorder And Level Order

Priority Queues

Min Priority Queue

Max Priority Queue

Complexity Of Operations

Applications

Complexity Of Sorting

Min Tree Definition

Min Tree Example

Min Heap Definition

Min Heap With 9 Nodes

Heap Height

Moving Up And Down A Heap

Putting An Element Into A Max Heap

Complexity Of Put

Removing The Max Element

Complexity Of Remove Max Element

Initializing A Max Heap

Time Complexity

Extended Binary Trees

An Extended Binary Tree

Binary Search Trees

Definition Of Binary Search Tree

Example Binary Search Tree

The Operation get

The Operation put

The Operation remove

Remove From A Leaf

Remove From A Leaf (contd.)

Remove From A Degree 1 Node

Remove From A Degree 1 Node (contd.)

Remove From A Degree 2 Node

Remove From A Degree 2 Node

Another Remove From A Degree 2 Node

Remove From A Degree 2 Node

Indexed Binary Search Tree

Example Indexed Binary Search Tree

get(index) And remove(index)

get(index) And remove(index)

توضیحات تکمیلی:

این فایل شامل پاورپوینتی با عنوان " آشنایی با ساختمان داده‌ها و الگوريتم " می باشد که در حجم 389 اسلاید همراه با تصاویر و توضیحات کامل تهیه شده است.

پاورپوینت تهیه شده بسیار کامل و قابل ویرایش بوده و در تهیه آن کلیه اصول و علائم نگارشی و چیدمان جمله بندی رعایت شده و به راحتی و به دلخواه می توان قالب آن را تغییر داد.