Syllabus for
Bachelor of Technology (Information Technology)
Academic Year  (2021)

The Undergraduate program in Information Technology is aimed at creating computer science engineers by providing the fundamentals of engineering and basic skills in computing. The special focus on employability is clear from the inclusion of subjects based on demand of industry and mandatory internships. A well-chosen elective basket gives the ward an opportunity to widen their knowledge in any specific domain.

Continuous internal Assesment-CIA-I,CIA-II,CIA-III

End Semester Examination

·       To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.

·       To make a study of SQL and relational database design.

·       To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.

·       To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure.

·       To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.

·       To implement the design of the tables in DBMS.

·       To write queries to get optimized outputs. 

·       To store, retrieve and view the contents. To generate report based on customized need.

Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.

Lab Programs

1. Data Definition Language (DDL) commands in RDBMS

2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in   RDBMS.

SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).

Lab programs

3. High-level language extension with Cursors.

4.High level language extension with Triggers

Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+ Tree – Query Processing.

Lab Programs 

5. Procedures and Functions.

6. Embedded SQL.

Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

Lab Programs

7. Database design using E-R model and Normalization.

8. Design and implementation of Payroll Processing System.

Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations- Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.

Lab Programs:

9. Design and implementation of Banking System

10.Design and implementation of Library Information System

1.     Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, Sixth Edition, McGraw-Hill, 2010.

1.     RamezElmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2008.

2.     Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003

 End Semester Examination(ESE) : 30% (30 marks out of 100 marks)

Course Description: The course focuses on basic and essential topics in data structures, including array-based lists, linked lists, trees, sorting algorithms, and graphs.

Course Objectives: To understand the basic concept of data structures for storage and retrieval of ordered or unordered data. Data structures include: arrays, linked lists, binary trees, heaps, and hash tables.  

Definition- Classification of data structures: primitive and non-primitive- Operations on data structures- Algorithm Analysis.

Lab Progrsm:

1.To determine the time complexity of a given logic.

Abstract Data Type (ADT) – The List ADT – The Stack ADT: Definition, Array representation of stack, Operations on stack: Infix, prefix and postfix notations Conversion of an arithmetic Expression from Infix to postfix. Applications of stacks.

The Queue ADT: Definition, Array representation of queue, Types of queue: Simple queue, circular queue, double ended queue (de-queue) priority queue, operations on all types of Queues.

1. Implement the applications Stack ADT 
2. Implement the applications for Queue ADT
3. Operations on stack [e.g.: infix to postfix, evaluation of postfix]

Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees – Tree Traversals – Hashing – General Idea – Hash Function – Separate Chaining – Open Addressing –Linear Probing – Priority Queues (Heaps) – Model – Simple implementations – Binary Heap.

Lab Program

Search Tree ADT - Binary Search Tree

 Implementing a Hash function/Hashing Mechanism.

Preliminaries – Insertion Sort – Shell sort – Heap sort – Merge sort – Quicksort – External Sorting.

Lab Program: 

1. Heap Sort
2. Quick Sort

Definitions – Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths – Dijkstra’s Algorithm – Minimum Spanning Tree – Prim’s Algorithm – Applications of Depth- First Search – Undirected Graphs – Bi-connectivity – Introduction to NP-Completeness-case study.

Lab Program: 

1. Implementing any of the shortest path algorithms

Mark Allen Weiss, “Data Structures and Algorithm Analysis in Java”, 3rd Edition, Pearson Education 2013.

R2.Classic Data Structures , Debasis Samanta ,2nd Edition, PHI Learning PVT,2011

End Semester Examination (ESE) : 30% (30 marks out of 100 marks)

Course Description: Software engineering course provides: Different life cycle models, Requirement dictation process, Analysis modelling and specification, Architectural and detailed design methods, Implementation and testing strategies, Verification and validation techniques, Project planning and management and Use of CASE tools.

Course objectives:  To be aware of Different life cycle models; Requirement dictation process; Analysis modeling and specification; Architectural and detailed design methods; Implementation and testing strategies; Verification and validation techniques; Project planning and management and Use of CASE tools.

Introduction –S/W Engineering Paradigm  – life cycle models (water fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) - system engineering – computer based system  – verification – validation – life cycle process – development process –system engineering hierarchy.

Functional and non-functional - user – system –requirement engineering process – feasibility studies – requirements – elicitation – validation and management – software prototyping – prototyping in the software process – rapid prototyping techniques – user interface prototyping -S/W document. Agile methods, Extreme Programming, SCRUM

Design process and concepts – modular design – design heuristic – design model and document. Architectural design – software architecture – data design – architectural design – transform and transaction mapping – user interface design – user interface design principles. Real time systems - Real time software design – system design – real time executives – data acquisition system - monitoring and control system. SCM – Need for SCM – Version control – Introduction to SCM process – Software configuration items.

