Programme Outcome/Programme Learning Goals/Programme Learning Outcome:

PO2: Identify, formulate, research literature, and solve complex computing problems reaching substantiated conclusions using fundamental principles of mathematics, computing sciences, and relevant domain disciplines.

PO3: Design and evaluate solutions for complex computing problems, and design and evaluate systems, components, or processes that meet specified needs with appropriate consideration for public health and safety, cultural, societal, and environmental considerations.

PO4: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions.

PO5: Create, select, adapt and apply appropriate techniques, resources, and modern computing tools to complex computing activities, with an understanding of the limitations.

PO6: Understand and commit to professional ethics and cyber regulations, responsibilities, and norms of professional computing practices.

PO7: Recognise the need, and have the ability, to engage in independent learning for continual development as a computing professional.

PO8: Demonstrate knowledge and understanding of the computing and management principles and apply these to one?s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.

PO9: Communicate effectively with the computing community, and with society at large, about complex computing activities by being able to comprehend and write effective reports, design documentation, make effective presentations, and give and understand clear instructions.

PO10: Understand and assess societal, environmental, health, safety, legal, and cultural issues within local and global contexts, and the consequential responsibilities relevant to professional computing practices.

PO11: Function effectively as an individual and as a member or leader in diverse teams and in multidisciplinary environments.

CIA: 50%

ESE: 50%

To enable the students to learn the basic functions, principles and fundamental aspects of computer architecture and design in terms of digital logic elements and circuits, central processing unit and memory unit.

CO2: Acquaint with elementary postulates of Boolean algebra and methods for simplifying Boolean expressions

CO3: Illustrate the procedures for the analysis and design of sequential and combinational circuits

CO4: Demonstrate the basic structure and operation of the processing unit and get familiarize with different types of memory systems

Number system- Decimal number system- Binary number system- octal number system- hexadecimal number system- number system conversion- number representation- unsigned representation – signed number representation-1’s complement – 2’s complement- 9’s complement – 10’s complement- binary arithmetic operation- binary addition- binary subtraction- Binary multiplication- binary division- Binary codes- BCD and Gray code

Introduction- Boolean algebra- Boolean operators- truth table- laws of Boolean algebra- De Morgan’s Law- Logic gates- Description of logic gates- Universal properties- Simplification of logic functions- Realization using NAND and NOR  gate

Self learning: Implementation using simulator

Logic expression- minterm - maxterm- SOP - POS expression- minimization techniques- Karnaugh Map Combinational circuits- Half Adder – Full adder- Half subtractor-Full subtractor- Binary adder-Binary subtractor-Binary adder subtractor-BCD adder – Realization using NAND gates -Binary multiplier- Encoder- Decoder- Multiplexer- Demultiplexer-BCD to seven segment display

Sequential Circuit Definitions - Latches- Clock - Types of Clock – positive - Negative edge triggered -  Flip-Flops- SR Flip Flop – D Flip Flop – JK Flip Flop -Edge Triggered Flip Flop- T Flip-Flop - Master-Slave JK Flip-Flop-Timing diagram.

Definition of Register and Counter – Registers - Shift Registers – Serial Transfer –  Modes of operations-SISO-SIPO –PISO-PIPO- Shift register with Parallel Load and Bidirectional Shift Register - Synchronous Counter -  Asynchronous Counters -  Binary Counters -  Up/Down counter -BCD counter.

Basic Structure of Computers: Basic Operational Concepts- Bus Structures – Processor Clock - Clock Rate- Instruction set: CISC and RISC.

Basic Processing Unit: Fundamental Concepts, Multiple Bus Organization, ALU, Von-Neumann architecture.

The memory system: RAM (Static and Dynamic)-ROM-PROM-EPROM-Cache Memory

[2] William Stallings Computer Organisation and Architecture, 10th edition, Pearson,2016

[2] Bartee, Thomas C, Digital Computer Fundamentals, Tata Mc Graw-Hill, 6th edition, 2016.

[3] William Stallings, Computer Architecture and Organization, PHI, Eigth  Edition, 2016.

[4] David A. Patterson and John L.Hennessey, Computer Organization and Design, Morgan Kauffman / Elsevier, Fifth edition, 2016.

ESE: 50%

To provide a strong foundation for database application design and development by introducing the fundamentals of database technology

CO2: Analyze the database requirements and determine the entities involved in the system and their relationships to one another

CO3: Develop the logical design of the database using data modeling techniques

CO4: Create a relational database and use data manipulation language to query, update and manage a database

Data models, schemas and instances, DBMS architecture and data independence, Database languages and interfaces, database system environment, Classification of DBMS.

Disk storage, basic file structures and hashing     

Secondary storage devices, buffering of blocks, Placing File Records on Disk Operations on Files, Files of Unordered Records, Files of Ordered Records hashing techniques.

Data modelling using ER model

Entities, attributes and relationships, Different types of attributes, E- R Diagrams, Specialization and generalization, constraints and characteristics of specialization and generalization, Relationship types of degree higher than two.

Relational Data Model and Database design

Relational Model Concepts, Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions, and Dealing with Constraint Violations.

ER and EER to Relational Mapping

Relational database design using ER to Relational Mapping, Mapping EER Model concepts to relations.

Database Design

Informal design guidelines for Relation schemes, Functional dependencies, Normal forms based on primary keys, General definitions of second and third normal forms.

Boyce – Code normal form, multi-valued dependencies and fourth normal form, Join dependencies and fifth normal form.

Basic SQL      

SQL Data Definition and Data Types, Specifying Constraints in SQL, Basic Retrieval Queries in SQL, INSERT, DELETE, and UPDATE Statements in SQL, Additional features of SQL.

Complex Queries, Triggers, Views, and Schema Modification More Complex SQL Retrieval Queries, Specifying Constraints as Assertions and Actions as Triggers, Views (Virtual Tables) in SQL, Schema Change Statements in SQL.

Transaction Management

Transaction - Introduction to transaction processing, transaction and system concept, Desirable properties of transaction, Transaction support in SQL, concurrency control techniques – Two phase Locking techniques for concurrency, timestamp based protocol.

Distributed Database        

Introduction to Distributed database concepts, Types of Distributed DatabaseSystems, Data Fragmentation, Replication, and Allocation Techniques for Distributed Database Design.

Object, object relational and XML database

Object and Object-Relational Database– Overview of Object Database Concepts,  Object- Relational Features: Object Database Extensions to SQL, The ODMG Object Model and the Object Definition Language ODL, The Object Query Language OQL.

Self Learning

Overview of Transaction Management in Distributed Database, Overview of Concurrency Control and Recovery in Distributed Database.

Service Learning

Students will engage in service learning which involves service is the field of tutoring or helping government school students as a part of their assignment

[2] O’neil Patric, O’neil Elizabeth ,Database Principles, Programming and Performance, Argon Kaufmann Publishers, 2nd Edition, 2002.

[3] Ramakrishnan and Gehrke, Database Management System, McGraw-Hill, 3rd  Edition, 2003

ESE: 50%

To acquire the fundamental knowledge of the operating system architecture and components.

CO1: Demonstrate the fundamental principles of operating system, system structure, system calls, programs and system boot.

CO2: Evaluate the process scheduling, Thread scheduling, scheduling criteria, critical section problems to calculate the processing time effectively.

CO3: Implement deadlock system and multiple memory management strategies.

CO4: Apply the appropriate file system for overall management of any operating system.

CO5: Analyze the file management concepts using LINUX.

Operating system definition, Computer system organization, structure, architecture and operations, process and storage management, Protection and security, Distributed systems, Special purpose systems, Computing Environments, Linux Operating Systems.  System structure: operating system services, user interface, system calls, system programs, OS design, Implementation and structure, virtual machines, system boot

OS structure and system calls can be demonstrated using Linux.

Process concepts, scheduling, operations on processes, Inter process communication, Examples of IPC systems, Communication in client server systems, Threads, Multi threading models, threading issues, Basic concepts, scheduling criteria, scheduling algorithms, Thread scheduling, Multiple-processor scheduling.

IPC, Threads, Scheduling algorithms can be demonstrated using Linux.

Critical section problems, Peterson solution, Introduction to semaphores, classic problems of synchronization, Monitors, synchronization examples, atomic transaction, System model, deadlock characterization, methods for handling deadlock, deadlock prevention, avoidance, detection and recovery from deadlock.

Process synchronization and deadlock concepts can be demonstrated using Linux.

Memory Management Strategies: Background, swapping, Memory allocation, Paging, Structure of the page table, Segmentation. Virtual Memory Management: Demand paging, Page replacement, allocation of frames, thrashing, memory mapped files, Allocating kernel memory.

