[AKU-PATNA] [105-CSE]

CURRICULUM
FOR
COMPUTER SCIENCE & ENGINEERING

SEMESTER - IV (COMPUTER SCIENCE & ENGINEERING)

S.No Paper Code Paper Title L T P Credits

1 PCC CS 401 Discrete Mathematics 3 1 0 4

2 PCC CS 402 Computer Organization & Architecture 3 0 4 5

3 PCC CS 403 Operating Systems 3 0 4 5

4 PCC CS 404 Design and Analysis of Algorithms 3 0 4 5

5 ESC 401 Digital Electronics 3 0 4 5

6 HSMC 401 Human Resource Development and 3 0 0 3

Organizational Behaviour

7 MC 401 Environmental Science 3 0 0 0

PAPER CODE - PCC CS 401

PCC CS Discrete Mathematics L:3 T:1 P:0 CREDIT:4

401

Objectives of the course:

➔ Use mathematically correct terminology and notation.

➔ Construct correct direct and indirect proofs.
➔ Use division into cases in a proof.
➔ Use counter examples.
➔ Apply logical reasoning to solve a variety of problems.

Detailed contents:

Module 1
Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products,
Binary Relation, Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum
and Product of Functions, Bijective functions, Inverse and Composite Function, Size

1
of a Set, Finite and infinite Sets, Countable and uncountable Sets, Cantor's diagonal
argument and The Power Set theorem, Schroeder-Bernstein theorem.

Module 2
Principles of Mathematical Induction: The Well-Ordering Principle, Recursive
definition, The Division algorithm: Prime Numbers, The Greatest Common Divisor:
Euclidean Algorithm, The Fundamental Theorem of Arithmetic. Basic counting
techniques-inclusion and exclusion, pigeon-hole principle, permutation and
combination.

Module 3
Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic
Connectives and Truth Tables, Logical Equivalence: The Laws of Logic, Logical
Implication, Rules of Inference, The use of Quantifiers. Proof Techniques: Some
Terminology, Proof Methods and Strategies, Forward Proof, Proof by Contradiction,
Proof by Contraposition, Proof of Necessity and Sufficiency.

Module 4
Algebraic Structures and Morphism: Algebraic Structures with one Binary
Operation, Semi Groups, Monoids, Groups, Congruence Relation and Quotient Structures,
Free and Cyclic Monoids and Groups, Permutation Groups, Substructures, Normal
Subgroups, Algebraic Structures with two Binary Operation, Rings, Integral Domain and
Fields. Boolean Algebraand Boolean Ring, Identities of Boolean Algebra, Duality,
Representation of Boolean Function, Disjunctive and Conjunctive Normal Form

Module 5
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path,
Cycle, Sub Graph, Isomorphism, Eulerian and Hamiltonian Walks, Graph Coloring,
Coloring maps and Planar Graphs, Coloring Vertices, Coloring Edges, List Coloring,
Perfect Graph, definition properties and Example, rooted trees, trees and sorting,
weighted trees and prefix codes, Bi-connected component and Articulation Points,
Shortest distances.

Suggested books:

➔ Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw –Hill
➔ Susanna S. Epp, Discrete Mathematics with Applications, 4th edition, Wadsworth
Publishing Co.Inc.
➔ C L Liu and D P Mohapatra, Elements of Discrete Mathematics: A Computer
Oriented Approach, 3rd Edition by, Tata McGraw –Hill.

Suggested reference books:

2
 ➔ J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It’s
Application to Computer Science”, TMGEdition,TataMcgraw-Hill
➔ Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.
Schaum’s Outlines Series, Seymour Lipschutz, MarcLipson
➔ Discrete Mathematics, Tata McGraw -Hill

Course Outcomes:

➔ For a given logic sentence, express it in terms of predicates, quantifiers,

and logical connectives.
➔ For a given problem, derive the solution using deductive logic and prove the
solution based on logical inference.
➔ For a given a mathematical problem, classify its algebraic structure
➔ Evaluate Boolean functions and simplify expressions using the properties of
Boolean algebra
➔ Develop the given problem as graph networks and solve them with techniques of
graph theory.

PAPER CODE - PCC CS 402

PCC CS 402 Computer Organization and Architecture L:3 T:0 P:4 CREDIT:5

Objectives of the course:

➔ How Computer Systems work & the basic principles
➔ Instruction Level Architecture and Instruction Execution
➔ The current state of art in memory system design
➔ How I/O devices are accessed and its principles.
➔ To provide the knowledge on Instruction Level Parallelism
➔ To impart the knowledge on microprogramming
➔ Concepts of advanced pipelining techniques.

Detailed contents:

Module 1
Functional blocks of a computer: CPU, memory, input-output subsystems, control
unit. Instruction set architecture of a CPU–registers, instruction execution cycle,
RTL interpretation of instructions, addressing modes, instruction set. Case study –
instruction sets of some common CPUs. 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, etc. multiplication – shift-and-add, Booth multiplier, carry save

3
multiplier, etc. Division restoring and non-restoring techniques, floating point
arithmetic.

Module 2
Introduction to x86 architecture. CPU control unit design: hardwired and
microprogrammed design approaches, Case study – design of a simple hypothetical CPU.
Memory system design: semiconductor memory technologies, memory organization.
Peripheral devices and their characteristics: Input-output subsystems, I/O device
interface, I/O transfers–program controlled, interrupt driven and DMA, privileged and
unprivileged instructions, software interrupts and exceptions. Programs and
processes–role of interrupts in process state transitions, I/O device interfaces –
SCII, USB.

Module 3
Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline
hazards. Parallel Processors: Introduction to parallel processors, Concurrent access
to memory and cache coherency.

Module 4
Memory organization: Memory interleaving, concept of hierarchical memory
organization, cache memory, cache size vs. Block size, mapping functions, replacement
algorithms, write policies.

Suggested books:
➔ “Computer Organization and Design: The Hardware/Software Interface”, 5th
Edition by David A. Patterson and John L. Hennessy, Elsevier.
➔ “Computer Organization and Embedded Systems”, 6th Edition by Carl Hamacher,
McGraw Hill Higher Education.

Suggested reference books:

➔ “Computer Architecture and Organization”, 3rd Edition by John P. Hayes,
WCB/McGraw-Hill
➔ “Computer Organization and Architecture: Designing for Performance”, 10th
Edition by William Stallings, Pearson Education.
➔ “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring
and Harry F. Jordan, Pearson Education.

Course outcomes:
➔ Draw the functional block diagram of a single bus architecture of a computer
and describe the function of the instruction execution cycle, RTL
interpretation of instructions, addressing modes, instruction set.

4
 ➔ Write assembly language program for specified microprocessor for computing 16
bit multiplication, division and I/O device interface (ADC, Control circuit,
serial port communication).
➔ Write a flowchart for Concurrent access to memory and cache coherency in
Parallel Processors and describe the process.
➔ Given a CPU organization and instruction, design a memory module and analyze
its operation by interfacing with the CPU.
➔ Given a CPU organization, assess its performance, and apply design techniques
to enhance performance using pipelining, parallelism and RISC methodology.

PCC CS 402P Computer Organization and Architecture Lab

Hands-on experiments related to the course contents of PCC CS 402.

PAPER CODE - PCC CS 403

PCC CS 403 Operating Systems L:3 T:0 P:4 CREDIT:5

Objectives of course:
➔ To learn the fundamentals of Operating Systems.
➔ To learn the mechanisms of OS to handle processes and threads and their
communication PCC CS 402P Computer Organization & Architecture Lab
➔ To learn the mechanisms involved in memory management in contemporary OS
➔ To gain knowledge on distributed operating system concepts that includes
architecture, mutual exclusion algorithms, deadlock detection algorithms and
agreement protocols
➔ To know the components and management aspects of concurrency management
➔ To learn to implement simple OS mechanisms

Detailed Contents:

Module 1
Introduction: Concept of Operating Systems, 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

Module 2
Processes: Definition, Process Relationship, Different states of a Process,
Process State transitions, Process Control Block (PCB), Context switching. Thread:

5
Definition, Various states, Benefits of threads, Types of threads, Concept of multi
threads Process Scheduling: Foundation and 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.

Module 3
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, Shared
Memory, Classical IPC Problems: Reader’s & Writer Problem, Dining Philosopher Problem
etc.

Module 4
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock,
Deadlock Prevention, and Deadlock Avoidance: Banker’s algorithm, Deadlock detection
and Recovery.

