User Interface Design

Introduction and Definition of Algorithm
Fundamentals of the Analysis of Algorithm Efficiency
Analysis of Algorithm: Fibonacci numbers
Analysis of Linear Search

Design Process

Divide and Conquer Method
Binary Search Algorithm
Greedy Method Algorithm
Container Loading Algorithm
Knapsack Problem or Rucksack Problem

WINDOWS

Dynamic programming
Optimal Binary Search trees
0/1 Knapsack Problem
Traveling Salesman Problem

MULTIMEDIA

Backtracking Algorithms
N-queens Problem
Subset- Sum problem
Graph Coloring
Hamiltonian Circuit Problem

WINDOWS LAYOUT

Graph Traversals - Breadth First Search Working Principle
Depth First Search(DFS) Algorithm: Working Principle, Forest, Application
Connected Component and Biconnected Components
Spanning Tree Algorithm: Prim�s and Kruskal�s Algorithm
Algorithm: Branch and Bound
Branch and Bound - Knapsack Problem
NP Hard and NP Completeness
Technical and Glossary Terms in Analysis and Design of Algorithm

Engineering Electrical Engineering Electronics Engineering Civil Engineering Mechanical Engineering Computer Science Engineering Information Technology Medical MBBS Nursing BPharm MD MBA AnnaUniv MBA TN School 11th 12th Anna University EEE - Anna University ECE - Anna University Civil - Anna University MECH - Anna University CSE - Anna University IT - Anna University Online Student Guide UPSC Civil services Entrance exams GATE Exam GATE Exam EE Electrical GATE Exam EC Electronics GATE Exam CS Computer Science GATE Exam CE Civil GATE Exam ME Mechanical IIT JEE IEEE Entrance Exam NEET Entrance Exam AIIMS Entrance Exams Problem Solving and Reasoning Verbal, Reading Comprehension Data Interpretation Logical Reasoning Mathematics or Quantitative CAT Entrance Exams CLAT LAW Entrance exams Banking Entrance exams TANCET Anna University TN State Board one mark TN 11th Standard one mark