HSMC 301 Technical Writing

Objectives of the course:
1. To understand the variety of structure of technical documents
2. To convey clearly, cogently and correctly, through written media, the technical aspects of a
practice to audiences.
3. To recognize and use of the verbal and technical elements necessary for the successful
practice of scientific and technical communication
4. To work collaboratively and individually to research, to analyze, and to write about, public
debates regarding the conduct of science and technology

Detail contents

Module 1 Lecture 10 hrs.
Introduction: Fundamentals of Technical Writing: Need for Clear and Concise Technical Writing,
Attributes of Technical Writing, Types of Technical Writing, Benefits of Technical Writing, Technical,
Managerial and General Readers, Expressing versus Impressing, Correct use of Noun, Pronoun, Verb,
Adjective, Adverbs, Tense and Punctuation.
Module 2 Lecture 10 hrs.
Performing Technical Studies: Types of Technical Studies, General Methodology- Proposing a Project,
Gathering Background Information, Designing Test Plans, Performing Experiments, Reporting Results.
Writing Strategy: Analysis of Readers, Scope of Writing, Purpose and Objective. Document Options:
Document Hierarchy, Report Types and Selection. Criteria for Good Technical Writing: Technical
Content, Presentation, Language Skills. Writing Style: Elements of Style, Examples of Writing Styles,
Recommended Style, Learn to Prepare Effective Illustrations
Module 3 Lecture 10 hrs.
Formal Reports: The Outline and Introduction (Outline, Title, Front Matter, Writing the Introduction),
Writing the Body (Writing a Procedure, Describing Machines/Processes, Writing Test Results, Writing
the Discussion Section), Closure (Conclusions, Recommendations, References, Abstract, Back Matter,
Report Distribution, Saving Reports). Informal Reports: Elements of an Informal Report, Investigation
Reports, Service Work, Action Letters and Proposals. Typical Memo Reports.
Module 4 Lecture 10 hrs.
Review and Editing: Types of Review and Edit, Review and Editing Methodology, Examples
of Reviews. Oral Presentations: Types of Oral Presentations, Preparation, Visual Aids,
Impediments to Technical Writing, Maintaining Writing Skills, Measuring Report Results.

Suggested reference books:
1. “A Guide to Technical Writing”, T. A. Rickard, Franklin Classics.
2. “Technical Writing”, S. Jayprakash, Himalaya Publishing House Pvt. Ltd.
3. “Technical Writing”, O. N. Pandey.

PCC CS 301 Data Structure & Algorithms

Module 1 Lecture 4 hrs.
Introduction: Basic Terminologies: Elementary Data Organizations, Data Structure
Operations: insertion, deletion, traversal etc.; Analysis of an Algorithm, Asymptotic
Notations, Time-Space trade off.
Module 2 Lecture 10 hrs.
Stacks and Queues: ADT Stack and its operations: Algorithms and their complexity
analysis, Applications of Stacks: Expression Conversion and evaluation – corresponding
algorithms and complexity analysis. ADT queue, Types of Queue: Simple Queue, Circular
Queue, Priority Queue; Operations on each Type of Queues: Algorithms and their analysis.
Module 3 Lecture 6 hrs.
Linked Lists: Singly linked lists: Representation in memory, Algorithms of several
operations: Traversing, Searching, Insertion into, Deletion from linked list; Linked
representation of Stack and Queue, Header nodes, doubly linked list: operations on it and
algorithmic analysis; Circular Linked Lists: all operations their algorithms and the
complexity analysis.
Module 4 Lecture 12 hrs.
Searching, Sorting and Hashing: Linear Search and Binary Search Techniques and their
complexity analysis. Objective and properties of different sorting algorithms: Selection
Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort; Performance and
Comparison among all the methods, Hashing.
Module 5 Lecture 8 hrs.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary
Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and their
algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+ Tree:
definitions, algorithms and analysis.
Graph: Basic Terminologies and Representations, Graph search and traversal algorithms
and complexity analysis.
Suggested reference books:
1. Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark Allen Weiss, Addison-Wesley Publishing Company.
2. “How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson
Education.
3. “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj
Sahni, Computer Science Press.

PCC CS 302 Object Oriented Programming using C++

Module 1 Lecture: 3 hrs.
Introduction to C++ : Object Oriented Technology, Advantages of OOP, Input- output in C++, Tokens,
Keywords, Identifiers, Data Types C++, Derives data types. The void data type, Type Modifiers,
Typecasting, Constant, Operator, Precedence of Operators, Strings.
Module 2 Lecture: 6 hrs.
Control Structures and Functions: Decision making statements like if-else, Nested if-else, goto, break,
continue, switch case, Loop statement like for loop, nested for loop, while loop, do-while loop. Parts of
Function, User- defined Functions, Value- Returning Functions, void Functions, Value Parameters,
Function overloading, Virtual Functions.
Module 3 Lecture: 12 hrs.
Classes and Data Abstraction : Structure in C++, Class, Build- in Operations on Classes, Assignment
Operator and Classes, Class Scope, Reference parameters and Class Objects (Variables), Member
functions, Accessor and Mutator Functions, Constructors, default Constructor, Destructors.
Module 4 Lecture: 8 hrs.
Overloading, Templates and Inheritance: Operator Overloading, Function Overloading, Function
Templates, Class Templates. Single and Multiple Inheritance, virtual Base class, Abstract Class, Pointer
and Inheritance, Overloading Member Function.
Module 5 Lecture: 11 hrs.
Pointers, Arrays and Exception Handling: Void Pointers, Pointer to Class, Pointer to Object, Void Pointer,
Arrays. The keywords try, throw and catch. Creating own Exception Classes, Exception Handling
Techniques (Terminate the Program, Fix the Error and Continue, Log the Error and Continue), Stack
Unwinding.

