Computer Algorithm
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesComputer Algorithm Syllabus — Unit-wise Content
The official GTU curriculum for Computer Algorithm (subject code 2710201) as prescribed for CE(A · Semester 1 divides the course into 10 units, covering 16 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (2710201)Unit 1 From problems to programs, set theory, functions and relations
- Insertion sort
- analyzing algorithms
- designing algorithms
- asymptotic notation
Unit 2 Divide and conquer, Strassen’s algorithm for matrix multiplication, The
- substitution method for solving recurrences
- The recursion tree method for solving recurrences
- master method
Unit 3 Dynamic programming, Making Change, The principal of optimality,
- the knapsack problem
- Floyd’s algorithm for shortest paths 4 10
Unit 4 Greedy Algorithms, making change, Knapsack problem, Shortest Path
- – Dijkstra’s algorithm
- Huffman codes 5 10
Unit 6 Single source shortest paths. Bellman Ford, directed acyclic graphs,
- Floyd Warshall algorithm 3 10
Unit 8 String matching, the naïve string matching, Rabin Karp
- Boyer Moore pattern matching
- Knuth Moriss Pratt algorithm 4 15
Unit 9 Introduction to NP completeness, The class P and NP, polynomial
- NP complete problems 3 10
Unit 10 Heuristic algorithm – the travelling salesperson, approximate
- algorithms-knapsack problem 3 10
Study on Android App:
