BSKE-142 IGNOU Guess Paper 2026-27

BSKE-142: Advanced Data Structures and Algorithms Exam Preparation with Solved Question Papers

BSKE-142 is a core course in the Bachelor’s in Science (Computer Science) program under IGNOU’s CBCS curriculum, focusing on advanced data structures and algorithmic problem-solving. This guide is designed to align with the course’s rigorous analytical requirements, covering recursive techniques, graph theory, and complex data models. The study material integrates solved question papers from June and December cycles (2018–2023) to identify recurring patterns, ensuring students prioritize high-weightage topics. The structured approach includes time-management strategies tailored to IGNOU’s 3-hour examination format, reducing last-minute stress and maximizing efficiency.

Key Syllabus Units & Topics

• Unit 1: Advanced Recursion and Divide-and-Conquer: Covers dynamic programming frameworks, memoization techniques, and analysis of recursive algorithms like merge sort and quicksort with time-space complexity proofs.
• Unit 3: Graph Theory and Network Algorithms: Explores adjacency matrix/list representations, Dijkstra’s and Prim’s algorithms, and applications in shortest path problems with real-world case studies.
• Unit 5: Hashing and Advanced Data Structures: Details collision resolution methods (chaining vs. open addressing), perfect hashing, and implementation of AVL trees and B-trees for database indexing.
• Unit 7: Computational Geometry and String Matching: Focuses on convex hull algorithms, polygon triangulation, and Knuth-Morris-Pratt (KMP) string search with practical coding examples.

Frequently Asked Questions

Q: How are numerical questions weighted in BSKE-142’s TEE, and which units typically have the highest marks allocation?
A: Numerical problems account for 30–35% of total marks, with Unit 3 (Graph Theory) and Unit 5 (Hashing) frequently carrying 15–20 marks each due to their algorithmic depth and application-based questions.

Q: Are there specific assignment questions from BSKE-142 that repeatedly appear in TEE exams, and how can students prepare for them?
A: The 2021 December TEE and 2022 June TEE included direct repeats of assignment questions on AVL tree balancing and Dijkstra’s algorithm pseudocode implementation. Reviewing solved assignments and focusing on these topics ensures 80% coverage of expected TEE questions.