BCS-042 Solved Assignment 2026-27 in English | Bachelor of Computer Applications

BCS-042 Solved Assignment 2026-27 in English is designed for students of the Bachelor of Computer Applications (BCA) studying BCS-042: Introduction to Algorithms Design.

The supplied assignment contains 8 questions of 10 marks each, making 80 marks for the questions, while the remaining 20 marks are for viva voce. Students are required to answer all questions.

BCS-042 Course Information

The assignment specifies the submission deadlines as 31 October 2026 for the July 2026 session and 30 April 2027 for the January 2027 session.

BCS-042 Topics Covered

The assignment covers important algorithm-design concepts including:

• Binary Search
• Strassen’s Matrix Multiplication
• Euclid’s GCD Algorithm
• Binary Exponentiation
• Insertion Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Prim’s Algorithm
• Minimum Cost Spanning Tree
• Bellman-Ford Algorithm
• Shortest Path
• DFS
• BFS Graph Traversal
• Time Complexity Analysis

BCS-042 Assignment Questions

Q1. Binary Search

Consider the sorted array:

11, 22, 27, 35, 42, 45, 55, 60, 65, 70, 75, 82, 85

Illustrate the working of the binary search technique while searching for:

1. 42
2. 82

Q2. Strassen’s Matrix Multiplication

Use Strassen’s matrix multiplication algorithm to multiply:

A=[5987]A= \begin{bmatrix} 5&9\\ 8&7 \end{bmatrix}

and

B=[3642]B= \begin{bmatrix} 3&6\\ 4&2 \end{bmatrix}

Q3. Euclid’s Algorithm

Find:

GCD(595,252)GCD(595,252)

using Euclid’s algorithm.

Also perform the best-case, worst-case and average-case time complexity analysis of the algorithm.

Q4. Binary Exponentiation

Compute:

a283a^{283}

using both:

• Left-to-right binary exponentiation
• Right-to-left binary exponentiation

Q5. Sorting Algorithms

Analyse the best-case, average-case and worst-case time complexities, with suitable examples, for:

1. Insertion Sort
2. Selection Sort
3. Quick Sort
4. Merge Sort

The supplied solved material gives the standard complexity comparison: Insertion Sort O(n), O(n²), O(n²); Selection Sort O(n²), O(n²), O(n²); Quick Sort O(n log n), O(n log n), O(n²); and Merge Sort O(n log n) in all three cases.

Q6. Prim’s Algorithm

Apply Prim’s Algorithm to the given graph to find the Minimum Cost Spanning Tree.

The supplied solution identifies the MST edges as:

• A–C = 1
• A–B = 2
• B–D = 2
• D–E = 2
• E–G = 2
• G–H = 2
• H–F = 1

The resulting minimum total cost is 12.

Q7. Bellman-Ford Algorithm

Apply the Bellman-Ford algorithm to find the shortest path from source vertex A to all other vertices in the given graph.

The supplied solution gives the final shortest distances as:

Q8. DFS and BFS

Apply DFS and BFS graph traversal algorithms to the given graph and find the traversal order of nodes, taking A as the starting vertex.

The supplied solved assignment gives:

DFS Order:
A → B → C → G → F → E → D → H

BFS Order:
A → B → D → F → C → G → E → H

What This BCS-042 Solved Assignment Includes

The BCS-042 Solved Assignment 2026-27 in English covers all 8 questions from the supplied assignment, including searching, matrix multiplication, number-theoretic algorithms, sorting, minimum spanning trees, shortest-path algorithms and graph traversal.

The solved material provides step-by-step explanations for Binary Search, Euclid’s Algorithm, sorting complexity, Prim’s Algorithm, Bellman-Ford, DFS and BFS.

Key Features

• BCS-042 Introduction to Algorithms Design
• Solved Assignment 2026-27
• English Medium
• Complete 8-question coverage
• Binary Search
• Strassen’s Algorithm
• Euclid’s Algorithm
• Binary Exponentiation
• Sorting Algorithms
• Prim’s Algorithm
• Bellman-Ford Algorithm
• DFS and BFS
• Time Complexity Analysis
• Digital PDF
• Instant Download

Frequently Asked Questions

1. What is BCS-042?

BCS-042 is Introduction to Algorithms Design.

2. Which programme is BCS-042 for?

It is included in the Bachelor of Computer Applications (BCA) programme.

3. What is the BCS-042 assignment code?

BCA_NEW/BCAOL(V)042/Assign/2026-27.

4. How many questions are there?

There are 8 questions, each carrying 10 marks.

5. What are the maximum marks?

The assignment carries 100 marks, including 20 marks for viva voce.

6. What is the medium?

This product is for English Medium.

7. What session does it cover?

It covers the 2026-27 session.

8. Which algorithms are covered?

Binary Search, Strassen’s Matrix Multiplication, Euclid’s Algorithm, Binary Exponentiation, sorting algorithms, Prim’s Algorithm, Bellman-Ford, DFS and BFS are covered.

9. What are the DFS and BFS orders?

The supplied solved assignment gives:

DFS: A → B → C → G → F → E → D → H
BFS: A → B → D → F → C → G → E → H

10. What are the submission dates?

The assignment states 31 October 2026 for the July 2026 session and 30 April 2027 for the January 2027 session.

Disclaimer

This material is independently prepared by Mother Publication for educational and reference purposes. Students should read and understand the material and prepare their assignments appropriately. Mother Publication is not affiliated with, endorsed by, or officially associated with IGNOU.

PRODUCT TAGS

BCS-042, BCS 042, BCS042, BCS-42, BCS 42, BCS42, BCS-040, BCS-042 Solved Assignment 2026-27, BCS 042 Solved Assignment 2026-27, BCS042 Solved Assignment 2026-27, BCS-42 Solved Assignment 2026-27, BCS 42 Solved Assignment 2026-27, BCS42 Solved Assignment 2026-27, BCS-042 Solved Assignment 2027, BCS 042 Solved Assignment 2027, BCS042 Solved Assignment 2027, BCS-42 Assignment 2027, BCS 42 Assignment 2027, BCS42 Assignment 2027, BCS-042 Introduction to Algorithms Design, BCS 042 Introduction to Algorithms Design, BCS042 Introduction to Algorithms Design, Introduction to Algorithms Design Assignment 2026-27, Introduction to Algorithms Design Solved Assignment, Introduction to Algorithms Design PDF, BCS-042 Assignment PDF, BCS 042 Assignment PDF, BCS042 Assignment PDF, BCA BCS-042, BCA Algorithms Assignment, BCA Solved Assignment 2026-27, BCA Assignment PDF 2026-27, Bachelor of Computer Applications Assignment, BCS-042 English Medium, BCS 042 English Medium, BCS042 English Medium, BCS-042 2026-27, BCS 042 2026-27, BCS042 2027, BCS-042 Solved PDF, BCS-042 Assignment Questions, BCS-042 Question Paper, BCS-042 Solution, BCS-042 Answers, BCS-042 Binary Search, BCS-042 Strassen Algorithm, BCS-042 Euclid Algorithm, BCS-042 Prim Algorithm, BCS-042 Bellman Ford, BCS-042 DFS BFS, BCS-042 Graph Algorithms, BCS-042 2026-27 PDF