Skip to content
Past paper

Bangladesh Livestock Research Institute Assistant Maintenance Engineer — Exam: 20.05.2023প্রশ্ন ও সমাধান

Set by
Bangladesh Livestock Research Institute
Post
Assistant Maintenance Engineer
Exam date
20 May 2023
Questions
8 (0 MCQ, 8 written)
Exam guide
Government IT officer posts · সরকারি প্রতিষ্ঠানের আইটি পদ
  • Database · ডেটাবেজ 2
  • Networking · নেটওয়ার্কিং 2
  • Algorithms · অ্যালগরিদম 1
  • Computer Architecture · কম্পিউটার আর্কিটেকচার 1
  • Data Structures · ডেটা স্ট্রাকচার 1
  • Digital Logic · ডিজিটাল লজিক 1
Written question 1Networking

A telephone line normally has a bandwidth of 3000 Hz (300 to 3300 Hz) assigned for data communication. The SNR is usually 3162. What will be the capacity for this channel?

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

Written question 2Computer Architecture

What is Diode and Inductor?

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

Written question 3Database

What in First and Second Normal form is DBMS?

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

Written question 4Digital Logic

Difference between combinational and sequential circuits.

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

Written question 5Algorithms

What is Big O and Big Omega?

Model answer

Direct answer: Big-O, Big-Omega, and Big-Theta describe the upper, lower, and tight asymptotic bounds of a function's growth rate, most often used to bound an algorithm's running time as input size n grows.

graph TD
  A["f(n) growth rate"] --> B["O(g(n)): f(n) <= c.g(n) — upper bound (worst case)"]
  A --> C["Omega(g(n)): f(n) >= c.g(n) — lower bound (best case)"]
  A --> D["Theta(g(n)): c1.g(n) <= f(n) <= c2.g(n) — tight bound"]
Notation Meaning Bounds Typical use
O(g(n)) — Big-O f grows no faster than g Upper bound only Worst-case time complexity
Ω(g(n)) — Big-Omega f grows at least as fast as g Lower bound only Best-case time complexity
Θ(g(n)) — Big-Theta f grows exactly as fast as g (up to constants) Both upper and lower Exact asymptotic behavior when best = worst order

Worked example: linear search on an array of n elements.

  • Worst case (element absent, or last): the loop runs all n times → O(n).
  • Best case (element found first try): the loop runs once → Ω(1).
  • Since best and worst cases differ in order, linear search does not have a single Θ bound — Θ(n) would only apply if every case took Θ(n), which is false here.

Contrast: for an algorithm like array-sum (always visits all n elements regardless of data), best = worst = Θ(n), so O, Ω and Θ all coincide at n.

Exam takeaway: O = "at most", Ω = "at least", Θ = "exactly" (both bounds match) — always state which case (best/worst/average) a bound refers to, since O and Ω on the same algorithm can differ.

Written question 6Data Structures

Difference between Stack and Queue.

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

Written question 7Networking

What is baseband and passband frequency?

Model answer

Direct answer: baseband transmission sends the original digital signal unmodulated, occupying frequencies from near 0 Hz up to its natural bandwidth; passband transmission modulates that signal onto a higher-frequency carrier so it occupies a band around that carrier frequency.

graph LR
  subgraph Baseband
    S1[Digital signal 0/1 levels] --> C1[Sent directly on the medium]
  end
  subgraph Passband
    S2[Digital signal] --> MOD[Modulator]
    CAR[Carrier frequency] --> MOD
    MOD --> C2[Modulated signal around carrier band]
  end
Aspect Baseband Passband
Frequency range used 0 Hz up to signal bandwidth Centered around a carrier frequency
Modulation None (direct digital signaling) Required (ASK, FSK, PSK, QAM, etc.)
Channels per medium One signal occupies the whole medium at a time Multiple signals via different carrier bands (FDM)
Typical use Ethernet LAN cables, short-haul digital links Radio, TV broadcast, DSL, Wi-Fi, cellular
Distance/noise resistance Degrades faster over distance Better suited to long-distance/wireless transmission

Why it matters: because passband signals occupy a narrow band around a chosen carrier, several signals can share the same physical medium (e.g. air, coaxial cable) simultaneously by assigning each one a different carrier frequency — this is exactly how radio and TV stations coexist and how DSL carries data alongside voice on the same phone line.

Exam takeaway: baseband = signal sent "as-is" at low frequency, one at a time on the medium; passband = signal shifted to a carrier band via modulation, enabling multiple simultaneous channels (frequency-division multiplexing).

Written question 8Database

What is primary key and foreign key with example?

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 · Government IT officer posts guide