0% found this document useful (0 votes)
34 views6 pages

Syllabus

The document outlines a comprehensive curriculum covering various aspects of computer networking, operating systems, algorithms, optimization, production management, and disaster management. Each unit includes topics such as network protocols, process synchronization, algorithm efficiency, optimization techniques, and disaster response strategies. Textbooks and reference materials are provided for each subject area to support the learning objectives.

Uploaded by

singhgunnu1011
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views6 pages

Syllabus

The document outlines a comprehensive curriculum covering various aspects of computer networking, operating systems, algorithms, optimization, production management, and disaster management. Each unit includes topics such as network protocols, process synchronization, algorithm efficiency, optimization techniques, and disaster response strategies. Textbooks and reference materials are provided for each subject area to support the learning objectives.

Uploaded by

singhgunnu1011
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

CONTENTS

Unit I 10 Hours
Evolution of Computer Networking-Types of Network- networks topologies-Protocols & standards-Network
Devices-The OSI reference model- TCP/IP Reference Model. Physical Layer: transmission media, twisted pairs,
coaxial cable, fiber optics, Wireless transmission.

Unit II 12 Hours
Data Link Layer Design Issues-Services provided to the Network Layer-Framing-Error Control-Flow Control-
Error Detection and Correction- Elementary Data Link Protocols-Sliding Window Protocols, A one-bit
sliding window protocol, A protocol using Go-Back-N,A protocol using Selective Repeat, Example data link
protocols. Medium Access sub layer:The channel allocation problem, Multiple access protocols: ALOHA,
Carrier sense multipleaccess protocols, collision free protocols. Wireless LANs, Data link layer switching,
Multiple Access Protocols-An overview of IEEE Standard for LANs, MAC Address.

Unit III 10 Hours


Introduction to Network Layer – Services – Circuit Switching Vs Packet Switching-PacketSwitched
Networks-Types of Routing-routing algorithms- congestion control algorithms, Hierarchical routing, Broadcast,
Multicast, distance vector routing -Network Protocols-IP-IPV4, IPV6, Subnets, Gateways- Congestion
Avoidance in Network Layer, Quality of Service, Internetworking, The Network layer in the internet

Unit IV 10 Hours
The Transport Services – Services provided to the upper layers –Elements of transportProtocols –
Internet Transport Protocols- Congestion Controls in Transport Layer Principles of Network
Applications-Web and HTTP-Electronic mail-DNS
Application Layer –Domain name system, SNMP, Electronic Mail; the World WEB, HTTP,Streaming audio
and video
Overview of Network Security

Text Books
1 Andrew S. Tanenbaum, Computer Networks, Pearson Education India, 5th Edition.
2 William Stalllings, Data and Computer Communications , Pearson Education India,10th Edition.

3 Schaum's Outline Of Computer Networking, McGraw Hill, 2020


Reference Books
1 Behrouz A Forouzan, Data Communications and Networking, McGraw Hill HigherEducation,
Special Indian Edition, 4th or Latest Edition, 2017.
2 Keith W. Ross, James F. kurose, Computer Networking: A Top-Down Approach,Pearson, 6th
Edition, 2017
CONTENTS

UNIT-I 11 Hours
Introduction: Introduction to Operating System, Types of O.S: Simple Batch, Multi programmed Batched, Time-
Sharing, Personal-computer, Parallel, Distributed, Real-TimeMobile
Operating-System Structures: Layered Architecture, System Calls, System Programs, System Structure,
Virtual Machine
Processes: Process Concept, Process Scheduling, Operations on Processes, CooperatingProcesses, Inter-
process Communication, Threads, Multithreaded Programming.
CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple-Processor
Scheduling, Real-Time Scheduling

UNIT-II 11 Hours
Process Synchronization: Background, Critical-Section Problem, Synchronization Hardware Semaphores,
Classical Problems of Synchronization, Critical Regions, Monitors.
Memory Management: Background, Logical versus Physical Address space, SwappingContiguous allocation,
Fragmentation, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Page
Replacement, Page-replacement Algorithms Performance of Demand Paging, Allocation of Frames, thrashing.
Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock

UNIT-III 10 Hours
Device Management: Techniques for Device Management, Dedicated Devices, SharedDevices, Virtual
Devices
Secondary-Storage Structure: Disk Structure, Disk Scheduling, Disk Management, Swap-Space
Management, Disk Reliability, Stable-Storage Implementation

UNIT-IV 10 Hours
Information Management: Introduction, Simple File System, General Model of a FileSystem Symbolic File
System, Basic File System, Access Control Verification, Logical File System Physical File System
File-System Interface: File Concept, Access Methods, Directory Structure, Protection, and Consistency
Semantics. File-System Implementation: File-System Structure, Allocation Methods, Free-Space Management,
Directory Implementation, Efficiency and Performance Recovery.

