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

Module 1 Lecture 6 hrs.

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 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 Lecture 8 hrs.

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 Lecture 8 hrs.

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 Lecture 8 hrs.

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 Algebra
and Boolean Ring, Identities of Boolean Algebra, Duality, Representation of Boolean Function,
Disjunctive and Conjunctive Normal Form

Module 5 Lecture 10 hrs.

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,
Biconnected component and Articulation Points, Shortest distances.
 PCC CS 402 Computer Organization & 3L:0T:4P 5 Credits
Architecture

Module 1 Lecture 10 hrs.

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 multiplier,
etc. Division restoring and non-restoring techniques, floating point arithmetic.

Module 2 Lecture 14 hrs.

Introduction to x86 architecture. CPU control unit design: hardwired and micro- programmed
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 non-privileged
instructions, software interrupts and exceptions. Programs and processes–role of interrupts in
process state transitions, I/O device interfaces – SCII, USB.

Module 3 Lecture 10 hrs.

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 Lecture 6 hrs.

Memory organization: Memory interleaving, concept of hierarchical memory organization, cache
memory, cache size vs. Block size, mapping functions, replacement algorithms, write policies.
 PCC CS 403 Operating Systems 3L:0T:4P 5 Credits

Module 1 Lecture 4 hrs.

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 Lecture 10 hrs.

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 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 Lecture 6 hrs.

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, Dinning
Philosopher Problem etc.

Module 4 Lecture 4 hrs.

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

Module 5 Lecture 9 hrs.

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 Lecture 9 hrs.

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 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.
PCC CS 404 Design and Analysis of 3L:0T: 4P 5 Credits
Algorithms
Pre- PCC CS 301 and
requisites Programming for Problem
Solving

Module 1 Lecture 10 hrs.

Introduction: Characteristics of algorithm. 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 Lecture 10 hrs.

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 Lecture 10 hrs.

Overview of Brute-Force, Greedy Programming, Dynamic Programming, Branch-
andBound and Backtracking methodologies. Greedy paradigm examples of exact
optimization solution: 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 Lecture 8 hrs.

Graph and Tree Algorithms: Representational issues in graphs, Traversal
algorithms: Depth First Search (DFS) and Breadth First Search (BFS); Shortest
path algorithms: Bellman-Ford 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 Lecture 5 hrs.

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
 ESC 401 Digital Electronics 3L:0T:4P 5 Credits

Module 1 Lecture: 7 hrs.

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 Lecture: 7 hrs.

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 Lecture: 7 hrs.

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 Lecture: 7 hrs.

A/D and D/A Converters: Digital to analog converters: weighted resistor/converter, R-2RLadder
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 Lecture: 7 hrs.

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).
 HSMC 401 Human Resource Development and 3L:0T:0P 3 Credits
Organizational Behavior

Module 1 Lecture: 8 hrs.

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 and Recruitment: Planning Process - planning at different
levels - Job Analysis

Module 2 Lecture: 8 hrs.

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 Lecture: 8 hrs.

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 Lecture: 8hrs.

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 Lecture: 8hrs.

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.
 MC 401 Environmental Science 3L : 0T : 0P 0 Credits
(Mandatory non-credit
course)

We as human being 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 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:

i) Small group meetings about water management, promotion of recycle use, generation of
less waste, avoiding electricity waste ii) Slogan making events iii) Poster making events iv)
Cycle rally
v) Lectures from experts

(b) Actual Activities: i) Plantation

ii) Gifting a tree to see its full growth
iii) Cleanliness drive
iv) Drive for segregation of waste
v) To live some big environmentalist for a week or so to understand his work vi) To
work in kitchen garden for mess vii) To know about the different varieties of plants
viii) Shutting down the fans and ACs of the campus for an hour or so
 ESC ENGINEERING GRAPHICS & DESIGN CREDIT:3

TRADITIONAL ENGINEERING GRAPHICS :

