Section One
The Examination, At A Glance
Everything you need to know before you sit for either the JU PMSCS or the CUET CSE postgraduate written test — distilled from the official Father of Admission Test (2nd Edition, JU PMSCS Version) by Mustakim Billah Bedar, the JU CSE department circular, and the CUET admission portal.
Total Marks
50
MCQ Count
40
Short Written
10
Negative Marking
0
This Portal Contains
518
practice MCQs across 11 subjects
JU PMSCS — Mark Distribution
| Section | Count | Per Question | Total |
|---|---|---|---|
| MCQ (Recent procedure) | 40 | 1 mark | 40 |
| Written / Short | 10 | 1 mark | 10 |
| Grand Total | 50 | — | 50 |
| Older procedure was 30 MCQ + 10 written×2 = 50. Current is 40+10. | |||
Strategic insight from the official guide: Almost 10% of MCQs repeat verbatim from previous years, 20% are slightly modified with the same answer, and 20% test the same fact with different wording. If you solve previous papers thoroughly, you can target ~50% of the paper before walking in.
CUET CSE — How It Differs
CUET does not publish a fixed syllabus for its M.Sc. Engg. / M.Engg. CSE admission. The department conducts a written test plus an interview. The same eight to ten core CSE subjects you prepare for JU will cover ~80% of CUET. Add basic AI (search, ML intro) and OOP depth, and you are ready for both.
Eligibility — Your Profile Check
| Requirement | JU PMSCS | CUET (Part-time M.Engg.) |
|---|---|---|
| 4-year BSc in CSE/CS/IT | ✓ Eligible | ✓ Eligible |
| Minimum CGPA | ≥ 2.50, no third division | Department-set |
| Job experience | Not required | Strongly preferred |
| Class schedule | Friday only | Part-time available |
With 3 years of experience and a BSc in Computer Science, you exceed every requirement.
The 14 Subjects, Ranked By Frequency
The official guide names the topics that appear most often. Use the priority bands when you allocate your study weeks.
Section Two
The Syllabus, In Detail
A complete topic map for both exams — what to know inside each subject, with the level of depth expected.
1. Programming (C/C++/Java) — High Priority
C Language
- Data types, operators, control flow, functions
- Pointers: declaration, pointer to pointer, pointer arithmetic, null pointer
- Memory management: malloc, calloc, realloc, free
- Arrays and strings — 1D, 2D, indexing, traversal
- Storage classes — auto, static, register, extern
- Structures and unions — declaration, accessing members, size differences
- Recursion — factorial, Fibonacci, Tower of Hanoi
- File handling basics
C++ & OOP
- Class, object, constructor, destructor
- Inheritance (single, multiple, multilevel, hierarchical, hybrid)
- Polymorphism — compile-time (overloading) vs runtime (overriding)
- Encapsulation, abstraction
- Virtual functions, abstract class, friend function
Java basics
- Class vs object, constructors
- Interface vs abstract class
- JVM, JRE, JDK distinction
- Exception handling — try, catch, finally, throw, throws
- Garbage collection
2. Data Structure — High Priority
- Linear: Array, Linked List (singly, doubly, circular)
- Stack & Queue: operations, infix-to-postfix, evaluation
- Tree: Binary Tree, BST, AVL, Heap (max/min), traversals (inorder, preorder, postorder, level-order)
- Hash Table: hash function, collision resolution (chaining, open addressing)
- Graph: representation (adjacency matrix/list), BFS, DFS
- Time complexity of operations on each structure
3. Database — High Priority
- DBMS vs file system, schema vs instance
- SQL: SELECT, JOIN (inner, left, right, full outer), GROUP BY, HAVING, subqueries, DISTINCT
- DDL, DML, DCL, TCL distinction
- Normalization: 1NF, 2NF, 3NF, BCNF, anomalies
- ACID properties: Atomicity, Consistency, Isolation, Durability
- Keys: primary, foreign, candidate, super, composite
- ER diagram, relational algebra
- Transaction, deadlock, two-phase locking
- Indexing — clustered vs non-clustered, B-tree
- Trigger, view, stored procedure
4. Networking — High Priority
- OSI Model (7 layers) — Physical, Data Link, Network, Transport, Session, Presentation, Application
- TCP/IP Model (4 layers) — Network Access, Internet, Transport, Application
- Transmission modes: simplex, half-duplex, full-duplex
- IEEE 802 standards (802.3 Ethernet, 802.5 Token Ring, 802.11 WiFi)
- CSMA/CD vs CSMA/CA
- IP addressing: IPv4 vs IPv6 (16 bytes / 128 bits), classes, subnetting basics
- TCP vs UDP — reliability, ordering, use cases
- Protocols: HTTP, HTTPS, FTP, SMTP, POP3, IMAP, DNS, DHCP, ARP, ICMP
- Network devices: hub, switch, bridge, router, repeater, gateway
- Network topology: bus, star, ring, mesh, tree
- Error detection: parity, CRC, checksum, Hamming code
- Shannon's capacity, Nyquist bit rate
5. Operating System — High Priority
- Process vs thread, process states, PCB
- Scheduling: FCFS, SJF (preemptive/non-preemptive), Round Robin, Priority, Multilevel queue
- Deadlock: 4 conditions (Mutual exclusion, Hold & wait, No preemption, Circular wait), Banker's algorithm
- Memory management: paging, segmentation, virtual memory, page replacement (FIFO, LRU, Optimal, Belady's anomaly)
- Synchronization — semaphore (binary, counting), mutex, monitor, spinlock
- Producer-consumer, Readers-writers, Dining philosophers
- UNIX features — multi-user, multi-tasking, time-sharing
- System call, kernel mode vs user mode
- I/O scheduling, DMA
6. Algorithm Design — High Priority
- Asymptotic notation: Big-O, Omega (Ω), Theta (Θ)
- Sorting: Bubble, Selection, Insertion, Merge, Quick, Heap — time & space complexity
- Searching: Linear, Binary
- Greedy: Kruskal, Prim, Dijkstra, Huffman
- Divide & Conquer: Merge sort, Quick sort, Binary search
- Dynamic Programming: Fibonacci, LCS, Knapsack, matrix chain
- Backtracking — N-queens basics
- NP-completeness intro
7. Math & Probability — High Priority
- Discrete Math: set theory, cardinality, propositional logic, truth tables
- Boolean algebra — laws, simplification, K-map
- Number systems: binary, octal, hex; conversions; 1's & 2's complement
- Probability: basic counting, permutation, combination, card/dice problems, conditional probability
- Series: Taylor for sin(x), cos(x), e^x, log(1+x)
- Differential calculus basics
- Matrix operations — determinant, inverse
- Statistics — mean, median, mode, variance, standard deviation
8. Computer Fundamental — High Priority
- Computer generations (1st through 5th) and underlying technology
- Hardware: CPU, ALU, CU, registers, motherboard, ports
- Memory hierarchy: register, cache (L1/L2/L3), RAM, ROM, secondary storage
- RAM types — DRAM, SRAM; ROM types — PROM, EPROM, EEPROM
- Storage devices: HDD, SSD, magnetic tape, optical disks
- Input/output devices, peripherals
- Software types: system, application, firmware, utility
- Internet basics: ISP, browser, URL, search engines
- MS Office (Word, Excel, PowerPoint) — common shortcuts
- File extensions and their meanings
9. Digital Electronics — Medium Priority
- Logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR
- Combinational circuits: adder (half/full), encoder, decoder, multiplexer
- Sequential circuits: flip-flops (SR, JK, D, T), counters, registers
- Boolean algebra simplification
10. Microprocessor — Medium Priority
- 8085/8086 architecture basics
- CISC vs RISC
- Addressing modes
- Pipelining basics
- Cache memory mapping
11. English — Medium Priority
- Prepositions (most asked)
- Right form of verb
- Synonyms and antonyms (CSE / general)
- Tense correction
- Subject-verb agreement
12. IQ & Analytical Reasoning — Medium Priority
- Pattern recognition (e.g., 1213=6, 1415=10 type)
- Number series, letter series
- Coding-decoding
- Blood relations
- Direction sense
- Syllogism basics
Section Three
The Reader · বিস্তারিত পড়াশোনা
৮টি high-priority subject-এর জন্য বিস্তারিত বাংলা notes — concept, code example, এবং exam tip সহ। উপরের subject filter থেকে যেকোনো একটা select করুন। প্রতিটা subject Practice section-এর প্রশ্নগুলোর foundation।
Section Four
MCQ Practice
A bank of 518 real questions extracted from Father of Admission Test (Mustakim Billah Bedar) and the Examveda computer fundamentals collection. Pick a subject, get instant feedback, learn from explanations.
Available in current filter
518 questions
Total Bank
518
Pick a subject above or click Start Practice to begin.
518 questions ready · click any subject filter to auto-start
Section Five
Mock Test
Full simulation of the JU PMSCS admission test — 40 MCQ + 10 short questions, 90 minutes, no negative marking. Builds the muscle of working under pressure.
Ready to take the test?
You will get a randomised set of 40 MCQs drawn from the question bank, plus 10 short-answer questions.
The timer is 90 minutes. You may review and change answers any time. There is no negative marking.
Navigation Grid · Click any number to jump
answered
flagged
current
Section Six
Reference Sheet
Cheat-sheet for the night before — full forms, key formulas, and frequently confused facts.
CSE Full Forms
Networking — Quick Facts
| Term | Value / Note |
|---|---|
| OSI Layers (top to bottom) | App → Pres → Sess → Trans → Net → DataLink → Phy |
| TCP/IP Layers | Application → Transport → Internet → Network Access |
| IPv4 size | 32 bits / 4 bytes |
| IPv6 size | 128 bits / 16 bytes |
| HTTP port | 80 |
| HTTPS port | 443 |
| FTP port | 20 (data), 21 (control) |
| SMTP port | 25 |
| POP3 port | 110 |
| DNS port | 53 |
| SSH port | 22 |
| Hub layer | Physical (Layer 1) |
| Switch layer | Data Link (Layer 2) |
| Router layer | Network (Layer 3) |
| Shannon's capacity | C = B × log₂(1 + SNR) |
| Nyquist bit rate | 2 × B × log₂(V) |
Operating System — Key Formulas
| Concept | Formula / Rule |
|---|---|
| Deadlock conditions (all 4 must hold) | Mutual Exclusion + Hold & Wait + No Preemption + Circular Wait |
| CPU utilization | 1 − p^n (p = I/O probability, n = degree of multiprogramming) |
| Effective access time (paging) | EAT = (1−p) × m + p × page-fault-time |
| Hit ratio (cache) | hits / (hits + misses) |
| Belady's anomaly | More page frames → more page faults (occurs in FIFO) |
Data Structure — Time Complexity Cheat Sheet
| Operation | Array | Linked List | BST (avg) | Hash Table |
|---|---|---|---|---|
| Access | O(1) | O(n) | O(log n) | O(1) |
| Search | O(n) | O(n) | O(log n) | O(1) |
| Insert | O(n) | O(1) | O(log n) | O(1) |
| Delete | O(n) | O(1) | O(log n) | O(1) |
Sorting Algorithms — Time Complexity
| Algorithm | Best | Average | Worst | Space | Stable? |
|---|---|---|---|---|---|
| Bubble | O(n) | O(n²) | O(n²) | O(1) | Yes |
| Selection | O(n²) | O(n²) | O(n²) | O(1) | No |
| Insertion | O(n) | O(n²) | O(n²) | O(1) | Yes |
| Merge | O(n log n) | O(n log n) | O(n log n) | O(n) | Yes |
| Quick | O(n log n) | O(n log n) | O(n²) | O(log n) | No |
| Heap | O(n log n) | O(n log n) | O(n log n) | O(1) | No |
Number System Conversions
| Decimal | Binary | Octal | Hex |
|---|---|---|---|
| 10 | 1010 | 12 | A |
| 15 | 1111 | 17 | F |
| 16 | 10000 | 20 | 10 |
| 255 | 11111111 | 377 | FF |
2's complement of −34: 34 in binary = 00100010 → flip = 11011101 → +1 = 11011110
Boolean Algebra Identities
- A + 0 = A, A + 1 = 1, A · 0 = 0, A · 1 = A
- A + A = A, A · A = A
- A + A' = 1, A · A' = 0
- (A')' = A
- De Morgan's: (A·B)' = A' + B', (A+B)' = A' · B'
- A + AB = A (absorption)
- A + A'B = A + B
Database — Normal Forms
- 1NF: atomic values, no repeating groups
- 2NF: 1NF + no partial dependency on composite key
- 3NF: 2NF + no transitive dependency
- BCNF: 3NF + every determinant is a candidate key
Common English Prepositions (frequently asked)
| Verb / Adjective | Preposition | Example |
|---|---|---|
| Depend | on | It depends on you. |
| Differ | from | This differs from that. |
| Insist | on / upon | He insisted on going. |
| Consist | of | Water consists of H and O. |
| Suffer | from | She suffers from fever. |
| Capable | of | He is capable of doing it. |
| Famous | for | Bangladesh is famous for jute. |
| Afraid | of | I am afraid of cats. |
| Confident | of / about | She is confident of success. |
| Aware | of | Be aware of the risks. |