YMCA UNIVERSITY OF SCIENCE AND TECHNOLOGY, FARIDABAD

B.Tech. (COMPUTER ENGINEERING)

Scheme of Studies/Examination
Semester- 4

S. Catego Course Course Title Hours per Credi Marks Marks for Total
No ry Code week ts for End Term
. Session Examinatio
L T P al n
1 PCC PCC-CS- Discrete 3 1 0 4 25 75 100
401 Mathematics
2 PCC PCC-CS- Computer 3 0 0 3 25 75 100
402 Organization &
Architecture
3 PCC PCC-CS- Operating System 3 0 0 3 25 75 100
403
4 PCC PCC-CS- Design & Analysis 3 0 0 3 25 75 100
404 of Algorithms

5 HSMC HSMC-02 Economics for 3 0 0 3 25 75 100

Engineers

6 MC MC-03 Environmental 2 0 0 0 25 75 100

Sciences
7 PCC PCC-CS- Computer 0 0 4 2 15 35 50
405 Organization &
Architecture LAB
8 PCC PCC-CS- Operating System 0 0 4 2 15 35 50
406 LAB
9 PCC PCC-CS- Design & Analysis 0 0 4 2 15 35 50
407 of Algorithms
LAB
Total 17 1 12 22 195 555 750

Note: Exams duration will be as under

(a) Theory exams will be of 03 hours duration.
(b) Practical exams will be of 02 hours duration
(c) Workshop exam will be of 03 hours duration
 CODE: PCC-CS-401

SUBJECT NAME: DISCRETE MATHEMATICS

NO OF CREDITS: 4

B.TECH 4th SEMESTER SESSIONAL: 25

L T P THEORY EXAM: 75
3 1 0 TOTAL : 100
Course Objectives:

Throughout the course, students will be expected to demonstrate their understanding of Discrete
Mathematics by being able to do each of the following:

1. Use mathematically correct terminology and notation.

2. Construct correct direct and indirect proofs.
3. Use division into cases in a proof.
4. Use counterexamples.
5. Apply logical reasoning to solve a variety of problems.

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 of a Set, Finite and infinite Sets,
Countable and uncountable Sets, Cantor's diagonal argument and The Power Set theorem,
Schroeder-Bernstein theorem.

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.

MODULE-2:
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 Algebra and
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 Colouring, Colouring maps and Planar
Graphs, Colouring Vertices, Colouring Edges, List Colouring, Perfect Graph, definition
properties and Example, rooted trees, trees and sorting, weighted trees and prefix codes, Bi-
connected component and Articulation Points, Shortest distances.

Course Outcomes:

1. For a given logic sentence express it in terms of predicates, quantifiers, and logical
connectives
2. For a given a problem, derive the solution using deductive logic and prove the solution
based on logical inference
3. For a given a mathematical problem, classify its algebraic structure
4. Evaluate Boolean functions and simplify expressions using the properties of Boolean
algebra
5. Develop the given problem as graph networks and solve with techniques of graph theory.
REFERENCES:

1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth
Publishing Co. Inc.
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer
Oriented Approach, 3rd Edition by, Tata McGraw Hill.
4.
Application -Hill
5. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.

Tata McGraw - Hill

 CODE: PCC-CS-402
SUBJECT NAME: COMPUTER ORGANIZATION & ARCHITECTURE
NO OF CREDITS: 3
B.TECH 4th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Pre-requisites: Digital Electronics

Course Objectives: To expose the students to the following:

1. How Computer Systems work and the basic principles.

2. Concept of computer architecture and Micro programming.
3. The basic principles for accessing I/O devices and memory unit.
4. Concepts of advanced processors, parallel and pipelining techniques.

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

Course Outcomes:

After completion of this course, the students will be able to perform the following:

