BCS755B Introduction to Algorithms – vtuease

BCS755B | Introduction to Algorithms

INTRODUCTION: What is an Algorithm?, Fundamentals of Algorithmic Problem Solving, Important problem Types, Fundamental Data Structures, Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, ,Analysis Framework, Asymptotic Notations and Basic Efficiency Classes

FUNDAMENTALS OF THE ANALYSIS OF ALGORITHM EFFICIENCY: Mathematical Analysis of Non-recursive Algorithms, Mathematical Analysis of Recursive Algorithms. BRUTE FORCE APPROACHES: Selection Sort and Bubble Sort, Sequential Search and Brute Force String Matching.

Exhaustive Search (Travelling Salesman problem and Knapsack Problem).
Depth First search and Breadth First search. DECREASE-AND-CONQUER: Insertion Sort, Topological Sorting.
DIVIDE AND CONQUER: Merge Sort, Binary Tree Traversals.

TRANSFORM-AND-CONQUER: Balanced Search Trees (AVL Trees), Heaps and Heapsort. SPACE-TIME TRADEOFFS: Sorting by Counting: Comparison counting sort, Input Enhancement in String Matching: Horspool’s Algorithm, Hashing.

DYNAMIC PROGRAMMING: Three basic examples, The Knapsack Problem and Memory Functions. THE GREEDY METHOD: Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees and Codes.

BCS755B | Model Question Paper with Solution

Access well‑organized Model Question Paper with step‑by‑step, point‑wise solutions. Each solution is created to save your time, clarify concepts, and help you revise effectively.

BCS755B | Passing Package
( Score More )

A smart package made for VTU students! Selected important questions prepared to cover exactly what matters in VTU exams. Clear, simple, and quick to revise – perfect for last‑minute preparation and aiming for better marks with confidence.