Memory management concepts can be demonstrated using Linux.

File concepts, access methods, directory and disk structure, File system mounting, File sharing, Protection, directory implementation, allocation methods, free-space management. I/O Systems, I/O hardware, Application I/O Interface, Kernel I/O subsystem, Transforming I/O requests to hardware operations.

File management concepts can be demonstrated using Linux.

[1] Silberschatz, P.B. Galvin, G. Gadne, Operating System Concepts, Wiley-India, 9th Edition, 2015.

[2] Robert Love, Linux System Programming, O’Reilly, 2014.

[1]William Stallings, Operating Systems: Internals and Design Principles, Pearson, 7th Edition, 2013.

 CIA: 50%

ESE: 50%

The main aim of this course is to provide the grounding knowledge of statistical methods for data analytics. Data summarization, probability, random variables with properties and distribution functions were included. Sampling distributions and their applications in hypothesis testing advanced statistical methods like ANOVA and correlation and regression analysis were included.

After completion of this course, students are able to

 CO1: Understand how to summarize and present the data using exploratory data analysis

CO2: Demonstrate the distribution functions of data and important characteristics

CO3: Infer the sampling distributions and their applications in hypothesis testing

CO4: Identify the relationship between the variables and modeling the same

Definition of Statistics, applications, data types and measurements, graphical representation of data using histogram, line diagram, bar diagram, time series plots; measures of central tendency and dispersion; coefficient of skewness and kurtosis and their practical importance.

Random experiment, sample space and events. Definitions of probability, addition and multiplication rules of probability, conditional probability and some numerical examples; Random variables: Definition, types of random variables, pmf and pdf of random variables; Mathematical expectation: mean, variance, covariance, mgf and cgf of a random variable(s); Probability distributions: Binomial, Poisson and Normal distributions with their important characteristics.

Concepts of population, sample, parameter, statistic, and sampling distribution of a statistics; Sampling distribution of standard statistics like, sample mean, variance, proportions etc. t, F and Chi- square distributions with statistical properties

Statistical hypotheses-Simple and composite, Statistical tests, Critical region, Type I and Type II errors, Testing of hypothesis – null and alternative hypothesis, level of significance,. Test of significance using t, F and Chi-Square distributions (large sample case). Concept of interval estimation and confidence interval construction for standard population parameters like, mean, variance, difference of means, proportions (only large sample case).

Analysis of one-way and two-way classifications with examples, analysis and statistical inference; Correlation and regression analysis, properties and their statistical significance.

1. Gupta S.C & Kapoor V.K, Fundamentals of Mathematical statistics, SultanChand & sons, 2009. 
2. Douglas C Montgomery, George C Runger, Applied Statistics and Probability for Engineers, Wiley student edition, 2004.

1.  Freund J.E, Mathematical statistics, Prentice hall, 2001.
2. Levine, David M; Berenson, L Mark; Stephen, David, Statistics for Managers Using Microsoft Excel, 2nd ed, PHI, New Delhi (2012)

ESE: 50%

This course is intended to assist students in planning and carrying out research. The students are exposed to the principles, procedures and techniques of implementing a research project. The course starts with an introduction to research and leads through the various methodologies involved in the research process. It focus on finding out the research gap from the literature using computer technology,introduces basic statistics required for research and report the research outcomes scientifically with emphasis on research ethics.

CO2: Apply research methods and methodology including research design, data analysis, and interpretation.

CO3: Create scientific reports according to specified standards.

Defining research problem:Selecting the problem, Necessity of defining the problem ,Techniques involved in defining a problem- Ethics in Research.

Principles of experimental design,Working with Literature: Importance, finding literature, Using your resources, Managing the literature, Keep track of references,Using the literature, Literature review,On-line Searching: Database ,SCIFinder, Scopus, Science Direct ,Searching research articles , Citation Index ,Impact Factor ,H-index.

Measurement of Scaling: Quantitative, Qualitative, Classification of Measure scales, Data Collection, Data Preparation. 

Scientific Writing and Report Writing: Significance, Steps, Layout, Types, Mechanics and Precautions, Latex: Introduction, Text, Tables, Figures, Equations, Citations, Referencing, and Templates (IEEE style), Paper writing for international journals, Writing scientific report. 

[2] Zina O’Leary, The Essential Guide of Doing Research, New Delhi: PHI, 2005. 

[2] Kumar, Research Methodology: A Step by Step Guide for Beginners, 3rd. ed. Indian: PE, 2010. 

ESE - 50%

To prepare students to create programs to solve real world problems and also to design appropriate data structure to improve its efficiency.

CO2: Able to demonstrate basic data structures

CO3: Design and develop modular programs using relevant data structure operations to improve the efficiency of the programs

Introduction to C-Identifiers and keywords-Data types and constants-Variables - Operators and expressions-Data input and output-Control statements

Self-learning

Applications and Features of C

Lab Exercise:

1.   1. Implementation of the various Data Types with modifiers and type conversion in C

2.  2.Implementation of various Control structures in C

3.  3.Implementation of Operators

Arrays and Strings-Functions and structures-Recursions- Storage Classes-Command line arguments-Macro Processor-Pointers in C- Pointer to functions

Self-learning

Various built-in functions in C

Lab Exercise:

1. Implementation of functions

2. Demonstration of string operation

 3. Demonstration of command line arguments

Introduction to data structures-Complexity analysis-performance measures for data structures-Arrays and Structures- Abstract Data Type(ADT), Array representation and ADT, Dynamically Allocated Arrays- Sparse matrix- Stacks-ADT-Stacks using dynamic arrays - Applications –Queue-ADT- Circular queue- Priority queue

Self-learning

Multidimensional array and  Evaluation of expressions

Lab Exercise:

1. Implementation of Arrays

2. Implementation Stacks.

3. Implementation Queues.

Self-referential Structures- Linked list creation and manipulation- Circular Linked Lists-Doubly Linked Lists-Linked stack and queues. Searching-linear and binary search- Sorting- Insertion, Merge and Quick sorting methods

Self-learning

Other searching and sorting methods and analysis of their complexities, Hashing

Lab Exercise:

1. Demonstration of pointer operations.

2. Implementation of pointers to structures and unions

3. Implementation of Linked list

Representation of Trees- Binary Trees-Abstract Data Type- Binary Tree Traversals- Binary Search Trees. Graphs-Representation- Depth first search-Breadth first search.

Self-learning

Minimum cost spanning tree

Lab Exercise:

1. Implementation of tree traversal using recursion

2. Implementation of DFS and BFS

3. Design and development of a sample application.

[2] Aaron M. Tenenbaum, YedidyahLangsam ,Moshe J. Augenstein, Data Structures Using C,  Pearson India,2019

[2] YashwantKanetkar, Data Structures Through C, 9th Edition, BPB Publication 2010.

[3] Tremblay J.P and Sorenson P.G: An Introduction to Data Structures with Applications, Tata McGraw-Hill 2nd Edition, 2002,

[4] Programming With C, Programming With C, McGraw Hill Education, Chennai: 2019.

[5] Dey, Pradip, Manas, Ghosh. and Thareja, Reema, Computer Programming and Data Structures , Oxford University Press; 2009

ESE: 50%

This course is designed to introduce the students to advanced technologies which can help realization of complex Web applications. Students examine advanced topics in Hyper Text Markup Language, Cascade Style Sheet and JavaScript for interactive web applications that use rich user interfaces and also understand the server-side web technologies for dynamic web applications and creating modern web applications using MEAN and FULL Stack.

On completion of this course, a student will be familiar with client server architecture and able to develop a web application using advanced technologies and cultivate good web programming style and discipline by solving the real world scenarios

CO2: Describe the main technologies and methods currently used in creating advanced web applications

CO3: Design websites using appropriate security principles, focusing specifically on the vulnerabilities inherent in common web implementations

CO4: Create modern web applications using MEAN&FULL stack 

Internet and web Technologies- Client/Server model -Web Search Engine-Web Crawling-Web Indexing-Search Engine Optimization and Limitations-Web Services –Collective Intelligence –Mobile Web –Features of Web 3.0-HTML vs HTML5-Exploring Editors and Browsers Supported by HTML5-New Elements-HTML5 Semantics-Migration from HTML to HTML5-Canvas-HTML Media

Self-learning

Introduction to CSS3-CSS2 vs CSS3

Lab Exercise:

1. Develop static pages for a given scenario using HTML

2. Creating Web Animation with audio using HTML5 & CSS3