1. Draw the functional block diagram of single bus architecture of a computer and describe
the function of the instruction execution cycle, RTL interpretation of instructions,
addressing modes, instruction set.
2. Write assembly language program for specified microprocessors using different data
representations.
3. Design the ALU, Control Unit and CPU of a computer system.
4. Design a memory module and analyze its operation by interfacing with a given CPU
organization and instruction
5. Given a CPU organization, assess its performance, and apply design techniques to
enhance performance using pipelining, parallelism and RISC methodology.

REFERENCES:

1.
Edition by David A. Patterson and John L. Hennessy, Elsevier.
2.
McGraw Hill Higher Education.
3.
WCB/McGraw-Hill
4.
Edition by William Stallings, Pearson Education.
5.
and Harry F. Jordan, Pearson Education.
 CODE: PCC-CS-403
SUBJECT NAME: OPERATING SYSTEM
NO OF CREDITS: 3
B.TECH 4th SEMESTER SESSIONAL: 25
L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Pre-requisites: Fundamentals of Computers, Computer Organization & Architecture

Course Objectives:

1. To learn the fundamentals of Operating Systems.

2. To learn the mechanisms of OS to handle processes, threads and their communication.
3. To know the components and management aspects of concurrency management viz.
Mutual exclusion algorithms, deadlock detection algorithms and agreement protocols.
4. To learn the mechanisms involved in memory management in contemporary OS.
5. To gain knowledge on Input/Output management aspects of Operating systems.

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: 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:
Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion, Hardware
emaphores,

Problem, Dinning Philosopher Problem etc.

MODULE-4:
Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention,
Deadlock Avoi
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: 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).
MODULE-6:
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 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

Course Outcomes:
After the completion of the course, the students will be able to:
1. Create processes and threads.
2. Develop algorithms for process scheduling for a given specification of CPU utilization,
Throughput, Turnaround Time, Waiting Time, and Response Time.
3. For a given specification of memory organization, develop the techniques for optimally
allocating memory to processes by increasing memory utilization and for improving the
access time.
4. Design and implement file management system.
5. For a given I/O device and OS (specify), develop the I/O management functions in OS as
part of a uniform device abstraction by performing operations for synchronization
between CPU and I/O controllers.
REFERENCES:
1. Abraham Silberschatz, Peter Galvin, Greg Gagne,
9th Edition, Wiley Asia Student Edition.
2. Operating Systems: Internals and Design Principles
Prentice Hall of India.
3. Operating System: A Design-oriented Approach
Publishing.
4. Operating Systems: A Modern Perspective -Wesley
5. Design of the Unix Operating Systems
6. Understanding the Linux Kernel
Associates
 CODE: PCC-CS-404

SUBJECT NAME: DESIGN & ANALYSIS OF ALGORITHMS

NO OF CREDITS: 3

B.TECH 4th SEMESTER SESSIONAL: 25

L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Pre-requisites: Data Structures and Algorithms

Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.

MODULE-1: 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

MODULE-2: FUNDAMENTAL ALGORITHMIC STRATEGIES

Brute-Force, Greedy, Dynamic Programming, Branch and-Bound and backtracking
methodologies for the design of algorithms; Illustrations of these techniques for Problem-
Solving, Bin Packing, Knapsack, Job sequencing with deadline, Optimal Binary Search tree, N-
Queen problem, Hamiltonian Cycle, TSP, Heuristics characteristics and their application
domains.
MODULE-3: GRAPH AND TREE TRAVERSAL ALGORITHMS
Depth First Search (DFS) and Breadth First Search (BFS); Shortest path algorithms, Transitive
closure, Minimum Spanning Tree, Topological sorting, Network Flow Algorithm.
MODULE-4: TRACTABLE AND INTRACTABLE PROBLEMS
Computability of Algorithms, Computability classes P, NP, NP-complete and NP-
theorem, Standard NP-complete problems and Reduction techniques.
MODULE-5: ADVANCED TOPICS
Approximation algorithms, Randomized algorithms, Class of problems beyond NP P SPACE

