Computer Science Engineering

Level 2 Syllabus

Sr.No. Category name Subcategory name weight-age

1 Operating System 1) Basics and Processes: Concept of Operating Systems, 2
Generations of Operating systems, Types of Operating Systems,
OS Services, System Calls, Structure of an OS - Layered,
Monolithic, Microkernel Operating Systems, Concept of Virtual
Machine, Case study on UNIX and WINDOWS Operating System
Processes: Definition, Process Relationship, Different states of a
Process, Process State transitions, Process Control Block (PCB),
Context switching
Thread: Definition, Various states, Benefits of threads, Types of
threads, Concept of multithreads
2) Scheduling and IPC: Process Scheduling: Foundation and 2
Scheduling objectives, Types of Schedulers, Scheduling criteria:
CPU utilization, Throughput, Turnaround Time, Waiting Time,
Response Time, Scheduling algorithms: Pre-emptive and Non pre-
emptive, FCFS, SJF, RR, Multiprocessor scheduling: Real Time
scheduling: RM and EDF
Inter-process Communication: Critical Section, Race Conditions,
Mutual Exclusion, Hardware Solution, Strict Alternation,
Peterson’s Solution, The Producer\Consumer Problem,
Semaphores, Event Counters, Monitors, Message Passing,
Classical IPC Problems: Reader’s & Writer Problem, Dinning
Philosopher Problem etc.
Deadlocks: Necessary and sufficient conditions for Deadlock,
Deadlock Prevention, Deadlock Avoidance: Banker’s algorithm,
Deadlock detection and Recovery
3) Memory, File and Device Management: Memory 3
Management: Basic concept, Logical and Physical address map,
Memory allocation: Contiguous Memory allocation – Fixed and
variable partition– Internal and External fragmentation and
Compaction, Paging: Principle of operation – Page allocation –
Hardware support for paging, Protection and sharing,
Disadvantages of paging
Virtual Memory: Basics of Virtual Memory – Hardware and control
structures – Locality of reference, Page fault, Working Set, Dirty
page/Dirty bit – Demand paging, Page Replacement algorithms:
Optimal, First in First Out (FIFO), Second Chance (SC), Not recently
used (NRU) and Least Recently used (LRU).
I/O Hardware: I/O devices, Device controllers, Direct memory
access Principles of I/O Software: Goals of Interrupt handlers,
Device drivers, Device independent I/O software, Secondary-
Storage Structure: Disk structure, Disk scheduling algorithms;
File Management: Concept of File, Access methods, File types, File
operation, Directory structure, File System structure, Allocation
methods (contiguous, linked, indexed), Free-space management
(bit vector, linked list, grouping), Directory implementation (linear
 Computer Science Engineering
Level 2 Syllabus

list, hash table), efficiency and performance

