What will i learn?
- 2. Sorting • Know the standard comparison based sorts and their strengths and weaknesses
- 3. Data Structures and their analysis • Know stacks, queues, linked lists, rooted trees; their standard implementations; and the analysis of these implementations
- 4. Standard Design and Analysis techniques • Know a variety of divide-and-conquer algorithms, how to analyze them, and how to apply the ideas to new situations
Curriculum for this course
13 Lessons
00:00:00 Hours
DAA
13 Lessons
00:00:00 Hours
- What is an Algorithm?
- Clear Writing
- Structure
- Characteristics of an Algorithm
- Analysis of Algorithm
- Traverse Element from Array
- Algorithm to Delete Item From An Array
- Sorting Algorithm
- Feature/operation of linear structure
- Linked List
- Tree
- How to organized Tree in Memory
- Heap Sort
Requirements
- Student who are under graduates
+ View more
Description
•Algorithm is a set of steps to accomplish or complete a
task that is described precisely enough that a computer
can run it.
•An algorithm
is a programming step written in human language
step by step to solve the problem
•The algorithm is the sequence of instruction which are given to computer
•Algorithm can be express in any language but particular in own language and English language
•These algorithms
run on computers or computational devices. For example, GPS in our smartphones,
Google hangouts.
•GPS uses shortest path algorithm. Online shopping uses cryptography which uses RSA algorithm.
+ View more
Other related courses
About the instructor
- 0 Reviews
- 3 Students
- 4 Courses
Student feedback
Reviews
Write a public review