Taxonomy of software testing – levels – test activities – types of s/w test – black box testing – testing boundary conditions – structural testing – test coverage criteria based on data flow mechanisms – regression testing – testing in the large. S/W testing strategies – strategic approach and issues - unit testing – integration testing – validation testing – system testing and debugging.

Measures and measurements – S/W complexity and science measure – size measure – data and logic structure measure – information flow measure. Software cost estimation – function point models – COCOMO model- Delphi method.- Defining a Task Network – Scheduling – Earned Value Analysis – Error Tracking - Software changes – program evolution dynamics – software maintenance – Architectural evolution. Taxonomy of CASE tools – Case Study.

R2. Ian Sommerville, “Software engineering,” Pearson education Asia, 9th Edition 2013.

R3. PankajJalote- “An Integrated Approach to Software Engineering,” Narosa publishing house 2011.

R4. James F Peters and WitoldPedryez, “Software Engineering – An Engineering Approach”, John Wiley and Sons, New Delhi, 2010.

R5. Ali Behforooz and Frederick J Hudson, “Software Engineering Fundamentals”, OUP India 2012.

End Semester Exams ESE 50

Total 100

This mandatory course is aimed at providing a comprehensive overview of the different facets of Cyber Security.  In addition, the course will detail into specifics of Cyber Security with Cyber Laws both in Global and Indian Legal environments

Security Fundamentals-4 As Architecture Authentication Authorization Accountability, Social Media, Social Networking and Cyber Security.Cyber Laws, IT Act 2000-IT Act 2008-Laws for Cyber-Security, Comprehensive National Cyber-Security Initiative CNCI – Legalities

Cyber Attack and Cyber Services Computer Virus – Computer Worms – Trojan horse.Vulnerabilities -  Phishing -  Online Attacks – Pharming - Phoarging  –  Cyber Attacks  -  Cyber Threats -  Zombie- stuxnet - Denial of Service Vulnerabilities  - Server Hardening-TCP/IP attack-SYN Flood

Cyber Security Management Risk Management and Assessment - Risk Management Process - Threat Determination Process -Risk Assessment - Risk Management Lifecycle.Security Policy Management - Security Policies - Coverage Matrix Business Continuity Planning - DisasterTypes  -  Disaster Recovery Plan - Business Continuity Planning Process

Vulnerability - Assessment and Tools: Vulnerability Testing - Penetration Testing Black box- white box.Architectural Integration:  Security Zones - Devicesviz Routers, Firewalls, DMZ. Configuration Management - Certification and Accreditation for Cyber-Security.

Authentication and Cryptography: Authentication - Cryptosystems - Certificate Services, Securing Communications:  Securing Services -  Transport  –  Wireless  -  Steganography and NTFS Data Streams. Intrusion Detection and Prevention Systems:   Intrusion -  Defense in Depth  -  IDS/IPS  -IDS/IPS Weakness and Forensic AnalysisCyber Evolution: Cyber Organization – Cyber Future

R2. Thomas R, Justin Peltier, John, “Information Security Fundamentals”, Auerbach Publications.

R3. AtulKahate, “Cryptography and Network Security”,  2^nd Edition, Tata McGrawHill.2003

R4. Nina Godbole, SunitBelapure, “Cyber Security”, Wiley India 1^st Edition 2011

R5. Jennifer L. Bayuk and Jason Healey and Paul Rohmeyer and Marcus Sachs, “Cyber Security Policy Guidebook”, Wiley; 1 edition , 2012

R6. Dan Shoemaker and Wm. Arthur Conklin, “Cyber security: The Essential Body Of Knowledge”,   Delmar Cengage Learning; 1 edition, 2011

R7. Stallings, “Cryptography & Network Security - Principles & Practice”, Prentice Hall, 6th Edition 2014

Maximum Marks : 50

·

To study the fundamentals of digital circuits and concepts used in the analysis and design of various digital systems.

Switching Theory: Laws of Boolean algebra, Theorems of Boolean algebra, Switching functions, Methods for specification of switching functions - Truth tables and Algebraic forms, Realization of functions using logic gates. Digital Logic Elements: Electronic logic gates, Positive and negative logic, Logic families -TTL, ECL and CMOS, Realization of logic gates.

Simplification of Boolean Expressions and Functions: Algebraic methods,     Canonical forms of Boolean functions, Minimization of functions using Karnaugh     maps, Minimization of functions using Quine-McClusky method.