Text Books
1 Silberschatz and Galvin, “Operating System Concepts”, John Wiley, 9th Ed., 2016.
2 R. C. Joshi, “Operating Systems”, Wiley Dreamtech, 2008.
3 Deitel, Deitel and Choffnes, “Operating Systems”, Pearson, 3rd Edition, 2003
Reference Books
1 Tannenbaum, “Operating Systems”, PHI, 5th Ed., 2000.
2 Madnick E. and Donovan J., “Operating Systems”, Tata McGraw Hill, 2017.
3 Flynn McHoes, “Operating System”, Cengage Learning, 6th edition, 2013.
4 Sibsankar Halder and Alex A. Arvind, “Operating System”, Pearson, 2009
CONTENTS

UNIT-I 10 Hours
Introduction: Algorithm definition and specification, analysis of algorithmic efficiency of algorithms Review
of growth of function, space complexity, time complexity, Recurrences Substitution method, Iteration method,
Master method, Divide and Conquer Approach:merge Sort, quick sort, shell sort, heap sort, Simultaneous Max
and Min
Problem, Strassen’s algorithm for matrix multiplications.

UNIT-II 10 Hours
Greedy Algorithms: Elements of Greedy strategy, knapsack problem, job sequencing withdeadlines,
minimum spanning trees, Activity selection problem, Huffman Codes. DynamicProgramming: Elements of
Dynamic Programming, Matrix Chain Multiplication, Longes common subsequence and optimal binary search
trees problems.

UNIT-III 12 Hours
Graph Algorithms: DFS, BFS, Topological Sort, Strongly Connected Components Kruskal’ and Prim’s
algorithm for MST, Dijkstra’s and Bellman Fort Algorithm, All pai shortest path Algorithm. Back Tracking:
General method, n-queen’s problem, Branch and Bound: GeneraMethod, 0/1 knapsack.

UNIT-IV 10 Hours
String matching: Naïve String Matching algorithm, Rabin-Karp Algorithm, String Matchingwith finite
automata, The Knuth-Morris Pratt algorithm. NP-Complete Problem: Polynomia time verification, NP-
Completeness and Reducibility, NP-Completeness Proof,
NP-Complete problems.

Text Books
1 T .H .Cormen, C .E .Leiserson, R .L .Rivest, “Introduction to Algorithms”, 3rdEd., PHI.

2 E. Horowitz, S. Sahni, and S. Rajsekaran, “Fundamentals of Computer Algorithms,”2nd Ed.,


Universities Press.
3 P. H. Dave, H. B. Dave, “Design and Analysis of Algorithms”, 2nd Ed.,Pearson Education.

Reference Books
1 Design and Analysis of Algorithms, S. Sridhar, Oxford Univ. Press.
2 Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson Education,2008.

3 Foundations of Algorithms, R. Neapolitan and K. Naimipour, 4th edition, Jonesand Bartlett


Student edition.
CONTENTS

UNIT-I 10 Hours
Introduction to optimization: Engineering application of Optimization, Formulation o design problems as
mathematical programming problems. General Structure of OptimizationAlgorithms, Constraints, The Feasible
Region.

UNIT-II 10 Hours
Branches of Mathematical Programming: Optimization using calculus, Graphical Optimization, Linear
Programming, Quadratic Programming, Integer Programming, Semi Definite Programming.

UNIT-III 12 Hours
Optimization Algorithms: Genetic Optimization, Particle Swarm Optimization, Ant Colony Optimization
etc. Real life Problems and their mathematical formulation as standardprogramming problems. Recent
trends: Applications of ant colony optimization, geneticsand linear and quadratic programming in real world
applications.

UNIT-IV 10 Hours
Decision Making: Basic Steps in Decision Analysis, Decision-Making Environment Decision Making
Under Uncertainty, Decision Making Under Risk, Utility Theory, DecisionTree, Group Decision Making:
GDM Methods, Content-Oriented Methods, Multicriteri Decision Making.

Text Books
1 Rao, S. S., “Engineering optimization: theory and practice”, John Wiley & Sons, 4th
Edition, 2009/Latest Edition.
2 Edwin K., P. Chong & Stanislawh. Zak., “An Introduction to Optimization”, Wiley-Inter science, 2
nd

Edition, 2001/Latest Edition.


3 Andreas Antoniou, Wu- Sheng Lu, “Practical Optimization Algorithms and Engineering
Applications”, Springer, 2007/Latest Edition.
4 Ishizaka, Alessio, and Philippe Nemery, “Multi-criteria decision analysis: methods andsoftware”, John
Wiley & Sons, 2013/Latest Edition.
Reference Books
1 Dimitris Bertsimas, Robert Weismantel, “Optimization over integers Dynamic Ideas”,2005/Latest
Edition.
2 H. Paul Williams, “Logic and Integer Programming”, Springer, 2009/Latest Edition.

