BARC OCES Computer Science & Engineering Syllabus

BARC OCES Computer Science & Engineering: topic-wise syllabus

1. 1

   Engineering Mathematics

   ~10 marks

   • Discrete Mathematics — Set Theory, Relations, Functions, Graphs & Trees, Combinatorics, Mathematical Logic
   • Linear Algebra — Matrices, Determinants, Vector Spaces, Eigenvalues, Eigenvectors, Systems of Equations
   • Calculus — Limits, Continuity, Differentiation, Integration, Partial Derivatives
   • Probability & Statistics — Random Variables, Distributions, Expectation, Bayes Theorem, Sampling, Hypothesis Testing
   • Numerical Methods — Root Finding, Interpolation, Integration, ODE Solutions, Matrix Factorization
   • Graph Theory — Trees, Connectivity, Matching, Coloring, Network Flow, Planar Graphs
2. 2

   Data Structures & Algorithms

   ~16 marks

   • Arrays, Linked Lists — Singly/Doubly/Circular, Operations, Two-pointer Technique, Sparse Matrices
   • Stacks & Queues — Array & Linked Implementations, Prefix/Postfix, Deque, Circular Queue, Applications
   • Trees — Binary Trees, BST, AVL, Red-Black, B/B+ Trees, Tree Traversals, Heap, Trie
   • Graph Algorithms — BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal, Prim, Topological Sort, SCC
   • Hashing — Hash Functions, Collision Resolution (Chaining, Open Addressing), Perfect Hashing, Bloom Filters
   • Sorting & Searching — Quick, Merge, Heap, Counting, Radix, Bucket; Binary Search, Ternary Search
   • Dynamic Programming — Memoization, Tabulation, LCS, LIS, 0/1 Knapsack, Matrix Chain, Optimal BST, Edit Distance
   • Greedy Algorithms — Interval Scheduling, Huffman Coding, Fractional Knapsack, Minimum Spanning Tree
   • String Algorithms — KMP, Rabin-Karp, Z-algorithm, Suffix Array, Suffix Tree, Tries
   • Algorithm Analysis & Complexity — Asymptotic Analysis (Big O, Theta, Omega), Amortized Analysis, NP-Completeness
3. 3

   Computer Organization & Architecture

   ~10 marks

   • Digital Logic — Boolean Algebra, Logic Gates, K-maps, Combinational & Sequential Circuits, State Machines
   • CPU Architecture — Data Path, Control Unit (Hardwired, Microprogrammed), Pipelining, Hazards, Superscalar
   • Memory Hierarchy — RAM, ROM, Cache (Direct, Set, Fully Associative), Virtual Memory, TLBs, Page Replacement
   • I/O Organization — Programmed, Interrupt Driven, DMA, I/O Processors, Buses (PCI, USB)
   • Multiprocessor & Parallel Architectures — SIMD, MIMD, Cache Coherence, Snooping, NUMA
   • ALU Design — Fixed/Floating Point Operations, Booth Multiplication, IEEE 754, Carry Lookahead
   • Performance Metrics — CPI, MIPS, FLOPS, Amdahl's Law, Benchmarking
