Skip to content
Past paper

47th BCS Technical Written (CSE-971)প্রশ্ন ও সমাধান

Set by
BCS
Questions
10 (0 MCQ, 10 written)
Exam guide
BCS (ICT and CSE cadre) · বিসিএস (আইসিটি ও সিএসই ক্যাডার)
  • Networking · নেটওয়ার্কিং 2
  • Programming · প্রোগ্রামিং 2
  • Algorithms · অ্যালগরিদম 1
  • Cloud & Emerging Tech · ক্লাউড ও উদীয়মান প্রযুক্তি 1
  • Computer Architecture · কম্পিউটার আর্কিটেকচার 1
  • Database · ডেটাবেজ 1
  • Microprocessor · মাইক্রোপ্রসেসর 1
  • Software Engineering · সফটওয়্যার ইঞ্জিনিয়ারিং 1
Written question 1Programming

(a) In the case of C programming, how does pointer arithmetic behave? Illustrate with an example.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 2Networking

(a) What are the purposes of using the protocols ARP and DVR? Explain with examples.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 3Computer Architecture

(a) Discuss how floating point representation contributes to rounding errors.

Model answer

Floating-point numbers are stored in IEEE-754 format as sign, exponent, and a finite-length mantissa — since only a fixed number of mantissa bits are available, most real numbers cannot be represented exactly and must be rounded to the nearest representable value.

Format Total bits Mantissa bits Approx. decimal precision
Single precision 32 23 ~7 digits
Double precision 64 52 ~15-16 digits

Why rounding errors occur

  • Many decimal fractions (e.g., 0.1) are repeating in binary, so they are truncated/rounded to fit the mantissa — the stored value is only an approximation.
  • Every arithmetic operation (add, multiply, divide) can introduce a fresh rounding step, since the true result may need more bits than the mantissa holds.
  • Error accumulation: repeated operations (e.g., summing millions of values in a loop) compound these small errors.
  • Catastrophic cancellation: subtracting two nearly equal floating-point numbers cancels the significant leading digits and leaves mostly rounding noise.

Worked example:

0.1 in binary = 0.0001100110011... (repeating, truncated to 23/52 bits)
0.1 + 0.2 in double precision = 0.30000000000000004   (not exactly 0.3)

This happens because both 0.1 and 0.2 are stored as slightly-off approximations, and their sum inherits both errors.

Exam takeaway: Never compare floats with ==; use a tolerance (|a-b| < ε) and avoid subtracting nearly-equal large numbers to reduce cancellation error.

Written question 4Algorithms

(a) For the frequencies given below, construct a Huffman Tree and compute Average Code Length. {A:5, B:9, C:12, D:13, E:16, F:45}

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 5Microprocessor

(a) Discuss the roles of different segment registers and offset registers of 8086 microprocessor with examples.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 6Programming

(a) What are the steps of operation of a compiler? Describe the tasks of each of the steps.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 7Database

(a) Consider the following Bank database, where the Primary keys are underlined.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 8Software Engineering

(a) What is Regression testing and why is it important?

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 9Cloud & Emerging Tech

(a) Differentiate between Supervised learning & Unsupervised learning with examples.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Written question 10Networking

(a) Compare between IPv4 and IPv6 headers.

Sign up free to see the model answer · উত্তর দেখতে বিনামূল্যে সাইন আপ করুন

Question text is from the public recruitment exam; answers and explanations are written by ARBS Academy. All past papers · BCS (ICT and CSE cadre) guide