Module 5
Memory Management: Basic concept, Logical and Physical address map, Memory
allocation: Contiguous Memory allocation – Fixed and variable partition–Internal and
External fragmentation and Compaction; Paging and Segmentation: Principle of
operation – Page allocation – Hardware support for paging, Protection and sharing,
Advantages and Disadvantages of paging and segmentation. 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).

Module 6
File Management: Concept of File, Access methods, File types, File operation,
Directory structure, File System structure, Allocation methods (contiguous, linked,
indexed), Freespace management (bit vector, linked list, grouping), directory
implementation (linear list, hash table), efficiency and performance.

Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN,
Disk reliability, Disk formatting, Boot-block, Bad blocks 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.

Suggested books:

6
 ➔ Operating System Concepts Essentials, 9th Edition by Avi Silberschatz, Peter
Galvin, Greg Gagne, Wiley Asia Student Edition.
➔ Operating Systems: Internals and Design Principles, 5th Edition, William
Stallings, Prentice Hall of India.
➔ Operating Systems: Design and Implementation 3rd Edition, 3rd Edition, Andrew
S. Tanenbaum

Suggested reference books:

➔ Modern Operating Systems, 4th Edition, Andrew S. Tanenbaum
➔ Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley,
Irwin Publishing
➔ Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt,
AddisonWesley
➔ Design of the Unix Operating Systems, 8th Edition by Maurice Bach,
Prentice-Hall of India
➔ Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati,
O'Reilly and Associates

Course Outcomes:

➔ Understand algorithms for process scheduling for a given specification of CPU

utilization, Throughput, Turnaround Time, Waiting Time, and Response Time.
➔ Develop the techniques for optimally allocating memory to processes by
increasing memory utilization and for improving the access time.
➔ Understand and implement file management system
➔ Understand the I/O management functions in OS by performing operations for
synchronization between CPU and I/O controllers.

PCC CS 403P Operating Systems Lab

Hands-on experiments related to the course contents of PCC CS 403.

PAPER CODE - PCC CS 404

PCC CS 404 Design and Analysis of Algorithms L:3 T:0 P:4 CREDIT:5

Prerequisite: Programming for Problem Solving

Objectives of the course:

➔ Analyze the asymptotic performance of algorithms.
➔ Write rigorous correctness proofs for algorithms.
➔ Demonstrate a familiarity with major algorithms and data structures.

7
 ➔ Apply important algorithmic design paradigms and methods of analysis.
➔ Synthesize efficient algorithms in common engineering design situations.

Detailed contents:

Module 1
Introduction: Characteristics of algorithms. Analysis of 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
and Masters’ theorem.

Module 2
Introduction to Divide and Conquer paradigm: Binary Search, Quick and Merge
sorting techniques, linear time selection algorithm, Strassen’s Matrix
Multiplication, Karatsuba Algorithm for fast multiplication etc. Introduction to
Heap: Min and Max Heap, Build Heap, Heap Sort

Module 3
Overview of Brute-Force, GreedyProgramming, Dynamic Programming, Branch-
and-Bound and Backtracking Methodologies. Greedy paradigm examples of exact
optimization solutions: Minimum Cost Spanning Tree, Knapsack problem, Job Sequencing
Problem, Huffman Coding, Single source shortest path problem. Dynamic Programming,
difference between dynamic programming and divide and conquer, Applications:
Fibonacci Series, Matrix Chain Multiplication, 0-1 Knapsack Problem, Longest Common
Subsequence, Travelling Salesman Problem, Rod Cutting, Bin Packing. Heuristics –
characteristics and their application domains.

Module 4
Graph and Tree Algorithms: Representational issues in graphs, Traversal
algorithms: Depth First Search (DFS) and Breadth First Search (BFS); Shortest path
algorithms: BellmanFord algorithm,Dijkstra’s algorithm & Analysis of Dijkstra’s
algorithm using heaps, Floyd- Warshall’s all pairs shortest path algorithm.Transitive
closure, Topological sorting, Network Flow Algorithm, Connected Component

Module 5
Tractable and Intractable Problems: Computability of Algorithms, Computability
classes – P, NP, NP-complete and NP-hard. Cook’s theorem, Standard NP-complete
problems and Reduction techniques. Approximation algorithms, Randomized algorithms

Suggested books:

8
 ➔ Introduction to Algorithms, 4th Edition, Thomas H Cormen, Charles E Lieserson,