Design of Combinational Logic Circuits: Gate level design of Small Scale     Integration (SSI) circuits, Modular combinational logic elements - Decoders,     Encoders, Priority encoders, Multiplexers and Demultiplexers. Design of Integer     Arithmetic Circuits using Combinational Logic: Integer adders - Ripple carry adder     and Carry look ahead adder, Integer subtractors using adders, Unsigned integer     multipliers - Combinational array circuits, Signed integer multipliers - Booth's     coding, Bit-pair recoding, Carry save addition and Wallace tree multiplier, Signed     integer division circuits - Combinational array circuits, Complexity and propagation     delay analysis of circuits. Design of Combinational Circuits using Programmable     Logic Devices (PLDs): Programmable Read Only Memories (PROMs),     Programmable Logic Arrays (PLAs), Programmable Array Logic (PAL) devices,     Design of multiple output circuits using PLDs.

Sequential Circuit Elements: Latches -RS latch and JK latch, Flip-flops-RS, JK, T     and D flip flops, Master-slave flip flops, Edge-triggered flip-flops. Analysis and     Design of Synchronous Sequential Circuits: Models of sequential circuits - Moore     machine and Mealy machine, Flip-flops - Characteristic table, Characteristic     equation and Excitation table, Analysis of sequential circuits- Flipflop input     expressions, Next state equations, Next state maps, State table and State transition     diagram, Design of sequential circuits - State transition diagram, State table, Next     state maps, Output maps, Expressions for flip-flop inputs and Expressions for circuit     outputs, Modular sequential logic circuits- Shift registers, Registers, Counters and  Random access memories, Design using programmable logic sequencers (PLSs).     Design of Arithmetic Circuits using Sequential Logic : Serial adder for integers,     Unsigned integer multiplier, Unsigned integer division circuits, Signed integer     division, Floating-pint adder/subtractor - Design of control circuit, Floating - point multiplier.

Case study: Learn the Fundamentals of Digital Logic Design with VHDL Informal Laboratory:

·         Design and implementation of binary adder / subtractor using basic gates

·         Design and implementation of applications using multiplexers

·         Design and implementation of Synchronous & Asynchronous Counters

·         Design and implementation of Shift Registers

Coding Combinational Circuits using Hardware Description Language (HDL)

T1 - Donald P Leach, Albert Paul Malvino&GoutamSaha, “Digital Principles and Applications” , Tata McGraw Hill 7^th Edition, 2010.

R2- R D Sudhaker Samuel, “Illustrative Approach to Logic Design. Sanguine-Pearson”, 2010.

R3- Charles H. Roth, “Fundamentals of Logic Design”, Cengage Learning, 5th Edition, 2004.

R4- Ronald J. Tocci, Neal S. Widmer. Gregory L. Moss, “Digital Systems Principles and     Applications, ” 10^th  Edition. Pearson Education, 2007

R5- M Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 10th Edition, 2008.

Assessment of each paper

·         Continuous Internal Assessment (CIA) for Theory papers: 50% (50 marks out

of 100 marks)

·         End Semester Examination(ESE) : 50% (50 marks out of 100 marks)

Components of the CIA

CIA I   :   Mid Semester Examination (Theory)                    : 25 marks                  

CIA II  :  Assignments                                                            : 10 marks

CIA III            : Quizzes/Seminar/Case Studies/Project Work     : 10 marks

Attendance                                                                             : 05 marks

            Total                                                                                         : 50 marks

For subjects having practical as part of the subject

Assessment of Practical paper

Conduct of experiments                                                       : 25 marks

Observations/Lab Record                                                   : 15 marks

Viva voce                                                                                : 10 marks

Total                                                                                        : 50 marks

(All the above assessments are carried for each experiment during regular lab classes and averaged to max 50 marks at the end of the semester)

The goal of this course is to prepare engineering students with individual and collaborative technical writing and presentation skills that are necessary to be effective technical communicators in academic and professional environments.

Communication – Process, Flow , Barriers. Analysing  different kinds of technical documents, Reports – types, Writing Engineering reports – Types, Importance, Structure of formal reports, Factors information and document design. 

Vocabulary for professional writing. Idioms and collocations, Writing drafts and revising,   writing style and language. ,advanced  grammar, Writing Emails, resumes

Self development process, Personality development, Types of personality, Perception and attitudes, Emotional intelligence, Time Management, Values and belief, Personal goal setting, Creativity, Conflict management, Career planning.

Writing a speech, Public speaking, Formal presentations, Presentation aids, Group communication, Discussions, Organizational GD, Meetings & Conferences.

Email etiquettes, Telephone Etiquettes, Time Management, Role and responsibility of engineer, Work culture in jobs, Engineering ethics

       T2: Diane Hacker, Pocket Style Manual, Bedford Publication, New York, 2003. (ISBN 0312406843)

T3: Raman Sharma, Technical Communications, Oxford Publication, London, 2004

R2. Sharma, R. and Mohan, K. Business Correspondence and Report Writing, TMH New Delhi 2002.

R3. Xebec, Presentation Book, TMH New Delhi, 2000. (ISBN 0402213)

