Skip to content
Search jobs inside ChatGPT or Claude. Claude, ChatGPT, Claude Code, Codex, Gemini, Cursor and Grok
Connect
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 231 of 235

Searchable text (unverified)
SYLLABUS FOR BCS (WRITTEN) EXAMINATION     
       
231/235 
 
management in Intel 80 x86 family: Real -mode memory management , segmentation  and segmented to 
physical address translation. Protected mode memory management: Segmentation and virtual addressing, 
segment selectors and descruptors and  tables. Intel 80386 and 80486 register formats. Paged memory 
operation and TLB structure I/O port organization and accessing. Interfacing the keyboard, printer and 
monitor. Structure and operation of certain chips as 8255A, 8253, 8272, 8259A, 8237. Bus in terfaces 
and micro controllers. 
(g) Computer Organization and Architecture: 
 Fundamentals of computer design. Processor and ALU design. Control design: Hardware control and 
micro-programmed control. Caches Memory organization. Exceptions System organization Bus and 
hazards I/O subsystem and I/O processor. Parallel processing: Concept, pipeline processors. Interrupts 
systolic arrays and fault-tolerant computers. 
(h) Compiler and theory of computation. Introduction to compiliary. Basic issues, logical analysis, hexical 
analysis, syntax analyses. Semantic analysis, type cheeking, run -time environments, code generation, 
code optimization and language theory. 
 
COMPUTER SCIENCE  
Part-II 
Marks-100 
(a) Algorithm: 
Algorithm and complexity: Asymptotic notat ions. Basic algorithm techniques and analysis: Divide and 
conquer, dynamic programming, greedy method, branch and bound, string matching, computational 
geometric problems, graph algorithms, spanning trees, shortest paths, max -flow problem, searching 
algorithms. Techniques for analysis of algorithms, approximation algorithms, parallel algorithms. 
 
(b) Operating System: 
 Introduction, evolution, goals and components of OS. Types of OS Process management: Process states 
PCB, job and process scheduling. CPU sch eduling algorithms, critical section problems and solutions. 
Semaphores, Inter -process communication techniques. Deadlick handling methods. Memory 
management techniques: Paging, segmentation and page replacement policies. Secondary storage 
management: Disk scheduling algorithms. File management: File system structure, organization, FCB, 
space allocation, tree structured file system. Protection and security: classification and handling 
techniques. 
 
 (c) Database Management System: 
 Definition of DBMS, types of DBMS, its advantages and disadvantages, Data model: ER model and 
relational model. Integrity constraints. Functional dependencies. Assertions and triggers. File 
organization: Definition of various file organization, classificat ion and Representation. Indexing 
techniques: sparse and dense indexing. B+ tree indexing, hash indexing. Relational database design: 
normalization, 2NF, 3NF and BCNF. Query processing: Various notations, cost estimation of selection 
operation and join oper ation. Transaction concept and concurrency  control: Lock based protocol, 
deadlock handling. SQL and application using SQL. 
 
(d) Software Engineering: 
 Introduction, Software process. Project management. Requirements engineering processes. System 
models: Co ntext, data, behavioral and object models. Object oriented design techniques. Real -time 
software design. System design with reuse. Critical system design dependability, software maintenance, 
critical system specification  and development Verification and va lidation. Software testing. Software 
cost estimation: COCOMO model Halstead formula, Graph: Cel analysis of complexity measures, 
software reliability and availability, Quality assurance.