Course Outcomes:
1. For a given algorithms analyze worst-case running times of algorithms based on
asymptotic analysis and justify the correctness of algorithms.
2. Describe the greedy paradigm and explain when an algorithmic design situation calls for
it. For a given problem develop the greedy algorithms.
3. 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.
4. Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problems of dynamic-programming and develop the
dynamic programming algorithms, and analyze it to determine its computational
complexity.
5. For a given model engineering problem model it using graph and write the corresponding
algorithm to solve the problems.
6. Explain the ways to analyze randomized algorithms (expected running time, probability
of error).
7. Explain what an approximation algorithm is. Compute the approximation factor of an
approximation algorithm (PTAS and FPTAS).

REFERENCES

1. Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein,

, MIT Press/McGraw-Hill; 3rd edition, [ISBN: 978-
0262533058], 2009.
2. Fundamentals of
Universities Press; 2nd edition [ISBN: 978-8173716126], 2008.
3. Pearson Publisher; 1st edition [ISBN:
978-0321295354], 2012.
4. Wiley Press;
1st edition [ISBN: 978-8126509867], 2006.
 CODE: HSMC-02

SUBJECT NAME: ECONOMICS FOR ENGINEERS

NO OF CREDITS: 3

B.TECH 4th SEMESTER SESSIONAL: 25

L T P THEORY EXAM: 75
3 0 0 TOTAL : 100
Prerequisites:

Course objectives:

MODULE-1:
Introduction to the subject: Micro and Macro Economics, Relationship between Science,
Engineering, Technology and Economic Development. Production Possibility Curve, Nature of
Economic Laws.
MODULE-2:
Time Value of Money: concepts and application. Capital budgeting; Traditional and modern
methods, Payback period method, IRR, ARR, NPV, PI (with the help of case studies)
MODULE-3:
Meaning of Demand. Law of Demand, Elasticity of Demand; meaning, factors effecting it and its
practical application and importance. Demand forecasting (a brief explanation)
MODULE-4:
Meaning of Production and factors of production, Law of variable proportions and returns to
scale. Internal and external economies and diseconomies of scale. Concepts of cost of
production, different types of costs; accounting cost, sunk cost, marginal cost, Opportunity cost.
Break even analysis, Make or Buy decision (case study). Relevance of Depreciation towards
industry.
MODULE-5:
Meaning of market, types of market, perfect competition, Monopoly, Monopolistic, Oligopoly.
(main features). Supply and law of supply, Role of demand and supply in price determination.
MODULE-6:
Indian Economy, nature and characteristics. Basic concepts; fiscal and monetary policy, LPG,
Inflation, Sensex, GATT, WTO and IMF. Difference between Central bank and Commercial
banks
Course Outcomes:

REFERENCES:
1. Jain T.R., Economics for Engineers, VK Publication
2. Chopra P. N., Principle of Economics, Kalyani Publishers
3. Dewett K. K., Modern economic theory, S. Chand
4. H. L. Ahuja., Modern economic theory, S. Chand
5. Dutt Rudar & Sundhram K. P. M., Indian Economy
6. Mishra S. K., Modern Micro Economics, Pragati Publications
7. Pandey I.M., Financial Management; Vikas Publishing House
8. Gupta Shashi K., Management Accounting, Kalyani Publication
 CODE: MC-03

SUBJECT NAME: ENVIRONMENTAL SCIENCES

NO OF CREDITS: 0

B.TECH 4TH SEMESTER SESSIONAL: 25

L T P THEORY EXAM: 75
2 0 0 TOTAL : 100

Pre-requisites: None

Course Objectives:

The prime objective of the course is to provide the students a detailed knowledge on the threats
and challenges to the environment due to developmental activities. The students will be able to
identify the natural resources and suitable methods for their conservation and sustainable
development. The focus will be on awareness of the students about the importance of ecosystem
and biodiversity for maintaining ecological balance. The students will learn about various
attributes of pollution management and waste management practices. The course will also
describe the social issues both rural and urban environment and environmental legislation

MODULE-1: The Multidisciplinary Nature of Environmental Studies