Suggested Reference Books:
1. The C++ Programming language 3/e by Bjarne Stroustrup, Pearson Education.
2. C++, How to Programme, 4e, by Deitel, Pearson Education.

3. Big C++ by Cay Horstmann, Wiley India.
4. C++ Primer, 3e by Stanley B. Lippmann, JoseeLajoie, Pearson Education.
5. C++ and Object Oriented Programming Paradigm, 2e by Debasish Jana, PHI.
6. Programming with C++, 2/e by Ravichandran, Tata McGraw Hill.
7. C++ Programming Black Book by Steven Holzner, Dreamtech Press.

 Analog Electronic Circuits

Module 1 Lectures: 4 hrs.
Diode circuits: P-N junction diode, I-V characteristics of a diode; review of half-wave and full-wave
rectifiers, Zener diodes, clamping and clipping circuits.
Module 2 Lectures: 8 hrs.

BJT circuits: Structure and I-V characteristics of a BJT; BJT as a switch. BJT as an amplifier: small-
signal model, biasing circuits, current mirror; common-emitter, common-base and common-collector

amplifiers; Small signal equivalent circuits, high-frequency equivalent circuits.
Module 3 Lectures: 8 hrs.
MOSFET circuits: MOSFET structure and I-V characteristics. MOSFET as a switch. MOSFET as an amplifier:
small-signal model and biasing circuits, common-source, common-gate and common-drain amplifiers;
small signal equivalent circuits - gain, input and output impedances, trans-conductance, high frequency
equivalent circuit.
Module 4 Lectures: 8 hrs.
Differential, multi-stage and operational amplifiers: Differential amplifier; power amplifier; direct

coupled multi-stage amplifier; internal structure of an operational amplifier, ideal op-amp, non-
idealities in an op-amp (Output offset voltage, input bias current, input offset current, slew rate, gain

bandwidth product)
Module 5 Lectures: 8 hrs.
Linear applications of op-amp: Idealized analysis of op-amp circuits. Inverting and non-inverting amplifier,
differential amplifier, instrumentation amplifier, integrator, active filter, P, PI and PID controllers and
lead/lag compensator using an op-amp, voltage regulator, oscillators (Wein bridge and phase shift). Analog
to Digital Conversion.
Module 6 Lectures: 4 hrs.
Nonlinear applications of op-amp: Hysteretic Comparator, Zero Crossing Detector, Square-wave and
triangular-wave generators. Precision rectifier, peak detector, Monoshot.

PCC CS 401 Discrete Mathematics

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 Algebraand 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, Bi-connected component and Articulation Points, Shortest distances.

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

Computer Organization & 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.

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

PCC CS 403 Operating Systems

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.

Suggested reference books:
1. Modern Operating Systems, 4th Edition, Andrew S. Tanenbaum
2. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin
Publishing

3. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-
Wesley

4. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of
India
5. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and
Associates

PCC CS 404 Design and Analysis of Algorithms

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, GreedyProgramming, Dynamic Programming, Branch- and-Bound
and Backtrackingmethodologies. 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
Suggested books:
1. Introduction to Algorithms, 4th Edition, Thomas H Cormen, Charles E Lieserson,
Ronald L Rivest and Clifford Stein, MITPress/McGraw-Hill.
2. Horowitz & Sahani, "Fundamental of Computer Algorithm", Galgotia.
3. Basse, "Computer Algorithms: Introduction to Design & Analysis", Addision
Wesley.
Suggested reference books
1. Algorithm Design, 1st Edition, Jon Kleinberg and Éva Tardos, Pearson.
2. Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition,
Michael T Goodrich and Roberto Tamassia, Wiley.
3. Algorithms—A Creative Approach, 3RD Edition, UdiManber, Addison-Wesley,
Reading, MA.

HSMC 401 Human Resource Development and 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 andRecruitment: Planning Process - planning at different levels - Job
Analysis
Module 2 Lecture:
8hrs.
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:
8hrs.
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.
Suggested books:
1. Gary Dessler, “Human Resource Management” - (8th ed.,) Pearson Education, Delhi.
2. Robbins, S.P., Judge &T.A., “Organizational Behavior”, Pearson Education, 15th Edn.
Suggested reference books:
1. Decenzo& Robbins, Personnel Human Resource Management, 3rd ed., John Wiley &
Sons (Pvt.) Ltd.
2. BiswajeetPatanayak, Human Resource Management, PHI, New Delhi
3. Luis R. Gomez, Mejia, Balkin and Cardy, Managing Human Resources PHI, New Delhi
4. Luthans, Fred: Organizational Behavior, McGraw Hill, 12th Edn.
5. Shukla, Madhukar: Understanding Organizations - Organizational Theory & Practice in
India, PHI

ESC 401 Digital Electronics

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, 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 
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).

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