3. Demonstrate Geolocation and Canvas using HTML5

XML AND AJAX XML-Documents and Vocabularies-Versions and Declaration -Namespaces JavaScript and XML: Ajax-DOM based XML processing Event-oriented Parsing: SAX-Transforming XML Documents-Selecting XML Data:XPATH-Template based Transformations: XSLT-Displaying XML Documents in Browsers - Evolution of AJAX -Web applications with AJAX -AJAX Framework

Lab Exercise:

1.      Write an XML file and validate the file using Document Type Definition (DTD)

2.      Demonstrate DOM parser

3.      Demonstrate SAX parser

JavaScript Implementation - Use Javascript to interact with some of the new HTML5 apis -Create and modify Javascript objects- JS Forms - Events and Event handling-JS Navigator-JS Cookies-Introduction to JSON-JSON vs XML-JSON Objects-Importance of Angular JS in web-Angular Expression and Directives

Lab Exercise:

1.      Write a JavaScript program to demonstrate Form Validation and Event Handling

2.      Create a web application using AngularJS with Forms.

3.      Implement web application using AJAX with JSON

Essentials of PHP- Installation of Web Server,XAMPP Configurations-PHP Forms- GET and POST  method - Regular Expressions-Cookies- Sessions- Usage of Include and require statements- File:read and write from the file-PHP Filters-PHP XML Parser-Introduction to Node.js-Node.js Modules and filesystem-Node.js Events

Self-Learning:

PHP syntax and variables, Operators and Expressions, Conditional Branching and Looping Statements

Lab Exercise:

1.      Demonstrate to fetch the information from an XML file with AJAX

2.      Demonstrate Node.js file system module

3.      Design a simple online test web page in PHP

4.      Write a PHP program to keep track of the number of visitors visiting the web page and to display this count of visitors, with proper headings

PHP with MySQL- Performing basic database operation(DML) (Insert, Delete, Update, Select)-Prepared Statement- Uploading Image or File to MySQL- Retrieve Image or File from MySQL- Uploading Multiple Files to MySQL-Introduction to MEAN and FULL Stack-Real time example for modern web applications using MEAN-MEAN vs Full Stack

Lab Exercise:

1.      Implement Mysql with PHP

2.      Demonstrate to fetch information from an XML file using PHP

3.      Installation of MangoDB and Express.JS

2. HTML 5 Black Book (Covers CSS3, JavaScript, XML, XHTML, AJAX, PHP, jQuery), DT Editorial Services, Dreamtech Press,Second Edition,2016

2. Mastering HTML, CSS & Javascript Web Publishing, Laura Lemay, Rafe Colburn & Jennifer Kyrnin, BPB Publications, First edition,2016

3. Mastering MongoDB 3.x, Alex Giamas Packt Publishing Limited,First Edition,2017

Web Resources:

1.      www.w3cschools.com

2.      http://www.php.net/docs.php

ESE: 50%

To study about network components, topologies, network models, protocols and algorithms.

CO2: Evaluate different techniques / algorithms of standard network models

CO3: Analyze network protocols for data transmission in various types of networks

CO4: Design solution to real time problems related to network security and compression

Wireless Transmission, Brief introduction about bluetooth and wimax. Multiplexing: Frequency Division Multiplexing, Wavelength Division Multiplexing, Time Division Multiplexing; Switching: Circuit Switching, Message Switching, Packet Switching; Ethernet cabling, Manchester encoding, Differential Manchester Coding.

Self Learning:

Network Hardware: LAN, MAN, WAN, Wireless Network, Guided Transmission media: Magnetic Media, Twisted Pair, Coaxial Cable, Fiber Optics

Introduction

Uses of Computer Networks, Internetworks; Network Software: Protocol hierarchies, Design issues for the layers, Connection Oriented and Connection less Services, Service Primitives; Reference Models: OSI, TCP/IP, Comparison of OSI and TCP reference models. 

Network layer design issues, Routing Algorithms: Optimality principle, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing; Congestion Control Algorithms: Congestion Prevention Policies, Jitter Control, Techniques for achieving good quality of service, Congestion control for multicasting; Internetworking, The Network layer in the Internet.

The Transport service, Elements of Transport protocols: Addressing, Connection Establishment, Connection Release, Flow Control and Buffering, Multiplexing, Crash recovery; A simple Transport protocol, The Internet Transport protocols: UDP, TCP.

Introduction to Application Layer, lossy and lossless compression techniques, Audio and Video Compression Techniques, Video on demand; Network Security: Cryptography: Introduction to cryptography, Substitution Ciphers, Transposition Ciphers, One-Time Pads, Fundamental Cryptographic Principles; Symmetric key encryption, Symmetric Key Algorithms: DES, Cipher Modes, Cryptanalysis; Public-Key Algorithms: Public-Key encryptions, RSA. Web Security: Threats, Secure Naming, Mobile Code Security.

[2]   Forouzan, Behrouz A., Mosharraf Firouz., Computer Networks A Top-Down Approach, TaTa McGraw Hill publications, First Edition, 2012.

[2]   Prakash C. Gupta, Data communications and Computer Networks, 1st Edition, 5th Reprint, PHI, 2009.

This course helps to preprocess and analyze data, choose relevant models and algorithms for respective applications and to develop research interest towards advances in data mining.

CO2: Categorize the scenario for applying different data mining techniques

CO3: Evaluate different models used for classification and Clustering

CO4: Focus towards research and innovation

Data Mining – Kinds of data to be mined – Kinds of patterns to be mined – Technologies – Targeted Applications - Major Issues in Data Mining – Data Objects and Attribute Types – Measuring Data similarity and dissimilarity - Data Cleaning –Data Integration - Data Reduction – Data Transformation – Data Discretization

Basic Concepts – Frequent Itemset Mining Methods – Pattern Evaluation Methods – Pattern Mining in Multilevel, Multidimensional space – Constraint-Based Frequent Pattern Mining – Mining Compressed or Approximate Patterns – Pattern Exploration and Application

Basic Concepts – Decision Tree Induction – Bayes Classification Methods – Rule-Based Classification – Model Evaluation and Selection – Techniques to Improve Classification Accuracy – Bayesian Belief Networks – Classification by Backpropagation – Support Vector Machines

Cluster Analysis – Partitioning Methods - Hierarchical Methods – Density-Based Methods (Includes all clustering techniques under the given categories in the Text Book)

Outliers and Outlier Analysis – Clustering-Based Approach – Classification-Based Approach – Mining Complex Data Types – Data Mining Applications. 

              2. Data Mining Techniques, Arun K Pujari, Second Edition, Universities Press India Pvt. Ltd.2010

2.         Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten, Eibe Frank, Mark A. Hall, Morgan and Kaufmann Publisher, Third Edition,2014

ESE: 50%

The explosive growth of the “Internet of Things” is changing our world and the rapid growth of IoT components is allowing people to innovate new designs and products at home.  Wireless Sensor Networks form the basis of the Internet of Things. To latch on to the applications in the field of IoT of the recent times, this course provides a deeper understanding of the underlying concepts of IoT and Wireless Sensor Networks.

CO2: Gain knowledge on IoT programming and able to develop IoT applications

CO3: Identify different issues in wireless ad hoc and sensor networks

CO4: To develop an understanding of sensor network architectures from a design and performance perspective

CO5: To understand the layered approach in sensor networks and WSN protocols

Introduction to IoT - Definition and Characteristics, Physical Design Things- Protocols, Logical Design- Functional Blocks, Communication Models- Communication APIs- Introduction to measure the physical quantities, IoT Enabling Technologies - Wireless Sensor Networks, Cloud Computing Big Data Analytics, Communication Protocols- Embedded System- IoT Levels and Deployment Templates.

Introduction to Smart Systems using IoT - IoT Design Methodology- IoT Boards (Rasberry Pi, Arduino) and IDE - Case Study: Weather Monitoring- Logical Design using Python, Data types & Data Structures- Control Flow, Functions- Modules- Packages, File Handling - Date/Time Operations, Classes- Python Packages of Interest for IoT.

Home Automation – Smart Cities- Environment, Energy- Retail, Logistics- Agriculture, Industry- Health and Lifestyle- IoT and M2M.

Sensing and Sensors - Wireless Sensor Networks, Challenges and Constraints - Applications:  Structural Health Monitoring, Traffic Control, Health Care - Node Architecture - Operating system.

Introduction – Fundamentals of MAC Protocols – MAC protocols for WSN – Sensor MAC Case Study – Routing Challenges and Design Issues – Routing Strategies – Transport Control Protocols – Transport Protocol Design Issues – Performance of Transport Protocols