4. 4

   Operating Systems

   ~10 marks

   • Process Management — Process States, PCB, Context Switch, Process vs Thread, Multi-threading Models
   • CPU Scheduling — FCFS, SJF, Round Robin, Priority, Multilevel Queue, Scheduling Criteria
   • Process Synchronization — Race Conditions, Critical Section, Semaphores, Mutex, Monitors, Classical Problems
   • Deadlocks — Characterization, Prevention, Avoidance (Banker's Algorithm), Detection, Recovery
   • Memory Management — Paging, Segmentation, Fragmentation, Virtual Memory, Page Replacement (FIFO, LRU, Optimal)
   • File Systems — File Organization, Directory Structure, Allocation Methods (Contiguous, Linked, Indexed), Disk Scheduling
   • I/O Management — Buffering, Spooling, RAID, Device Drivers
   • OS Security — Protection, Access Control, Authentication, Encryption, Trusted Systems
5. 5

   Database Management Systems

   ~10 marks

   • ER Model — Entities, Relationships, Attributes, Extended ER, Mapping to Relational Schema
   • Relational Model — Relations, Keys, Integrity Constraints, SQL (DDL, DML, DCL, TCL, Joins, Nested Queries, Views)
   • Normalization — Functional Dependencies, 1NF, 2NF, 3NF, BCNF, 4NF, 5NF, Decomposition
   • Transactions — ACID Properties, States, Schedules, Serializability (Conflict/View), Lock-based Protocols, Deadlock
   • Concurrency Control — Locking (2PL, Strict 2PL), Timestamp Ordering, MVCC, Optimistic Protocols
   • Recovery System — Failure Classification, Log-based (UNDO, REDO, Checkpoint), Shadow Paging, ARIES
   • Indexing & Query Processing — B+ Trees, Hash Indexes, Query Optimization, Selection/Fetch/Join Algorithms
   • NoSQL & Distributed Databases — Key-Value, Document, Columnar, Graph, CAP Theorem, BASE
6. 6

   Computer Networks

   ~10 marks

   • OSI & TCP/IP Models — Layers, Protocols, Encapsulation, Multiplexing, Application vs Transport vs Network
   • Data Link Layer — Framing, Error Detection (CRC, Parity, Checksum), Flow Control, ARQ, MAC (CSMA/CD, Ethernet, Token Ring)
   • Network Layer — IPv4/IPv6, Subnetting, CIDR, ARP, ICMP, Routing (RIP, OSPF, BGP), Multicast, NAT
   • Transport Layer — TCP, UDP, Congestion Control (Slow Start, AIMD, Fast Retransmit), Flow Control, Sockets
   • Application Layer — HTTP, HTTPS, DNS, SMTP, FTP, DHCP, SNMP, Web/API Protocols
   • Network Security — Firewalls, IDS/IPS, TLS/SSL, VPN, IPsec, DDoS, Authentication Protocols
   • Wireless Networks — WiFi, Bluetooth, Cellular (4G/LTE, 5G), MANET, WSN, IoT Protocols
7. 7

   Theory of Computation

   ~8 marks

   • Finite Automata — DFA, NFA, Equivalence, Minimization, Regular Expressions, Pumping Lemma for Regular Languages
   • Pushdown Automata & CFG — PDA Design, Parse Trees, Ambiguity, Chomsky Normal Form, Pumping Lemma for CFL
   • Turing Machines — Design, Variants, Recursive & Recursively Enumerable Languages, Decidability
   • Undecidability — Halting Problem, Reductions, Rice's Theorem, Undecidable Problems, Recursion Theorem
   • Complexity Classes — P, NP, NP-Complete, NP-Hard, Cook-Levin Theorem, Approximation Algorithms
8. 8

   Compiler Design

   ~6 marks

   • Lexical Analysis — Tokens, Patterns, Lex, Regular Expressions to NFA/DFA, Lexical Errors
   • Parsing — Top-Down (Recursive Descent, LL(1)), Bottom-Up (LR(0), SLR, CLR, LALR), Error Recovery
   • Semantic Analysis — Syntax Directed Translation, Type Checking, Intermediate Representations (AST, 3AC)
   • Code Optimization — Local/Global, DAG, Basic Blocks, Peephole, Data Flow Analysis, Register Allocation
   • Code Generation — Target Machine, Instruction Selection, Register Allocation (Graph Coloring), Runtime Environments
9. 9

   Software Engineering & Programming Languages

   ~5 marks

   • SDLC Models — Waterfall, Agile, Scrum, Spiral, V-Model, Iterative, DevOps
   • Requirements Engineering — Elicitation, Analysis, SRS, Use Cases, User Stories
   • Design Principles — OOP (Encapsulation, Inheritance, Polymorphism, Abstraction), Design Patterns, SOLID, UML
   • Software Testing — Unit, Integration, System, Acceptance, White Box, Black Box, Test Coverage
   • Software Quality — Metrics, CMMI, ISO, Code Review, Refactoring, Technical Debt