Mid Semester Exams - 25 Marks

CIA 2 - 10 Marks

End Semester Exams - 50 Marks

Attendance - 5 marks

To extend student’s mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

The objective of the paper is to develop:

·  The knowledge of the concepts needed to test the logic of a program.

·    Knowledge which has application in expert system, in data base and a basic for the programing language.

·    An understanding in identifying patterns on many levels.

·    Awareness about a class of functions which transform a finite set into another finite set that relates to input output functions in computer science.

Propositions Logical connectives Compound propositions Conditional and bi conditional propositions Truth tables Tautologies and contradictions Contrapositive Logical equivalences and implications De Morgans Laws - Normal forms Principal conjunctive and disjunctive normal forms Rules of inference Arguments - Validity of arguments.

Predicates Statement Function Variables Free and bound variables Quantifiers Universe of discourse Logical equivalences and implications for quantified statements Theory of inference The rules of universal specification and generalization Validity of arguments

Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Matrix and Graph representation of a relation Partial ordering Poset Hasse diagram Lattices and their properties Sublattices Boolean algebra.

Definitions of functions Classification of functions Types of functions - Examples Composition of functions Inverse functions Characteristic function of a set Hashing functions Permutation functions.

Groups - Properties Subgroups - Cosets and Lagranges theorem Normal subgroups Algebraic system with two binary operations Preliminaries of Coding - Hamming Metric - group codes: Basic notions of error correction - Error recovery in group codes.

T1. Trembly J.P and Manohar R, Discrete Mathematical Structures with Applications to Computer Science, Tata McGrawHill Pub.Co. Ltd, New Delhi, 2003. 

T2. Ralph. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition, Pearson Education Asia,Delhi, 2009.

1.      R1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, Discrete Mathematical Structures,  Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.

2.      R2. Kenneth H. Rosen, Discrete Mathematics and its Applications, Fifth Edition, Tata McGraw Hill Pub. Co. Ltd., New Delhi, 2003.

3.      R3. .Richard Johnsonbaugh, Discrete Mathematics, Fifth Edition,Pearson Education Asia, New Delhi, 2002.

4.      R4. Dr K.S.C , Discrete Mathematical Structures, 5^th Edition, Prism Engineering Education Series2018.

5.      R5. S Santha, Discrete Mathematics with Combinatorics and Graph Theory  Cengage, 1^st Edition, 2019

End Semester Examination(ESE)      : 50% (50 marks out of 100 marks) 

Components of the CIA

CIA I  :  Subject Assignments / Online Tests                  : 10 marks

CIA II :   Mid Semester Examination (Theory)                : 25 marks            

CIAIII:Quiz/Seminar/Case Studies/Project/Innovative Assignments/presentations/publications : 10 marks

Attendance                                                                           : 05 marks

            Total                                                                                       : 50 marks

Mid Semester Examination (MSE) : Theory Papers:

• The MSE is conducted for 50 marks of 2 hours duration.
• Question paper pattern; Five out of Six questions have to be answered. Each  question carries 10 marks

End Semester Examination (ESE):

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers are divided into FIVE units and each unit carries equal Weightage in terms of marks distribution.

Question paper pattern is as follows.

Two full questions with either or choice will be drawn from each unit. Each question carries 20 marks. There could be a maximum of three sub divisions in a question. The emphasis on the questions is to test the objectiveness, analytical skill and application skill of the concept, from a question bank which reviewed and updated every year

The criteria for drawing the questions from the Question Bank are as follows

50 % - Medium Level questions

25 % - Simple level questions

25 % - Complex level questions

The studio intends to contextualize the student towards aesthetical approach and sensitize them towards local and heterogeneous culture of ours. Today, the biggest challenge is lying in the areas of aesthetical thinking and process-based techniques, where we try to enhance aesthetic sense, creativity, responsive and reflective ecology in which they live and connect. They connect their creativity and aesthetical sensibility to local knowledge and culture of their own environment. Also, there are things to learn and adapt from the diversity of craftsmanship and knowledge system. 

1. Introduction to different media and rendering techniques.
2. Introduction to principles of composition, developing keen sensitivity to space, scale, proportion, light, wind, sound, texture.
3. To understand basic principles of freehand drawing and color.
4. Introduction to the representation of the human body and anthropometrics /ergonomics.
5. To translate abstract principles of design into architectural processes, forms, and solutions.
6. To introduce the Architectural Design Language – technical drafting and presentation and to impart the appropriate manual skills for visualization and technical representation.

Level: Basic

CO2: Ability to sensitively observe and record various aspects of the immediate environment including human relationships, visual language, aesthetic characteristics and space, elements of nature, etc. 

Level: Basic

CO3: Ability to achieve skills of visualization and communication, through different mediums and processes.

Level: Basic 

Observing, experiencing, analyzing the manmade environment and organic environment.