PRINCIPLES OF ENGINEERING GRAPHICS; ORTHOGRAPHIC PROJECTION; DESCRIPTIVE GEOMETRY ; DRAWING PRINCIPLES ; ISOMETRIC PROJECTION; SURFACE
DEVELOPMENT ; PERSPECTIVE; READING A DRAWING; SECTIONAL VIEWS; DIMENSIONING & TOLERANCES ;
TRUE LENGTH, ANGLE; INTERSECTION, SHORTEST DISTANCE.

COMPUTER GRAPHICS :ENGINEERING GRAPHICS SOFTWARE; -SPATIAL TRANSFORMATIONS; ORTHOGRAPHIC PROJECTIONS; MODEL VIEWING; CO-ORDINATE SYSTEMS;
MULTI-VIEW PROJECTION ;EXPLODED ASSEMBLY; MODEL VIEWING; ANIMATION; SPATIAL MANIPULATION; SURFACE MODELLING; SOLID MODELLING, INTRODUCTION
TO BUILDING INFORMATION MODELLING (BIM.

(EXCEPT THE BASIC ESSENTIAL CONCEPTS, MOST OF THE TEACHING PART CAN HAPPEN
CONCURRENTLY IN THE LABORATORY)

MODULE 1 : INTRODUCTION TO ENGINEERING DRAWING,PRINCIPLES OF ENGINEERING GRAPHICS AND THEIR SIGNIFICANCE, USAGE OF DRAWING INSTRUMENTS,
LETTERING, CONIC SECTIONS INCLUDING THE RECTANGULAR,HYPERBOLA (GENERAL METHOD ONLY) ; CYCLOID, EPICYCLOID, HYPOCYCLOID AND
INVOLUTE;SCALES PLAIN, DIAGONAL AND VERNIER SCALES

MODULE 2:ORTHOGRAPHIC PROJECTIONS,PRINCIPLES OF ORTHOGRAPHIC PROJECTIONS-CONVENTIONS -PROJECTIONS OF POINTS,AND LINES INCLINED TO BOTH
PLANES; PROJECTIONS OF PLANES INCLINED PLANES AUXILIARY PLANES

MODULE 3: PROJECTIONS OF REGULAR SOLIDS,THOSE INCLINED TO BOTH THE PLANES- AUXILIARY VIEWS; DRAW SIMPLE ANNOTATION,DIMENSIONING AND
SCALE.FLOOR PLANS THAT INCLUDE: WINDOWS, DOORS, AND FIXTURES SUCH AS WC, BATH, SINK, SHOWER, ETC.

MODULE 4: SECTIONS AND SECTIONAL VIEWS OF RIGHT ANGULAR SOLIDS,COVERING, PRISM, CYLINDER, PYRAMID, CONE - AUXILIARY VIEWS; DEVELOPMENT OF
SURFACES OF RIGHT REGULAR SOLIDS- PRISM, PYRAMID, CYLINDER AND CONE; DRAW THE SECTIONAL ORTHOGRAPHIC VIEWS OF GEOMETRICAL SOLIDS, OBJECTS
FROM INDUSTRY AND DWELLINGS (FOUNDATION TO SLAB ONLY)

MODULE 5: ISOMETRIC PROJECTIONS

PRINCIPLES OF ISOMETRIC PROJECTION - ISOMETRIC SCALE, ISOMETRIC VIEWS,CONVENTIONS ; ISOMETRIC VIEWS OF LINES, PLANES, SIMPLE AND COMPOUND
SOLIDS; CONVERSION OF ISOMETRIC VIEWS TO ORTHOGRAPHIC VIEWS AND VICE-VERSA, CONVENTIONS

MODULE 6: OVERVIEW OF COMPUTER GRAPHICS

LISTING THE COMPUTER TECHNOLOGIES THAT IMPACT ON GRAPHICAL COMMUNICATION,
DEMONSTRATING KNOWLEDGE OF THE THEORY OF CAD SOFTWARE [SUCH AS: THE MENU SYSTEM, TOOLBARS (STANDARD, OBJECT PROPERTIES, DRAW, MODIFY AND
DIMENSION) , DRAWING
AREA (BACKGROUND, CROSSHAIRS, COORDINATE SYSTEM) , DIALOG BOXES AND WINDOWS, SHORTCUT MENUS (BUTTON BARS) , THE COMMAND LINE (WHERE
APPLICABLE) , THE STATUS
BAR, DIFFERENT METHODS OF ZOOM AS USED TN CAD, SELECT AND ERASE OBJECTS . ISOMETRIC VIEWS OF LINES, PLANES, SIMPLE AND COMPOUND SOLIDS]

MODULE 7: CUSTOMISATION& CAD DRAWING

CONSISTING OF SET UP OF THE DRAWING PAGE AND THE PRINTER, INCLUDING SCALE SETTINGS, SETTING UP OF UNITS AND DRAWING LIMITS; ISO AND ANSI
STANDARDS FOR COORDINATE DIMENSIONING AND TOLERANCING; ORTHOGRAPHIC CONSTRAINTS, SNAP TO OBJECTS MANUALLY AND AUTOMATICALLY; PRODUCING
DRAWINGS BY USING VARIOUS COORDINATE INPUT ENTRY METHODS TO DRAW STRAIGHT LINES, APPLYING VARIOUS WAYS OF DRAWING CIRCLES.

MODULE 8: ANNOTATIONS, LAYERING & OTHER FUNCTIONS COVERING APPLYING DIMENSIONS TO OBJECTS, APPLYING ANNOTATIONS TO DRAWINGS; SETTING UP
AND USE OF LAYERS, LAYERS TO CREATE DRAWINGS, CREATE, EDIT AND USE CUSTOMIZED LAYERS; CHANGING LINE LENGTHS THROUGH MODIFYING EXISTING
LINES (EXTEND/ LENGTHEN) ; PRINTING DOCUMENTS TO PAPER USING THE PRINT COMMAND; ORTHOGRAPHIC PROJECTION TECHNIQUES; DRAWING SECTIONAL VIEWS
OF COMPOSITE RIGHT REGULAR GEOMETRIC SOLIDS AND PROJECT THE TRUE SHAPE OF THE SECTIONED SURFACE; DRAWING ANNOTATION, COMPUTER-AIDED DESIGN
(CAD) SOFTWARE MODELING OF PARTS AND ASSEMBLIES. PARAMETRIC AND NON-PARAMETRIC SOLID, SURFACE, AND WIREFRAME MODELS.PART EDITING AND TWO-
DIMENSIONAL DOCUMENTATION OF MODELS. PLANAR PROJECTION
THEORY, INCLUDING SKETCHING OF PERSPECTIVE, ISOMETRIC, MULTIVIEW, AUXILIARY , AND SECTION VIEWS. SPATIAL VISUALIZATION EXERCISES.
DIMENSIONING GUIDELINES, TOLERANCING TECHNIQUES; DIMENSIONING AND SCALE MULTI VIEWS OF DWELLING.

MODULE 9: DEMONSTRATION OF A SIMPLE TEAM DESIGN PROJECT THAT ILLUSTRATES

GEOMETRY AND TOPOLOGY OF ENGINEERED COMPONENTS: CREATION OF ENGINEERING
MODELS AND THEIR PRESENTATION IN STANDARD 2D BLUEPRINT FORM AND AS 3D WIREFRAME AND SHADED SOLIDS; MESHED TOPOLOGIES FOR ENGINEERING
ANALYSIS AND TOOL-PATH GENERATION FOR COMPONENT MANUFACTURE;GEOMETRIC DIMENSIONING AND TOLERANCING; USE OF SOLID-MODELING SOFTWARE FOR
CREATING ASSOCIATIVE MODELS AT THE COMPONENT AND ASSEMBLY LEVELS. FLOOR PLANS THAT INCLUDE: WINDOWS, DOORS, AND FIXTURES SUCH AS WC, BATH,
SINK, SHOWER, ETC. APPLYING COLOUR CODING,ACCORDING TO BUILDING DRAWING PRACTICE; DRAWING SECTIONAL ELEVATION SHOWING FOUNDATION TO CEILING;
INTRODUCTION TO BUILDING INFORMATION MODELLING (BIM).RING DESIGN AND ITS PLACE IN SOCIETY