All syllabi
BCSWritten
BCS written syllabus
General and technical cadres · 235 pages
Compulsory subjects and post-related subjects for professional and technical cadres. Confirm the applicable subject code in the recruitment notice.
Published by BPSC. Collected 2026-11-14. Confirm the edition and subject against your recruitment notice before studying.
Text below is extracted for search and may contain mistakes. Use the original PDF to check marks, formulas and Bangla spelling.
BanglaEnglishBangladesh affairsInternational affairsCivil engineeringElectrical engineeringMechanical engineeringComputer science
Read the document
Page 230 of 235
Searchable text (unverified)
SYLLABUS FOR BCS (WRITTEN) EXAMINATION
230/235
(POST RELATED)
Subject Code: 971
Total Marks-200
Part-I
Marks-100
(a) Computer Programming:
Introduction to computer programming. Assembling language programming. Problem solving
techniques, algorithm specification and development. Programming style, testing and debugging.
Program design techniques: Structured and modular program design. Programming languages and
paradigms: classification. Programming in C: Data type, statements, control structures, arrays, pointers,
strings, functions, preprocessor directives, structures, unions and bit -fields, files. Introduction to object
oriented programming: Encapsulation, inheritance and polymorphism, Mechanic Language
Programming, Template functions and classes multi -threads exceptions, Class and object. Introductory
programming with C++/JAVA.
(b) Digital System:
Number system: binary, octal, hexadecimal and BCD. Data representation. Logic gates and Boolean
algebra: Combinational circuits. Circuit design using logic gates. Circuit and expression minimization:
Karnaugh map and Quine -McCluskey. Basic flip -flops ( FF), Design of half and full adder. Basic
counters and register. Basic decoders, encoders, multiplexers and demultiplexers. ADC and DAC
circuits. PLA design, Pulse mode and f undamental mode logic, Pulse & switching units,
Newtrivibrations , Digital LC: DTL, TTL, III, CMOS MOS gates, Memory system, LED, LCD
applications of Op-Amps. Cooparators.
(c) Discrete Mathematics:
Prepositional and predicate calculus: Basic concept. Theory o f sets: set operations, algebra of sets.
Mathematical induction. Basic concept of relations and its representation. Functions and its classification
and pictorial representation. Graph theory and its application. Elementray number system. Principles of
counting. Reversion, generating, functions, recurrence relation.
(d) Numerical Analysis:
Solving linear systems with Gaussian elimination and Gauss -Jordan elimination method. Interpolation:
Newton‘s formula, Lagrange‘s formula. Numerical differentiations an d integrations: Trapezoidal,
Simpson‘s 1/3rd and 3/ 8th rule. Romberg integration. Solutions and Newton -Ralphson‘s method.
Solution of ordering differential equation and least square approximation of functions.
(e) Data Structures:
Arrays: Representation and operations. Sparse and dense matrices: Concept and operation. Stacks and
queues: Concept, structures and basic operations. Quick -sort and Polish notation: Applications of stack.
Recursion: Concept and applications. Linked lists: Representation and v arious operations. Trees: Binary
trees, traversing binary trees. Binary search trees: Various opeations. Binary heaps: Heap sort.
Huffman‘s algorithm. Graphs: Representations and operations. Spanning trees, shortest path and
topological sorting. Internal s orting: Insertion sort, selection sort, merge -sort, radix sort, Basic hashing
techniques.
(f) Microprocessor and Interfacing:
Microprocessor and microcomputers. Evolution of microprocessor. Architecture of a general purpose
microprocessor and its operati on. Addressing modes. Common instruction types: Basic assembly
instruction set. Intel 8086 microprocessor: Internal architecture, register structure, programming model,
addressing modes and instruction sets. Interrupts its classification and interrupt hand ling, Memory