To create awareness of human abilities like perception, intuition, Identification, and observation, enjoying our senses through a nature walk, (by seeing, hearing, touching, smelling, and tasting)

To understand basic principles of art and drawing as an extension of seeing and a tool to create awareness of different visualization techniques.

1. Elements of design, Developing skills of analysis, synthesis, interpretation, and communication through elements and composition.
2. Introduction to the theory of visual perception through color, form, space, light and shadow, texture, and tones.

1. Developing pictorial representations -Isometric Projection, Axonometric projection, and Perspective projections 
2. Introduction to Sciography and principles of shades and shadows.
3. Rendering the pictorial projections.

T2. Bhatt, N. D., Engineering Drawing, Charotar Publishing House Pvt. Ltd

T3. Venugopal, K., Engineering Drawing and Graphics, New Age International Publishers. 

T4. S. Rajaraman, Practical Solid Geometry.

R2. Alexander W. White, ‘The Elements of Graphic Design, Allworth Press

R3. Alexander W. White, ‘The Elements of Graphic Design, Allworth Press; 1 edition (Nov 1, 2002)

CONTINUOUS INTERNAL ASSESSMENT (CIA): 50 Marks

END SEMESTER EXAMINATION (ESE, VIVA-VOCE): 50 Marks

TOTAL:100 Marks

Note: For this course, a minimum of 50% marks in CIA is required to be eligible for VIVA-VOCE which is conducted as ESE.

• To learn the systematic way of solving problems.
• To understand the different methods of organizing large amounts of data.
• To efficiently implement the different data structures.
• To efficiently implement solutions for specific problems.

Definition- Classification of data structures: primitive and non-primitive- Operations on data structures- Algorithm Analysis.

LAB Programs:

1a. Sample C Programs 1b. To determine the time complexity of a given logic. 

Abstract Data Type (ADT) – The List ADT – The Stack ADT: Definition,Array representation of stack, Operations on stack: Infix, prefix and postfix notations Conversion of an arithmetic Expression from Infix to postfix. Applications of stacks. 

The Queue ADT: Definition, Array representation of queue, Types of queue: Simple queue, circular queue, double ended queue (de-queue) priority queue, operations on all types of Queues 

LAB Programs:

2. Implement the applications Stack ADT.

3. Implement the applications for Queue ADT.

4.Operations on stack[e.g.: infix to postfix, evaluation of postfix]

Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees – Tree Traversals – Hashing – General Idea – Hash Function – Separate Chaining – Open Addressing –Linear Probing – Priority Queues (Heaps) – Model – Simple implementations – Binary Heap.

LAB PROGRAMS:

5. Search Tree ADT - Binary Search Tree

Preliminaries – Insertion Sort – Shell sort – Heap sort – Merge sort – Quicksort – External Sorting.

LAB PROGRAMS

6. Heap Sort.

7. Quick Sort.

8.Applications of Probability and Queuing Theory Problems to be implemented using data structures. 

Definitions – Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths – Dijkstra‘s Algorithm – Minimum Spanning Tree – Prim‘s Algorithm – Applications of Depth- First Search – Undirected Graphs – Bi-connectivity – Introduction to NP-Completeness-case study

LAB PROGRAMS

9. Implementing a Hash function/Hashing Mechanism.

10. Implementing any of the shortest path algorithms. 

1.Mark Allen Weiss , “Data Structures and Algorithm Analysis in C”, 2nd  Edition, Addison-Wesley, 1997

CIA I : Assignment/MCQ  and Continuous Assessment : 10 marks

CIA II : Mid Semester Examination (Theory) : 10 marks

CIA III : Closed Book Test/Mini Project and Continuous Assessment: 10 marks

Lab marks :35 marks

Attendance : 05 marks

End Semester Examination(ESE) : 30% (30 marks out of 100 marks)

Total: 100 marks

Course Description: This is offered as a core course in first trimester. This course will provide a general introduction to management principles and theories, and a brief outline on history and development of management thought.

Course Objectives: This course describes the steps necessary to understand an organisation that are aligned with business objectives and provides an insight to address a range of challenges that every manager encounters. It aims to prepare students for an exciting challenging and rewarding managerial career through case studies on ‘Global Perspective’.

 CLO1   Understand different management approaches

 CLO2   Demonstrate planning techniques

 CLO3   Able to work in dynamic teams within organizations

CLO4   Analyze different processes in staffing and controlling

Meaning; Scope; Managerial levels and skills; Managerial Roles; Management: Science, Art or Profession; Universality of Management.

Ancient roots of management theory; Classical schools of management thought; Behavioral School, Quantitative School; Systems Approach, Contingency Approach; Contemporary Management thinkers & their contribution. Ancient Indian Management systems & practices. Comparative study of global management systems & practices. Social responsibility of managers, Managerial Ethics.