[2]   KazemSohraby, Daniel Minoli and TaiebZnati, Wireless Sensor Networks: Technology. Protocols and Application, Wiley Publications, 2010.

[3]   WaltenegusDargie and Christian Poellabauer, Fundamentals of Wireless Sensor Networks: Theory and Practice, AJohn Wiley and Sons Ltd., 2010.

[2]  Michael Miller, The Internet of Things, Pearson Education, 2015.

[3]    Holger Karl and Andreas Willig, Protocols and Architectures for Wireless Sensor Networks, John Wiley & Sons Inc., 2005.

[4]   ErdalÇayırcıandChunmingRong, Security in Wireless Ad Hoc and Sensor Networks, John Wiley and Sons, 2009.

[5]   Carlos De MoraisCordeiro and Dharma PrakashAgrawal, Ad Hoc and Sensor Networks: Theory and Applications, World Scientific Publishing, 2011.

[6]  WaltenegusDargie and Christian Poellabauer, Fundamentals of Wireless Sensor Networks Theory and Practice, John Wiley and Sons, 2010

[7]   Adrian Perrig and J. D. Tygar, Secure Broadcast Communication: In Wired and Wireless Networks, Springer, 2006.

This course aims at developing an understanding about the issues involved in defining and simulating perception, identifying the problems where AI is required and the different methods available, to compare and contrast different AI techniques available,  to define and explain learning algorithms and to provide the student additional experience in the analysis and evaluation of complicated systems.

CO1: Express the modern view of AI and its foundation

CO2: Illustrate Search Strategies with algorithms and Problems

CO3: Implement Propositional logic and apply inference rules

CO4: Apply suitable techniques for NLP and Game Playing

Introduction to AI, The Foundations of AI, AI Technique -Tic-Tac-Toe. Problem characteristics, Production system characteristics, Production systems: 8-puzzle problem. Searching: Uniformed search strategies – Breadth first search, depth first search.

Generate and Test, Hill climbing, simulated annealing search, Constraint satisfaction problems, Greedy best first search, A* search, AO* search. Toy problems

First order logic. Inference in first order logic, propositional Vs. first order inference, unification & lifts, Clausal form conversion, Forward chaining, Backward chaining, Resolution.

SELF LEARNING

Propositional logic - syntax & semantics

Overview, Minimax algorithm, Alpha-Beta pruning, Additional Refinements. Probabilistic Reasoning : Ad Hoc Methods., Expert System, Expert System Shells

Introduction,Practical Applications of NLP, Syntax processing, Semantic Analysis, Pragmatic and Discourse Processing: Analysis, Perception.

[2] S. Russell and P. Norvig, Artificial Intelligence A Modern Approach, 3^rd  Edition. Pearson Education, 2019.

[2] George F Luger, Artificial Intelligence Structures and Strategies for Complex ProblemSolving, 4th Edition. Singapore: Pearson Education, 2008, ISBN-13  9780321545893

[3] N.L. Nilsson, Artificial Intelligence: A New Synthesis, 1st Edition. USA: MorganKaufmann, 2000.

[4] Introduction to artificial intelligence by Patterson, ISBN-13: 978-0134771007

Web Resources:

1.     https://ai.google/education/

2.     https://intellipaat.com/blog/tutorial/artificial-intelligence-tutorial/

3.     https://www.javatpoint.com/artificial-intelligence-tutorial

The objective of this course is: for students to learn how to design, prototype and evaluate user interfaces to effectively browse and search systems by examining what research has uncovered, what developers have produced, and how people perform information tasks.

CO2: Demonstrate impactful visual design and color concepts

CO3: Apply design principles and skills for design prototype

CO4: Design an intuitive design for software products

Usability of interactive systems: Usability Goals and Measures, Usability Motivations, Universal Usability, Goals for our Design Profession. Guidelines, Principles, and Theories of Design.

Design process introduction, designing to address a problem w/o solution ideas, designing for a known solution direction, designing to iterate on/improve an existing solution, common elements, usability engineering and task-centered approaches, use cases, personas, tasks and scenarios, intro to design centered approaches, design centered methods and when they work best.

Direct manipulation and virtual environments-Introduction- Examples of direct Manipulation, discussion of Direct Manipulation, 3D interfaces, teleoperation, Virtual and Augmented Reality. Menu Selection,Form Fill-in,and Dialog Boxes- Introduction- Task related menu organization, single menus, combinations of multiple menus, content organization, fast movement through menus, Data entry with Menus, audio menus and menus for small displays.

Fitt’s Law, Short and long term memory, attention, perception and visualization, hierarchy, mistakes, errors and slipsm, conceptual models, the gulf executionand the gulf of evaluation, design principles: visibility, feedback, mappings, constraints, interacting beyond individuals (social psychology), high-level models:distributed cognition, activity theory, situated action, assignment video: interface critiques.

Information Search -Introduction-Searching in Textual Documents and Database Querying-Multimedia Document Searches-Advanced Filtering and Search Interfaces. Information Visualization- Introduction- Data type by Task Taxonomy-Challenges for Information Visualization.

UX process, user research, creating user personas, information architecture, user flowchart & user journey y making low fedility wireframes

Use Cases, Personas, tasks, and Scenarios

Adobe illustrator, Adobe Photoshop, Invision,, Adobe XD, Figma, Sketch

[2] Wilber O Galitz, An Introduction to GUI Design Principles and Techniques, John- Wiley &Sons, 2007

[3] Andrew Faulkner, Conrad Chavez, Adobe Photoshop CC Classroom in a Book, The official training work book from Adobe,2018.

[2] Alan J Dix et al, Human-Computer Interaction, Pearson, 2009.

Web Resources:

1.https://www.interaction-design.org

2.https://www.sketch.com/

3.https://www.invisionapp.com/studio

4.https://www.adobe.com/in/products/photoshop.html

This course provides comprehensive understanding of theory and algorithms that are widely used in Digital image processing. Student gets hands-on experience to implement programs in Matlab to process images.

CO2: Apply image enhancement, restoration, compression and segmentation in both frequency and spatial domain.

CO3: Represent and recognize objects through patterns in application.

The origins of Digital Image Processing, Fundamental Steps in Image Processing, Elements of Digital Image Processing System, Image Sampling and Quantization, Basic relationships: Neighbors, Connectivity, Distance Measures between pixels, Linear and Non Linear Operations.

Spatial Domain :Gray Level Transformations - Histogram Processing - Histogram equalization, Histogram specification - Basics of Spatial Filters - Smoothening and Sharpening Spatial Filters. Frequency Domain : Introduction to Fourier Transform and the frequency Domain - Smoothing and Sharpening - Frequency Domain Filters - Homomorphic Filtering

A model of The Image Degradation / Restoration Process - Noise Models, Restoration in the presence of Noise - Periodic Noise Reduction by Frequency Domain Filtering.  Image Compression models: Huffman coding - Run length coding - LZW coding.

Point, Line and Edge detection - Thresholding : Basic global thresholding - optimum global thresholding using Otsu’s Method - Region Based Segmentation: Region Growing - Region Splitting and Merging. Representation: Chain codes - Polygonal approximations using minimum perimeter polygons.

Boundary descriptors – Fourier descriptors - Regional descriptors –Topological descriptors - Moment invariants.  

Introduction to Patterns and Pattern Classes – Decision Theoretic Methods – Minimum distance classifier - K-NN classifier - Bayes’ classifier.

[1] R. C. Gonzalez & R. E. Woods, Digital Image Processing, PearsonEducation, 4th Edition, 2018.

[2] A.K. Jain, Fundamental of Digital Image Processing, PHI, 4th Edition, 2011.

[2] M. A. Joshi, Digital Image Processing: An algorithmic approach, PHI, 2nd Edition, 2009.

[3] B. Chanda, D. Dutta Majumdar, Digital Image Processing and analysis, PHI, 1st Edition, 2011.

To help students to understand the basics of 8085 microprocessor-based systems and assembly language programming. This Course also gives the introduction to 8051 microcontroller.

CO1: Identify the basic elements and functions of microprocessor and describe the architecture of microprocessor and its peripheral devices

CO2: Understand the basic concept of microcontroller

CO3: Demonstrate fundamental understanding on the operation between the microprocessor and its interfacing devices

CO4: Apply the programming techniques in developing the assembly language program for microprocessor application

Microprocessor 8085         

Introduction to Microprocessor 8085 –Signals -Address Bus, Data Bus, Control & status signals, Power supply and Frequency signals, Externally initiated signals, serial I/O ports 