Ronald L Rivest and Clifford Stein, MITPress/McGraw-Hill.
➔ Horowitz & Sahani, "Fundamentals of Computer Algorithm", Galgotia.
➔ Basse, "Computer Algorithms: Introduction to Design & Analysis", Addision
Wesley.

Suggested reference books:

➔ Algorithm Design, 1st Edition, Jon Kleinberg and Éva Tardos, Pearson.
➔ Algorithm Design: Foundations, Analysis, and Internet Examples, Second
Edition, Michael T Goodrich and Roberto Tamassia, Wiley.
➔ Algorithms—A Creative Approach, 3RD Edition, UdiManber, Addison-Wesley,
Reading, MA.

Course Outcomes:
➔ For a given algorithm, analyze the worst-case running times of algorithms
based on asymptotic analysis and justify the correctness of algorithms.
➔ Describe the greedy paradigm and explain when an algorithmic design situation
calls for it. For a given problem develop the greedy algorithms.
➔ Describe the divide-and-conquer paradigm and explain when an algorithmic
design situation calls for it. Synthesize divide-and-conquer algorithms.
Derive and solve recurrence relation.
➔ Describe the dynamic-programming paradigm and explain when an algorithmic
design situation calls for it. For a given problem of dynamic-programming and
develop the dynamic programming algorithms, and analyze it to determine its
computational complexity.
➔ For a given model engineering problem, model it using a graph and write the
corresponding algorithm to solve the problems.
➔ Explain the ways to analyze randomized algorithms (expected running time,
probability of error).
➔ Explain what an approximation algorithm is. Compute the approximation factor
of an approximation algorithm (PTAS and FPTAS).

PCC CS 404P Design and Analysis of Algorithms Lab

Hands-on experiments related to the course contents of PCC CS 404.

PAPER CODE - ESC 401

ESC 401 Digital Electronics L:3 T:0 P:4 CREDIT:5

Detailed Contents:

9
Module 1
Fundamentals of Digital Systems and logic families: Digital signals, digital
circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations, Boolean algebra,
examples of IC gates, number systems-binary, signed binary, octal hexadecimal number,
binary arithmetic, one’s and two’s complements arithmetic, codes, error detecting and
correcting codes, characteristics of digital lCs, digital logic families, TTL,
Schottky TTL and CMOS logic, interfacing CMOS and TTL, Tri - state logic.

Module 2
Combinational Digital Circuits: Standard representation for logic functions
K-map representation, simplification of logic functions using K-map, minimization of
logical functions. Don’t care conditions, Multiplexer, DeMultiplexer/Decoders,
Adders, Subtractors, BCD arithmetic, carry look ahead adder, serial adder, ALU,
elementary ALU design, popular MSI chips, digital comparator, parity
checker/generator, code converters, priority encoders, decoders/drivers for display
devices, Q-M method of function realization.

Module 3
Sequential circuits and systems: A 1-bit memory, the circuit properties of
Bistable latch, the clocked SR flip flop, J- K-T and D types flip flops, applications
of flip flops, shift registers, applications of shift registers, serial to parallel
converter, parallel to serial converter, ring counter, sequence generator, ripple
(Asynchronous) counters, synchronous counters, counters design using flip flops,
special counter IC’s, asynchronous sequential counters, applications of counters.

Module 4
A/D and D/A Converters: Digital to analog converters: weighted
resistor/converter, R2RLadder D/A converter, specifications for D/A converters,
examples of D/A converter lCs, sample and hold circuit, analog to digital converters:
quantization and encoding, parallel comparator A/D converter, successive
approximation A/D converter, counting A/D converter, dual slope A/D converter, A/D
converter using Voltage to frequency and voltage to time conversion, specifications
of A/D converters, example of A/D converter ICs.

Module 5
Semiconductor memories and Programmable logic devices: Memory organization and
operation, expanding memory size, classification and characteristics of memories,
sequential memory, read only memory (ROM), read and write memory(RAM), content
addressable memory (CAM), charge de coupled device memory (CCD), commonly used memory
chips, ROM as a PLD, Programmable logic array, Programmable array logic, complex
Programmable logic devices (CPLDS), Field Programmable Gate Array (FPGA).