Evolution of Management: Teaching management through Indian Mythology (Videos of Devdutt Pattanaik, Self-learning mode)

Types of Plans; Steps in Planning Process; Strategies, level of Strategies, Policies and Planning; Decision making, Process of Decision Making, Techniques in Decision Making, Forecasting & Management by Objectives (MBO).

Planning: Emerald Case and Projects of Events

Organizational structure and design; types of organizational structures; Span of control, authority, delegation, decentralization and reengineering. Social responsibility of managers, Managerial Ethics.

Organizing: Holacracy form of organization structure

Human resource planning, Recruitment, selection, training & development, performance appraisal, managing change, compensation and employee welfare.

Motivation: Concept, Forms of employee motivation, Need for motivation, Theories of motivation, Stress Management

Staffing: Stress Management & Career path, Emerald Case

Leadership concept, leadership Styles, leadership theories, leadership communication.

Nature of organizational control; control process; Methods and techniques of control; Designing control systems, Quality Management

Leading: Article on Styles of leadership by Daniel Goleman

Controlling: Projects of Events

1.     Daft, R. L. (2013). The new era of management (10^th Edition). Cengage Publications.

2.     Prasad, L.M., Principles and practices of management. New Delhi: Sultan Chand & Sons.     

3.     Stoner, J.F., Freeman, E. R., & Gilbert, D.R. (2013). Management (6^th Edition). Pearson Publications.

4.      Joseph L Massie, Essentials of Management. Prentice-Hall India, New York.

Course objectives:  

• To know about the types of transducers available.
• To understand the function of signal generators and analyzers.
• To gain information about data acquisition, data logging, and application of sensors incondition-based monitoring.

Sensors and classifications – Characteristics environmental parameters – Selectionand specification of sensors – Introduction to Acoustics and acoustic sensors- Ultrasonicsensor- Types and working of Microphones and Hydrophones – Sound level meter, Humidity
sensor, and Nuclear radiation sensor – Stress- Strain measurements Strain gauges (resistiveand Optical) types Uniaxial and Multiaxial strain gauges with signal conditioning circuits(half, quarter, and full bridges)

Introduction - primary sensors, characteristic, Information coding / processing, Datacommunication - Recent trends in sensors and Technology - Film sensor, MEMS and NanoSensors.

Amplification, Filtering – Level conversion – Linearization - Buffering – Sample andHold circuit – Quantization – Multiplexer / Demultiplexer – Analog to Digital converter –Digital to Analog converter- I/P and P/I converter - Instrumentation Amplifier-V/F and F/V converter.

Data Acquisition conversion-General configuration-single channel and multichanneldata acquisition – Digital filtering – Data Logging – Data conversion – Introduction to DigitalTransmission system.

Introduction to condition monitoring - Non destructive testing (vs) condition
monitoring- Intelligent fault detection- Accelerometers- Acoustic Emission sensors- Thermalimaging cameras- Vibration Signature based monitoring techniques - Acoustic emissionholography - oil Analysis- Ultrasound based Non Destructive Evaluation techniques.

T2. Ernest O. Doebelin, “Measurement Systems – Applications and Design”, TataMcGraw-Hill, 2009.

T3. David G. Alciatore and Michael B. Histand, “Introduction to Mechatronics andMeasurement systems”, Tata McGraw-Hill, 2nd Edition, 2008.

T4. John Turner and Martyn Hill, Instrumentation for Engineers and Scientists, OxfordScience Publications, 1999.

R2. A.K. Sawney and PuneetSawney, “A Course in Mechanical Measurements andInstrumentation and Control”, 12th edition, DhanpatRai& Co, New Delhi, 2001.

R3.Mohamed Gad-el-Hak, “The MEMS handbook”, Interpharm/CRC. 2001

R4. Dr.Ing.B.V.A. RAO, “Monograph on Acoustics & Noise control”, NDRF, TheInstitution of Engineers (India), 2013.

ESE Marks: 50

This course focuses on the fundamentals of psychology. It is an introductory paper that gives an overall understanding about the human behavior. It will provide students with an introduction to the key concepts, perspectives, theories, and sub-fields on various basic processes underlying human behavior.

1. To understand the fundamental processes underlying human behavior
2. To become aware of one’s idiosyncrasies and predispositions
3. To apply the understanding of concepts in day-to-day activities

1. Explain human behaviors using theoretical underpinnings
2. Understand oneself and others, respecting the differences
3. Demonstrate their understanding of psychological processes in daily activities

Definition, Characteristics of Sensory modalities: Absolute and difference threshold; Signal detection theory; sensory coding; Vision, Audition, Other Senses. Assessment of Perception and Sensation

Practicum: Aesthesiometer

Definition, Understanding perception, Gestalt laws of organization, Illusions and Perceptual constancy; Various sensory modalities; Extrasensory perception.