8085 Machine cycles and bus Timings     

Opcode Fetch Machine cycle, Memory Read, Memory Write, I/O Read and I/O Write Machine cycles, Calculation of execution time for a program with examples

1

     [1] Write a program to add N one byte numbe

     [2] Write a program to interchange N one bytes of data.

     [3] Write a program to check whether the 4th bit of a number is zero or one.  Display FF if 1 otherwise display 00. 

     [4] Write a program to find the first 10 terms of a Fibonacci sequence

     [5] Write a program to find sum of first 10 terms of odd and even series.

Block Diagrams, Registers, Flags, ALU, Timing and Control Unit, Instruction Decoder, Serial I/O Control, Stack, PC, Address/Data Buffers

[6] Write a program to check whether a byte belongs to the 2-out-of-5codes. Display FF if it is a 2-out-of- 5 code otherwise00.(Number is 2-out-of-5 code if the left most three bits are zero and in the  remaining five bits  there are exactly two 1’s) 

 [7] Write a program to perform linear search over a set of N numbers.  Display FF and its position if found otherwise 00. 

[8] Write a program to add two 32 - bit binary numbers. 

[9] Write a program to add two 32 - bit BCD numbers. 

[10] Write a program to subtract a 16 - bit number from another 16 - bit number.

The 8085 programming model, Instruction Classification, Data Format and storage, 8085 instruction Set Addressing Modes, Data Transfer Operations, Arithmetic Operations, Logic Operations, Branch Operations, Programming Techniques, Writing simple programs.

[11] Write a program to subtract a 16 - bit BCD number from another 16 – bit BCD number.

[12] Write a program to multiply two 8 - bit number.  

[13] Write a program to divide a 16 - bit number by an 8 - bit numbers. 

[14] Write a program to find the largest and smallest of N numbers. 

[15] rite a program to sort the numbers in ascending and in descending and in descending order using bubble sort.

Programming Techniques with Additional instructions: 

Looping Counting and indexing Additional data transfer and 16 bit Arithmetic  Instructions, Arithmetic operations related to memory, Logic operations: Rotate, Compare. Writing assembly language programs- Binary and BCD addition of two 32 bit numbers, Binary and BCD subtraction of 16 bit number, Multiplication  and division of  8 bit numbers,  shifting  8 bit number by 1or  2 bit etc.,

Counters and Time Delays

Counters and Time delays, Illustrative the program, modulo Ten counter, Subroutine concepts, Subroutine call and return instruction 

Interrupts           

Introduction – INTR, TRAP, RST 7.5, 6.5, 5.5 – RST, SIM and RIM instructions

1.

[16] Write a program to display a rolling message. 

17] Write a program to determine the HCF of two one byte numbers. 

[18] Write a program to display FF and 00 alternatively with 1.5 sec delay.

[19] Write a program to check whether a one byte number is a palindrome or not. 

[20] Write a program to prepare a look-up table for the squares of one -digit BCD numbers. 

[21] Write a program to simulate the throw of dice. 

Block Diagram – Control Logic, Control Word – Modes of operations with examples, Mode 0, Mode 1, BSR Mode, Control word for each modes of operation Programming in 8255A with an example. 

     [22] Write a program to determine the LCM of two one byte numbers.

     [23] Write a program to simulate a BCD counter to count from 0 to 100.

     [24] Write a program to simulate a stopwatch with a provision to stop the watch.

     [25] Write a program to implement block move with the without overlap condition.

     [26] Write a program to interface keyboard using 8255A interface 

       [27] Write a program to interface Seven Segment Display using 8255A interface

[2] Charles M Gilmore, Pal Ajit, Microprocessor Principles and Applications, Tata McGraw Hill, 2nd Edition, 2009.

This course will help the learner to gain a sound knowledge in object oriented principles, GUI application design with data base, enterprise application design with java beans and Servlets.

CO2: Competence in the use of Java Programming Language in the development of small to medium sized applications that demonstrate  professionally  acceptable  coding  and  performance  standards 

CO3: To prepare the students to address the challenging requirements coming from the enterprise applications

Introduction to Object Oriented Programing(OOP)

Object-Oriented Programming(OOP) Principles- The Evolution of Java- Buzzwords of Java - Class Fundamentals - Declaring Objects - Introducing Methods - Overloading methods – Constructors - Parameterized Constructors - this Keyword

Class features

Garbage Collection - the finalize () Method - Introducing Access Control - Understanding static - Introducing nested and inner classes - String class - String Buffer Class - Command Line Arguments

Lab4

Implement the concept of class, data members, member functions and accessspecifiers.

Lab5

Implement the concept of function overloading & Constructoroverloading.

Lab6

Implement the static keyword – static variable, static block, static function and staticclass

Lab7

Implement String and String Bufferclasses.

Lab8

Implement this keyword and command line arguments.

Inheritance in Java

Inheritance Basics - Multilevel Hierarchy- Using super - Method overriding - Dynamic Method Dispatch- Abstract keyword- Using final with inheritance - the Object Class.

Interfaces and Packages

Inheritance in java with Interfaces – Defining Interfaces - Implementing Interfaces - Extending Interfaces- Creating Packages - CLASSPATH variable - Access protection  -  Importing Packages - Interfaces in a Package.

Exception Handling in Java

try-catch-finally mechanism - throw statement - throws statement - Built-in-Exceptions – CustomExceptions.

Lab 9

Implement the concept of inheritance, super, abstract and final keywords injava.

Lab10

Implement package and interface keywords injava

Lab11

Implement Exception Handing in java

Multithreading         

Java Thread Model - Life cycle of a Thread - Java Thread Priorities - Runnable interface and Thread Class- Thread Synchronization – Inter Thread Communication.

Generics

Generics Concept - General Form of a Generic Class – Bounded Types – Generic Class Hierarchy - Generic Interfaces – Restrictions in Generics

The Collections Framework

The Collections Overview – Collection Interface – List Interface – Set Interface – SortedSet Interface – Queue Interface -  ArrayList Class – LinkedList Class – HashSet Class – Using an Iterator – The For Each Statement

Lab 12

Implement multithreading – Thread class, Runnable interface, thread synchronization and thread communication.

Lab 13

Implement generic concept – generic class and generic interface

Lab 14

Implement collections – collection Interfaces and collection classes

Introducing GUI Programing with Swing

Swing Basics – Components and Containers – JLabel and ImageIcons- JTextField – Swing Buttons – JTabbedPane – JScrollPane – JList – JComboBox – JTable – Swing Menus

Event Handling

Delegation  EventModel-    Event Classes – Key Event Class – Event Listener Interface - AdapterClasses

Database Programming

Connectingtoandqueryingadatabase–Automaticdriverrecovery-Connectingtothedatabase

-CreatingaStatementforexecutingquery-Executingaquery-ProcessingaQuery’sResultSet

– PreparedStatements.

Lab15

Implement Swing components and containers

Lab16

Implement EventHandling

Lab17

Implement basic CRUD operations in JDBC

Java Beans

Beans Basics – Advantages – Design Patterns for Methods, Events and Properties – BeanInfo Interface – Java Beans API – Introspector – Property Descriptor – EventSet Descriptor – Method Descriptor

Servlets

Servlets Basics – Life Cycle of a Servlet –The Servlet API – Servlet Interfaces – Generic Servlet Class- HttpServletRequest Interface – HttpServeltResponse Interface – HttpServet Class – The Cookie Class – Handling HTTP GET Request – Handling HTTP POST Request

Lab18

Implement Java Beans

Lab19

Implement Java Servlets

[2]  Core Java Volume 1 Fundamentals, Cay S Horstmann, Prentice Hall, 11^th Edition,2018.

Web Resources:

    [1] www.w3cschools.com

    [2] https://www.javatpoint.com/

    [3] http://stackoverflow.com/

This course covers programming paradigms brought in by Python with a focus on Regular Expressions, List and Dictionaries. It explores the various modules and libraries to cover the landscape of Python programming.

CO2: Demonstrate significant experience with the Python program development environment.

CO3: Understand and implement the basic methods of python modules like NumPy, Matplotlib

Underlying mechanism of Module Execution- Sequences, Mapping and Sets- Dictionaries- Functions - Lists and Mutability- Problem Solving Using Lists and Functions. Custom and built-in modules.

Lab Exercises:

1. Implement python objects

2. Implement lambda functions and custom modules  

Classes: Classes and Instances-Inheritance—Polymorphism- Abstract classes-Exceptional Handling- Regular Expressions using “re” module.

Lab Exercises:

3. Implement Polymorphism

4. Implement “re” module

Computation on NumPy-Aggregations-Computation on Arrays-Comparisons, Masks and Boolean Arrays-Fancy Indexing-Sorting Arrays-Structured Data: NumPy’s Structured Array. Introduction to Pandas Objects-Data indexing and Selection-Operating on Data in Pandas-Handling Missing Data-Hierarchical Indexing. Basic functions of Matplotlib-Simple Line Plot, Scatter Plot.

Lab Exercises:

5. Implement “Numpy” and “Matplotlib” modules to plot line and scatterplot

6. Implement Pandas to demonstrate data handling and indexing

Introduction-Tkiner module-Root window-Widgets-Button-Label-Message-Text-Menu-Listboxes-Spinbox-Creating tables

Lab Exercises:

7. Create an GUI application using all the appropriate widgets required

Basic Database Operations and SQL, Databases and Python, The Python DB-API, Connection Objects Databases and Python: Adapters Examples of Using Database Adapters , A Database Adapter Example Application

Lab Exercises:

8. Establish database connectivity for an GUI application and demonstrate data manipulation and visualization.

[2] Wesely J.Chun,Core Python Application Programming ,Prentice Hall,third edition 2015.

              [2] T.R.Padmanabhan, Programming with Python,Springer Publications,2016

ESE: 50%

To enable the students to understand the concepts software engineering.  To prepare the students to develop the skills necessary to handle software projects. To make the students aware of the importance of software engineering principles in designing software projects.

CO2: Design software by applying the software engineering principles

CO3: Develop the quality software using efficient project management

A generic process model – Prescriptive Process Models – The waterfall Model, Incremental Model, Evolutionary Process Model, Concurrent Model, Component based Development, The formal Methods Model. Requirements Engineering - Design concepts – Abstraction, Architecture, Patterns, Separation of  concerns, Modularity, information hiding, Functional Independence, refinement, Aspects, Refactoring, Object Oriented design concepts Design classes,  The design Model – Data Design elements, Architectural Design elements, Interface Design Elements, Component-Level Design elements, Deployments level Design elements.

What is a component – An Object-Oriented View, The Traditional View, A Process-Related View, Designing class based components – Basic Design Principles, Component-level Design guidelines, Cohesion, Coupling,  Functional design at the Component level,  designing traditional components – Graphical design notation, Tabular Design Notation, Program Design Language, Component based development- Domain Engineering, Component qualification, Adaptation, and Composition, Analysis and Design for reuse, classifying and retrieving components. The golden rules- Place the User in Control, Reduce the User's Memory load, Make the interface Consistent, Interface Analysis and Design models, The Process, Interface  Analysis User Analysis, Task Analysis, Analysis of Display Content, Analysis of the Work Environment, Interface design steps – Applying Interface Design steps, User Interface design patterns, Design Issues.

Software Quality, Garvin's Quality Dimensions, McCall's Quality Factors, ISO 9126 Quality Factors, Targeted Quality factors, Transition to a Quantitative view, Achieving software quality- Software Engineering Methods, Project Management Techniques, Quality Control, Quality Assurance. Software testing fundamentals, internal and external view of testing, White-box testing, Basic path testing -  Flow graph notation, Independent program path, Deriving test cases, Graph matrices-, , control structure testing – Condition testing, Data flow testing, loop testing-, Black- box testing – Graph- based Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Orthogonal Array Testing, Model Based Testing, Testing for specialized environments, Architectures, and Applications – Testing GUIs, Testing of Client-Server Architectures, Testing Documentation and Help facilities, testing for Real-Time Systems, Patterns for software testing.

Students will carry out a group project in any area to demonstrate software engineering and RDBMS concepts.

ESE: 50%

The course is designed to enhance the soft skills and technical understanding of the students.

CO2: Demonstrate the professional presentation abilities

CO3: Apply the acquired knowledge in their Research

Students will be giving presentations on any advanced concepts and technologies in Computer Science and submit the report.

To study about network components, topologies, network models, protocols and algorithms.

CO2: Evaluate different techniques / algorithms of standard network models

CO3: Analyze network protocols for data transmission in various types of networks

CO4: Design solution to real time problems related to network security and compression

Introduction

Uses of Computer Networks, Internetworks; Network Software: Protocol hierarchies, Design issues for the layers, Connection Oriented and Connection less Services, Service Primitives; Reference Models: OSI, TCP/IP, Comparison of OSI and TCP reference models. 

Wireless Transmission, Brief introduction about bluetooth and wimax. Multiplexing: Frequency Division Multiplexing, Wavelength Division Multiplexing, Time Division Multiplexing; Switching: Circuit Switching, Message Switching, Packet Switching; Ethernet cabling, Manchester encoding, Differential Manchester Coding.

Self Learning:

Network Hardware: LAN, MAN, WAN, Wireless Network, Guided Transmission media: Magnetic Media, Twisted Pair, Coaxial Cable, Fiber Optics

Network layer design issues, Routing Algorithms: Optimality principle, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing; Congestion Control Algorithms: Congestion Prevention Policies, Jitter Control, Techniques for achieving good quality of service, Congestion control for multicasting; Internetworking, The Network layer in the Internet.

The Transport service, Elements of Transport protocols: Addressing, Connection Establishment, Connection Release, Flow Control and Buffering, Multiplexing, Crash recovery; A simple Transport protocol, The Internet Transport protocols: UDP, TCP.

Introduction to Application Layer, lossy and lossless compression techniques, Audio and Video Compression Techniques, Video on demand; Network Security: Cryptography: Introduction to cryptography, Substitution Ciphers, Transposition Ciphers, One-Time Pads, Fundamental Cryptographic Principles; Symmetric key encryption, Symmetric Key Algorithms: DES, Cipher Modes, Cryptanalysis; Public-Key Algorithms: Public-Key encryptions, RSA. Web Security: Threats, Secure Naming, Mobile Code Security.

[2]   Forouzan, Behrouz A., Mosharraf Firouz., Computer Networks A Top-Down Approach, TaTa McGraw Hill publications, First Edition, 2012.

[2]   Prakash C. Gupta, Data communications and Computer Networks, 1st Edition, 5th Reprint, PHI, 2009.

ESE:50%

To provide the students to understand the concepts software engineering.  To prepare the students to develop the skills necessary to handle software projects. To make the students aware of the importance of software engineering principles in designing software projects.

CO2: Design software by applying the software engineering principles.

CO3: Develop the quality software using efficient project management

A generic process model – Defining a framework activity, identifying a Task Set, Process Patterns, Process Assessment and improvement, Prescriptive Process Models – The waterfall Model, Incremental Model, Evolutionary Process Model, Concurrent Model,  Component based Development, The formal Methods Model. Requirements Engineering, Establishing the groundwork – Identifying Stakeholders, Recognizing multiple viewpoints, Working toward Collaboration, Asking the first questions, Eliciting requirements – Collaborative requirement gathering, Quality function Deployments, Usage Scenario Elicitation Work Products, Developing use cases, building the requirements model – Elements of the requirements Model, Analysis pattern, Negotiating requirements, validating requirements.

The design within the context of Software Engineering,  The design process – Software quality guidelines and attributes, The evolution of software design, Design concepts – Abstraction, Architecture, Patterns, Separation of  concerns, Modularity, information hiding, Functional Independence, refinement, Aspects, Refactoring, Object Oriented design concepts Design classes,  The design Model – Data Design elements, Architectural Design elements, Interface Design Elements, Component-Level Design elements, Deployments level Design elements. Software architecture – What is architecture, Why is Architecture important, Architectural descriptions, Architectural Decisions, Architectural style – Brief taxonomy of Architectural  styles,  Architectural Patterns, Organization and refinement.

What is a component – An Object-Oriented View, The Traditional View, A Process-Related View, Designing class based components – Basic Design Principles, Component-level Design guidelines, Cohesion, Coupling,  Functional design at the Component level,  designing traditional components – Graphical design notation, Tabular Design Notation, Program Design Language, Component based development- Domain Engineering, Component qualification, Adaptation, and Composition, Analysis and Design for reuse, classifying and retrieving components. The golden rules- Place the User in Control, Reduce the User's Memory load, Make the interface Consistent, Interface Analysis and Design models, The Process, Interface  Analysis User Analysis, Task Analysis, Analysis of Display Content, Analysis of the Work Environment, Interface design steps – Applying Interface Design steps, User Interface design patterns, Design Issues.