1) Algorithm Analysis: Analysis of algorithm- Characteristics of 2
algorithm, Asymptotic analysis of complexity bounds - best,
average and worst-case behavior, Performance measurements of
Algorithm, Time and space trade-offs; Analysis of recursive
algorithms through recurrence relations- Substitution method,
Recursion tree method, Masters’ theorem
2) Algorithm Strategies: Fundamental Algorithmic Strategies- 1
Brute-Force, Greedy, Dynamic Programming, Divide and Conquer,
Branchand- Bound and Backtracking methodologies for the design
Design and of algorithms, Illustrations of these techniques for Problem-
Analysis of Solving, Bin Packing, Knap Sack TSP; Heuristics- characteristics and
2 Algorithms their application domains
3) Graph and Tree Algorithms: Traversal algorithms: Depth First 2
Search (DFS) and Breadth First Search (BFS); Shortest path
algorithms- Transitive closure, Minimum Spanning Tree,
Topological sorting, Network Flow Algorithm.
4) Advance Problems: Tractable and Intractable Problems- 2
Computability of Algorithms, Computability classes – P, NP, NP-
complete and NP-hard, Cook’s theorem, Standard NP-complete
problems and Reduction techniques; Advanced Topics-
Approximation algorithms, Randomized algorithms, Class of
problems beyond NP – P SPACE
1) Computer Organization and Arithmetic: Computer 1
Architecture Fundamental Blocks- CPU, Memory, I/O Subsystems,
Control Unit; Levels of programming languages, assembly
1
language instructions, Computer Registers, Computer
Instructions, Timing & Control, Memory Reference Instructions,
Input-Output and Interrupts; Data representation- signed number
representation, fixed and floating point representations, character
representation., Computer arithmetic – integer addition and
subtraction, ripple carry adder, carry look-ahead adder,
multiplication – shift-andadd, Booth multiplier, carry save
Computer multiplier, Division restoring and non-restoring techniques,
Organization & floating point arithmetic
3 Architecture 2) Control Design and Instruction Set: Instruction Set- Instruction 1
set architecture of a CPU- registers, Instruction execution cycle
and subcycle, Instruction set, Instruction types and formats,
Instruction, Codes, RTL interpretation of instructions; Control
Design- Micro Programmed Control: Control memory, Address
sequencing, Addressing Modes, micro program , example, design
of control unit, micro-operations; Hardwire and micro-
programmed control- micro-programme sequencing, concept of
horizontal and vertical microprogramming. Hardwired & Micro
Programmed (Control Unit), Micrprogrammed; Instruction
sequencing & interpretation, computers, Microcoded CPU-
Pentium processor, Specifying a CPU, Design & implementation of
 Computer Science Engineering
Level 2 Syllabus

simple CPU, General Register Organization, Stack Organization,

3) Memory and I/O Organization: Input/Output organization, 1
Peripheral devices, I/O interface, I/O ports; Interrupts- interrupt
hardware, types of interrupts and exceptions; Modes of Data
Transfer- Programmed I/O, interrupt initiated I/O and Direct
Memory Access. I/O channels and processors; Serial 1
Communication- Synchronous & asynchronous communication,
standard communication interfaces; Memory Organization:
Memory-Basic concept and hierarchy, Main memory, Auxiliary 1
memory, Associative memory, Memory Interleaving; Cache
memories: concept and design issues, associative mapping, direct
mapping, set-associative mapping, cache writing and initialization;
Mapping Functions, Write policies, Replacement Algorithm;
Pipeline and Multiprocessor: Pipeline and Vector Processing-
Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction
Pipeline, RISC Pipeline, Vector Processing, Array Processors; Multi
Processors: Characteristics of Multiprocessors, Interconnection
Structures, Inter processor arbitration, Inter processor
communication, and synchronization.
1) Database System Basics: Data Abstraction, Data Independence, 2
Data Definition Language (DDL), Data Manipulation Language
(DML),
Entity-relationship model ( E-R Diagram, Extended E-R features-
DBMS Generalization, Specialization, Translating E-R model into
4
Relational model),
network model, relational and object oriented data models,
integrity constraints, data manipulation operations, Keys, Design
issues, Aggregation
DB Architecture
2) RDBMS: Relational Query Language: Relational algebra, Tuple 4
and domain relational calculus, SQL fundamentals, DDL and DML,
DCL constructs, Open source and Commercial DBMS - MYSQL,
ORACLE, DB2, SQL server; Relational database Design: Domain
and data dependency: Functional Dependencies, Non-loss
Decomposition, Multi-valued Dependencies, Join Dependencies,
Armstrong's axioms, Normal forms:First, Second, Third Normal
Forms, Boyce/Codd Normal Form, 4NF and 5 NF, Dependency
preservation, Lossless design, Evaluation of relational algebra
expressions, Query equivalence, Join strategies, Query
optimization algorithms; Storage strategies: Physical Storage
Media, File Organization, Indices, B-trees, hashing, Query
Processing Overview, Catalog Information for Cost Estimation,
Selection Operation
 Computer Science Engineering
Level 2 Syllabus

1
3) Transaction processing and Database Security:
Concurrency control, ACID property, Serializability of
scheduling, Locking and timestamp based schedulers, Multi-
version and optimistic Concurrency Control schemes,
Database recovery; Authentication, Authorization and access
control, DAC, MAC and RBAC models, Intrusion detection,
SQL injection

Core Java (Module

5
ID: 1937)