Practicum:  Muller-Lyer Illusion

Learning:Definition, Classical conditioning, Instrumental conditioning, learning and cognition; Memory:  Types of Memory; Sensory memory, working memory, Long term memory, implicit memory, Constructive memory, improving memory; Assessment of memory.

Practicum: Memory drum

Concepts and nature of Individual differences; Nature vs. nurture; Gender difference in cognitive processes and social behavior; Intelligence: Definition, Contemporary theories of intelligence; Tests of intelligence; Emotional, Social and Spiritual intelligence.

Practicum: Bhatia’s Battery of Performance

Definition, Type and trait theories of personality, Type A, B & C. Psychoanalytic -  Freudian perspective; Types of personality assessment.

Practicum: NEO-FFI 3

Rathus, S. A. (2017). Introductory Psychology, 5thEd. Belmont, CA: Wadsworth.

Nolen-Hoeksema, S., Fredrickson, B.L. & Loftus, G.R. (2014). Atkinson & Hilgard'sIntroduction to Psychology.16th Ed. United Kingdom: Cengage Learning.

Morgan, C. T., King, R. A., & Schopler, J. (2004). Introduction to Psychology. New Delhi: Tata     McGraw Hill.

Kalat, J. W. (2016). Understanding Psychology. New York: Cengage Learning

Mid Semester Examination

End Semester Examination

Understanding and application of MATLAB and TINKERCAD for biological analysis which would results in better healthcare and any engineer, irrespective of the parent discipline (mechanical, electrical, civil, computer, electronics, etc.,) can use the disciplinary skills toward designing/improving biological systems. This course is designed to convey the essentials of human physiology.

The course will introduce to the students the various fundamental concepts in MATLAB and TINKERCAD for numerical analysis and circuit design using arduino.

1.      To familiarize with Matlab Online and getting used to basic functionalities used in Matlab (arrays, matrices, tables, functions)

2.      To calculate the Body Mass Index (BMI) of a person and determine under what category the person falls under – underweight, normal, overweight

3.      To determine the R peaks in given ECG and to find HRV using Matlab.

4.      To determine the R peaks in given ECG and to find HRV using Matlab.

5.      To determine the R peaks in given ECG and to find HRV using Matlab.

6.      Introduction to Tinkercad and using the various tools available for running a simple program of lighting a LED bulb using Arduino (digital).

7.      To design a driver motor in Tinkercad using Arduino and driver motor

8.      To design a temperature sensor in Tinkercad using Arduino and TMP36

9.      To design and simulate gas sensors using potentiometers, Arduino and servo motors

10.  To design and simulate measuring pulse sensors using photodiodes, IR LED and Arduino

11.  Preparation of biopolymers (polylactic acid) at home using home-based ingredients.

At the end of the course, the students would have a fundamental knowledge of the basic probability concepts. Have a well – founded knowledge of standard distributions which can describe real life phenomena. Acquire skills in handling situations involving more than one random variable and functions of random variables. Understand and characterize phenomena which evolve with respect to time in a probabilistic manner. Be exposed to basic characteristic features of a queuing system and acquire skills in analyzing queuing models.

Axioms of probability - Conditional probability - Total probability – Baye’s theorem Random variable - Probability mass function - Probability density function  - Properties – Moments - Moment generating functions and their properties.

Binomial, Poisson, Geometric, Negative Binomial, Uniform, Exponential,Gamma,

Weibull and Normal distributions and their properties - Functions of a random variable.

Joint distributions - Marginal and conditional distributions – Covariance Correlation and regression - Transformation of random variables - Central limit theorem.

Classification - Stationary process - Markov process - Poisson process - Birth and death process - Markov chains - Transition probabilities - Limiting distributions. Transition Diagram.

Markovian models – M/M/1, M/M/C, finite and infinite capacity - M/M/∞ queues - Finite source model -  M/G/1 queue (steady state solutions only) – Pollaczek – Khintchine formula – Tools for statistical analysis

T2. Medhi J., “Stochastic Processes”, New Age Publishers, New Delhi, 2017. (Chapters 2, 3,4) 

T3. T. Veerarajan, “Probability, Statistics and Random process”, Second  Edition, Tata McGraw Hill, New Delhi,  2017.

R2. Taha H. A., “Operations Research-An Introduction”, Seventh Edition, Pearson Education Edition Asia, Delhi, 2014.

R3. John F. Shortle , James M. Thompson, Donald Gross, Carl M. Harris Fundamentals of Queueing Theory; Wiley Series 2018

●   End Semester Examination(ESE)      : 50% (50 marks out of 100 marks) 

Objectives of this course is to have an overview of different types of operating systems. They also include an understanding of the components of an operating system; To develop knowledge of process management and have a thorough knowledge of storage management; To know the concepts of I/O and file systems.

