User Interface Design

Important questions and answers, Online Study Material, Lecturing Notes, Assignment, Reference, Wiki

User Interface Design

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


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


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


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

Privacy Policy, Terms and Conditions, DMCA Policy and Compliant, Contact

Copyright © 2018-2023; All Rights Reserved. Developed by Therithal info, Chennai.