Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Basic of Algorithm

# Basic of Algorithm

Ratings: (0)|Views: 0 |Likes:
Basic of Algorithm
Basic of Algorithm

### Availability:

See more
See less

07/23/2013

pdf

text

original

SYLLABUS
Algorithms, Abstract Data Type, The Running Times Of a Program, Good Programming Practice, The data type, Implementation of lists, Array implementation of list, Pointer implementation of list, Doubly-link lists, Stack, Queues, Mapping.Sets, An ADT with union, intersection and difference, Bit vector, implementation of sets, Link-listimplementation of sets, The data dictionary.Efficiency of algorithms, Analysis of recursive programs, Solving recurrence equation, Divide andconquer algorithms, Dynamic programming, Greedy algorithm, Prim’s algorithm, Kruskal’salgorithm, Dijkstra’s method, Backtracking.Basic terminology, Implementation of tree, An Array Representation of Trees, Representation of  Trees by List of Children, Binary trees, The internal sorting model, Bubble sort, Insertion sort,Selection sort, Heap sort, Divide and conquer, Merge sort, Quick sort, Binary search.A Model of External Computation, External sorting, Characteristics of External Sorting, Criteriafor Developing an External Sorting Algorithm, Important Uses of External Sorting, Merge Sort--ADigression, Top-Down Strategy, Bottom-Up Strategy, Storing Information in Files, Hashed Files,Indexed Files The Issues in Memory, Garbage Collection Algorithms For Equal-Sized Block, Collection in Place,Buddy system, Distribution of blocks, Allocation blocks, Returning blocks to available storage,Storage compaction and Compaction problemIntroduction to NP Problem, Polynomial-time, Abstract Problems, Encoding, NP-Completeness andReducibility, NP-Completeness, Circuit Satisfiability, NP-Complete Problems, The Vertex-coverProblem, The Subset-sum Problem, The Hamiltonian-cycle Problem, The Traveling-salesmanProblem
www.arihantinfo.com
1

UNIT 1Basic of Algorithms
1.1Algorithm
1.2Abstract Data Type1.3The Running Times Of a Program1.4Good Programming Practice
UNIT 2Basic Data Type
2.1The data type “list”2.2Static and Dynamic Memory Allocation2.3Pointers2.4Implementation of lists2.5Linear Linked List2.6Array implementation of list2.7Pointer implementation of list2.8Doubly-link lists2.9Stack2.10Queues2.11Mapping
UNIT 3Basic Operations and Sets
3.1Sets3.2An ADT with union, intersection and difference3.3Bit vector implementation of sets3.4Link-list implementation of sets3.5The data dictionary
UNIT 4Algorithms Analysis Techniques
4.1Efficiency of algorithms4.2Analysis of recursive programs4.3Solving recurrence equation
UNIT 5Algorithms Design Technique
5.1Divide and conquer algorithms5.2Dynamic programming5.3Greedy algorithm5.4Minimum-cost spanning trees5.5Minimum Spanning Tree5.6Prims Algorithm5.7Kruskals Algorithm5.8Shortest Paths5.9Dijkastras Algorithm5.10Backtracking
UNIT 6
www.arihantinfo.com
2

Trees and Sorting
6.1
Basic terminology
6.2
Implementation of tree
6.3An Array Representation of Trees6.4
Representation of Trees by List of Children
6.5
Binary trees
6.6
The internal sorting model
6.7
Bubble sort
6.8
Insertion sort
6.9
Selection sort
6.10
Heap sort
6.11
Divide and conquer
6.11.1
Merge sort
6.11.2
Quick sort
6.11.3
Binary search
UNIT 7Algorithms for External Storage
7.1
A Model of External Computation
7.2
External sorting
7.3
Characteristics of External Sorting
7.4
Criteria for Developing an External Sorting Algorithm
7.5
Important Uses of External Sorting
7.6
Merge Sort--A Digression
7.7
Top-Down Strategy
7.8
Bottom-Up Strategy
7.9
Storing Information in Files
7.10
Hashed Files
7.11
Indexed Files
UNIT 8Memory Management
8.1
The Issues in Memory
8.2
Garbage Collection Algorithms For Equal-Sized Block
8.3
Collection in Place
8.4
Buddy system
8.5
Distribution of blocks
8.6
Allocation blocks
8.7
Returning blocks to available storage
8.8
Storage compaction and Compaction problem
UNIT 9NP Complete Problem
9.1
Introduction
9.2
Polynomial-time
9.3
Abstract Problems
9.4
Encoding
9.5
NP-Completeness and Reducibility
9.6
NP-Completeness
9.7
Circuit Satisfiability
9.8
NP-Complete Problems
9.9
The Vertex-cover Problem
9.10
The Subset-sum Problem
9.11
The Hamiltonian-cycle Problem
www.arihantinfo.com
3