Introduction : What operating systems do, Computer System Architecture, Operating System Structure, Operating System Operations, Process Management, Memory Management, Storage Management, Protection and Security; System Structures: Operating System Services, User Operating System Interface, System Calls, Types of System Calls

Process Management: Process Concept, Process Scheduling, Operations on Processes, Inter-process Communication; Threads: Overview, Multithreading Models, Thread Libraries; CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple- Processor Scheduling

Process Synchronization: Background, The Critical Section Problem, Peterson’s Solution, Synchronization Hardware, Semaphores, Classical Problems of Synchronization, Monitors, Synchronization Examples, Deadlocks 

Memory Management: Background, Swapping, Contiguous Memory Allocation, Paging,

Virtual Memory: Background, Demand Paging, Copy on Write, Page Replacement, Allocation of frames, Thrashing, Allocating Kernel Memory

File System Interface: File System: File Concept, Access Methods, Directory Structure, File System Mounting, File Sharing, Protection;

File System Implementation & Mass Storage Structure: Implementing File Systems: File System Structure, File System Implementation, Directory Implementation, Allocation Methods, Free Space Management. Disk structure, Disk Attachment, Disk Scheduling Methods, Disk Management, Swap-Space Management

2.      Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2009.

3.      William Stallings, “Operating System”, Pearson Education 2009

4.      Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts and Practice”, PHI, 2010.

Software development in business environment has become more sophisticated, the software implementation is becoming increasingly complex and requires the best programming paradigm which helps to eliminate complexity of large projects. Object Oriented Programming (OOP) has become the predominant technique for writing software at present. Many other important software development techniques are based upon the fundamental ideas captured by object-oriented programming. The course also caters to the understanding of event driven programming, generic programming and concurrent programming. By the end of this COURSE, the student should acquire the basic knowledge and skills necessary to implement the concepts of various programming paradigms.

Review of OOP - Objects and classes in Java – defining classes – methods - access specifiers – static members – constructors – finalize method – Arrays – Strings - Packages – JavaDoc comments. 

Inheritance – class hierarchy – polymorphism – dynamic binding – final keyword – abstract classes – the Object class – Reflection – interfaces – object cloning – inner classes.

Graphics programming – Frame – Components – working with 2D shapes – Using color, fonts, and images - Basics of event handling – event handlers – adapter classes – actions – mouse events – AWT event hierarchy – introduction to Swing – Model-View- Controller design pattern – buttons – layout management – Swing Components

Motivation for generic programming – generic classes – generic methods – generic code and virtual machine – inheritance and generics – reflection and generics – exceptions – exception hierarchy – throwing and catching exceptions.

Multi-threaded programming – interrupting threads – thread states – thread properties – thread synchronization – thread-safe Collections – Executors – synchronizers – threads and event-driven programming, Parallel programming –fork, join framework.

2.              Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – undamentals”, Eighth Edition, Sun Microsystems Press, 2008.

2.             Ivan BratikoPROLOG: Programming for Artificial Intelligence, Third Edition, Pearson Publisher, 2002.

3.            Bruce Eckel, “Thinking in Java”, 4th Edition, February 20, 2006.

4.          Doug Rosenberg, Matt Stephens, “Use Case Driven Object Modeling with UML: Theory and Practice (Expert's Voice in UML Modeling)”, January 16, 2013.

To have an understanding of finite state and pushdown automata.

To have a knowledge of regular languages and context free languages.

To know the relation between regular language, context free language and corresponding recognizers.

To study the Turing machine and classes of problems.

Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.

Regular Expression  – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata.

Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG, Deterministic Pushdown Automata.

Normal forms for CFG – Pumping Lemma for CFL - Closure Properties of CFL – Turing Machines – Programming Techniques for TM.

A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem - The classes P and NP.

R2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH,       2003.

R3. Michael Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997. 

• Continuous Internal Assessment (CIA) for Theory papers: 50% (50 marks out of 100 marks) 
• End Semester Examination(ESE): 50% (50 marks out of 100 marks)
  

This course will help the students to learn about basic structure of computer system, design of arithmetic and logic unit with the implementation of fixed and floating point numbers. Further, it will give knowledge about design of control unit and pipelined processing concepts. It discusses about various parallel processing architectures, different memory systems and I/O Communication systems

Functional Units – Basic Operational Concepts – Performance – Instructions: Language of the Computer – Operations, Operands – Instruction representation – Logical operations – decision making – MIPS Addressing.

Addition and Subtraction – Multiplication – Division – Floating Point Representation – Floating Point Operations – Subword Parallelism

A Basic MIPS implementation – Building a Datapath – Control Implementation Scheme – Pipelining – Pipelined datapath and control – Handling Data Hazards & Control Hazards – Exceptions.