Software Quality, Garvin's Quality Dimensions, McCall's Quality Factors, ISO 9126 Quality Factors, Targeted Quality factors, Transition to a Quantitative view, Achieving software quality- Software Engineering Methods, Project Management Techniques, Quality Control, Quality Assurance. Software testing fundamentals, internal and external view of testing, White-box testing, Basic path testing -  Flow graph notation, Independent program path, Deriving test cases, Graph matrices-, , control structure testing – Condition testing, Data flow testing, loop testing-, Black- box testing – Graph- based Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Orthogonal Array Testing, Model Based Testing, Testing for specialized environments, Architectures, and Applications – Testing GUIs, Testing of Client-Server Architectures, Testing Documentation and Help facilities, testing for Real-Time Systems, Patterns for software testing.

The management spectrum- The people, The product, The Process, The project-,  Metrics in the process and project domains-Process metrics and Software Process improvement Project Metrics-, software measurement-Size Oriented metrics, Function Oriented Metrics, Reconciling LOC and FP Metrics, Object Oriented Metrics, Use case oriented metrics, WebApp project metrics-, Metrics for software quality – Measuring quality, Defect removal Efficiency. Observations on estimation, The project planning process, Software scope and Feasibility, Resources-Human resources, reusable software resources, Environmental resources,  software project estimation, Decomposition techniques – Software sizing, Problem based estimation, Example of LOC based estimation, Example of FP based estimation, Process based estimation, Example of process based estimation, estimation with use cases, example of use case based estimation, Reconciling estimates,  Empirical estimation models – The structure of Estimation model, COCOMO II Model, Software equation.

[1] Pressman S Roger, Software Engineering -  A Practitioner’s Approach, Mc Graw Hill, 7th edition, 2014.

[1] Sommerville, Ian, Software Engineering, Addison Wesley, 9th edition, 2010.

To acquire the fundamental knowledge of the operating system architecture and components.

CO2: Evaluate the process scheduling, Thread scheduling, scheduling criteria, critical section problems to calculate the processing time effectively

CO3: Implement deadlock system and multiple memory management strategies

CO4: Apply the appropriate file system for overall management of any operating system

CO5: Analyze the file management concepts using LINUX

Operating system definition, Computer system organization, structure, architecture and operations, process and storage management, Protection and security, Distributed systems, Special purpose systems, Computing Environments, Linux Operating Systems. System  structure: operating system services, user interface, system calls, system programs, OS design, Implementation and structure, virtual machines, systemboot

OS structure and system calls can be demonstrated using Linux.

Process concepts, scheduling, operations on processes, Inter process communication, Examples of IPC systems, Communication in client server systems, Threads, Multi threading models, threading issues, Basic concepts, scheduling criteria, scheduling algorithms, Thread scheduling, Multiple-processor scheduling.

IPC, Threads, Scheduling algorithms can be demonstrated using Linux.

Critical section problems, Peterson solution, Introduction to semaphores, classic problems of synchronization, Monitors, synchronization examples, atomic transaction, System model, deadlock characterization, methods for handling deadlock, deadlock prevention, avoidance, detection and recovery from deadlock.

Process synchronization and deadlock concepts can be demonstrated using Linux.

Memory Management Strategies: Background, swapping, Memory allocation, Paging, Structure of the page table, Segmentation. Virtual Memory Management: Demand paging, Page replacement, allocation of frames, thrashing, memory mapped files, Allocating kernel memory.

Memory management concepts can be demonstrated using Linux.

File concepts, access methods, directory and disk structure, File system mounting, File sharing, Protection, directory implementation, allocation methods, free-space management. I/O Systems, I/O hardware, Application I/O Interface, Kernel I/O subsystem, Transforming I/O requests to hardware operations.

File management concepts can be demonstrated using Linux.

[2]  Robert Love, Linux System Programming, O’Reilly,2014.

This course will help the learner to gain a sound knowledge in object oriented principles, GUI application design with data base, enterprise application design with java beans and Servlets.

CO2: Competence in the use of Java Programming Language in the development of small to medium sized applications that demonstrate  professionally  acceptable  coding  and  performance  standards 

CO3: To prepare the students to address the challenging requirements coming from the enterprise applications

Object-Oriented Programming(OOP) Principles- The Evolution of Java- Buzzwords of Java - Class Fundamentals - Declaring Objects - Introducing Methods - Overloading methods – Constructors - Parameterized Constructors - this Keyword

Class features

Garbage Collection - the finalize () Method - Introducing Access Control - Understanding static - Introducing nested and inner classes - String class - String Buffer Class - Command Line Arguments

Lab4

Implement the concept of class, data members, member functions and accessspecifiers.

Lab5

Implement the concept of function overloading & Constructoroverloading.

Lab6

Implement the static keyword – static variable, static block, static function and staticclass

Lab7

Implement String and String Bufferclasses.

Lab8

Implement this keyword and command line arguments.

Inheritance in Java

Inheritance Basics - Multilevel Hierarchy- Using super - Method overriding - Dynamic Method Dispatch- Abstract keyword- Using final with inheritance - the Object Class.

Interfaces and Packages

Inheritance in java with Interfaces – Defining Interfaces - Implementing Interfaces - Extending Interfaces- Creating Packages - CLASSPATH variable - Access protection  -  Importing Packages - Interfaces in a Package.

Exception Handling in Java

try-catch-finally mechanism - throw statement - throws statement - Built-in-Exceptions – CustomExceptions.

Lab 9

Implement the concept of inheritance, super, abstract and final keywords injava.

Lab10

Implement package and interface keywords injava

Lab11

Implement Exception Handing in java

The Collections Framework

The Collections Overview – Collection Interface – List Interface – Set Interface – SortedSet Interface – Queue Interface - ArrayList Class – LinkedList Class – HashSet Class – Using an Iterator – The For Each Statement

Lab 12

Implement multithreading – Thread class, Runnable interface, thread synchronization and thread communication.

Lab13

Implement generic concept – generic class and genericinterface

Lab14

Implement collections – collection Interfaces and collection classes

Lab15

Implement Swing components and containers

Lab16

Implement EventHandling

Lab17

Implement basic CRUD operations in JDBC

Introducing GUI Programing with Swing

Swing Basics – Components and Containers – JLabel and ImageIcons- JTextField – Swing Buttons – JTabbedPane – JScrollPane – JList – JComboBox – JTable – Swing Menus

Event Handling

Delegation  EventModel-    Event Classes – Key Event Class – Event Listener Interface - AdapterClasses

Database Programming

Connectingtoandqueryingadatabase–Automaticdriverrecovery-Connectingtothedatabase

-CreatingaStatementforexecutingquery-Executingaquery-ProcessingaQuery’sResultSet

– PreparedStatements.

Lab18

Implement Java Beans

Lab19

Implement Java Servlets

Java Beans

Beans Basics – Advantages – Design Patterns for Methods, Events and Properties – BeanInfo Interface – Java Beans API – Introspector – Property Descriptor – EventSet Descriptor – Method Descriptor

Servlets

Servlets Basics – Life Cycle of a Servlet –The Servlet API – Servlet Interfaces – Generic Servlet Class- HttpServletRequest Interface – HttpServeltResponse Interface – HttpServet Class – The Cookie Class – Handling HTTP GET Request – Handling HTTP POST Request

[2]  Core Java Volume 1 Fundamentals, Cay S Horstmann, Prentice Hall, 11^th Edition,2018.

ESE 50%

The course provides comprehensive understanding of the system calls for File System, Process Management, Inter Process Communication, Memory Management and IO System. The lab also enables to develop shell scripts, socket programming applications in a multi process Unix programming environment

CO2: Develop shell script for UNIX system administration

CO3: Apply system calls for file system, process creation and management and Inter Process Communication

CO4: Develop system software with process and thread synchronization

Types of shells – Features of Bourne, C and Korn Shells. Redirection: The three standard files - /dev/null and /dev/tty: Two special Files – Shell variables - Shell Keywords - Positional parameters - Passing command line arguments. Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi - if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break and continue. Shell meta characters - Exporting variables - User defined Functions.

Lab Exercises:

1. Write a shell script to print prime numbers for a given range using functions.

2. Write a shell script to find the list of students who stayed more than eight hours in the campus. Input file contains Student Id, Time In and Time Out in (HR:MIN:SEC) format.

3. Write a shell script to merge two tables with multiple fields with a unique key for both the files.

