Introduction to Algorithm Design

BCS-042 important topics

The eGyanKosh units IGNOU has examined most, from 8 past papers. Matched automatically from question wording.

1. Block 1, Unit 3: Analysis of Simple Algorithms ↗Asked almost every time: in 7 of 8 papers
2. Block 2, Unit 1: Greedy Techniques ↗Asked almost every time: in 6 of 8 papers
3. Block 2, Unit 3: Graph Algorithms ↗Asked almost every time: in 6 of 8 papers
4. Block 2, Unit 2: Divide and Conquer Approach ↗Asked almost every time: in 6 of 8 papers
5. Block 1, Unit 1: Basics of an Algorithm ↗Asked often: in 4 of 8 papers
6. Block 1, Unit 2: Asymptotic Bounds ↗Asked often: in 3 of 8 papers

BCS-042 assignment

The latest BCS-042 assignment is valid for the July 2026 & January 2027 sessions, number BCA_NEW/BCAOL(V)042/Assign/2026-27. It carries 100 marks and 30% of your final grade. Due 31 Oct 2026 for the July 2026 session or 30 Apr 2027 for the January 2027 session.

BCS-042 previous-year question papers

Official term-end exam papers for Introduction to Algorithm Design, published by IGNOU. Each one opens on IGNOU’s website.

• June 2024BCS-042 term-end exam, official PDF↗
• December 2023BCS-042 term-end exam, official PDF↗
• June 2023BCS-042 term-end exam, official PDF↗
• December 2022BCS-042 term-end exam, official PDF↗
• June 2022BCS-042 term-end exam, official PDF↗
• December 2021BCS-042 term-end exam, official PDF↗
• June 2021BCS-042 term-end exam, official PDF↗
• December 2020BCS-042 term-end exam, official PDF↗

Important Introduction to Algorithm Design questions

6 questions have come in more than one BCS-042 exam. They are listed first. The text is taken from IGNOU’s official papers, so open the paper for figures and exact wording.

1. June 2024 · Q3(a) · 5 marksAsked 2 times

   Write and explain binary search algorithm. Explain its time complexity for best and worst cases.

2. June 2024 · Q4(b) · 6 marksAsked 2 times

   Write an algorithm for multiplying two matrices. Also find the time complexity of this algorithm.

3. June 2023 · Q5(b) · 4 marksAsked 2 times

   Write algorithm for adding two matrices of order m × n and find its time complexity.

4. December 2023 · Q1(c) · 5 marksAsked 2 times

   Write binary search algorithm and explain its best case and worst case complexity.

5. December 2021 · Q1(e) · 4 marksAsked 2 times

   Multiply 10056 × 2037 using divide and conquer technique. Apply Karatsuba’s method.

6. December 2020 · Q5(a) · 5 marksAsked 2 times

   Apply Karatsuba’s method in multiplying 2376201 and 219237 using divide and conquer technique.

7. June 2024 · Q1(a)

   Arrange the following time complexities in the increasing order: 2 2log, O (), O (3), !nnn n

8. June 2024 · Q1(c) · 4 marks

   What is recurrence relation? Define Fibonacci sequence using recurrence relation.

9. June 2024 · Q2(a)

   Explain the following terms: (i) Space complexity (ii) Cycle in a graph (iii) Lower bound

10. June 2024 · Q4(a) · 4 marks

    Define the term algorithm. Explain various properties of an algorithm.

11. June 2024 · Q5(b) · 2 marks

    Briefly explain divide and conquer approach of problem solving.

12. June 2023 · Q1(a) · 5 marks

    What is complexity of algorithm? Explain space complexity and time complexity of algorithms with the help of example.

Introduction to Algorithm Design study material

IGNOU publishes the full BCS-042 self-learning material free on eGyanKosh: every block and unit on algorithm and design techniques.