10
Suggested books:
➔ R. P. Jain, "Modern Digital Electronics", McGraw Hill Education, 2009.
➔ M. M. Mano, "Digital logic and Computer design", Pearson Education India,
2016.
➔ A. Kumar, "Fundamentals of Digital Circuits", Prentice Hall India, 2016.

Course Outcomes:
➔ Understand the working of logic families and logic gates.
➔ Design and implement Combinational and Sequential logic circuits.
➔ Understand the process of Analog to Digital conversion and Digital to Analog
conversion.
➔ Be able to use Programmable logic devices to implement the given logical
problem.

ESC 401P Digital Electronics Lab

Hands-on experiments related to the course contents of ESC 401.

PAPER CODE - HSMC 401

HSMC 401 Human Resource Development and L:3 T:0 P:0 CREDIT:3
Organizational Behaviour

Detailed Contents:

Module 1
Introduction: HR Role and Functions, Concept and Significance of HR, Changing
role of HR managers - HR functions and Global Environment, role of a HR Manager.
Human Resources Planning: HR Planning andRecruitment: Planning Process - planning at
different levels - Job Analysis

Module 2
Recruitment and selection processes - Restructuring strategies -
Recruitment-Sources of Recruitment-Selection Process-Placement and
Induction-Retention of Employees. Training and Development: need for skill
upgradation - Assessment of training needs - Retraining and Redeployment methods and
techniques of training employees and executives – performance appraisal systems.

Module 3

11
 Performance Management System: Definition, Concepts and Ethics-Different
methods of Performance Appraisal- Rating Errors Competency management. Industrial
Relations : Factors influencing industrial relations - State Interventions and Legal
Framework - Role of Trade unions - Collective Bargaining - Workers; participation in
management.

Module 4
Organizational Behaviour: Definition, Importance, Historical Background,
Fundamental Concepts of OB, Challenges and Opportunities for OB. Personality and
Attitudes: Meaning of personality, Personality Determinants and Traits, Development
of Personality, Types of Attitudes, Job Satisfaction.

Module 5
Leadership: Definition, Importance, Theories of Leadership Styles.
Organizational Politics: Definition, Factors contributing to Political Behavior.
Conflict Management: Traditional vis-a-vis Modern View of Conflict, Functional and
Dysfunctional Conflict, Conflict Process, Negotiation - Bargaining Strategies,
Negotiation Process.

Suggested books:
➔ Gary Dessler, “Human Resource Management” - (8th ed.,) Pearson Education,
Delhi.
➔ Robbins, S.P., Judge &T.A., “Organizational Behavior”, Pearson Education, 15th
Edn.

Suggested reference books:

➔ Decenzo& Robbins, Personnel Human Resource Management, 3rd ed., John Wiley &
Sons (Pvt.) Ltd.
➔ Biswajit Pattanaik, Human Resource Management, PHI, New Delhi
➔ Luis R. Gomez, Mejia, Balkin and Cardy, Managing Human Resources PHI, New
Delhi
➔ Luthans, Fred: Organizational Behavior, McGraw Hill, 12th Edn.
➔ Shukla, Madhukar: Understanding Organizations - Organizational Theory &
Practice in India, PHI

PAPER CODE - MC 401

MC 401 Environmental Science L:3 T:0 P:0 CREDIT:0

12
 We as human beings are not an entity separate from the environment around us
rather we are a constituent seamlessly integrated and co-exist with the environment
around us. We are not an entity so separate from the environment that we can think of
mastering and controlling it rather we must understand that each and every action of
ours reflects on the environment and vice versa. Ancient wisdom drawn from Vedas
about the environment and its sustenance reflects these ethos. There is a direct
application of this wisdom even in modern times. Idea of an activity based course on
environment protection is to sensitize the students on the above issues through
following two type of activities:

(a) Awareness Activities:

1) Small group meetings about water management, promotion of recycle use,

generation of less waste, avoiding electricity waste
2) Slogan making events
3) Poster making events
4) Cycle rally
5) Lectures from experts

(b) Actual Activities:

1) Plantation
2) Gifting a tree to see its full growth
3) Cleanliness drive
4) Drive for segregation of waste
5) To live some big environmentalist for a week or so to understand his work
6) To work in kitchen garden for mess
7) To know about the different varieties of plants
8) Shutting down the fans and ACs of the campus for an hour or so

****

13