Directory related commands: pwd, mkdir, cd, rmdir - File manipulation commands: cat, cp, rm, mv, more, spell and ispell, cmp, comm, diff - File compression commands: gzip, gunzip, tar, zip, unzip - Listing Directory Attributes, File Ownership, File Permissions - chmod: Changing File Permissions, Directory Permissions - Changing File Ownership, Creating Hard links, Symbolic Links, ln, umask, find, pr: Paginating Files, head: Displaying the Beginning of a File, tail: Displaying the End of a File, cut: Slitting a File Vertically, sed: stream editor, paste: Pasting Files, sort: Ordering a File, uniq: Locate Repeated and Non repeated Lines, tr: Translating Characters, wc: word count and awk for preprocessing input data. Filters for regular expressions: grep: Searching for a Pattern, and egrep. Communicating with other users: mail, wall, send, mesg, ftp.

Lab Exercises:

4. Demonstrate open, read, write and close system calls.

5. Demonstrate dup, link, unlink and lseek system calls

6. Write a program to create multiple processes as per given process hierarchy graph. Parent process should be alive till any of the child process is alive.

Memory Layout of a C Program. Shared Libraries – Memory allocation – environment variables – Process identifiers –fork, wait, waitpid system call – exec and system function – Process accounting – User identification – Process scheduling.

Lab Exercises:

7. Demonstrate exec family of system calls and report file descriptor behavior in fork and exec family system calls.

8. Demonstrate two-way data transfer between processes using pipes.

9. Synchronization between parent and child process for transferring data using signals.

Pipe, FIFO, Message Queue, Shared Memory, Mailbox, Semaphore, monitor, Socket – Thread synchronization with mutex and semaphore – Solve Dining Philosopher problem and readers- writers problem with semaphore, mailbox and monitor.

Lab Exercises:

10. Demonstrate two-way data transfer between processes using message queues.

11. Demonstrate thread creation, waiting and termination of threads and thread synchronization with mutex.

12. Demonstrate two-way data transfer with synchronization between Threads using Shared Memory and Mutex/Semaphore.

Process open file table – System open file table – Structure and layout of file – File descriptor allocation – File descriptor inheritance with fork and exec system calls – Directories – System calls for file system – open, read, write, lseek, close, creat, stat, dup, link and unlink – Implementation of user level hierarchical file system.

Lab Exercises:

13. Develop your own shell and shell commands with IO redirection feature.

14. Develop page based memory management simulator with UNIX style clock algorithm for stealing pages for bringing in pages from secondary memory with multiple processes directly feeding in multiple memory requests in real time.

15. Develop user level file system with directories, hard link and soft links which can be accessed from multiple processes.

    [2] Richard Stevens, “Advanced programming in the UNIX environment”, Addison Wesley, Third edition, 2017.

ESE: 50%

At the end of the semester the students should develop the working project using RDBMS concepts.

CO2: Analyze the problem, identify the solution, various front end and backend tools required for the project and apply them as per the requirement. 

CO3: Create a working project that satisfies the need of the end user. 

CO4: Develop communication skills, ethics and leadership qualities as an individual and as a leader.

Students will carry out a group project in any area involving RDBMS concepts.

ESE 50%

Course Description :

There is only CIA for this course. Students should do a thorough literature review in their research area. They should give a presentation and submit a document containing the following:

• Introduction to topic, existing scenario and applications.

• Literature review (Minimum 25 references).

• Existing Model and Methodology.

• Concrete problem statement definition.

CO1 : Able to produce commercially valuable intellectual property.

CO2 : Able to produce new products/processes/methods/model/Framework.

Week 1 - Discussion and Identification of Research Domain (Updations)

Week 2 - Identification of Research Gap / OBJECTIVES OF RESEARCH

Week 3 - Research Design Phase - I

Week 4 - Research Design Phase - II

Week 5 - Research Design Phase - III

Week 6 - Methods of Data Collection - PROCESSING - ANALYSIS OF DATA

Week 7 - Methods of Data Collection - PROCESSING - ANALYSIS OF DATA

Week 8 - Methods of Data Collection - PROCESSING - ANALYSIS OF DATA

Week 9 - Methods of Data Collection - PROCESSING - ANALYSIS OF DATA

Week 10 - Methods of Data Collection - PROCESSING - ANALYSIS OF DATA

Week 11 - Implementation Phase - I

Week 12 - Implementation Phase - I (a)

Week 13 - Implementation Phase - I (b)

Week 14 - Implementation Phase - I (c)

Week 15 - Implementation Phase - I (d)

The objective of this course is to provide introduction to the principles and design of machine learning algorithms. The course is aimed at providing foundations for conceptual aspects of machine learning algorithms along with their applications to solve real world problems.

CO2: Formulate machine learning problems and their solutions

CO3: Apply machine learning algorithms to solve real world problems

Machine Learning-Examples of Machine Applications-Learning Associations-Classification- Regression-Unsupervised Learning-Reinforcement Learning. Supervised Learning: Learning class from examples- Probably Approach Correct(PAC) Learning-Noise-Learning Multiple classes. Regression-Model Selection and Generalization.

Introduction to Parametric methods-Maximum Likelihood Estimation: Bernoulli Density- Multinomial Density-Gaussian Density, Nonparametric Density Estimation: Histogram Estimator-Kernel Estimator-K-Nearest Neighbour Estimator

Introduction- Subset Selection-Principal Component Analysis, Feature Embedding-Factor Analysis-Singular Value Decomposition-Multidimensional Scaling- Linear Discriminant Analysis- Bayesian Decision Theory

Linear Discrimination: Introduction- Generalizing the Linear Model-Geometry of the Linear Discriminant- Pairwise Separation-Gradient Descent-Logistic Discrimination.

Kernel Machines

Introduction- optical separating hyperplane- v-SVM, kernel tricks- vertical kernel- vertical kernel- defining kernel- multiclass kernel machines- one-class kernel machines

Multilayer Pereptron

Introduction, training a perceptron- learning Boolean functions- multilayer perceptron- backpropogation algorithm- training procedures.

Combining multiple Learners

Rationale-Generating diverse learners- Model combination schemes- voting, Bagging- Boosting- fine tuning an Ensemble

Introduction, Single state case, elements of reinforcement learning, Temporal difference learning, Generalization, partially observedstate.

[2]  T. Hastie, R. Tibshirani and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference and Prediction, Springer, 2nd Edition,2009.

[3]  K. P. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press,2012.

CIA 50%

ESE 50%

To make the students learn the principles and practices of Cryptography, Network Security and to enable the students understand the various methods of encryption and authentication and help them identify the application of these techniques for providing Network and System Security.

CO2: Appreciate the role played by Cryptographic techniques in enhancing Network and system Security.

CO3: Identify and explain the concepts, protocols and technologies associated with a secure communication across the Network and the Internet.

CO4: Discuss the objectives of authentication and access control methods and describe how the available methods are implemented in the defense of a network.

Introduction, The need for security, Security Approaches, Security Attacks, Security Services, Security Mechanisms, A Model for Network Security. Symmetric Cipher Models – Substitution techniques, Transposition techniques, Steganography, Block Cipher Operation, Electronic Code Book, Cipher Block Chaining, Block Cipher Principles, The Data Encryption Standard, A DES Example, The Strength of DES, Evaluation criteria for AES, AES Cipher.

Introduction To Number Theory, Modular Arithmetic, Prime Numbers, Euler’s Totient Function, Principles of Public Key Cryptosystems, The RSA Algorithm, Other Public key cryptosystems, Diffie Hellman Key Exchange.

Applications of Cryptographic Hash Functions, Two Simple Hash Functions, Hash Functions Based on Cipher Block Chaining, MD5 Message Digest Algorithm, Secure Hash Algorithm SHA 512.

Message Authentication Requirements –Message Authentication Functions –Requirements for Security of MACs, MACs Based on Hash Functions, HMAC, MACs Based on Block Ciphers, Data Authentication Algorithm.

Digital Signatures, Elgamal Digital Signature Scheme, Schnorr Digital Signature Scheme, Digital Signature Standard.

Symmetric Key Distribution Using Symmetric Encryption, Symmetric Key Distribution Using Asymmetric Encryption, Distribution of Public Keys, X.509 Certificates, Public Key Infrastructure.

Remote user Authentication Principles, Remote User-Authentication Using Symmetric Encryption, Kerberos, Motivation, Kerberos Version 4, Remote User-Authentication Using Asymmetric Encryption, Federated Identity Management.

IP Security Overview, IP Security Policy, Encapsulating Security Payload, Combining Security Associations, Internet Key Exchange.

Transport-Level Security– Web security Considerations, Secure Socket Layer and Transport layer Security.

Legal and ethical aspects

Cyber Crime and computer crime, Intellectual property, privacy, Ethical issues.

Pretty Good Privacy, S/MIME.