Definition, scope and importance. Need for public awareness.

MODULE-2: Natural Resources: Renewable and Non-Renewable Resources

Natural resources and associated problems:

Forest resources: Use and over-exploitation, deforestation, case studies. Timber

extraction, mining, dams and their effects on forests and tribal people.
Water resources: Use and over-utilization of surface and ground water, floods, drought,
conflicts over water, dams-benefits and problems.
Mineral resources: Use and exploitation, environmental effects of extracting and mineral
resources, case studies.
Food resources: World food problems, changes caused by agriculture and overgrazing,
effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case
studies.
Energy resources: Growing energy needs, renewable and non- renewable energy sources,
use of alternate energy sources. Case studies.
 Land resources: Land as a resource, land degradation, man induced landslides, soil
erosion and desertification.
Role of an individual in conservation of natural resources. Equitable use of resources for
sustainable lifestyles.

MODULE-3: Ecosystems

Concept of an ecosystem. Structure and function of an ecosystem. Producers, consumers

and decomposers.
Energy flow in the ecosystem. Ecological succession. Food chains, food webs and
ecological pyramids.
Introduction, types, characteristic features, structure and function of the following
ecosystem: a) Forest ecosystem b) Grassland ecosystem c) Desert ecosystem d) Aquatic
ecosystems (ponds, streams, lakes, rivers, oceans, estuaries).

MODULE-4: Biodiversity and its Conservation

Introduction Definition: genetic, species and ecosystem diversity.

Biogeographical classification of India. Value of biodiversity: consumptive use,
productive use, social, ethical, aesthetic and option values. Biodiversity at global,
National and local levels.
India as a mega-diversity nation. Hot-spots of biodiversity. Threats to biodiversity:
habitat loss, poaching of wildlife, man-wildlife conflicts. Endangered and endemic
species of India. Conservation of biodiversity: insitu and ex-situ conservation of
biodiversity

MODULE-5: Environmental Pollution Definition

Causes, effects and control measures of: Air pollution b) Water pollution c) Soil pollution
d) Marine pollution e) Noise pollution f) Thermal pollution g) Nuclear hazards
Solid waste Management: Causes, effects and control measures of urban andindustrial
wastes. Role of an individual in prevention of pollution. Pollution case studies. Disaster
management: floods, earthquake, cyclone and landslides.

MODULE-6: Social Issues and the Environment

From Unsustainable to Sustainable development Urban problems related to energy.

Water conservation, rain water harvesting, watershed management. Resettlement and
rehabilitation of people; its problems and concerns. Case studies.
 Environmental ethics: Issues and possible solutions. Climate change, global warming,
acid rain, ozone layer depletion, nuclear accidents and holocaust. Case studies. Wasteland
reclamation. Consumerism and waste products.
Environment Protection Act. Air (Prevention and Control of Pollution) Act. Water
(Prevention and Control of Pollution) Act
Wildlife Protection Act. Forest Conservation Act. Issues involved in enforcement of
environmental legislation Public awareness.

MODULE-7: Human Population and the Environment

Population growth, variation among nations. Population explosion Family Welfare

Programme. Environment and human health. Human Rights. Value Education. HIV/AIDS.
Women and Child Welfare. Role of Information Technology in Environment and human health.
Case Studies.

MODULE-8: Field Work

Visit to a local area to document environmental assets-river / forest / grassland / hill /

mountain.
Visit to a local polluted site Urban / Rural / Industrial / Agricultural.
Study of common plants, insects, birds.
Study of simple ecosystems pond, river, hill slopes, etc.

Course Outcomes:

RERERENCES

1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008

PHL Learning Private Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela
2008 PHI Learning Pvt Ltd.
3. Environmental Science by Daniel B. Botkin& Edwards A. Keller, Wiley INDIA
edition.
4. Fundamentals of Ecology by Odum, E.P., Barrick, M. and Barret, G.W. Thomson
Brooks/Cole Publisher, California, 2005.