User Interface Design
- Lecture Notes, Study Materials and Important questions answers

Subject : User Interface Design

INTRODUCTION

1. Introduction and Definition of Algorithm - Answer (click here)
2. Fundamentals of the Analysis of Algorithm Efficiency - Answer (click here)
3. Analysis of Algorithm: Fibonacci numbers - Answer (click here)
4. Analysis of Linear Search - Answer (click here)

Design Process

1. Divide and Conquer Method - Answer (click here)
2. Binary Search Algorithm - Answer (click here)
3. Greedy Method Algorithm - Answer (click here)
4. Container Loading Algorithm - Answer (click here)
5. Knapsack Problem or Rucksack Problem - Answer (click here)

WINDOWS

1. Dynamic programming - Answer (click here)
2. Optimal Binary Search trees - Answer (click here)
3. 0/1 Knapsack Problem - Answer (click here)
4. Traveling Salesman Problem - Answer (click here)

MULTIMEDIA

1. Backtracking Algorithms - Answer (click here)
2. N-queens Problem - Answer (click here)
3. Subset- Sum problem - Answer (click here)
4. Graph Coloring - Answer (click here)
5. Hamiltonian Circuit Problem - Answer (click here)

WINDOWS LAYOUT

1. Graph Traversals - Breadth First Search Working Principle - Answer (click here)
2. Depth First Search(DFS) Algorithm: Working Principle, Forest, Application - Answer (click here)
3. Connected Component and Biconnected Components - Answer (click here)
4. Spanning Tree Algorithm: Prim‘s and Kruskal‘s Algorithm - Answer (click here)
5. Algorithm: Branch and Bound - Answer (click here)
6. Branch and Bound - Knapsack Problem - Answer (click here)
7. NP Hard and NP Completeness - Answer (click here)
8. Technical and Glossary Terms in Analysis and Design of Algorithm - Answer (click here)