PAID
AKTU Cloud Computing BCS071 Question Bank
by University Academy
This question bank has been compiled by UQuest (by University Academy) to help you prepare efficiently for the BCS071 Cloud Computing semester examination (AKTU). Each of the five syllabus units contains 15 short-answer questions (2 marks) and 15 long-answer questions (7–10 marks), each with a complete, exam-ready solved answer including real, verified worked examples (Amdahl's Law speedup calculations, elasticity/pay-as-you-go cost comparisons, VM consolidation via bin-packing, SLA uptime/downtime tables, storage replication durability, an HDFS block-splitting trace, and a fully executed MapReduce word-count trace), and concept diagrams (layered cloud architecture, deployment models, hypervisor types, NIST reference architecture, IAM flow, HDFS architecture, cloud federation) wherever applicable.
Understanding the Tags
★ MOST IMPORTANT — Repeatedly asked across multiple AKTU examination years, or covers a core syllabus concept almost certain to be examined — prioritise these first.
☆ IMPORTANT — Asked in at least one recent AKTU examination, or a high-value supporting concept — cover these after the Most Important questions.
PYQ: AKTU — Indicates this question (or a very close variant of it) has actually appeared in an AKTU Cloud Computing examination under BCS071 or a predecessor code (RCS075/KCS713/KOE081) in the year(s) shown, compiled from official/publicly archived AKTU question papers.
A Note on Previous Year Questions
Cloud Computing as BCS071 is a recently introduced AKTU code, so no BCS071-coded paper has been held/archived yet at the time of writing. To give you genuinely real exam questions rather than invented ones, this book's PYQ tags are drawn from verified, publicly archived AKTU papers for this subject under its earlier/parallel codes — RCS075, KCS713 and KOE081 (the open-elective variant) — which carry the same syllabus content, covering the examinations of 2019-20, 2020-21, 2021-22, 2022-23 and 2023-24, each cross-checked where possible against a second independent source. Coverage gaps for 2016-17, 2017-18, 2018-19, 2024-25 and 2025-26 are real and are reported honestly rather than papered over — for these years either no archived paper could be located, or (2024-25) only a single, possibly-paraphrased compiled source could be found, so it was not used for year-tagging. A small number of questions are drawn from a compiled, undated question bank and are correctly left untagged (no PYQ year) rather than assigned a guessed year. Every numerical in this book — Amdahl's Law speedups, elasticity cost comparisons, VM consolidation bin-packing, SLA downtime tables, storage durability, HDFS block splitting, and the MapReduce word-count trace — was independently computed (and, for MapReduce, actually executed and checked against Python's own Counter()) rather than merely narrated. Question wording has, in places, been rephrased slightly for clarity and consistency of style — always cross-check against your own institute's latest circulars for any last-minute syllabus changes.
Suggested Preparation Strategy
• Start each unit with all questions marked ★ MOST IMPORTANT — these give the highest return on revision time.
• Work through every numerical (Amdahl's Law, elasticity cost comparison, VM consolidation, SLA downtime, storage durability, HDFS block split, MapReduce trace) by hand before checking the worked solution — these are heavily rewarded in AKTU answer sheets when shown step by step.
• Redraw every diagram (layered architecture, deployment models, hypervisor types, NIST reference architecture, IAM flow, HDFS, MapReduce, federation levels) from memory — diagram-based recall is heavily rewarded in AKTU answer sheets.
• Revise the ☆ IMPORTANT questions next, followed by the remaining questions for full syllabus coverage.
• Use the Detailed Syllabus section to confirm no topic has been missed before the exam.