3 Xu, Zeshui. “Uncertain multi-attribute decision making: Methods and applications”,


Springer, 2015/Latest Edition.
4 Tzeng, Gwo-Hshiung, and Jih-Jeng Huang. “Multi Attribute Decision Making: Methods
and Applications”, USA, CRC Press. 2016/Latest Edition.
CONTENTS

UNIT I 11 Hours
Introduction –Introduction to productivity, Multi Factor productivity, Principles omanagement,
Organization structure.
Capacity Planning, Plant Location and Plant Layout – Introduction, need for selecting asuitable location,
Location Factors, Quantitative Method, Principles of Plant layout, Type of Layout – Product, Process, Fixes
Position, Cellular Layout.
UNIT II 11 Hours
Demand Forecasting-Need for demand forecasting, Techniques of forecasting, Time series analysis, Least Square
Method, Moving Average, Exponential Method and Qualitative Techniques.
Method Study- Introduction, Objectives Steps, Micromotion Study, Cycle graph and chronocycle graph,
Therbligs and SIMO charts.
Work Study – Objectives, Different Techniques, Standard Time, Allowances, Time studyNumerical,
Performance Rating, Work sampling.
Process and Product Life Cycle,
Material Requirement Planning – Introduction, MRP objectives, Functions served by MRPProduction
Planning and Control, Supply chain and Logistics Management,
Production Scheduling.

UNIT III 10 Hours


Inventory Management - Introduction, Reasons for Holding Inventories, Relevant Costs o Inventories, EOQ
models, Quantity Discount Models, Safety Stock, Inventory control systemSelective Control of Inventory ABC
analysis, VED analysis.
Production Cost Concepts – Introduction, Cost of Production, Classification and analysis of Cost, break even
analysis, Make and Buy.

UNIT IV 10 Hours
Industrial Maintenance – Concepts of Maintenance, Organisation for Maintenance department, Types of
Maintenance-Preventive, Breakdown and Corrective Maintenance Failure Analysis, Maintenance Performance,
Replacement policies of machines.

Text Books
1. Martinich, J.S., Production and Operations Management: An Applied ModernApproach”,
John Wiley and Sons, New Delhi, 2008.
2. Richard B. Chase, Nicholas J.A., Jacobs, F.R., “Production and Operation
Management”, Tata McGraw Hill, New Delhi, 1998.
3. Ravi Shankar, “Industrial Engineering and Management”, Galgotia Publications.
Reference Books
1. Paneerselvam, R., “Production and Operations Management”, Prentice Hall India,2012.

2 Khanna, O.P., “Industrial Engineering and Management”, Dhanpat Rai & Sons, 1985.
CONTENTS

UNIT-I 4 Hours
Concepts and definitions of disaster - hazard, vulnerability, resilience, risks, rehabilitation reconstruction, search and
rescue before, during and after disasters. Disaster Profile of India – Mega Disasters of India and Lessons Learnt.

UNIT-II 10 Hours
Categories of disasters -Natural disasters – earthquake, cyclone, landslide, flood, tsunami, he waves, cold waves,
avalanches, Man-made disasters – fire, urban fire, forest fire, Chemica biological, radiological and nuclear disasters,
armed conflict and civil strife, oil and Gasleakag Transport disasters Factors affecting Vulnerabilities, impact of
Development projects such a dams, high rise constructions etc.

UNIT-III 6 Hours
Geo-informatics in Disaster Management (RS, GIS, GPS and RS), Disaster CommunicationSystem (Early
Warning and Its Dissemination), Use of ICT, mobile technology, alarms etc, Application of Drone.

UNIT IV 8 Hours
Disaster Management Act 2005, Disaster Management National Policy, Disaster Managementcycle,
Role of Government (local, state and national), Non-Government, Inter-Governmental and UNAgencies.

Practical Component
Demonstration of Cardiopulmonary Resuscitation (CPR) Demonstration of Search and RescueOperations,
Earthquake Evacuation Drill Demonstration of Fire Drill
Text Books
1 Alexander David, Introduction in Confronting Catastrophe, Oxford University Press, 2000.

2 Kapur, Anu& others, Disasters in India Studies of grim reality, Rawat Publishers, Jaipur,2005.

3 MuktaGirdhar, Natural Disasters, Amy publication, Dariyaganj, New Delhi, 2019.


Reference Books
1 Andharia J. Vulnerability in Disaster Discourse, JTCDM, Tata Institute of Social SciencesWorking Paper
No. 8, 2008.
2 Govt. of India: Disaster Management Act 2005, Government of India, New Delhi.

You might also like