Dr. Babasaheb Ambedkar Technological University, Lonere

Dr. Babasaheb Ambedkar Technological University, Lonere Faculty of Engineering and Technology

Academic Calendar 2018-19 Activity Second Year Direct Second Year M. Tech First Year M. Tech Second Year

Admission July 13, 2018 As per Dates of DTE As per Dates of DTE -----July 13, 2018

Commencement of Classes July 02, 2018 As per Dates of DTE August 01, 2018 July 16, 2018

Last date for Enrollment --- September 15, 2018 September 15, 2018 ---

Last date for Enrollment with Late Fees --- September 29, 2018 September 29, 2018 ---

Remedial Examination July 23- August 04 2018 --- --- ---

Mid Semester Examination Sept 03 – 08, 2018 Sept 03 – 08, 2018 --- ---

Internal Academic Monitoring September 10-17, 2018

Last date of Submitting Semester Examination Form September 29, 2018 September 29, 2018 October 13, 2018 September 29, 2018

Last date of Submitting Semester Examination Form with Late Fees

October 06, 2018 October 06, 2018 October 22, 2018 October 06, 2018

Last date of Submitting Semester Examination Form with Super Penalty

October 13, 2018 October 13, 2018 October 27, 2018 October 13, 2018

Mid Semester Examination --- --- Oct 08-13, 2018 ---

Last Date for Submitting Mid Semester / Test Exam Marks October 23, 2018 September 18, 2018 October 23, 2018 ---

External Academic Monitoring October 23-27, 2018

Last date of Submitting Internal Assessment Marks October 26, 2018 October 26, 2018 November 30, 2018 October 26, 2018

End of Classes October 26, 2018 October 26, 2018 November 30, 2018 ---

Practical Examination Oct 29- Nov 03, 2018 Oct 29- Nov 03, 2018 Dec 03-08, 2018 Oct 29- Nov 03, 2018

Semester Examination Nov 12- Dec 14, 2018 Nov 12- Dec 14, 2018 Dec 10- 22, 2018 ---

Commencement of Classes for Next Semester January 01, 2019 January 01, 2019 January 01, 2019 ---

Declaration of Semester examination Results January 28, 2019 January 28, 2019 February 05, 2019 ---

M/D M T W T F S S M T W T F S S M T W T F S S M T W T F S S M T W T F S S M T

JULY 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

AUG 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

SEPT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

OCT 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

NOV 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

Flag Hosting -Independance Day

22-Aug-18 Bakari-Id

Deogiri Institute of Engineering and Management Studies, Aurangabad.

Computer Science and Engineering Department

ACADEMIC CALENDER 2018-19 TERM-I

9-Jul-18 Commencement of Term - II

17-Sep-18 Marathwada Mukti Din

23-Sep-18 Ganpati Visarjan

20-Oct-18 Term End

Minimum 3 invited talks of Professors/ Industry

Professionals should be conducted and two

industrial visits to be arranged by each mentor in a

semester.

15-Aug-18

Oral/Practical [Tentative]

19-Oct-18 Dasara

Class Tests IIIrd Review Final Year Project

13-Oct-18 Final Defaulter List Theory Exams [Tentative]

31 July, 31 Aug,

30 SeptMonthly Defaulter List

Display of Class Test Results

Minimum 3 Expert Talks under" Inspire" lecture

Series.

Ist Review TE Mini Project

Ist Review Final Year Project

IInd Review TE Mini Project

IInd Review Final Year Project

IIIrd Review TE Mini Project

Total Teaching days : 85

1

Dr . BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY,

AURANGABAD

PROPOSED

SCHEME AND DETAILED SYLLABUS

of

Final Year Engineering of Computer Science & Engineering BE(CSE)

of

FOUR YEAR DEGREE COURSE IN ENGINEERING

With Effect from Academic Year 2014-2015

2

Faculty of Engineering and Technology

Board of Studies in Computer Science and Engineering

Curriculum structure of B.E(Computer Science and Engineering)

PART-I

Semester-I

Contact Hrs/Week Examination Scheme

Sub

Code Subject L T P Total CT TH TW PR Total

Duration of

The Theory

Examination

CSE401 Data Warehousing & Data Mining 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE402 Parallel & Distributed Computing 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE403 Principles of Compiler Design 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE404 Visual Modeling 4 -- -- 4 20 80 -- -- 100 3 Hrs

Elective – I 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE421 LAB-I Data Warehousing & Data

Mining -- -- 2 2 -- -- -- 50 50

CSE422 LAB-II Principles of Compiler Design -- -- 2 2 -- -- -- 50 50

CSE423 LAB-III Visual Modeling -- -- 2 2 -- -- -- 50 50

CSE424 LAB-IV Elective - I -- -- 2 2 -- -- 50 -- 50

CSE425 Project Part-I -- -- 2 2 -- -- 25 -- 25

CSE426 Seminar 25 -- 25

Total 20 -- 10 30 100 400 100 150 750

Elective –I :

Code Subject CSE441 Cloud Computing CSE442 Artificial Intelligence CSE443 Multicore Computing CSE444 Open Elective

Dr. U.B. Shinde Dr Vijaya B. Musande

Dean, Faculty of Engineering and Technology Chairman, Board of Studies

Dr.BAMU. Computer Science & Engineering, Dr.BAMU.

3

Faculty of Engineering and Technology

Board of Studies in Computer Science and Engineering

Curriculum structure of B.E(Computer Science and Engineering)

PART – II

Semester-II


Sub

Code Subject L T P Total CT TH TW PR Total

Duration of

The Theory

Examination

CSE451 Computer System Security and Laws 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE452 Mobile Computing 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE453 Soft Computing 4 -- -- 4 20 80 -- -- 100 3 Hrs

Elective –II 4 -- -- 4 20 80 -- -- 100 3 Hrs

CSE471 LAB-V Computer System Security and

Laws -- -- 2 2 -- -- -- 50 50

CSE472 LAB-VI Mobile Computing -- -- 2 2 -- -- -- 50 50

CSE473 LAB-VII Soft Computing -- -- 2 2 -- -- -- 50 50

CSE474 LAB-VIII Elective – II -- -- 2 2 -- -- 50 -- 50

CSE375 Project Part – II -- -- 6 6 -- -- 50 100 150

Total 16 -- 14 30 80 320 100 250 750

Total of Semester I & II 36 -- 24 60 180 720 250 400 1500

Elective –II :

Code Subject CSE491 Remote Sensing & Geographical Information System CSE492 Green IT CSE493 Agile Methodology CSE494 Open Elective

L:Lecture hours per week T:Tutorial hours per week P:Practical hours per week

CT: Class Test TH:University Theory Examination TW: Term Work

PR: Practical/Oral Examination

Dr. U.B. Shinde Dr Vijaya B. Musande

Dean, Faculty of Engineering and Technology Chairman, Board of Studies

Dr.BAMU. Computer Science & Engineering, Dr.BAMU.

4

Dr. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY, AURANGABAD

FACULTY OF ENGINEERING AND TECHNOLOGY

Final Year Engineering (CSE/IT)

Semester – I

Course Code : CSE401 Title : Data Warehousing and Data mining

(DWDM)

Teaching Scheme Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks

Theory Examination (Marks) : 80 Marks

Theory Examination (Duration) :03 Hours

Prerequisite: Data Base Management System, Discrete Mathematics

Objectives:

• To understand data warehouse

• To understand and implement multidimensional model

• To identify the problems, and apply mining algorithms

• To describe the business intelligence (BI) methodology and concepts

CONTENTS

SECTION-A

Unit 1: (7 Hrs)

Introduction to Decision Support System, Data Warehousing and Online Analytical Processing,

Data Warehouse: Basic Concepts , Data Warehouse Modeling: Data Cube and OLAP, Data

Warehouse Design and Usage, Data Warehouse Implementation.

Unit 2: (5Hrs)

Introduction to Data Mining, Integration of Data Mining system with a Database or a Data

Warehouse System, Major issues in Data Mining, Applications and Trends in Data Mining .

Unit 3: (8 Hrs)

Know your Data - Data objects and Attribute Types, Basic Statistical Descriptions of Data,

Measuring Data Similarity and Dissimilarity , Data Preprocessing – An Overview.

SECTION-B

Unit 4: (5 Hrs)

Mining Frequent Patterns : Mining Frequent Patterns, Associations: Basic Concepts, Apriori

Algorithm, association rules from frequent item sets. Cluster Analysis : Types of data in cluster

5

analysis, classical Partitioning methods : k-Means and k-Medoids.

Unit 5: (8 Hrs)

Introduction to Classification and Prediction, Classification by Decision tree Induction, Bayesian

classification, Rule based classification, Prediction: Linear Regression, non-linear regression

Unit 6: (7Hrs)

Introduction to Business Intelligence, Changing Business Environments and Computerized Decision

Support , The Business Pressures-Responses- Support Model , A Framework for Business

Intelligence (BI) , Intelligence Creation and Use and BI Governance , Transaction Processing

versus Analytic Processing , Successful BI Implementation , Major Tools and Techniques of

Business Intelligence

Text Books: 1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Third Edition,

Elsevier Publication

2. Paulraj Ponniah, Data Warehousing :Fundamentals for IT Professionals, Wiley Publication

Reference Books:

1. C.S.R.Prabhu :Data Warehousing Concepts,Techniques,Products and Applications,

Prentice Hallof India.

2. Alex Berson,Stephan J.Smith :Data Warehousing ,Data Mining and OLAP, Tata McGraw

Hill Edition.

3. Ivan Bayross: SQL, PLSQL:The Programming Language of ORACLE, BPB

Publication.

4. Business Intelligence : A Managerial Approach (2nd Ed.) Turban, Sharda, Delen, King ,

Wiley Publication.

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper

shall be set having two sections A and B. Section A questions shall be set on first part and Section B

questions on second part. Question paper should cover the entire syllabus.

For 80 marks Paper:

1. Minimum ten questions

2. Five questions in each section

3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each , will be

compulsory.

4. From the remaining questions in section A and B , students are supposed to solve any two

questions from each section, 15 marks each.

6



Final Year Engineering (CSE)

Semester – I

Course Code: CSE402 Title: Parallel and Distributed Computing

(PDC)

Teaching Scheme: Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks

Theory Examination (Marks): 80 Marks

Theory Examination (Duration):03 Hrs

Prerequisite: Fundamentals of Operating System.

Objectives:

• To train the students with the concepts of Parallel Computing because of the need in the

availability of growing number of cores on a chip.

• To provide the concept of massive -core GPUs and parallel programming.

• To understand the basic concepts of Distributed Computing.

• To introduce students to one distributed programming framework.

CONTENTS

SECTION-A: Parallel Computing

Unit 1: (6 Hrs)

Introduction to Parallel Computing, Scope and applications of Parallel Computing, Parallel

Computing Platforms - Implicit Parallelism, limitations of Memory System Performance, Physical

organization of Parallel platforms, Communication costs in parallel machines

Introduction to Message Passing Paradigm, Message Passing Interface

Unit 2: (7 Hrs)

Principles of Parallel Algorithm Design, Granularity, Concurrency and Task interaction, Recursive

Decomposition, Data Decomposition, Parallel Algorithm Models --The Data Parallel Model, The

Task Graph Model, The Master-Slave Model

Programming Shared Address Space Platforms- Threads, Why threads, The POSIX Thread API,

Thread creation-termination, Synchronization primitives in Pthreads--Mutual Exclusion for shared

variables

OpenMP standard for Parallel Programming: Basics, specifying concurrent tasks in OpenMP, Use of

various Directives

7

Unit 3: (7 Hrs)

CUDA (Compute Unified Device Architecture) Architecture: Introduction to CUDA GPU (Graphics

Processing Unit) architecture, Terms- Grid, Block, Threads. CUDA memory types, CUDA C

program structure, CUDA thread organization, Matrix multiplication using multiple blocks Simple

programs of merging and sorting

SECTION-B: Distributed Computing

Unit 4 (7 Hrs)

Theoretical Foundation for Distributed System: Limitation of Distributed system, Differences

between Distributed systems and Parallel systems, Models of distributed computation- Interleaving

Model, Happened before Model, Potential Causality Model, Shared memory

Temporal ordering of events, Logical clocks and Vector Clocks (Definition and algorithm)

Mutual Exclusion using Time stamps, Lamport's Algorithm for Mutual exclusion.

Unit 5 (7 Hrs)

Distributed Shared Memory (DSM): General architecture of DSM systems, Design and

implementation of DSM, Granularity, structure of shared memory space, consistency models,

Replacement Strategy, Thrashing, approaches to DSM, and Advantages of DSM

Distributed Objects and Remote Invocation: Communication between distributed objects, Remote

procedure call, Events and notifications, Java RMI case study

Unit 6 (6 Hrs)

Case study- Hadoop - A distributed programming framework, Building blocks of Hadoop, Setting

up SSH for Hadoop cluster, Running Hadoop, Working with Files in HDFS, Anatomy of

MapReduce program, Writing basic MapReduce programs

Text Books:

1. Ananth Grama, Anshal Gupta, Greoge Karypis, Vipin Kumar, "Introduction to Parallel Computing",

Second Edition, (Pearson Publication)

2. David B. Kirk and Wen-mei W. Hwu, “Programming Massively Parallel Processors - A Hands-on

Approach”, Second Edition (MK - Morgan Kaufmann Publication)

3. Vijay K. Garg, "Elements of Distributed Computing" (Wiley Publication)

4. Pradeep K Sinha “Distributed Operating Systems : Concepts and design” , Addison Wesely, 2003

Reference Books: 1. Chuck Lam, "Hadoop in Action" ( dreamtech Press)

8

2. A.D. Kshemkalyani, M. Singhal, “ Distributed Computing: Principles, Algorithms, and

Systems”, Cambridge University Press.

PATTERN OF QUESTION PAPER:

Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper



For 80 marks Paper:




compulsory.

4. From the remaining questions in section A and B , students are supposed to solve any two


9




Semester – I

Course Code: CSE403 Title: Principles of Compiler Design

(PCD)


Theory Examination (Marks):80 Marks

Theory Examination (Duration):03 Hours

Prerequisite:

• Knowledge of Data structures, Discrete Mathematics and Algorithms.

• Basic Knowledge of Theory of Computation.

• Programming skill in any Programming language like C.

Objectives:

• To get working knowledge of the major phases of compilation, like lexical analysis, parsing,

semantic analysis and code generation.

• To use the formal attributed grammars for specifying the syntax and semantics of

programming languages.

• To learn and use tools for compiler construction.

• To understand the structure of a compiler, and how the source and target languages influence

various choices in the design.

CONTENTS

SECTION-A

Unit 1: Introduction to Compilers (6 Hrs)

Compilers & translators, the structure of compilers, Bootstrapping, Compiler construction tools,

Programming language basics.

Unit 2: Lexical Analysis (6 Hrs)

Role of a lexical analyzer, Input buffering, Specification of tokens, Recognition of tokens,

Finite automata, Design of a lexical analyzer generator.

Unit 3: Syntax Analysis (8 Hrs)

Role of Parser, shift reduce parsing, top down parsing, Predictive parsing – Computation of FIRST

& FOLLOW functions and construction of parsing table, LR parsers, the canonical collection of LR

(O) items, LALR parser, Automatic parser Generator YACC, YACC programs, Error detection and

correction with YACC.

10

SECTION-B

Unit 4: Intermediate-Code Generation (6 Hrs)

Intermediate code: Postfix notations, parser trees and syntax trees, three address codes – Quadruples

and triples, indirect triples.

Unit 5: Syntax Directed Translation (6 Hrs)

Syntax-Directed Definitions, Construction of Syntax Trees, Bottom-Up Evaluation of S-Attributed

Definitions, L-Attributed Definitions, Top Down Translation, Bottom-Up Evaluation of Inherited

Attributes, Type Checking: Type Systems, Specification of a Simple Type Checker, Equivalence of

Type Expressions, Type Conversions.

Unit 6: Code Optimization and Code Generation (8 Hrs)

Principal sources of optimization, loop optimization - Basic blocks, flow graphs, loops, code

motion, induction variables , DAG representation of basic blocks, Application of DAGs, Global

Data Flow Analysis, Data Flow equations. Loop unrolling, loop jamming, constant folding, Object

programs: the environment of code, generator, run-time addresses for names, Problems in code

generation, A machine model, working of a simple code generator in brief, Register allocation and

assignments, Peephole optimization.

Text Books: 1. A V Aho, R. Sethi, J D Ullman, “Compilers: Principles, Techniques, and Tools”,

Pearson Education

2. D. M. Dhamdhere, “Compiler Construction – Principles & practices”

Reference Books:

1. A.V. Aho, J.D. Ullman , “Principles of Compiler Design” – (NAROSA)

2. V Raghavan ,”Principles of Compiler Design”-TMH Publications

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper



For 80 marks Paper:



3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be

compulsory.

4. From the remaining questions in section A and B students are supposed to solve any two


11




Semester – I

Course Code: CSE404 Title: Visual Modeling

(VM)




Prerequisite:

• Students should have prior knowledge of software engineering.

• Students should have idea of software development life cycle.

• Students should have knowledge of object oriented concepts.

Objectives:

• To design a software project using Object Oriented Modeling

• To design a software project using Design Patterns

• To design an Object- Oriented Software

CONTENTS

SECTION-A: Object Oriented Modeling

Unit 1: Introduction (6 hrs)

Complexity of Software, Algorithmic and Object-Oriented Decomposition,

Software Modeling : Object-Oriented Methods and the Unified Modeling Language, Software

Architectural Design : Method and Notation , UML as a Standard , Multiple Views of Software

Architecture , Evolution of Software Modeling and Design Methods , Evolution of Object-Oriented

Analysis and Design Methods , Survey of Concurrent, Distributed, and Real-Time Design Methods

Unit 2: UML Modeling (8 hrs)

Functional Modeling: Basics of Use Cases System, Actors: Finding actors, actors in UML,

Relationship between actors , Use case: Finding use cases, use cases in UML, Relationship between

use cases, Use Case Description : Types of use cases, elements of use case Description, Guidelines

for Creating Use cases descriptions, Organizing use cases, describing use cases, realizing use cases

and Use case Diagrams.

Structural Modeling: Structural Models: Classes, attributes, operations, Relationship Class

Responsibility Collaboration (CRC Cards) , Class Diagram: Elements of Class Diagram

Unit 3: Behavioral Modeling: (6 hrs)

Behavioral Models, Interaction Diagrams: Objects, operations and messages, Sequence diagram,

Communication diagram.

12

Activity Diagram: elements of activity diagram, guidelines for creating Activity diagram,

Component diagram, deployment diagram

NOTE: Case Study for Unit 2 & 3:

• ATM System

• Courseware Management System

• Library Management System

SECTION-B: Design Patterns

Unit 4: Introduction to Design Patterns (8 hrs)

Introduction to Design Pattern, The Catalog of Design Patterns, Organizing the Catalog , Creational

Design Pattern , Intent, applicability, structure, collaborations, consequence, implementations :

Abstract Factory, Prototype, Singleton.

Unit 5: Structural Design Patterns (6 hrs)

Intent, applicability, structure, collaborations, consequence, implementations: Adapter, Decorator,

Proxy

Unit 6: Behavioral Design Patterns (6 hrs)

Intent, applicability, structure, collaborations, consequence, implementations: Command, Observer,

strategy

NOTE: Case Study for Unit 4, 5 and 6:

• Document Editor

Text Books:

1. Object-Oriented Analysis and Design by Grady Booch, 2nd

Edition , Addison Wesley

2. Alan Dennis, Barbara Haley Wixom,David Tegarden ,”System Analysis and Design with

UML 2.0 “ Wiley India Edition.

3. Software Modeling and Design UML, Use Cases, Patterns, and Software Architectures by

Hassan Gomaa.

4. Design Patterns (ISBN: 81-7808-135-0) by Erich Gamma, Richard Helm, Ralph Johnson,

John Vlissides (Pearson Education Inc.) (Gang-of Four)

Reference Books: 1. Software Architecture Design − Methodology and Styles ISBN: 1-58874-621-6 Stipes

Publishing L.L.C. by Lixin Tao, Xiang Fu and Kai Qian

2. Pattern Oriented Software Architecture (ISBN: 9971-51-421-4) by Frank Bushmann

3. Hank-Erik Eriksson, Magnus Penkar, Brian Lyons, David Fado,” UML 2 Tool Kit”

OMG Press

13





For 80 marks Paper:




compulsory.

4. From the remaining questions in section A and B, students are supposed to solve any two

questions from each section , 15 marks each.

14




Semester – I

Course Code: CSE441 Title: Elective – I Cloud Computing

Teaching Scheme Examination Scheme Theory: -- 4hrs/week Class Test: 20 Marks

Theory Examination(Marks):80Marks


Prerequisite:

Computer Network

Objectives:

• To learn and understand Cloud Technologies

• To design, develop and deploy Cloud applications

• To get acquainted with the challenges and security aspects of Cloud Computing.

• To study Mobile Cloud Applications

CONTENTS

SECTION-A

Unit 1: Evolution of Model Computing (06 Hrs)

Introduction to Mainframe architecture, Client-server architecture, Cluster Computing, Grid

Computing, Parallel Computing and Distributed Computing, Evolution of sharing on the Internet,

Introduction of Cloud Computing: Definition of cloud, Cloud Deployment Models, Cloud Service

Models, Key Characteristics, Benefits and Risks in Cloud Computing, Service oriented architecture

(SOA) and Cloud Computing Reference Architecture by IBM

Unit 2: Services Delivered from the Cloud (08 Hrs)

Model architecture, Benefits and Drawbacks: Infrastructure-as-a-Service (IaaS), Platform-as-a-

Service (PaaS), Software-as-a-Service (SaaS), Business-Process-as-a-service (BPaaS), Identity-as-a-

service (IDaaS), Communication-as-a-service (CaaS), Monitoring-as-a-service (MaaS), Storage as a

service: Traditional storage versus storage cloud, Cloud Service providers: Infrastructure as service:

Amazon EC2, Platform as Service: Google App Engine, Force.com.

Unit 3: Cloud Technologies (06 Hrs)

Web services: SOAP and REST, SOAP VS REST, Virtualization: Introduction to virtualization,

Types of Virtualization, Pros and cons of virtualization, Virtualization applications in enterprises: Server virtualization, Desktop and Application Virtualization, Storage and Network Virtualization.

15

SECTION-B

Unit 4: Big Data and Analytics (08 Hrs)

Big Data, Challenges in Big Data, Hadoop: Definition, Architechture, Cloud file systems: GFS and

HDFS, BigTable, HBase and Dynamo, MapReduce and extensions: Parallel computing, The

MapReduce model: Parallel efficiency of MapReduce , Relational operations using MapReduce,

Projects in Hadoop: Hive, HBase, Pig, Oozie, Flume, Sqoop

Unit 5: Security in the Cloud (06 Hrs)

Security, Cloud Security Challenges, Infrastructure Security: Network, Host and Application level,

Data security and Storage, Security Management in the cloud, Data Privacy, Life cycle of Data, Key

Privacy concerns in cloud and Disaster Recovery.

Unit 6: Using Mobile Cloud (06 Hrs)

Adopting mobile cloud applications, Feature phones and the cloud, Using Smartphones with the

Cloud: Android, Apple iPhone, Research In Motion BlackBerry, Symbian, Windows Mobile,

Working with Mobile Web Services: Mobile interoperability, Performing Service Discovery:

Context-aware services, MEMS, Location awareness, Push services, Defining WAP and Other

Protocols.

Text Books:

1. Enterprise Cloud Computing: Technology, Architecture, Applications by Gautam Shroff,

Cambridge University Press.

2. Cloud Computing Implementation, Management, and Security By John W. Rittinghouse ,

James F. Ransome , CRC Press.

3. IBM smart storage cloud Red paper by Larry Coyne Mark Bagley Gaurav Chhaunker

4. Cloud Security and Privacy Tim Mather, Subra Kumaraswamy, Shahed Latif

Reference Books:

1. Cloud computing Bible by Barrie Sosinsky, Wiley India Pvt Ltd (2011)

2. Mastering Cloud Computing Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi





16

For 80 marks Paper:




compulsory.



17

Dr. BABASAHEB AMBEDKAR MARATHWADA UNIRVERSITY, AURANGABAD

FACULTY OF ENGINEERING & TECHNOLOGY


Semester – I

Course Code: CSE442 Title: Elective – I Artificial Intelligence(AI)

Teaching Scheme Examination Scheme Theory: 4 Hours/week Class Test: 20 Marks


Theory Examination (Duration): 03 Hours

Prerequisites: Discrete Mathematics, Basic Probability theory and statistics, Knowledge of any programming

language and data structures

Objectives

• Introduction to the basic principles and applications of Artificial Intelligence.

• Understanding the basic areas of Artificial Intelligence such as problem solving,

knowledge representation, reasoning, planning, perception, vision and learning.

• To understand the key components of intelligent agents.

• To design and implement expert systems of moderate complexity in appropriate

Language and evaluate their performance

CONTENTS

SECTION-A

Unit 1: Introduction (6 Hrs)

Introduction to AI, Foundation of AI, History, AI Techniques, AI Problems, Production systems,

Problem characteristics, AI Intelligent Agents, AI Application (E-Commerce & Medicine), Issues in

design of search algorithms, Future scope of AI.

Unit 2: Heuristic Search Techniques (8 Hrs)

Heuristic search, Hill Climbing, Best firth search, Problem, Reduction, mean and end analysis,

Constraint Satisfaction, A* and AO* Algorithm, Knowledge Representation: Basic Concepts,

Knowledge representation Paradigms, Propositional Logic, Inference Rules in Propositional Logic, ,

Knowledge representation using Predicate logic, Predicate calculus, Predicate and arguments, ISA

hierarchy, Frame notation, Resolution, Natural Deduction.

Unit 3: Logic Programming (6 Hrs)

Introduction, Logic Programming, Forward and backward reasoning, Forward and backward

chaining rules, Knowledge representation using non monotonic logic: TMS (Truth Maintenance

system), Matching, Control, fuzzy logic, semantic net, frames, Script, Conceptual dependency.

18

SECTION-B

Unit 4: Planning (6 Hrs)

Overview, An example domain: The blocks world, component of planning system, goal stack

planning, non linear planning using constraint pasting, hierarchical planning, Reactive system

Unit 5 : Advanced AI (6 Hrs)

Game playing: Min max search procedure, Alpha-Beta cutoffs, Natural Language Processing:

Introduction, syntactic processing, semantic analysis, Discourse & pragmatic processing,

Unit 6: Learning & Expert systems (8 Hrs)

Introduction to learning, Rote learning, learning by taking advice, learning in problem solving,

learning from examples: Induction, explanation based learning , Representing and using Domain

knowledge, Architecture of expert systems, knowledge acquisition.

Text Books:

1. Elaine rich and Kevin Knight, Shivshankar Nair, “Artificial Intelligence”, 3rd

Edition,

Tata McGraw-Hill, ISBN-10-0070087709, ISBN-13-9780070087705

2. Stuart Russell, Peter Norvig, “Artificial Intelligence-A Modern Approach”, 2nd

Edition, Pearson Education / Prentice Hall of India, ISBN:01379023952

Reference Books:

1.Eugene Charniak, Drew McDermott, “Introduction to Artificial Intelligence”,1.

Pearson Education, ISBN 81-7808-033-8

2.Ivan Bratco, “PROLONG: Programming for Artificial Intelligence”, Pearson

Education, 3rd

edition, ISBN 10:0-201-40375-7

3. Saroj Kaushik, “Artificial Intelligence”, Cengage learning, ISBN-13:9788131510995

4. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”,

Prentice Hall of India, ISBN: 81-203-0777-1

5. Rjschat-Koft “Artificial Intelligence & Engineering Approach “, Tata Mc-Graw Hill


Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question

paper shall be set having two sections A and B. Section A questions shall be set on first part and

Section B questions on second part. Question paper should cover the entire syllabus.

19

For 80 marks Paper:




compulsory.



20




Semester – I

Course Code: CSE443 Title: Elective-I Multicore Computing




Prerequisite:

Fundamentals of Computer Organization and Operating Systems

Objectives:

• To be able to differentiate between computing in mono core and multi core technology .

• To get acquainted with various challenges while writing code for multi core technology.

• To understand different architectures of multicore systems.

• To understand the design issues in parallel algorithms.

CONTENTS

SECTION-A

Unit 1:Introduction to multicore computing (6 hrs)

Single core, Dual core and quad core processor. Introduction to multicore, Multicore Architecture,

The software developers view point,Multiprogramming and multiprocessing ,Multicore application

design and implementation .

Unit 2 :Architecture types of multicore systems (7 hrs)

Symmetric and Asymetric multiprocessing,SMP scheduling,AMP scheduling,SMP-AMP,hybrid

system,multi kernel operating systems for multicore processors.

Unit 3: Challenges of Multicore programming (7 hrs)

Introduction to sequential model, Concurrency processor architecture, challenges, software

development challenges, The harsh realities of parallelization, parallel programming

SECTION-B

Unit 4 :Foundation of Shared memory (7 hrs)

Analytical modeling of parallel programming sources of overhead in parallel programming,

Performance Metrics for parallel systems .The effect of granularity on performance, Scalability of

parallel systems, Asymptotic analysis of parallel programming.

21

Unit 5: Principles of parallel algorithm design (7 hrs)

Decomposition , tasks and dependency graphs, granularity concurrency and task interaction.

Decomposition techniques, Characteristics of tasks and interaction, Mapping techniques for load

balancing.

Unit 6: Role of Operating system (6 hrs)

Decomposition and operating systems’s Role, Multicore OS vs multiprocessor OS, Recent Linux

OS supporting multicore architecture and Its architecture, Recent Windows OS supporting multi

core architecture and its architecture.

Text books

1.Cameron Huges,Tracy Huges,” Professional Multi core programming”Wrox publication,2013.

2Anath Grama,Anshul Gupta,George Karypis,”Introduction to Parrelle computing”,Pearson

Publication second edition,2013.

3.Hardik Joshi,Hushen Savani,”Object Oriented and Multicore Programming,Vishwakarma

Publications.

References

1.Rami Matarneh,”Hybrid system,multi Micro kernel Operating systems for Multicore

processors”Journal of Computer Science,5(7),pp.493-500,2009.

2.www.embeded.com/design/mcus-processors-and-socs/4422211/2/…





For 80 marks Paper:




compulsory.



22




Semester – I

Course Code : CSE421 Title :- LAB-I Data Warehousing and Data Mining

Teaching Scheme Examination Scheme

Practical: 2 Hours/Week Practical /Oral Examination: 50 Marks

Practical /Oral Examination (Duration) :- 03 Hours

List of Practical Assignments:

Minimum 8 assignments should be conducted (04 assignments from each set).

SET I : Implementation assignments should performed using any appropriate language.

1. Implementation of OLAP operations .

2. Implementation of Varying Arrays.

3. Implementation of Nested Tables .

4. Demonstration of any ETL tool.

5. Write a program of apriori algorithm using any programming language.

6. Write a program of naive Bayesian classification using c.

7. Write a program of cluster analysis using simple k-means algorithm using any programming

language.

8. A case study of Business Intelligence in Government sector/Social Networking/Business.

SET II: Following assignments should be performed in WEKA with detail analysis.

9. Create data-set in arff file format. Demonstration of preprocessing on WEKA data-set.

10. Demonstration of Association rule process on data-set contact lenses.arff /supermarket

using apriori algorithm.

11. Demonstration of classification rule process on WEKA data-set using j48 algorithm.

12. Demonstration of classification rule process on WEKA data-set using id3 algorithm.

13. Demonstration of classification rule process on WEKA data-set using naive bayes

algorithm.

14. Demonstration of clustering rule process on data-set iris.arff using simple k-means.

Practical Examination:

Practical Examination should be conducted by internal examiner for three hours under the

supervision of external examiner. External examiner should evaluate student by checking practical

performance and conducting viva.

23




Semester – I

Course Code: CSE422 Title: LAB-II:Principles of Compiler Design



Practical /Oral Examination (Duration):- 03 Hours


Minimum 8 assignments should be conducted. Implementation Assignments should be performed in any appropriate Programming Language.

1. Program to convert Non-deterministic finite automaton(NFA) to Deterministic finite

automaton(DFA).

2. Program to generate lexical tokens.

3. Study of LEX/FLEX tool and write LEX program to identify tokens : integer numbers,

decimal numbers, identifiers, keywords, arithmetic operators, relational operators.

4. Program to implement LR parser.

5. Study of YACC tool.

6. Program to implement any one code optimization technique.

7. Implementation of any one method of Intermediate Code Generator.

8. Implementation of code generator.


Practical Examination should be conducted by internal examiner for three hours under the

supervision of external examiner. External examiner should evaluate student by checking practical

performance and conducting viva.

24




Semester – I

Course Code:CSE423 Title: LAB-III Visual Modeling



Practical /Oral Examination (Duration):- 03 Hours

List of Practical Assignments

Minimum 8 assignments should be conducted (04 assignments from each set).

SET I: Object Oriented Modeling

(Make use of any UML tool to perform the following list)

1. Choose a hypothetical system of significant complexity and write an SRS for the same.

2. Draw one or more Use Case diagrams for capturing and representing requirements of the

system. Use case diagrams must include template showing description and steps of the Use

Case for various scenarios.

3. Draw one or more Package diagram to organize and manage your large and complex systems

as well as their complex models.

4. Draw activity diagrams to display either business flows or like flow charts.

5. Draw basic class diagrams to identify and describe key concepts like classes, types in your

system and their relationships.

6. Draw advanced class diagrams to depict advanced relationships, other classifiers like

interfaces.

7. Draw sequence diagrams OR communication diagrams with advanced notation for your

system to show objects and their message exchanges.

8. Draw state machine to model the behavior of a single object, specifying the sequence of

events that an object goes through during its lifetime in response to events.

9. Draw component diagrams assuming that you will build your system reusing existing

components along with a few new ones.

10. Draw deployment diagrams to model the runtime architecture of your system.

SET II: Design Patterns

Write a program in Java to implement the Design patterns of the following

1. Abstract factory

2. Singleton

3. Prototype

4. Adapter

5. Decorator Pattern

6. Observer Patterns

7. Strategy

Practical Examination: Practical Examination should be conducted by internal examiner for three hours under the supervision of

external examiner. External examiner should evaluate student by checking practical performance and

conducting viva.

25




Semester – I

Course Code : CSE424 Title :- LAB-I Elective-I Cloud Computing


Practical: 2 Hours/Week Term Work: 50 Marks


Minimum 8 assignments should be conducted.

1. Introduction to cloud computing.

2. Implementation of SOAP Web services in C#/JAVA Applications.

3. Implementation of RESTFul Web services in C#/JAVA Applications.

4 . Implementation of Para-Virtualization using VMWare’s Workstation/ Oracle’s

Virtual Box and Guest O.S.

5. Implementation of Full-Virtualization using VMWare’s ESXi and Guest O.S.

6. Creating a Warehouse Application in SalesForce.com.

7. Installation and Configuration of Single-Node Setup in Hadoop.

8 . Create any Application (Ex: Word Count) Using Hadoop Map/Reduce.

9. To study Cloud security challenges.

10. Case Study: PAAS (Face book, Google App Engine)

11. Case Study : Amazon Web Services.

Term Work:

The term work shall consist of at least 8 experiments/ assignments based on the syllabus above.

Assessment of term work should be done as follows

• Continuous lab assessment

• Actual practical performance in Laboratory.

26




Semester – I

Course Code : CSE424 Title :- LAB-I Elective-I Artificial Intelligence



List of Practical Assignments.


1. Study of Prolog

2. Program to generate family tree

3. Program for Water Jug Problem.

4. Program checking a person eligible for voting.

5. Program to calculate factorial of a number

6. Program for generating Fibonacci series

7. Program for generating pyramid

8. Program for Towers of Hanoi puzzle

9. Design an expert system (Ex. Medical Diagnosis System)

Term Work:





27




Semester – I

Course Code: CSE424 Title: LAB-IV Elective – I Multicore Computing


Practical: 02 Hours/Week Term Work : 50 Marks



1. Survey the recent products of AMD Athlon series and present pros and cons of the products.

2. Survey the recent products of Intel multicore series and present pros and cons of the products.

3. Find and discuss various features of Windows OS such as memory model, IPC mechanism,

Resource management, scheduling policies which support multicore operations.

4. Find and discuss various features of Linux OS such as memory model, IPC mechanism, Resource

management, scheduling policies which support multicore operation.

5. Discuss how concurrency issues are handled in multi-core architecture. Implement Test and Set

based Spin locks for concurrency in multicore computing.

6. What are challenges a typical resource manger of operating system has to face if it is used for

multicore architecture . Do some research from IEEE/ACM/Springer/Elsevier conference/journal

papers. Study at least one strategy for resource management in multicore computing.

7: Implement at least one strategy for resource management in multicore computing using any

appropriate programming language.

8. As the processor’s chip is becoming thin and thin, it is affecting on overall reliability of software

due to transient faults. Find out the facts through literature survey and suggest the remedy.

Term Work:





28




Semester – I

Course Code: CSE425 Title: Project Part I


Practical: 02 Hours/Week Term Work : 25 Marks

1. Project Group size = maximum 4 students.

2. The project is to be taken up at the start of the semester I and the project must be completed by

the end of semester II.

3. While submitting project proposal care is to be taken that project will be completed within the

available time of two terms.

4. Project title should be precise and clear. Selection and approval of topic: Topic should be related

to real life or commercial application in the field of Computer Engineering

OR

Investigation of the latest development in a specific field of Computer Engineering

OR

Commercial and Interdisciplinary projects should be encouraged. The examination will be

conducted independently in respective departments.

5. The group should maintain a logbook of activities. It should have entries related to the work

done, problems faced, solution evolved etc., duly signed by guide. This data should be used for

finding the total man hours and estimating the cost of the project

.6. The group is expected to complete details Literature Survey, system/problem definition, analysis,

design, etc. in (B.E. first Term) seventh term, as a part of term work in the form of a joint report.

Project report must be submitted in the prescribed format only. No variation in the format will be

accepted.

7. The guides should regularly monitor the progress of the project work.

8. Assessment of the project for award of term work marks shall be done by the guide and a

departmental committee as per the guidelines given in the following table.

9. The suggestive format of the report is as follows:

( Only one report should be submitted per group as a part of term work submission. )

29

Title of the Project:

Names & Roll Numbers of the students:

Name of the guide:

Chapter 1: Introduction

Chapter 2: Literature Survey

Chapter 3: System Development

30




Semester – I

Course Code: CSE426 Title: Seminar

Examination Scheme

Term Work : 25 Marks

All the final year students are informed to present a seminar on a topic related to current trends and

technologies. Seminar should be evaluated on the following basis:

• PPT prepared and Presentation skills

• Understanding of Topic

• Report preparation

31




Semester – II

Course Code : CSE451 Title :- Computer System Security and Laws

(CSSL)


Theory Examination (Marks) : 80 Marks

Theory Examination (Duration) : 03 Hours

Prerequisite:

Fundamentals of Computer Networking

Objectives:

• To understand the five security components and apply them when evaluating a given security

mechanism.

• To understand basic cryptography including symmetric and asymmetric cryptography, message

digests, digital signatures and digital certificates.

• To understand the basics of system security along-with the mechanisms for authentication and

authorization.

• To understand the legal aspect and Forensics in the computer system security.

CONTENTS

SECTION-A

Unit-1 (06hrs)

Introduction: Need for Security, security approaches, principles of security, security attacks,

security services ,model for network security.

Unit-2 (06 hrs)

Authentication and Authorization controls: User-names and password, certificate based

authentication, extensible Authentication protocol(EAP), biometric authentication, role based

authentication, access control lists(ACL), rule based authentication.

Unit-3 (08 hrs)

Securing Communications: Cryptography Techniques, Cryptographic keys, cryptographic hash

functions, Digital Signatures, Digital Certificates, RSA, Advanced Encryption Standard(AES).

Steganography, Authentication Applications: Kerberos, Firewalls, Intrusion detection.

32

SECTION-B

Unit-4 (06 hrs)

Internet Security Protocols: Introduction, Basic concepts, SSL,Transport Layer Security(TLS),

Secure HTTP, Secure Electronic Transaction(SET), Email Security, Wireless Application Protocol

Security, Security in GSM, Security in 3G, IEEE 802.11 security.

Unit-5 (06 hrs)

Incident Handling Basics: Purpose of Incident Response, Common terms, organizational planning

for incident handling, organizational roles, procedures for responding to incidents, types of

incidents, stages of incident response, Incident prevention and detection

Information Technology Act 2000: Scope, jurisdiction, offense and contraventions, powers of

police, adjudication.

Unit-6 (08 hrs)

Cyber Forensics: History of Cyberforensics, Computer forensics and law, cybercrime examples,

forensic Evidence Forensics Casework, Preserving integrity of crime scene, Investigative incident

response actions,forensics analysis investigative actions, computer forensic tools.

Textbooks:

1. Atul Kahate, Cryptography and Network Security, 3e, McGraw Hill Education

2. John W. Rittinghouse, William M.Hancock, “Cyber security Operations Handbook”,

Elsevier Pub.

3. Roberta Bragg, Mark Rhodes-Ousley, Keith Strassberg , “The Complete reference –

Network Security” , Tata McGraw Hill publication

Reference Books:

1. William Stallings, Cryptography and Network Security, Pearson Education.

2. Behrouz A. Forouzan, Debdeep Mukhopadhyay, Cryptography and Network

Security, McGraw Hill Education.

3.Vivek Sood, 'Cyber Law Simplified', McGraw Hill Education.





33

For 80 marks Paper:




compulsory.


questions from each section , 15 marks each.

34




Semester – II

Course Code: CSE452 Title: Mobile Computing (MOC)

Teaching Scheme: Examination Scheme

Theory: 04 Hours/Week Class Test:20

Marks



Prerequisite:

• Knowledge of Computer Network

Objectives:

• To make students familiarize with Wireless Networking. and mobile OS.

• To understand the mobile IP.

• To know the basics of WAP and WML.

• To understand and use open source tools for Mobile Applications.

CONTENTS

SECTION-A

Unit 1: Mobile Operating System (4 Hrs)

Features and Technology: Windows mobile os , Symbian ,Black berry, Android, Iphone OS.

Unit 2: Wireless and Mobile Network Architecture (8 Hrs)

Principle of Cellular Communication, Overview 1G, 2G, 2.5G and 3G and 4G technologies, GSM

Architecture and Mobility management hand off management, Network signaling, Mobile Devices:

PDA, first generation phone and smart phone

Unit 3: Medium Access Control (8Hrs)

Medium Access Control: Motivation for a specialized MAC (Hidden and exposed terminals,

SDMA, FDMA, TDMA, CDMA.

35

SECTION-B

Unit4: Mobile IP Protocol Architecture (8 Hrs)

Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent advertisement

and discovery, registration, tunneling and encapsulation, optimizations) , Mobile IPv4 and IP v 6

and its application in mobile computing.. CDPD, VOIP, GPRS architecture and Services, Wireless

Local Loop-WLL system

Unit 5: Wireless Application Protocol (WAP) (4 Hrs)

The Wireless Application Protocol application environment, wireless application protocol Client

software, hardware and websites, wireless application protocol gateways, Implementing enterprise

wireless application protocol strategy.

Unit 6: Wireless Markup Language (8 Hrs)

An Introduction to Wireless Technologies, Markup Languages, An Introduction to XML,

Fundamentals of WML. Writing and Formatting Text, Navigating Between Cards and Decks,

Displaying Images, Tables, Using Variables, Acquiring User Input ,An Introduction to WMLScript,

WMLScript Control Structures, Events, Phone.com

Text Books:

1.Yi Bing Lin, “Wireless and Mobile Networks Architecture”, John Wiley

2. JochenSchiller,“MobileCommunications”,Addison-Wesley.

Reference Books:

1.Professional Android™ 4 Application Development by Reto Meier

2. Wrox, “The Beginning WML and WML Script”, Wrox Publication

Pattern of Question Paper:




For 80 marks Paper: 1. Minimum ten questions


3. Question no. 1 from section A and Question no. 6 from section B, 10 marks eac , will be

compulsory.



36

Dr. BABASAHEB AMBEDKAR MARATHWADA UNIRVERSITY, AURANGABAD

FACULTY OF ENGINEERING & TECHNOLOGY


Semester – II

Course Code: CSE453 Title: Soft Computing(SC)


Theory: 4 Hours/week Class Test: 20 Marks



Prerequisite:

Image Processing

Objectives:

• To understand the scope of soft computing and pattern recognition tasks that can be

performed by some of the basic structures of artificial neural networks

• Analyze feedforward networks and Understand the significance of nonlinear output

functions of processing unit in feedback network for pattern storage.

• To describe and explain Core concepts and techniques of fuzzy logic.

• To understand Fuzzy Logic in database System and information. introduction to genetics.

CONTENTS

SECTION-A

Unit – 1 (7 Hrs)

Soft Computing : Introduction of soft computing, soft computing vs. hard computing, various types

of soft computing techniques, applications of soft computing.

Characteristics of Neural Networks, Structure and Working of a biological neural network, Artificial

Neural Network Teminology, models of neurons: MP model, Perceptron model, Adaline model,

Topology, Basic Learning laws, What is learning, supervised and unsupervised learning, Functional

Units of ANN for pattern recognition task: Pattern Recognition Problem, Basic functional units.

Unit – 2 (7 Hrs)

Perceptron learning – single layer and multilayer perceptron, linear and non-linear separability

problems, supervised learning algorithms, Error correction and Gradient Decent Rules, FFNN,

Architecture of FFNN, Backpropagation learning algorithm, pattern classification, pattern

association by FFNN

37

Unit-3 (6 Hrs)

Pattern association- auto association and hetero association, feedback NN, architecture of FBNN,

energy function, associative memory, bidirectional associative memory.Hopfield network.

SECTION-B

Unit-4 (7 Hrs)

Unsupervised learning – pattern clustering, Self-organization map (SOM), Generalized learning

laws, Competitive Learning, examples, learning Vector Quantization, self –organizing feature map,

Applications of self-organizing feature map.

Unit-5 (6 Hrs)

Classical sets, Fuzzy sets, Crisp relations, Fuzzy relations, Examples, Properties of membership

functions, fuzzification and Defuzzification to crisp sets,Application of fuzzy control

Unit-6 (7 Hrs)

Fuzzy logic in database and information systems, Fuzzy relational data models, Operations in fuzzy

relational data models, Design theory for fuzzy relational databases. Fuzzy If-Then Rules, . Fuzzy

Linear Programming

Fundamentals of Genetic algorithm, Working principle and application of genetic Alogorithm.

Text Books

1. S.N.Sivanandam & S.N. Deepa, “Principles of Soft Computing”, Wiley Publications.

2. B. Yegnanarayana, “Artificial Neural Networks”, PHI Publications.

3. John Yen, Reza Langari, “Fuzzy Logic”, Pearson Education.

4. S. Rajasekaran, Vijaylakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic algorithms-

Synthesis and Applications”, PHI Publications.

Reference Books

1. Timothy J Ross , “Fuzzy Logic with Engg. Applications”, Wiley Publications.

2. B. Satish Kumar, “Neural Networks - A Classroom Approach”, McGrawHill Publications


Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be

set having two sections A and B. Section A questions shall be set on first part and Section B questions on

second part. Question paper should cover the entire syllabus.

38

For 80 marks Paper:



3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each , will be compulsory.

4. From the remaining questions in section A and B students are supposed to solve any two questions from

each section, 15 marks each.

39




Semester – II

Course Code: CSE491 Title: - Elective II Remote Sensing & GIS

Teaching Scheme Examination Scheme Theory:04 Hours/Week Class Test:20 Marks

Theory Examination (Marks) :80 Marks


Prerequisite:

Students should have prior knowledge of Image processing and Computer Graphics.

Objectives:

• To get acquainted with the concepts of Earth observation and remote data acquisition

techniques.

• To understand the concepts of remotely sensed data manipulation, processing, and

visualisation.

• To apply data manipulation and visualisation methods.

• To perform appropriate data manipulation and visualisation methods for a number of Earth

Science applications, including Geographical Information Systems (GIS).

CONTENTS

SECTION-A

Unit 1: Fundamentals of Remote Sensing (7 hrs)

Principles of Remote sensing, History of Remote sensing, Remote sensing in India, Electromagnetic

radiation, Electromagnetic Radiation and Electromagnetic Spectrum, EMR quantities,

Nomenclature and Units, Thermal Emission of Radiation, Radiation Principles, Interaction of EMR

with the Earth Surface , Spectral signature, Reflectance characteristics of Earths cover type, Remote

sensing systems, Human vision colours, Spectral signatures and their interpretation

Unit 2: Remote Sensing platforms and sensors (6 hrs)

Platforms, Types of sensors, Sensor resolutions , Passive and Active Sensors, Optical sensors,

Classification of RS, Selection of Sensor Parameter, Spatial Resolution, Spectral Resolution,

Radiometric Resolution, Temporal Resolution, Band combinations and optimum index factor, False

and pseudo colour composites, Errors in the imaging process.

Unit 3: Visual Image Interpretation (7 hrs)

Elements of image interpretation; interpretation key, Hardware and software aspects of digital image

processing, Properties of digital remote sensing data, Concept of geo-referencing , Errors due to

40

geo-referencing, Physical and mathematical models, hybrid models, Rectification of images,

interpolation methods in the rectification of images: nearest neighbour, bilinear and bi-cubic

methods, Concept of world file and embedding of projection information in the images.

SECTION-B

Unit 4: Remote Sensing Image Processing (7 hrs) Image Registration, Image enhancement techniques, The Classification Process, Image

classification techniques: supervised & unsupervised techniques

Unit 5: Geographic Information Systems (7 hrs)

Definition of GIS; Elements of a GIS; Coordinate System, Need for GIS, Data Models: Raster and

Vector, GIS data acquisition, Date inputs for GIS, Integration of satellite images, aerial photographs

and GIS, Concept of Web GIS

Unit 6: Data Exploration & Analysis (6 hrs)

Data Display and Cartography, Data exploration, Vector data analysis, Raster data analysis, Terrain

Mapping & analysis.

Text Books:

1. Lillesand, Kiefer, Chipman, Remote Sensing and Image Interpretation, Wiley Publications.

2. Robert A. Schowengerdt, Remote Sensing models & methods for image processing, 3rd

edition, Academic press.

3. Kang-tsung Chang, “Introduction to Geographic Information Systems”, Tata McGrawHill,

Fourth Edition

Reference Books:

1. Fundamentals of Remote Sensing, George Joseph, Universities Press (India) Pvt. Ltd.

2. Remote Sensing – Principles & Applications, Dr. B C Panda, Viva Books Pvt. Ltd.

3. J. B. Campbell and R. H. Wyne, Introduction to Remote Sensing, Guilford Press, 2011





For 80 marks Paper:




compulsory.



41




Semester – II

Course Code: CSE492 Title: Elective - II Green IT

Teaching Scheme Examination Scheme:

Theory: - 04 Hours/Week Class Test: 20 Marks



Prerequisite:

Understanding of Environmental Science and Business Process

Objectives:

1. Learn to measure computer power usage, minimize power usage, procure sustainable hardware,

design green data centers, and recycle computer equipment.

2. Acquire expertise for improving the energy efficiency of personal computers by reducing the

power consumption requirements.

3. Evaluate the regulatory and governance issues surrounding IT.

4. Execute a virtualization plan.

CONTENTS

SECTION-A

UNIT 1: Green IT an Overview: (06 Hrs)

Introduction, Environmental Concerns and Sustainable Development, Environmental Impacts of IT,

Green IT, Holistic Approach to Greening IT, Greening IT, Enterprise Green IT Strategy, Green IT

Burden or opportunity, Life Cycle of a Device or hardware Reuse, Recycle and Dispose.

UNIT 2: Green Software & Sustainable software Development (08 Hrs)

Energy- Saving Software Techniques- Computational Efficiency, Data Efficiency, Context

Awareness, Idle Efficiency, Evaluating and Measuring Software Impact to Platform Power, Current

practices, Sustainable Software, Software Sustainability Attributes, Software Sustainability Metrics,

Sustainable Software methodology, Case Study.

UNIT 3: Green Data Centres and Data Storage: (06 Hrs)

Data centres and Associated Energy Challenges ,Data Centre IT Infrastructure, Data Centre Facility

Infrastructure, IT Infrastructure Management, Green Data Centre Metrics, Case study on Data

Centre Management Strategies, Storage Media Power Characteristics-Hard Disks, Magnetic Tapes,

Solid-State Drives, Energy Management Techniques for Hard Disks-State

Monitoring,Caching,Dynamic RPM,System- Level Energy Management.

42

SECTION-B

UNIT 4: Green Networks and Communication: (06 Hrs)

Introduction, Objectives of Green Network Protocols-Energy-Optimizing Protocol Design, Bit

Costs Associated with Network Communication Protocol, Green Network Protocols and Standards-

Strategies to Reduce Carbon Emissions, Contributions from the EMAN Working Group,

Contributions from Standardization Bodies.

UNIT 5: Green Cloud Computing and environmental Sustainability (06 Hrs)

Cloud Computing, Cloud Computing Energy usage Model, Features of Clouds Enabling Green

Computing, Green Cloud Architecture, case Study: IaaS Provider.

UNIT 6: Green Enterprises and Role of IT and Green IT Outlook (08 Hrs)

Organizational and Enterprise Greening, Information Systems in Greening Enterprises, Greening the

Enterprise: IT Usage and hardware,Inter-organizational, Enterprise Activities and Green Issues,

Enablers and Making the Case for IT and the green Enterprise, Awareness to implementation,

Greening by IT, Green IT Megatrend, Seven-step approach to Creating Green IT Strategy, Research

and Development Directions.

Text Books:

1. San Murugesan, and G. R. Gangadharan “Harnessing Green IT: Principles and Practices”,

IEEE Wiley publication.

2. Adrian Sobotta and Irene Sobotta ,”Greening IT - How Greener IT Can Form a Solid Base

For a Low Carbon Society”, Creative Commons Publication, 2009. (greening it_isbn -

9788791936029.pdf).





For 80 marks Paper:




compulsory.



43




Semester – II

Course Code: CSE493 Title: Elective - II Agile Methodology (AM)


Theory: 04 Hours/Week Class Test:20 Marks



Prerequisite:

• Awareness of basics of software engineering concepts and waterfall methodology.

• Exposure to any object oriented programming language such as Java, C#.

Objectives:

• To understand the background and driving forces for taking an Agile approach to software

development.

• To understand the business value of adopting agile approaches.

• To understand the Agile development practices.

• To drive development with unit tests using Test Driven Development.

• To Apply design principles and refactoring to achieve Agility.

• To deploy automated build tools, version control and continuous integration.

CONTENTS

SECTION-A

Unit 1: Fundamentals of Agile (6 hrs)

The Genesis of Agile, Introduction and background, Agile Manifesto and Principles, Overview of

Scrum, Extreme Programming, Feature Driven development, Lean Software Development, Agile

project management, Design and development practices in Agile projects, Test Driven

Development, Continuous Integration, Refactoring, Pair Programming, Simple Design, User

Stories, Agile Testing, Agile Tools.

Unit 2: Agile Scrum Framework (6 hrs)

Introduction to Scrum, Project phases, Agile Estimation, Planning game, Product backlog, Sprint

backlog, Iteration planning, User story definition, Characteristics and content of user stories,

Acceptance tests and Verifying stories, Project velocity, Burn down chart, Sprint planning and

44

retrospective, Daily scrum, Scrum roles – Product Owner, Scrum Master, Scrum Team, Scrum case

study, Tools for Agile project management.

Unit 3: Agile Testing (8 hrs)

The Agile lifecycle and its impact on testing, Test-Driven Development (TDD), x Unit framework

and tools for TDD, Testing user stories - acceptance tests and scenarios, Planning and managing

testing cycle, Exploratory testing, Risk based testing, Regression tests, Test Automation, Tools to

support the Agile tester.

SECTION-B

Unit 4: Agile Software Design and Development (6 hrs)

Agile design practices, Role of design Principles including Single Responsibility Principle, Open

Closed Principle, Liskov Substitution Principle, Interface Segregation Principles,

Unit 5: Agile Software Design Principles (6 hrs)

Dependency Inversion Principle in Agile Design, Need and significance of Refactoring, Refactoring

Techniques, Continuous Integration, Automated build tools, Version control.

Unit 6: Industry Trends (8 hrs)

Market scenario and adoption of Agile, Agile ALM, Roles in an Agile project, Agile applicability,

Agile in Distributed teams, Business benefits, Challenges in Agile, Risks and Mitigation, Agile

projects on Cloud, Balancing Agility with Discipline, Agile rapid development technologies.

Text Books:

1. Agile Software Development with Scrum by Ken Schawber, Mike Beedle Publisher: Pearson

Published: 21 Mar 2008.

2.Agile Testing: A Practical Guide for Testers and Agile Teams by Lisa Crispin, Janet Gregory

Publisher: Addison Wesley Published: 30 Dec 2008.

Reference Books

1.Agile Software Development, Principles, Patterns and Practices by Robert C. Martin

Publisher:Prentice Hall Published: 25 Oct 2002.

45





For 80 marks Paper:




compulsory.


questions, 15 marks each.

1




Semester – II

Course Code : CSE471 Title :- LAB-V Computer System Security and Laws


Practical: 2 Hours/Week Practical /Oral Examination:50 Marks

Practical /Oral Examination (Duration) :- 03 Hours



1. Installation and demonstration of nmap tool.

2. Perform an experiment to demonstrate use of nmap tool for Port Scanning.

3. Installation and demonstration of Wireshark Network Analyzer tool.

4. Perform an experiment to demonstrate the use of wireshark network analyzer to sniff for

router traffic.

5. Installation and demonstration of jcrypt tool.

6. Use jcrypt tool (or any other equivalent) to demonstrate asymmetric, symmetric crypto

algorithm, hash and digital signatures

7. Case study : Kerberos.

8. Implementation of RSA algorithm using any appropriate Programming Language.

9. Demonstrate any tool for Intrusion Detection System (IDS)

10. Study of IT Act 2000.


Practical Examination should be conducted by internal examiner for three hours under the supervision of

external examiner. External examiner should evaluate student by checking practical performance and

conducting viva.

2




Semester – II

Course Code: CSE472 Title: LAB - VI Mobile Computing


Practical: 2 Hours/Week Practical /Oral Examination:50 Marks

Practical /Oral Examination (Duration): 03 Hours



1. Write a program to show how to use UI elements, layouts by using ADT.

2. Write a program to show Linking of activities.Broadcast receiver in Android.

3. Write a Program to develop simple application to show activity life cycle.

4. Write a Program work with Google services

5. Write a program for Broadcast receiver in Android.

6. Write a program by using <p>,line braking,fonts and formatting of text in WML

7. Write a program for Navigation between cards, deck, and formatted text.

8. Write a program Displaying of Image,table using WML

9. Write a program for anchor links, variables.

10. Write a program Methods of acquiring user inputs in WML

11. Write a program WML scripts basics by using conditional or loop statement

12. Write an assignment on latest Open Source Operating Systems for Mobile.


Practical Examination should be conducted by internal examiner for three hours under the supervision

of external examiner. External examiner should evaluate student by checking practical performance

and conducting viva.

3




Semester – II

Course Code: CSE473 Title: LAB VII Soft Computing


Practical: 2 Hours/Week Practical /Oral Examination:50 Marks Practical /Oral Examination (Duration) :- 03 Hours


Minimum 08 implementation assignments and two study assignments should be conducted.

1. Write a program to implement MP-model

2. Write a program for solving linearly separable and nonlinearly separable problems with single

layer and multilayer perception

3. Write a program to solve pattern recognition problem with FFNN using back propagation

algorithm

4. Write a program solve pattern storage problem with feedback NN

5. Write a program to Solve pattern clustering problem by unsupervised learning method using

self organizing map (SOM)

6. Write a program to solve pattern recognition problem with learning vector quantization (LVQ)

7. Write a program to solve Face recognition problem using ANN as a classifier

8. Write a program to solve character recognition problem (or classification for medical database)

.

9. Write a program to implement Fuzzy set operation and properties .Write a program to

implement Fuzzy Set operation and properties

10. Write a program to perform Max-Min composition of two matrices obtained from Cartesian

Product.

11. Write a program to solve an optimization problem using Fuzzy If-Then Rules


Practical Examination should be conducted by internal examiner for three hours under the supervision

of external examiner. External examiner should evaluate student by checking practical performance

and conducting viva.

4




Semester – II

Course Code:CSE474 Title: - LAB VIII Remote Sensing & GIS



List of Practical Assignments.


(Software : ILWIS / GRASS / QGIS / ArcGIS )

1. Reading and importing a raster dataset into RS/GIS s/w and creating a subset.

2. Image processing filters: smoothing and edge detection filtering

3. Image classification: Unsupervised classification

4. Image classification: Supervised classification

5. Image classification: Accuracy assessment

6. Image geo-referencing and understanding projections

7. Image fusion with images of two different resolutions

8. Digitization of point, line and polygon features

9. Composition of maps

Term Work:

The term work shall consist of atleast 8 experiments/ assignments based on the syllabus above.




5




Semester – II

Course Code: CSE474 Title: LAB VIII Elective - II Green IT

Teaching Scheme: Examination Scheme:

Practical: 2 Hours/Week Term work: 50 Marks



1. Case study on Climate change and low carbon society

2. Study types of Carbon Management Systems (CMS), their features and limitation.

3. Green IT and Disaster management

4. Green IT and Decision support system

5. Tools most useful in developing green software, developer perspective.

6. Case study on Data Center Management Strategies.

7. Cloud computing as Green IT initiative through visualization.

8. Case study on Smart Grid.

Term Work:





6




Semester – II

Course Code: CSE474 Title: Lab - VIII Elective - II Agile Methodology





1. Understand the background and driving forces for taking an Agile approach to software

development.

2. Understand the business value of adopting Agile approaches.

3. Understand the Agile development practices.

4: Drive development with unit tests using Test Driven Development.

5: Apply design principles and refactoring to achieve Agility.

6 & 7: Deploy automated build tools, version control and continuous integration.

8: Perform testing activities within an agile project.

Term Work:





7




Semester – II

Course Code: CSE475 Title: Project Part II


Term Work : 50 Marks

Practical: 06 Hours/Week Practical /Oral Examination:100 Marks Practical /Oral Examination (Duration) :- 03 Hours

1. The guide should be internal examiner for oral examination.

2. The external examiner should be from the related area of the concerned project. He should have

minimum of five years of experience at degree level / industry.

3. The evaluations at final oral examination should be done jointly by the internal and external

examiner.

4. The same project group of Part I should continue the work in Part – II as well. The project group

should complete the project work taken in Part I. It should complete the rest of the work from stage III

onwards till the conclusion. The performance Analysis chapter should consist of various testing

methods used along with sample test cases. It should also include how better the system is performing

as compared to other similar systems. The final examination will consist of the demonstration of work

which will be judged by two examiners (one internal and one external) and the marks will be given

accordingly. The suggestive format of the report is as follows:

( Only one report should be submitted per group as a part of term work submission)

Title of the Project:

Names & Roll Numbers of the students:

Name of the guide:

Chapter 1: Introduction

Chapter 2: Literature Survey

Chapter 3: System Development

(This chapter will include the entire design process with necessary DFDs, other diagrams, design

methodologies and other design and implementation details.)

Chapter 4: Performance Analysis

Chapter 5: Conclusions

( Detailed format of the project report is to be made available by the Dept. )

Dr. Babasaheb Ambedkar Technological University

(Established as a University of Technology in the State of Maharashtra)

(under Maharashtra Act No. XXIX of 2014)

P.O. Lonere, Dist. Raigad, Pin 402 103, Maharashtra

Telephone and Fax. : 02140 - 275142

www.dbatu.ac.in

Detailed Syllabus

for

Second Year

B. Tech program in Computer Engineering/ Computer Science/ Computer Science &Engineering

With effective from

Academic year July 2018-19

Approved in the 11th meeting of Academic Council 8th June 2018

Teaching and Evaluation Scheme Second Year B. Tech. (Computer Engineering)

Sr.No.

Code Course title WeeklyTeaching hours

EvaluationScheme Credit

L T P MSE CA ESE

Semester III

1 BTBSC301 Engineering Mathematics -III 3 1 - 20 20 60 4

2 BTCOC302 Discrete Mathematics 2 1 - 20 20 60 3

3 BTCOC303 Data Structures 2 1 - 20 20 60 3

4 BTCOC304 Computer Architecture & Organization 2 1 - 20 20 60 3

5 BTCOC305 Digital Electronics & Microprocessors 2 1 - 20 20 60 3

6 BTHMC306 Basic Human Rights 2 - - - 50 - Audit

7 BTCOL307 Python Programming 1 - 2 - 60 40 2

8 BTCOL308 HTML and Javascript 1 2 60 40 2

8 BTCOL309 Data Structures Lab - - 2 - 60 40 1

9 BTCOL310 Digital Electronics & Microprocessor Lab

- - 2 - 60 40 1

10 BTCOF311 Field Training / Internship/Industrial Training Evaluations

- - - - - 100 1

Total 15 5 8 100 390 560 23

Semester IV

1 BTCOC401 Design & Analysis of Algorithms 2 1 - 20 20 60 3

2 BTCOC402 Probability & Statistics 2 1 - 20 20 60 3

3 BTCOC403 Operating System 2 1 - 20 20 60 3

4 BTCOE404 Elective-IA) Object Oriented

Programming in C++B) Object Oriented

Programming in Java

2 1 - 20 20 60 3

5 BTCOE405 Elective-IIA) Numerical MethodsB) Physics of Engineering

MaterialsC) Soft Skills and Personality

Development

2 1 - 20 20 60 3

6 BTXXC406 Product Design Engineering 2 - - 20 20 60 2

7 BTCOL407 Design & Analysis of Algorithms Lab - - 2 - 60 40 1

8 BTCOL408 Introduction to Data Science with R 1 - 2 - 60 40 2

9 BTCOL409 Object Oriented Programming Lab - - 2 - 60 40 1

10 BTCOL410 Operating System Lab - - 2 60 40 1

11 BTCOF411 Field Training / Internship/Industrial Training (minimum 4 weeks which can be completed partially in first semesterand second Semester or in at one time.)

100 Creditsto be

evaluated at inV Sem.

Total 13 5 8 120 360 620 22

(BTBSC301) Engineering Mathematics III

Unit 1: Laplace TransformDefinition – conditions for existence ; Transforms of elementary functions; Properties of Laplacetransforms - Linearity property, first shifting property, second shifting property, transforms offunctions multiplied by tn, scale change property, transforms of functions divided by t, transforms ofintegral of functions, transforms of derivatives ; Evaluation of integrals by using Laplace transformTransforms of some special functions- periodic function, Heaviside-unit step function, Dirac deltafunction. [07 Hours]Unit 2: Inverse Laplace TransformIntroductory remarks ; Inverse transforms of some elementary functions ; General methods offinding inverse transforms ; Partial fraction method and Convolution Theorem for finding inverseLaplace transforms ; Applications to find the solutions of linear differential equations andsimultaneous linear differential equations with constant coefficients. [07 Hours]Unit 3: Fourier TransformDefinitions – integral transforms ; Fourier integral theorem (without proof) ; Fourier sine and cosineintegrals ; Complex form of Fourier integrals ; Fourier sine and cosine transforms ; Properties ofFourier transforms ; Parseval’s identity for Fourier Transforms. [07 Hours] Unit 4: Partial Differential Equations and Their ApplicationsFormation of Partial differential equations by eliminating arbitrary constants and functions;Equations solvable by direct integration; Linear equations of first order (Lagrange’s linearequations); Method of separation of variables – applications to find solutions of one dimensional

heat flow equation ( ∂u∂ t

=c2 ∂2 u∂ x2 ) , and two dimensional heat flow equation (i.e. Laplace equation :

∂2u∂ x2 +

∂2 u∂ y2 =0 ). [07 Hours]

Unit 5: Functions of Complex Variables (Differential calculus)Limit and continuity of f(z); Derivative of f(z) ; Analytic functions; Cauchy- Riemann equations inCartesian and polar forms; Harmonic functions in Cartesian form; Mapping: Translation,magnification and rotation, inversion and reflection , bilinear transformation; Conformal mapping.

[07 Hours]Unit 6: Functions of Complex Variables (Integral calculus) Cauchy’s integral theorem; Cauchy’s integral formula; Residues; Cauchy’s residue theorem (Alltheorems without proofs). [07 Hours]Text Books

1. Higher Engineering Mathematics by B. S. Grewal, Khanna Publishers, New Delhi.2. Advanced Engineering Mathematics by Erwin Kreyszig, John Wiley & Sons, New York.3. A Course in Engineering Mathematics (Vol III) by Dr. B. B. Singh, Synergy Knowledge

ware, Mumbai.4. A Text Book of Applied Mathematics (Vol I & II) by P. N. Wartikar and J. N. Wartikar,

Pune Vidyarthi Griha Prakashan, Pune.5. Higher Engineering Mathematics by H. K. Das and Er. Rajnish Verma, S. Chand & CO.

Pvt. Ltd., New Delhi. Reference Books

1. Higher Engineering Mathematics by B. V. Ramana, Tata McGraw-Hill Publications, NewDelhi.

2. A Text Book of Engineering Mathematics by Peter O’ Neil, Thomson Asia Pte Ltd.,Singapore.

3. Advanced Engineering Mathematics by C. R. Wylie & L. C. Barrett, Tata Mcgraw-HillPublishing Company Ltd., New Delhi.

4. Integral Transforms and Their Engineering Applications by Dr. B. B. Singh, Synergy .Knowledge ware, Mumbai.

5. Integral Transforms by I. N. Sneddon, Tata McGraw-Hill, New York.

BTCOC302 Discrete Mathematics

Unit 1 6 hrsFundamental Structures and Basic Logic: Sets, Venn diagram, Cartesian product, Power sets,Cardinality and countability, Propositional logic, Logical connectives, Truth tables, Normal forms,Validity, Predicate logic, Limitations of predicate logic, Universal and existential quantification, Firstorder logic.Principles of Mathematical Induction: The Well-Ordering Principle, Recursive definition, TheDivision algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean Algorithm, TheFundamental Theorem of Arithmetic.

Unit 2 6 hrsFunctions and Relations: Subjective, Injective, Bijective and inverse functions, Composition offunction, Reflexivity, Symmetry, Transitivity and equivalence relations.

Unit 3 6 hrsCombinatorics: Counting, Recurrence relations, generating functions.

Unit 4 6 hrsGraph Theory: Basic terminology, Multi graphs and weighted graphs, Paths and circuits, Shortestpath problems, Euler and Hamiltonian paths, Representation of graph, Isomorphic graphs, Planargraphs, Connectivity, Matching Coloring.

Unit 5 6 hrs

Trees: Rooted trees, Path length in rooted tree, Binary search trees, Spanning trees and cut set,Minimal spanning trees, Kruskal’s and Prim’s algorithms for minimal spanning tree.

Unit 6 6 hrs

Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, SemiGroups, Monoids, Groups, Congruence Relation and Quotient79 Structures, Free and CyclicMonoids and Groups, Permutation Groups, Substructures, Normal Subgroups, Algebraic Structureswith two Binary Operation, Rings, Integral Domain and Fields. Boolean Algebra and Boolean Ring,Identities of Boolean Algebra, Duality, Representation of Boolean Function, Disjunctive andConjunctive Normal Form.

Reference Books:1. Lipschutz, Discrete Mathematics, McGraw-Hill Publication, 3rd Edition, 2009.2. V. K. Balakrishnan, Schaum's Outline of Graph Theory, McGraw-Hill Publication, 1st

Edition, 1997.3. Eric Gossett, Discrete Mathematics with Proof, Wiley Publication, 2nd Edition, 2009.

Text Books:1. C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill Publication, 3rd Edition, 2008.2. Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw-Hill Publication, 6th

Edition, 2010.3. Y. N. Singh, Discrete Mathematical Structures, Wiley Publication, 1st Edition, 2010.4. Dr. Sukhendu Dey, Graph Theory with Applications, SPD Publication, 1st Edition, 2012.

BTCOC303 Data StructuresUnit 1 6 hrs

Introduction: Data, Data types, Data structure, Abstract Data Type (ADT), representation ofInformation, characteristics of algorithm, program, analyzing programs.

Unit 2 6 hrs

Arrays and Hash Tables: Concept of sequential organization, linear and non-linear data structure,storage representation, array processing sparse matrices, transpose of sparse matrices. Hash Tables,Direct address tables, Hash tables, Hash functions, Open addressing, Perfect hashing.

Unit 3 6 hrs

Searching and Sorting: Sequential, binary searching, skip lists – dictionaries, linear listrepresentation, skip list representation, operations – insertion, deletion and searching. Insertionsort, selection sort, radix sort, File handling.

Unit 4 6 hrs

Linked Lists: Concept of linked organization, singly and doubly linked list and dynamic storagemanagement, circular linked list, operations such as insertion, deletion, concatenation, traversal oflinked list, dynamic memory management, garbage collection.

Unit 5 6 hrs

Stacks and Queues: Introduction, stack and queue as ADT, representation and implementation ofstack and queue using sequential and linked allocation, Circular queue and its implementation,Application of stack for expression evaluation and expression conversion, recursion, priorityqueue.

Unit 6 6 hrs

Trees and Graphs: Basic terminology, binary trees and its representation, insertion and deletionof nodes in binary tree, binary search tree and its traversal, threaded binary tree, Heap, BalancedTrees. Terminology and representation of graphs using adjacency matrix, Warshall’s algorithm.

Reference Books:1. E. Horowitz, S. Sahani, Fundamentals of Data Structures, Galgotia Publication, 1st Edition,

1983.2. Thomas Cormen, Introduction to Algorithms, PHI Publication, 2nd Edition, 2002.3. Venkatesan & Rose, Data Structures, Wiley Publication, 1st Edition, 2015.4. Goodrich & Tamassia, Data Structure & Algorithm in C++, Wiley Publication, 2nd Edition,

2011.5. R. G. Dromey, “How to Solve it by Computer”, 2nd Impression, Pearson Education.6. Kyle Loudon, Mastering Algorithms with C: Useful Techniques from Sorting to Encryption,

O'Reilly Media, 1st Edition, 1999.

Text Books: 1. Mark Allen Weiss, Data structures and algorithms analysis in C++, Pearson Education, 4th

Edition, 2013. 2. S. Lipschutz, Data Structures, McGraw-Hill Publication, Revised 1st Edition, 2014.3. Y. Langsm, M. Augenstin, A. Tanenbaum, Data Structure using C and C++, Prentice Hall

India Learning Private Limited, 2nd Edition, 1998. 4. Trembley and Sorenson, Introduction to Data Structures, PHI Publication, 2nd Revised

Edition, 1983.5. Vishal Goyal, Lalit Goyal, A Simplified Approach To Data Structure, SPD Publication, 1st

Edition, 2014.

BTCOC304 Computer Architecture and OrganizationUnit 1 6 hrs

Introduction: Concept of computer organization and architecture, Fundamental unit, Computerfunction and interconnection, CPU structure and function.

Unit 2 6 hrs

Instruction Sets: Characteristics, Types of operands, Types of operations, Assembly language,Addressing modes, Instruction format, Types of instruction, Instruction execution, Machine stateand processor status, Structure of program, Introduction to RISC and CISC architecture.

Unit 3 6 hrs

Computer Arithmetic: The arithmetic and logic Unit, Integer representation, Integer arithmetic,Floating point representation, Floating point arithmetic, Introduction of arithmetic co-processor.

Unit 4 6 hrs

Memory Organization: Internal Memory: Semiconductor main memory, Error correction,Advanced DRAM organization, Virtual memory systems and cache memory systems. ExternalMemory: Organization and characteristics of magnetic disk, Magnetic tape, Optical memory,RAID, Memory controllers.

Unit 5 6 hrs

Control Unit: Control unit operation: Micro-operations, Control of the processor, Hardwiredimplementation, Micro-programmed Control Unit, Basic concepts, Micro-instruction sequencing,Micro-instruction execution, Applications of micro-programming.

Unit 6 6 hrs

Input/ Output Organization: External devices, I/O module, Programmed I/O, Interrupt driven I/O, Direct memory access, I/O channels and processors, External interface.Instruction pipe-lining: Concepts. Parallel processing: Multiple processor organization,Symmetric multiprocessor, Cache coherence and the MESI protocol.

Reference Books: Hennessy and Patterson, Computer Architecture: A Quantitative Approach, Morgan and

Kaufman Publication, 4th Edition, 2007. Morris Mano, Computer System Architecture, Pearson Education India, 3rd Edition, 2007. Mostafa Abd-El-Barr, Hesham El-Rewini, Fundamentals of Computer Organization and

Architecture, Wiley Publication, 1st Edition, 2004. Miles J. Murdocca, Vincent P. Heuring, Computer Architecture and Organization: An

Integrated Approach, Wiley Publication, 1st Edition, 2007. Sajjan G. Shiva, Computer Organization, Design, and Architecture, CRC Press, 5th Edition,

2013.

Text Books: William Stalling, Computer Organization and Architecture: Designing for Performance,

Prentice Hall Publication, 8th Edition, 2009. Hayes, Computer Architecture and Organization, McGraw-Hill Publication, 3rd Edition,

2012. Zaky, Computer Organization, McGraw-Hill Publication, 5th Edition, 2011.

BTCOC305 Digital Electronics & MicroprocessorUnit 1 6 hrs

Digital signals, digital circuits, AND, OR, NOT, NAND, NOR and Exclusive-OR operations,Boolean algebra, examples ofICgates, Number Systems: binary, signed binary, octal hexadecimalnumber, binary arithmetic, one’s and two’s complements arithmetic, codes, error detecting andcorrecting codes.

Unit 2 6 hrs

Combinational Digital Circuits:Standard representation for logic functions, K-map representation, simplification of logic functionsusing K-map, minimization of logical functions. Don’t care conditions, Multiplexer, De-Multiplexer/Decoders, Adders, Subtractors, BCD arithmetic, carry look ahead adder, serial adder,ALU, elementary ALU design, parity checker / generator.

Unit 3 6 hrs

Sequential circuits and systems:A 1-bit memory, the circuit properties of Bistable latch, the clocked SR flip flop, J- K - T and D-types flip flops, applications of flip flops, shift registers, applications of shift registers, serial toparallel converter, parallel to serial converter, ring counter, sequence generator, ripple(Asynchronous) counters, synchronous counters, counters design using flip flops, special counterIC’s, asynchronous sequential counters, applications of counters.

Unit 4 6 hrs

Fundamentals of Microprocessors:Fundamentals of Microprocessor, Comparison of 8-bit, (8085) 16-bit (8086), and 32-bitmicroprocessors (80386). The 8086 Architecture: Internal Block Diagram, CPU, ALU, address, data and control bus,Working registers, SFRs, Clock and RESET circuits, Stack and Stack Pointer, Program Counter, I/O ports, Memory Structures, Data and Program Memory, Timing diagrams and Execution Cycles.

Unit 5 6 hrs

Memory Interfacing. I/O Interfacing. Direct Memory Access. (DMA). Interrupts in 8086.

Unit 6 6 hrs

8086 Instruction Set and Programming:Addressing modes: Introduction, Instruction syntax, Data types, Subroutines Immediateaddressing, Register addressing, Direct addressing, Indirect addressing, Relative addressing,Indexed addressing, Bit inherent addressing, bit direct addressing. Instruction timings. Datatransfer instructions, Arithmetic instructions, Logical instructions, Branch instructions, Subroutineinstructions, Bit manipulation instruction. Assembly language programs, C language programs.Assemblers and compilers. Programming and debugging tools.

Text Books: 1. R. P. Jain, "Modern Digital Electronics", McGraw Hill Education, 2009.2. M. M. Mano, "Digital logic and Computer design", Pearson Education India, 2016.3. A. Kumar, "Fundamentals of Digital Circuits", Prentice Hall India, 2016.4. Douglas Hall, Microprocessors and Interfacing, McGraw-Hill Publication, Revised 2nd

Edition, 2006.

BTHMC306-Basic Human Rights

Unit 1 6 hrs

The Basic Concepts:Individual, Group, Civil Society, State, Equality, Justice, Human Values: - Humanity, Virtues,Compassion.

Unit 2 6 hrs

Human Rights and Human Duties: Origin, Civil and Political Rights, Contribution of American Bill of Rights, French Revolution,Declaration of Independence, Rights of Citizen, Rights of working and Exploited people,Fundamental Rights and Economic program, India’s Charter of freedom.

Unit 3 6 hrs

Society, Religion, Culture, and their Inter-Relationship:Impact of Social Structure on Human behaviour, Roll of Socialization in Human Values, Scienceand Technology, Modernization, Globalization, and Dehumanization.

Unit 4 6 hrs

Social Structure and Social Problems:Social and Communal Conflicts and Social Harmony, Rural Poverty, Unemployment, BondedLabour, Migrant workers and Human Rights Violations, Human Rights of mentally and physicallychallenged.

Unit 5 6 hrs

State, Individual Liberty, Freedom and Democracy:The changing of state with special reference to developing countries, Concept of developmentunder development and Social action, need for Collective action in developing societies andmethods of Social action, NGOs and Human Rights in India: - Land, Water, Forest issues.

Unit 6 6 hrs

Human Rights in Indian Constitution and Law:The constitution of India:(i) Preamble(ii) Fundamental Rights (iii) Directive principles of state policy(iv) Fundamental Duties(v) Some other provisions Universal declaration of Human Rights and Provisions of India, Constitution and Law, NationalHuman Rights Commission and State Human Rights Commission.

Text / Reference Books: Shastry, T. S. N., India and Human rights: Reflections, Concept Publishing Company India

(P Ltd.), 2005. Nirmal, C.J., Human Rights in India: Historical, Social and Political Perspectives (Law in

India), Oxford India.

BTCOL307 Python Programming

One hour per week is for program demonstration and instruction which can be conducted as aclassroom session or lab session.Module 1: 2 Hrs.Informal introduction to programming, algorithms and data structures, Downloading and installingPython, run a simple program on Python interpreter.Module 2: 2 Hrs.Variables, operations, control flow – assignments, conditionals, loops, functions: optionalarguments, default values, Passing functions as arguments.

Module 3: 2 Hrs.Statements, Expressions, Strings: String processing. Exception handling, Basic input/output,Handling files.

Module 4: 2 Hrs.Class and Object, Data Structure: List, Tuple and Sequences, Set, Dictionaries.

Module 5: 4 Hrs.Using Database and Structured Query Languages (SQL): SQLite manager, Spidering Twitter usinga Database, Programming with multiple tables, JOIN to retrieve data.*Programming assignments are mandatory.Reference Books:

1. Mark Lutz, Learning Python, O'Reilly Media, 5th Edition, 2013.2. Mark Pilgrim, Dive into Python 3, Apress Publication, 2nd Edition, 2009.3. Allen B. Downey, Think Python, O'Reilly Media, 2nd Edition, 2012.4. Jon Kleinberg and Eva Tardos, Algorithm Design, Pearson Education, 1st Edition, 2006.

Text Books:1. Michael Urban and Joel Murach, Murach’s Python Programming, Murach's Publication,

2016.2. Charles Severance, Python for Informatics: Exploring Information, University of Michigan,

Version 2.7.0, 2014.3. Dr. R. Nageswara Rao, Core Python Programming, Dreamtech Press, 1st Edition, 2016.

BTCOL308 HTML and JavaScript

Unit 1 2 hrs

Web Site development Essentials: Overview of Web Design Concepts, Web DevelopmentTeams, Web Project Management Fundamentals, Web Site Development Process, Web PageLayout and Elements, Web Site Usability and Accessibility, Configure Browsers Setting,Navigation Concepts, Web Graphics, Multimedia and the Web.

Unit 2 2 hrs

Hyper Text Markup Language (HTML): HTML and the Evolution of Markup languages, CreateHyperlinks, Create Tables, Create Web Forms, Image Inserting Techniques, Create Frames, GUIHTML Editors, Site Content and Metadata.

Unit 3 2 hrs

Introduction to Client-Server Model: Features of Dreamweaver Interface, Setting Up a Site withDreamweaver, FTP -Site Upload Feature of Dreamweaver, Create various types of Links, Insertmultimedia including text, image, animation & video, Finding a Home for your WordPress Site,Installing WordPress on Your Site, Content Management using WordPress, Selecting the RightTools, Image Formats, Fonts and Colors, Designing Your WordPress Site, The WordPress DefaultLayout, Creating a Custom Site.

Unit 4 2 hrs

Cascading Style Sheets: Cascading Style Sheets for Web page design, Creating CSS rules inDreamweaver, Format Text with CSS, Use of CSS Selectors, Embed Style Sheets, and AttachExternal Style Sheets.Using CSS with Tables: Insert and Styling Tables, Import Table Data, Style Tables with CSS, Sort

Data in Table.

Unit 5 4 hrs

JavaScript first steps; JavaScript first steps overview; What is JavaScript?; A first splash intoJavaScript; What went wrong? Troubleshooting JavaScript; Storing the information you need —Variables; Basic in JavaScript — Numbers and operators; Handling text — Strings in JavaScript;Useful string methods; Arrays; Making decisions in your code — Conditionals; Looping code;Functions — Reusable blocks of code; Build your own function; Function return values;Introduction to events

*Programming assignments are mandatory.

Reference Books:J. N. Robbins, Learning Web Design, O'Reilly Media, 4th Edition, 2012.Steven M. Schafer, HTML, XHTML, and CSS Bible, Wiley India, 5th Edition, 2010.John Duckett, Beginning HTML, XHTML, CSS, and JavaScript, Wiley India, 3rd Edition, 2009.Hal Stern, David Damstra, Brad Williams, Professional WordPress: Design and Development,

Wrox Publication, 3rd Edition, 2015.E. Robson, E. Freeman, Head First HTML & CSS, O’Reilly Media, 2nd Edition, 2012.

BTCOL309 Data Structure LaboratoryList of Experiments:

1. Write a program to implement stack using arrays.2. Write a program to evaluate a given postfix expression using stacks.3. Write a program to convert a given infix expression to postfix form using stacks.4. Write a program to implement circular queue using arrays.5. Write a program to implement double ended queue (dequeue) using arrays.6. Write a program to implement a stack using two queues such that the push operation

runs in constant time and the pop operation runs in linear time.7. Write a program to implement a stack using two queues such that the push operation

runs in linear time and the pop operation runs in constant time.8. Write a program to implement a queue using two stacks such that the enqueue

operation runs in constant time and dequeue operation runs in linear time.9. Write programs to implement the following data structures: (a) Single linked list (b)

Double linked list.10. Write a program to implement a stack using a linked list such that the push and pop

operations of stack still take O(1) time.11. Write a program to create a binary search tree (BST) by considering the keys in

given order and perform the following operations on it. (a) Minimum key (b)Maximum key (c) Search for a given key (d) Find predecessor of a node (e) Findsuccessor of a node (f) delete a node with given key.

12. Write a program to construct an AVL tree for the given set of keys. Also writefunction for deleting a key from the given AVL tree.

13. Write a program to implement hashing with (a) Separate Chaining and (b) Openaddressing methods.

14. Implement the following sorting algorithms: (a) Insertion sort (b) Merge sort (c)Quick sort (d) Heap sort.

15. Write programs for implementation of graph traversals by applying: (a) BFS (b)DFS

BTCOL310 Digital Electronics and Microprocessor Laboratory

List of Experiments:

1. Simplification, realization of Boolean expressions using logic gates/universalgates.

2. Realization of half/full adder & half/full subtractors using logic gates.3. Realization of parallel adder/subtractors using 7483 chip, BCD to Excess-3code

conversion & vice versa.4. Realization of binary to gray code conversion & vice versa.5. MUX/DEMUX – use of 74153, 74139 for arithmetic circuits & code converter.6. Realization of one/two bit comparator and study of 7485 magnitude comparator.7. Use of a) Decoder chip to drive LED display & b) Priority encoder.8. Truth table verification of flip-flops: i) JK Master Slave ii) T type iii) D type.9. Realization of 3-bit counters as a sequential circuit & MOD-N counter design

(7476, 7490, 74192, 74193).10. Writing & testing of sequence generator.11. Design of FSM: Moore machine, Mealy machine.

BTCOC401 Design and Analysis of Algorithms

Unit 1 6 hrs

Introduction to Algorithms: Definition of Algorithms, Properties of Algorithms, ExpressingAlgorithm, Flowchart, Algorithm Design Techniques, Performance Analysis of Algorithms, Typesof Algorithm's Analysis, Order of Growth, Asymptotic Notations, Recursion, RecurrencesRelation, Substitution Method, Iterative Method, Recursion Tree, Master Theorem, ChangingVariable, Heap Sort.

Unit 2 6 hrs

Divide and Conquer: Introduction to Divide and Conquer Technique, Binary Search, Merge Sort,Quick Sort, Strassen’s Matrix Multiplication.

Unit 3 6 hrs

Greedy Algorithms: Introduction to Greedy Technique, Greedy Method, Optimal Merge Patterns,Huffman Coding, Knapsack Problem, Activity Selection Problem, Job Sequencing with Deadline,Minimum Spanning Tree, Single-Source Shortest Path Algorithm.

Unit 4 6 hrs

Dynamic Programming: Introduction, Characteristics of Dynamic Programming, Component ofDynamic Programming, Comparison of Divide-and-Conquer and Dynamic ProgrammingTechniques, Longest Common Sub-sequence, matrix multiplication, shortest paths: Bellman Ford,Floyd Warshall, Application of Dynamic Programming.

Unit 5 6 hrs

Backtracking: Backtracking Concept, N–Queens Problem, Four–Queens Problem, Eight–QueenProblem, Hamiltonian Cycle, Sum of Subsets Problem, Graph Coloring Problem.

Branch and Bound: Introduction, Traveling Salesperson Problem, 15-Puzzle Problem,Comparisons between Backtracking and Branch and Bound.

Unit 6 6 hrs

Tree: Introduction, B-tree, Red-Black Tree (RBT): Insertion, Deletion.NP Completeness: Introduction, The Complexity Class P, The Complexity Class NP, Polynomial-Time Reduction, The Complexity Class NP-Complete.

Reference Books:1. Aho, Ullman, Data Structure and Algorithms, Addison-Wesley Publication, 1st Edition,

1983.2. Michel Goodrich, Roberto Tamassia, Algorithm Design – Foundation, Analysis & Internet

Examples, Wiley Publication, 2nd Edition, 2006.3. George T. Heineman, Gary Pollice, Stanley Selkow, Algorithms in a Nutshell, A Practical

Guide, O'Reilly Media, 2nd Edition, 2016.

Text Books:1. Cormen, Introduction to Algorithms, PHI Publication, 2nd Edition, 2002.2. Ellise Horowitz, Sartaj Sahni, S. Rajasekaran, Fundamentals of Computer Algorithms,

University Press (India) Private Ltd, 2nd Edition, 2008.3. Sara Base, Computer algorithms: Introduction to Design and Analysis, Addison-Wesley

Publication, 2nd Edition, 1988.

BTCOC402 Probability and Statistics

Unit 1 6 hrs

Probability Theory: Definition of probability: classical, empirical and axiomatic approach ofprobability, Addition theorem of probability, Multiplication theorem of probability, Bayes’ theoremof inverse probability, Properties of probabilities with proofs, Examples.

Unit 2 6 hrs

Random Variable and Mathematical Expectation: Random variables, Probability distributions,Probability mass function, Probability density function, Mathematical expectation, Join andmarginal probability distributions, Properties of expectation and variance with proofs.

Unit 3 6 hrs

Theoretical Probability Distributions: Binomial distribution, Poisson distribution, Normaldistribution, Fitting of binomial distributions, Properties of binomial, Poisson and normaldistributions, Relation between binomial and normal distributions, Relation between Poisson andnormal distributions, Importance of normal distribution, Examples.

Unit 4 6 hrs

Correlation: Introduction, Types of correlation, Correlation and causation, Methods of studyingcorrelation, Karl Pearson's correlation coefficient, Spearman’s rank correlation, Coefficient,Properties of Karl Pearson's correlation coefficient and Spearman’s rank correlation coefficient,Probable errors.

Unit 5 6 hrs

Linear Regression Analysis: Introduction, Linear and non-linear regression, Lines of regression,Derivation of regression lines of y on x and x on y, Angle between the regression lines,Coefficients of regression, Theorems on regression coefficient, Properties of regression coefficient.

Unit 6 6 hrs

Applied Statistics: Curve fitting by the method of least squares- fitting of straight lines, seconddegree parabolas and more general curves. Test of significance: Large sample test for singleproportion, difference of proportions, single mean, difference of means, and difference of standarddeviations.

Reference Books:1. Kishor S. Trivedi, Probability, Statistics with Reliability, Queuing and Computer

Science Applications, Wiley India Pvt. Ltd, 2nd Edition, 2001.2. Vijay K. Rohatgi, A. K. Md. Ehsanes Saleh, An Introduction To Probability And

Statistics, Wiley Publication, 2nd Edition, 2001.

Text Books:1. S. C. Gupta, Fundamentals of Statistics, Himalaya Publishing House, 7th Revied and

Enlarged Edition, 2016.2. G. V. Kumbhojkar, Probability and Random Processes, C. Jamnadas and Co., 14th

Edition, 2010.3. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,

2006.4. Veerarajan T., Engineering Mathematics (for semester III), Tata McGraw-Hill, New

Delhi, 2010.5. G. Haribaskaran, Probability, Queuing Theory and Reliability Engineering, Laxmi

Publications, 2nd Edition, 2009.6. Murray Spiegel, John Schiller, R. ALU Srinivasan, Probability And Statistics, Schaum's

Outlines, 4th Edition, 2013.

BTCOC403 Operating SystemUnit 1 6 hrs

Introduction and Operating system structures: Definition, Types of Operating system, Real-Time operating system, System Components- System Services, Systems Calls, System Programs,System structure. Virtual Machines, System Design and Implementation, System Generations.

Unit 2 6 hrs

Processes and CPU Scheduling: Process Concept, Process Scheduling, Operation on process,Cooperating processes. Threads, Inter-process Communication, Scheduling criteria, schedulingAlgorithms, Multiple-Processor Scheduling, Real-Time Scheduling, Scheduling Algorithms andperformance evaluation.

Unit 3 6 hrs

Process Synchronization The critical-section problem, Critical regions, SynchronizationHardware, Semaphores, Classical Problems of synchronization, and Monitors Synchronizations inSolaris.

Unit 4 6 hrs

Deadlocks: Systems Model, Deadlock characterization, Methods for handling Deadlocks,Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock,Combined approach to deadlock Handling.

Unit 5 6 hrs.

Memory Management: Basic concept, Logical and Physical address map, Memory allocation:Continuous Memory Allocation, Fixed and variable partition, Internal and external fragmentationand compaction, Paging: Principle of operation, Page allocation – Hardware support for paging,Protection and sharing, Disadvantages of paging.Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality ofreference, Page fault, Working Set, Dirty page/Dirty bit – Demand paging, Page Replacementalgorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) andLeast Recently used (LRU).

Unit 6 6 hrs.

I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of I/O Software:Goals of Interrupt handlers, Device drivers, sDevice independent I/O software, Secondary-StorageStructure: Disk structure, Disk scheduling algorithms.

File Management: Concept of File, Access methods, File types, File operation, Directorystructure, File System structure, Allocation methods (contiguous, linked, indexed), Free-spacemanagement (bit vector, linked list, grouping), directory implementation (linear list, hash table),efficiency and performance.

Reference Books:1. D. M. Dhamdhere, Systems Programming and Operating Systems, McGraw-Hill, 2nd

Edition, 1996.2. Garry Nutt, Operating Systems Concepts, Pearson Publication, 3rd Edition, 2003.3. Harvey M. Deitel, An Introduction to Operating Systems, Addison-Wesley Publication, 2nd

Edition, 1990.4. Thomas W. Doeppner, Operating System in Depth: Design and Programming, Wiley

Publication, 2011.Text Books:

1. Abraham Silberschatz, Peter B. Galvin and Greg Gagne, Operating System Concepts,Wiley Publication, 8th Edition, 2008.

2. Andrew S. Tanenbaum, Modern Operating System, PHI Publication, 4th Edition, 2015.

BTCOE404(A) Object-Oriented Programming using C++ (Elective I)Unit 1 6 hrs

Introduction to Object Oriented Programming and Objects and Classes: Need of objectoriented programming, The object oriented approach, Characteristics of object oriented languages.A class, Objects as data types, Constructors, Objects as function arguments, Returning objects.

Unit 2 6 hrs

Operator Overloading and Inheritance: Overloading unary and binary operators, Dataconversion. Derived and base class, Public and private inheritance, Levels of inheritance, Multipleinheritance Examples.

Unit 3 6 hrs

Polymorphism: Virtual functions, Dynamic binding, Abstract classes and pure virtual functions,Friend functions, this pointer.

Unit 4 6 hrs

Streams and Files: Streams, Stream output and input, Stream manipulators, Files and streams,Creating, Reading, Updating sequential and random files.

Unit 5 6 hrs

Templates and Exception Handling: Function templates, Overloading function templates, Classtemplates, Exception handling overview, Need of exceptions, An exception example, Multipleexceptions, Exception specifications.

Unit 6 6 hrs

Standard Template Library (STL): Introduction to STL-Containers, Iterators, Algorithms,Sequence containers, Associative containers, Container adapters.

Reference Books:1. Bjarne Stroustrup, The C++ Programming Language, Addison-Wesley Publication,

4th Edition, 2013.2. P. J. Deitel, H. M. Deitel, C++ How to Program, PHI Publication, 9th Edition, 2012. 3. John Hubbard, Programming with C++, Schaum’s Outlines, McGraw-Hill

Publication, 2nd Edition, 2000.4. Nicolai M. Josuttis, Object-Oriented Programming in C++, Wiley Publication, 1st Edition,

2002.

Text Books:1. E. Balagurusamy, Object Oriented Programming with C++, McGraw-Hill

Publication, 6th Edition, 2013. 2. Robert Lafore, Object Oriented Programming in C++, Sams Publishing, 4th Edition, 2001.3. Dr. B. B. Meshram, Object Oriented Paradigms with C++ Beginners Guide for C and

C++, SPD Publication, 1st Edition, 2016.4. Rajesh R. Shukla, Object-Oriented Programming in C++, Wiley India Publication, 1st

Edition, 2008.

BTCOE404(B) Object-Oriented Programming using Java (Elective I)Unit 1 6 hrs

Introduction to Computers and Java: Computers: Hardware and Software, Data Hierarchy,Computer Organization, Machine Languages, Assembly Languages and High-Level Languages,Introduction to Object Technology, Operating Systems, Programming Languages, Java and aTypical Java Development Environment, Your First Program in Java: Printing a Line of Text,Modifying Your First Java Program, Displaying Text with printf, Another Application: AddingIntegers, Memory Concepts, Arithmetic, Decision Making: Equality and Relational Operators.

Unit 2 6 hrs

Introduction to Classes, Objects, Methods and Strings: Introduction, Declaring a Class with aMethod and Instantiating an Object of a Class, Declaring a Method with a Parameter, InstanceVariables, set Methods and get Methods, Primitive Types vs. Reference Types, Initializing Objectswith Constructors Floating-Point Numbers and Type double.

Unit 3 6 hrs

Control Statements: Algorithms, Pseudocode, Control Structures, if Single-Selection Statement,if...else Double-Selection Statement, while Repetition Statement, Formulating Algorithms:Counter-Controlled Repetition, Formulating Algorithms: Sentinel-Controlled Repetition,Formulating Algorithms: Nested Control Statements, Compound Assignment Operators, Incrementand Decrement Operators, Primitive Types, Essentials of Counter-Controlled Repetition, forRepetition Statement, Examples Using for Statement, do...while Repetition Statement, switchMultiple-Selection Statement, break and continue Statements, Logical Operators.

Unit 4 6 hrs

Array: Introduction, Declaring and Creating Arrays, Examples Using Arrays, Case Study: CardShuffling and Dealing Simulation, Enhanced for Statement, Passing Arrays to Methods, CaseStudy: Class GradeBook Using an Array to Store Grades, Multidimensional Arrays, ase Study:Class GradeBook Using a Two-Dimensional Array, Variable-Length Argument Lists, UsingCommand-Line Arguments, Class Arrays.

Unit 5 6 hrs

Classes and Objects: Introduction, Controlling Access to Members, Referring to the CurrentObject’s Members with the this Reference, Time Class Case Study: Overloaded Constructors,Time, Default and No-Argument Constructors, Notes on Set and Get Methods, Composition,Enumerations, Garbage Collection and Method finalize, static Class Members, static Import, finalInstance Variables, Time Class Case Study: Creating Packages, Package Access.

Unit 6 6 hrs

Inheritance: Introduction, Superclasses and Subclasses, protected Members, Relationshipbetween Superclasses and Subclasses, Hierarchy Using private Instance Variables, Constructors inSubclasses Software Engineering with Inheritance, Class Object.Polymorphism: Introduction, Polymorphism Examples, Demonstrating Polymorphic Behavior,Abstract Classes and Methods, Case Study: Payroll System Using Polymorphism, final Methodsand Classes, Case Study: Creating and Using Interfaces.

Reference Book:1. Paul Deitel and Harvey Detail, Java: How to Program, Pearson's Publication, 9th Edition, 2. Joel Murach and Michael Urban, Murach’s Beginning Java with Eclipse, Murach's

Publication, 1st Edition, 2016.3. Doug Lowe, Java All-in-One For Dummies, Wiley Publication, 4th Edition, 2014.4. Herbert Schildt, Java The Complete Reference, McGraw-Hill Publication, 9th Edition, 5. Patrick Niemeyer, Daniel Leuck, Learning Java, O'Reilly Media, 4th Edition, 2013.

BTCOE405(A) Numerical Methods (Elective-II)This course preferably offered as a SWAYAM course

Unit 1 [5 Hrs.]Solution of Algebraic and Transcendental Equation: Bisection method, Method of false position,Newton’s method and Newton-Raphson method.

Unit 2 [5 Hrs.]Solution of Linear Simultaneous Equation: Gauss elimination method, Gauss-Jordan method,Iterative method of solution- Jacobi iteration method, Gauss-Seidal iteration method, Relaxationmethod.

Unit 3 [5 Hrs.]Finite Differences: Forward difference operator, Backward difference operator, Central differenceoperator, Newton’s interpolation formulae, Newton’s forward–backward-central interpolationformulae.

Unit 4 [5 Hrs.]Differentiation and Integration: Newton-Cortes formula, Trapezoidal rule, Simpson one–third rule,Simpson three- eighth rule.

Unit 5 Numerical Solution of ODE: Picard’s methods, Taylor series method, Euler’s method,Modified Euler’s method, Runge - Kutta method. [5 Hrs.] Text Books:

1. B.S Grewal, Higher Engineering Mathematics, 40 th edition, Khanna publication.2. S. S. Shastri, Introduction to Numerical Methods, PHI publication.3. V. Rajaraman, Computer Oriented Methods, 3 rd edition, PHI publication.

Reference Books:1. Conte and De boor, Elementary Numerical Analysis, BPB publication.2. E. Kreyszig, Advanced Engineering Mathematics, BPB publication.3. Steven C Chapra, Numerical Methods for Engineers, 5 th edition, McGraw Hill publication.

Equivalent SWAYAM/NPTEL Course

BTCOE405(B) Physics of Engineering Material (Elective-II)Unit I Magnetic Materials: 5hrs

Magnetic Materials: Origin of magnetization using atomic theory, classification of magneticmaterials and properties, Langevin’s theory of Dia, Para and ferromagnetism, Soft and Hardmagnetic materials and their uses, Domain theory of ferromagnetism, Hysteresis loss, Antferromagnetic and Ferromagnetic materials, Ferrites and Garnets, magnetic bubbles, magneticrecording. Unit II Conducting and Superconducting Materials: Band theory of solids, Classical freeelectron theory of metals, Quantum free electron theory, Density of energy states and carrierconcentration, Fermi energy, Temperature and Fermi energy distribution, Superconductivity, Factoraffecting Superconductivity, Meissner effect, Type-I and Type-II superconductors, BCS theory,Josephson effect, High temperature superconductors, Application of superconductors ( Cryotron,magnetic levitation) 5hrsUnit III Semiconducting Materials: Band structure of semiconductor, Charge carrierconcentration, Fermi level and temperature, Electrical conductivity, Hall effect in semiconductors,P-N junction diode, Preparation of single crystals, LED, Photovoltaic Cell 5hrsUnit IV Dielectric Materials: Dielectric constant and polarizability, types of polarization,temperature and frequency dependences of Dielectric parameter, internal fields in solids, Clausius-Mosotti equation, dielectric loss, dielectric breakdown, ferroelectric, pyroelectric and piezoelectricmaterials, applications of dielectric materials 5hrsUnit V Nano Materials: Nanomaterials : Introduction and properties, synthesis of nanomaterials,Carbon Nano Tubes, Characterization techniques of nanomaterials- SEM, TEM, EDAX, FMR,XRD. Applications of nanomaterials. 5hrs

Text Books:

1. C. Kittle ,“Introduction to Solid state Physics”.

2. C. M. Srivastava , C. Srinivasan , “Science of Engineering Materials and Carbon Nanotubes”.

3. A. J. Dekker, “Solid State Physics”.

Reference Books:

1. V. Raghavan, “Material Science and Engineering”.

2. A. J. Dekker, “Electrical Engineering Materials”.

BTCOE405(C) Soft Skills and Persnolity Development (Elective-II)This course preferably offered as a SWAYAM course

UNIT I Self Management: Self Management, Self Evaluation, Self discipline, Self criticism, Recognition of one’s own limits and deficiencies, dependency, etc.Self Awareness, Self Management, Identifying one’s strengths and weaknesses, Planning & Goal setting, Managing self-emotions, ego, pride,- Leadership & Team Dynamics

UNIT II Time Management Techniques Practice by game playing and other learning strategies to achieve the set targets Time Management Concept, Attendance, Discipline & Punctuality, Acting in time, Quality /Productive time.

UNIT IIIMotivation/ InspirationAbility to shape and direct working methods according to self-defined criteria, Ability to think for oneself, Apply oneself to a task independently with self-motivation, Motivation techniques :Motivation techniques based on needs and field situations

Unit IVInterpersonal Skills DevelopmentPositive Relationship, Positive Attitudes, Empathies: comprehending others’ opinions, points of views, and face them with understanding, Mutuality, Trust, Emotional Bonding, Handling Situations(Interview), Importance of interpersonal skills

Unit VEffective Computing SkillsDesigning an effective Presentation: Contents, appearance, themes in a presentation, Tone and Language in a presentation, Role and Importance of different tools for effective presentation

Reference books:1. Mitra, Barun, “Personality Development and Soft Skills”, Oxford University Press, 2016.2. Ramesh, Gopalswamy, “The Ace of Soft Skills: Attitude, Communication and Etiquette for

Success”, Pearson Education, 2013.3. Covey, Stephen R., “Seven Habits of Highly Effective People: Powerful Lessons in

Personal Change”4. Rosenberg Marshall B., “Nonviolent Communication: A Language of Life”.

BTXXC406 Product Design Engineering

Unit 1 6 hrs

Creating Simple Products and Modules.

Unit 2 6 hrs

Document Creation and Knowledge Sharing.

Unit 3 6 hrs

Self and Work Management.

Unit 4 6 hrs

Team Work and Communication.

Unit 5 6 hrs

Managing Health and Safety.

Unit 6 6 hrs

Data and Information Management.

Text / Reference Books:1. Model Curriculum for “Product Design Engineer – Mechanical”, NASSCOM (Ref. ID:

SSC/Q4201, Version 1.0, NSQF Level: 7)

2. Eppinger, S., & Ulrich, K.(2015). Product design and development. McGraw - Hill Higher

Education.

3. Green, W., & Jordan, P. W. (Eds.). (1999).Human factors in product design: current prac-

tice and future trends. CRC Press.

4. Sanders, M. S., & McCormick, E. J. (1993). Human factors in engineering and design Mc-

GRAW- HILL book company.

5. Roozenburg, N. F., &Eekels, J. (1995). Product design: fundamentals and methods (Vol. 2).

John Wiley & Sons Inc.

6. Lidwell, W., Holden, K., & Butler, J.(2010). Universal principles of designs, revised and

updated: 125 ways to enhance usability, influence perception, increase appeal, make better

design decisions, and teach through design. Rockport Pub.

BTCOL407 Design and Analysis of Algorithm Laboratory

List of Experiments:

1. Divide and conquer method (quick sort, merge sort, Strassen's matrix multiplication).2. Greedy method (knapsack problem, job sequencing, optimal merge patterns, minimal

spanning trees).3. Dynamic programming (multistage graphs, OBST, 0/1 knapsack, traveling sales

person problem).4. Obtain the Topological ordering of vertices in a given digraph.5. Back tracking (n-queens problem, graph coloring problem, Hamiltonian cycles).6. Selection: Minimum/ Maximum, Kth smallest element.7. Find optimal ordering of matrix multiplication. (Use Dynamic programming

method).8. Use dynamic programming algorithm to solve optimal binary search tree problem.9. Compute the transitive closure of a given directed graph using Warshall's algorithm.10. Write programs to find out a minimum spanning tree of a simple connected

undirected graph by applying: (a) Prim’s algorithm (b) Kruskal’s algorithm.11. Write a program to implement Dijkstra’s algorithm for solving single source shortest

path problem using priority queue.12. Write a program to implement Floyd-Warshall algorithm for solving all pairs shortest

path problem.

BTCOL408 Introduction to data science with RUnit 1: Introduction to Basics 2 hrsThe basic data types in R. Variables.

Module 2 Vectors and Matrices 4hrsVectors. Create, name and select elements from vectors. Learn how to work with matrices in R.Do basic computations with them and demonstrate your knowledge by analyzing the Star Warsbox office figures.

Module 3: Factors & Data Frames 2 hrsStoreing Categorical data in factors. Learn how to create, subset and compare categorical data.When working R, you’ll probably deal with Data Frames all the time. Therefore, you need to knowhow to create one, select the most interesting parts of it, and order them.

Module 4: Lists 2 hrsCreate, name and select elements from Lists

Module 5: Basic Graphics 2 hrsDiscover R’s packages to do graphics and create your own data visualizations.

*Programming assignments are mandatory.Reference Books:

1. Joel Grus, Data Science from Scratch: First Principles with Python, O'Reilly Media, 1st

Edition, 2015.2. Hadley Wickham, Garrett Grolemund, R for Data Science Import, Tidy, Transform,

Visualize, and Model Data, O'Reilly Media, 1st Edition, 2017.3. Nina Zumel, John Mount,“Practical Data Science with R”, Manning, 2014.

Text Books: 1. Rajendra Patil, Hiren dand, Rupali Dahake, A practical approach to R Tool, SPD

Publication, 1st Edition, 2017.

BTCOL409 Object Oriented Programming Laboratory

List of Experiments:1. Programs on Operators, Arithmetic Promotion, Method Calling.2. Programs on dealing with Arrays.3. Programs on Classes: String and Math.4. Programs on Inheritance and Polymorphism.5. Programs on Garbage collection, packaging, access Modifiers, as well as static and

abstract modifiers.6. Programs on Interfaces, block initializers, final Modifier, as well as static and dynamic

binding.7. Programs on file handling and stream manipulation.8. Programs on Dynamic Polymorphism.9. Programs on Dynamic Memory Management.10. Programs on Exception Handling.11. Programs on generic programming using templates.12. Programs on STL-containers and iterators.

BTCOL410 Operating Systems Laboratory1. Hands on Unix Commands2. Shell programming for file handling.3. Shell Script programming using the commands grep, awk, and sed.4. Implementation of various CPU scheduling algorithms (FCFS, SJF, Priority).5. Implementation of various page replacement algorithms (FIFO, Optimal, LRU).6. Concurrent programming; use of threads and processes, system calls (fork and v-fork).7. Study pthreads and implement the following: Write a program which shows the performance8. Improvement in using threads as compared with process.(Examples like Matrix

Multiplication,9. Hyper Quick Sort, Merge sort, Traveling Sales Person problem).10. Implementation of Synchronization primitives – Semaphore, Locks and Conditional

Variables.11. Implementation of Producer-Consumer problem, Bankers algorithm.12. Implementation of various memory allocation algorithms, (First fit, Best fit and Worst fit),

Disk13. Scheduling algorithms (FCFS, SCAN, SSTF, C-SCAN).14. Kernel reconfiguration, device drivers and systems administration of different operating

systems.15. Writing utilities and OS performance tuning.

Curriculum under Choice Based Credit & Grading System

Revised Syllabus of

Bachelor of Engineering

Third Year

Computer Science & Engineering/IT

Under the Faculty of Science & Technology

[ Effective from the Academic Year 2018-19 & onwards/-

Dr. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY, AURANGABAD FACULTY OF SCIENCE AND TECHNOLOGY

Board of Studies in Computer Science and Engineering Curriculum structure of TE CSE/IT

PART-I

Sub Code

Semester-I

Contact Hrs/Week Examination Scheme Duration of

The Theo

ry Examination

Subject L T P Total

CT TH TW PR Total credit

s

CSE301 Operating Systems 4 -- -- 4 20 80 -- -- 100 4 3 HrsCSE302 Theory of Computation 4 -- -- 4 20 80 -- -- 100 4 3 Hrs

CSE303 Database Management Systems

4 -- -- 4 20 80 -- -- 100 4 3 Hrs

CSE304 Programming in JAVA 4 -- -- 4 20 80 -- -- 100 4 3 HrsCSE341 CSE342 CSE343

Elective –I 4 -- -- 4 20 80 -- -- 100 4 3 Hrs

CSE321 Lab 1: Database Management Systems

-- -- 2 2 -- -- -- 50 50 1

CSE322 Lab 2: Programming in JAVA

-- -- 2 2 -- -- -- 50 50 1

CSE323 CSE324 CSE325

Lab 3: Elective –I -- -- 2 2 -- -- 50 -- 50 1

CSE326 Lab 4: Software Development Lab-I (ASP.NET using C#)

-- 2 2 -- -- -- 50 50 1

BSH305 Communication Skills- II

2 -- -- 2 -- -- 50 -- 50 2

Total 22 -- 8 30 100 400 100 150 750 26

PART - II

Sub Code

Semester-II


Subject L T P Total

CT TH TW PR Tota

l

Credits

Duration of The

Theory Examination

CSE351 Advanced JAVA 4 -- -- 4 20 80 -- -- 100 4 3 Hrs CSE352 Software Engineering 4 -- -- 4 20 80 -- -- 100 4 3 Hrs CSE353 Design and Analysis of

Algorithms 4 -- -- 4 20 80 -- -- 100 4 3 Hrs

ITD354

Ebusiness Systems (For IT) 4 -- -- 4 20 80 -- -- 100 4 3 Hrs

CSE354 Systems Programming (For CSE)


Elective-II 4 -- -- 4 20 80 -- -- 100 4 3 Hrs

CSE371 Lab 5: Advanced JAVA -- -- 2 2 -- -- -- 50 50 1 CSE372 Lab 6: Software Testing &

Quality Analysis -- -- 2 2 -- -- 50 -- 50 1

CSE373 Lab 7: Design and Analysis of Algorithms

-- -- 2 2 -- -- -- 50 50 1


Lab 8 Elective-II -- -- 2 2 -- -- 50 -- 50 1

CSE377 Lab 9 SDL-II (Android) -- -- 4 4 -- -- -- 50 50 2 Total of Semester II 20 -- 12 32 100 400 100 150 750 26 Total of Semester I & II 42 20 62 200 800 200 300 1500 52

Elective I & II:

Code Elective -I Code Elective - II CSE341 Computer Network

Architecture and Protocols CSE391 Distributed Operating System

CSE342 Digital Image Processing CSE392 Artificial Intelligence CSE343 Embedded Systems CSE393 Network Security

L: Lecture hours per week, T: Tutorial hours per week, P: Practical hours per week, CT: Class Test, TH: University Theory Examination, TW: Term Work, PR: Practical/Oral Examination


Third Year Engineering (CSE/IT) Semester – I

Course Code: CSE301 Title: Operating systems Teaching Scheme Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks

Theory Examination (Marks): 80 Marks Theory Examination (Duration): 03 Hours

Prerequisite: 1: Understanding of data structures and digital electronics, 2: Knowledge of basic computer, hardware components, microprocessor and peripheral components. 3: Programming skills in C, C++. Objectives: 1. Students should learn fundamentals which will help them to understand design of modern operating

system. 2. To study different components of OS. 3. Students should have overview of different types and structures of OS. 4. Should learn important system resources and their management policies. CONTENTS

SECTION A Unit 1: Introduction (6 hrs)

• Operating System as an extended machine , OS as a resource manager. • History of operating system: Generations- batch system, multiprogramming, time sharing,

multitasking, distributed, handheld computer system, embedded OS, real time OS and smart OS. Computer hardware review. OS concepts.

• Operating system structure: monolithic, layered systems, microkernel, client server models, virtual machines, exokernels, mainframe OS. System calls.

• Comparison of Linux, Windows, DOS Unit 2: Process management (8 hrs)

• Processes: Process Model, Process creation/termination, Hierarchies, process states (two state, five state), Implementation of process.

• THREAD: process and thread, thread functionality,user level and kernel level threads. • Interprocess Communication: race condition, critical regions, mutual exclusion with busy

waiting, sleep and wakeup, Producer consumer problem, semaphore, message passing,Monitors • Classical IPC Problem: Dining philosopher problems, Readers and writers problems.

• Process Scheduling, scheduling criteria, scheduling algorithms. Unit 3: File systems (6 hrs)

• Files: File Naming, File Types, Access, File operations, • Directories: Types, Operations. • File System Implementation: Layout, Implementation Files and directories. • File system management: Disk space management, File system consistency. • Comparison of Linux and windows file systems

SECTION B

Unit 4: Memory management (8 hrs) • Memory management strategies: Basic Hardware, Address binding, Logical vs Physical

Address space, Swapping, contiguous memory allocation. • Memory partitioning: fixed, dynamic partitioning, buddy system reallocation, fragmentation. • Managing free memory: memory management with bitmap, linked list. • Virtual memory: demand paging, page replacement algorithms- options, FIFO, LRU,

allocations of frames, thrashing and working set models. • Paging: Basic method, hardware support, structure of page table. • Segmentation: Basic method, hardware

Unit 5: Device management (6 hrs)

• Principles of I/O hardware: I/O device controllers • Principles of I/O software. • I/O software layers • Disk: disk hardware-magnetic disk, RAID, CDs, DVDs, Disk formatting, disk scheduling

algorithms, clocks Unit 6: Deadlock Management (6 hrs) Deadlock:

• Introduction to deadlocks: Resources- Types and resource acquisition. Conditions for resource deadlock, Deadlock Modelling.

• Deadlock detection and recovery with one resource and multiple resources. • Deadlock avoidance:- Resource trajectories, safe & unsafe states, bankers algorithm for single

and multiple resources • Deadlock Prevention.

Text Books: 1. Andrew S. Tanenbaum, “Modern Operating Systems”, Third Edition, Prentice Hall Publication. 2. Peter Galvin, Greg Gagne, Abraham Silberschatz, “Operating Systems Concepts”,

8th Edition,

Reference Book: 1. William Stallings, “Operating Systems: Internal and design Principles”, 7th Edition, Pearson

Education. Links : 1. http://stst.elia.pub.ro/news/SO/Modern%20Operating%20System%20-%20Tanenbaum.pdf

2. Comparison of LINUX and Windows file systems:- https://www.guru99.com/linux-differences.html

3. Memory management requirements & Memory partitioning: http://dinus.ac.id/repository/docs/ajar/Operating_System.pdf

4. Case study:- Windows 7:- http://codex.cs.yale.edu/avi/os-book/OSE1/slide-dir/PDF-dir/ch16.pdf

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus. For 80 marks Paper: 1. Minimum ten questions. 2. Five questions in each section. 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be

compulsory. 4. From the remaining questions in section A and B students are supposed to solve any two questions,

15 marks each.



Course Code: CSE302 Title: Theory of Computation Teaching Scheme Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Discrete mathematics

Objectives:

1. To introduce the fundamental concepts of formal languages, grammars and automata theory. 2. To study and develop fundamentals for computational theory. 3. To apply abstract models for solving problems in computing. 4. To understand the differences between decidability and undecidability.

CONTENTS SECTION A

Unit 1: Finite Automata (8 hrs) Introduction to Finite Automata, Structural representation, Automata and complexity. Chomsky Classification of languages, Central Concepts of Automata Theory, Deterministic Finite Automata, Nondeterministic Finite automata, FA with epsilon transitions, Applications of FA, FA with output : Moore and Mealy machine Unit 2: Regular Expressions and Languages (8 hrs) Regular Expressions, Finite automata and Regular Expression, Algebraic laws for RE, Ardens theorem, Pumping lemma for Regular languages, Applications of pumping lemma, Closure and Design properties of regular languages, Equivalence and minimization of Automata, Applications of Regular Expressions. Unit 3: Context Free Grammars and Languages (4 hrs) Context Free Grammars, Parse trees, Applications of CFG, Ambiguity in grammars and languages, Normal Forms for CFG: Chomsky Normal Form

SECTION B

Unit 4: Pushdown Automata and LBA (8 hrs)

Pushdown Automata – Definition, Languages of PDA, Acceptance by Empty Stack and Final State, Equivalence of PDA and CFG , Deterministic Pushdown Automata, Pumping lemma for CFL, The model of linear bounded Automata. Unit 5: Turing Machine (8 hrs) The Turing machine – Notation for TM, Instantaneous description for TM , Transition diagram for TM, The language of a TM, Design of Turing Machines, Church Turing Thesis, TM and halting, Extensions to the basic TM: Multitape TM, Nondeterministic TM, Universal TM. Unit 6: Decidability and Undecidability(4 hrs) Decidable problems,Decidable problems concerning Regular Language, Undecidable Problems, Simple Un-decidable Problem: Post Correspondence Problem, Intractable Problems: Classes P and NP. Text Books:

1. John E. Hopcroft , Rajeev Motwani , Jeffrey D. Ullman, “Introduction to Automata Theory Languages, and Computation” 3rd ed. , Pearson Education, ISBN: 81-317-1429-2

2. K.L.P. Mishra, N. Chandrasekaran, “Theory of Computer Science: Automata, Languages and Computation” 3rd ed. , PHI , ISBN : 978-81-203-2968-3

3. John C Martin, “Introduction to Languages and the Theory of Computation”, 3rd ed., Tata McGraw Hill, ISBN: 0-07-066048-4)

Reference Books:

1. Michael Sipser, Introduction to the Theory of Computation, CENGAGE Learning, 3rd Edition ISBBN-13:978-81-315-2529-6.

2. Basavaraj S. Anami, Karibasappa K. G. , “ Formal Languages and Automata Theory” Wiley Publication, ISBN : 978-81-265-2010-7

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus. For 80 marks Paper: 1. Minimum ten questions. 2. Five questions in each section. 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be


15 marks each.



Course Code: CSE303 Title: Database Management System Teaching Scheme Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks


Prerequisites: 1. Programming Concepts 2. Discrete Mathematics 3. Object Oriented Programming

Objectives:

1. To understand the different issues in the design and implementation of a database system 2. To design and build simple database systems 3. To retrieve information efficiently and effectively from database

CONTENTS

SECTION-A Unit 1: Introduction (06 hrs)

• DBMS and Database System Applications • Purpose of Database Systems • View of Data

• Data Abstraction • Instances and Schemas • Data Models

• Database Languages • DDL, DML

• Database Architecture • Database Users and Administrators • History of Database Systems.

Unit 2: Introduction to Database Design (08 hrs)

• Database Design and ER diagrams • Beyond ER Design

• Entities, Attributes And Entity sets • Relationships and Relationship sets • Additional features of ER Model

• Key Constraints • Participation Constraints • Weak Entities • Class Hierarchies • Aggregation

• Conceptual Design with the ER Model • Entity versus Attribute • Entity versus Relationship • Binary versus Ternary Relationships • Aggregation versus Ternary Relationships

• Case Study : The Internet Shop Unit 3: Relational Model (06 hrs)

• Relational Model Concepts • Domains, Attributes, Tuples and Relations • Characteristics of Relations

• Relational Model Constraints • Domain Constraints • Key Constraints and Constraints on Null Values • Relational Databases and Relational Database Schemas • Entity Integrity, Referential Integrity and Foreign Keys

• Relational Database Design Using ER-to-Relational Mapping

SECTION-B Unit 4: Relational Algebra and SQL (06 hrs)

• Relational Algebra • Selection and Projection • Set operations • Renaming • Joins • Examples of Algebra Queries

• SQL • SQL Data Definition • Specifying Constraints in SQL • Form of Basic SQL Query • Joins • Nested Queries • Aggregate Operators • NULL values • Views • Active Databases

Unit 5: Functional Dependencies and Normalization (06 hrs)

• Functional Dependencies • Definition of Functional Dependency • Inference Rules for Functional Dependencies • Equivalence of Sets of Functional Dependencies • Minimal Sets of Functional Dependencies

• Normal Forms based on Primary Keys • General Definitions of Second and Third Normal Forms • Boyce-Codd Normal Form • Properties for Relational Decompositions • Multi-valued Dependencies and 4NF • Join Dependencies and 5NF

Unit 6: Transaction Management (08 hrs)

• Transaction Support • Properties of Transactions

• Concurrency Control • The Need for Concurrency Control • Serializability and Recoverability • Locking Methods • Deadlock • Timestamping Methods

• Database Recovery • The Need for Recovery • Transactions and Recovery • Recovery Facilities • Recovery Techniques

Text Books:

1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, 5th Edition, Pearson Education

2. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database System Concepts”, 6th Edition, McGraw Hills

3. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, 3rd Edition, TATA McGraw Hill, 2003

Reference Books:

1. Thomas Connolly, Carolyn Begg “Database Systems, A Practical approach to Design implementation and Management”, Third Edition, , Pearson Education

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus. For 80 marks Paper:

1. Minimum ten questions 2. Five questions in each section 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be

compulsory. 4. From the remaining questions in section A and B students are supposed to solve any two



FACULTY OF SCIENCE AND TECHNOLOGY Third Year Engineering (CSE/IT)

Semester – I

Course Code: CSE304 Title: Programming in Java Teaching Scheme Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Basics of programming languages. 2. Concepts of Object Oriented Programming languages. Objectives: The students will be able to: 1. Apply object oriented features to real time entities. 2. Handle exceptions & implement multithreaded programs. 3. Implement database programming. 4. Design & implement GUI with event handling 5. Develop I/O & networking programs.

CONTENTS

SECTION-A Unit 1: Introduction (8 Hours)

• Features of Java, Java Virtual Machine, Byte Code, JIT Compiler • Class fundamentals, Declaring objects, Nested and Inner Classes, Introducing Methods,

Constructors, Garbage Collection • Overloading Methods, Using Objects as Parameters, Returning Objects, Access Control,

Understanding static & final keyword, • Inheritance Basics, Using Super, Method Overriding, Abstract Classes, Using final keyword

with inheritance • Arrays, Vectors, Strings, Wrapper classes • Using Command-Line Arguments

Unit 2: Packages & interfaces (6 Hours)

• Packages: Defining a Package, Finding Packages and CLASSPATH, A Short Package Example, Access Protection, Importing Packages

• Study of java.lang & java.util packages • Interfaces: Defining an Interface, Implementing Interfaces, Variables in Interfaces, Extending

Interfaces, • Multiple Inheritance

Unit 3: Exception Handling & Multithreaded Programming (6 Hours)

• Exception handling fundamentals, Exception Types, Using try-catch, Multiple try-catch clauses, Nested try statements, throw, throws, finally, Built-in Exceptions, creating your own exception subclasses

• The Java Thread Model, The Main Thread, Creating a Thread , Creating Multiple Threads, Using isAlive( ) and join( ), Thread Priorities, synchronization, Suspending, Resuming, and Stopping Threads

SECTION-B

Unit 4: Java Database Connectivity (4 Hours)

• Introduction, Types of JDBC Drivers , Driver interface & DriverManager class, Connection Interface , Statement Interface, PreparedStatement , ResultSet,

• JDBC Program for executing Statements & processing ResultSet ,Using PreparedStatement

Unit 5: Applet, Event Handling and AWT (10 Hours) • Applet: Applet Basics, An Applet Skeleton, Simple Applet Display Methods, Using the Status

Window, The HTML APPLET Tag, Passing Parameters to Applets • Event Handling: The Delegation Event Model, Event Classes, Sources of Events, Event

Listener Interfaces, Handling Mouse and Keyboard Events, Adapter Classes • Introduction to AWT , AWT classes, Window, Creating a Frame Window in an Applet,Working

with Graphics

Unit 6: Input /Output & Networking (6 Hours) • Input /Output: I/O Basics, Reading Console Input, Writing Console Output, The PrintWriter

Class, Reading and Writing Files, The Stream Classes, The Byte Streams, The Character Streams, Object Serialization & deserialization

• Networking: Networking Basics, The Networking Classes and Interfaces, TCP/IP Client Sockets, TCP/IP Server Sockets, Datagrams

Text / Reference Books: 1. Herbert Schildt , The Complete Reference- Java2 ,(Seventh Edition), Tata Mc Graw Hill 2. Steven Holzner , Java 2 Black Book,DreamTech Press 3.Deitel & Deitel ,Java: How to Program , PHI 4. Bert Bates, Kathy Sierra , Head First Java, O'Reilly Media, Inc. 5. E Balagurusamy , Programming with Java, Tata Mc Graw Hill

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus.

For 80 marks Paper: 1. Minimum ten questions 2. Five questions in each section 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be


15 marks each



Course Code: CSE341 Title: Computer Network Architecture and Protocols (Elective-I) Teaching Scheme Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Computer fundamentals 2. Computer Networks

Objectives:

1. To understand fundamental concepts of computer networking and functionality of layered network architecture.

2. To understand wireless and mobile networking concepts 3. To apply networking concepts to various situations, classifying networks, analyzing

performance of computer network infrastructure.

CONTENTS SECTION-A

Unit I : Network Layer (6 Hrs) Design issues, IPv4, Problems with IPv4, strategies to bridge the limitations (IP subnetting, CIDR, DHCP, NAT), Network design with CIDR, IPv6. Unit II: Network Layer Protocols (6 Hrs) Routing algorithms: Unicast protocols: RIP, EIGRP, OSPF, BGP and multicast routing protocols, ICMP, IGMP, DHCP Unit III: Transport Layer Protocols (8 Hrs) Services, Transport layer protocols, UDP, TCP, SCTP: State Transition diagram, flow control, error control, socket programming.

SECTION-B Unit IV : ATM Networks (8 Hrs) Design goals, Problems, Architecture and ATM Switching, ATM layers, Congestion Control and Quality of Service, ATM LAN’s, LAN Architecture, LAN Emulation client server model

Unit V :Wireless Networks and Protocols (6 Hrs) Link Layer: IEEE 802.11 WLAN protocols, CSMA/CA, Wireless Application Protocol, Routing Protocols & Location Awareness Strategies in Wireless Networks, Resource Allocation and management in Wireless Networks, TCP over wireless network. Unit VI: Applications (6 Hrs) Traditional Applications Telnet, SSH, SNMP: SMI, MIB, Multimedia: RTP, RTTP, VOIP, SIP, H.323. Text Books: 1. B. A. Forouzan, “Data Communications and Networking”, 5th Edition, Tata McGraw-Hill. 2. A S Tanenbaum, “Computer Networks”, 4th Edition, Pearson Education. 3. Vijay K Garg, Wireless Communications and Networking, Morgan Kaufmann. Reference Books: 1. William Stallings, “Data and computer Communication”, 7th Edition, Pearson Education. 2. Larry L Peterson and B S Davie, Computer Networks: A Systems Approach, Elsevier. 3. B. A. Forouzan, “TCP/IP Protocol Suite”, 4th Edition, Tata McGraw-Hill. PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus.



15 marks each.

Dr. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY, AURANGABAD FACULTY OF ENGINEERING AND TECHNOLOGY


Course Code: CSE342 Title: Digital Image Processing (Elective-I) Teaching Scheme Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks


Prerequisite: The Students should have knowledge of

1. Elements of visual perception 2. Basic linear algebra and Fourier transform 3. The sampling theorem, quantization. 4. Set theory

Objectives:

1. Students should be able to understand digital image processing beyond the fundamental level. 2. To study complete digital image processing steps. 3. Students should be able to choose appropriate image processing algorithm to achieve desired

result. 4. Students should be able to properly implement DIP algorithms using modern computing tools such as MATLAB, interpret and present the results. CONTENTS

SECTION-A Unit 1: Digital Image Fundamentals (08 Hours)

• Introduction: Image, Pixel, Digital image • Fundamental Steps and Components of Digital Image Processing • Brightness adaption and discrimination • Image sensing and Acquisition • Image Sampling and Quantization: Basic Concepts in Sampling and Quantization,

Representing Digital images, Spatial and intensity resolution • Relationships between pixels: Neighbors of a Pixel, Adjacency, Connectivity, Regions and

Boundaries, Distance Measures. • Basic Intensity Transformation: Image Negatives, Log transformation, Power law

Transformation, Piecewise Linear Transformation • Histogram processing: Definition, Histogram Equalization • Image Transforms: Discrete Fourier transform(DFT), DCT, Walsh Hadamard Transform.

Unit 2: Image Enhancement (06 Hours) Spatial Domain Methods:

• Fundamentals of Spatial Filtering: Mechanics of Spatial Filtering, Generating Spatial Filter Masks

• Noise Model • Smoothing Spatial Filters: Linear filters – Mean filters, Non-linear (Order Statistic) spatial

filters: Median, Mode, Max, Min filters • Sharpening spatial Filters: Foundation, Using First Order Derivatives for image sharpening –

The Gradient, Using Second Order Derivatives for image sharpening – The Laplacian, Unsharp Masking, High-Boost Filtering

Frequency Domain Methods: • Image Enhancement by Frequency domain methods: Basic steps for filtering in Frequency

Domain. • Frequency Domain low pass (Smoothing) and high pass (Sharpening) Filters

Unit 3: Image Compression (06 Hours)

• Fundamentals • Coding Redundancy, Spatial and Temporal (Interpixel) Redundancy, Irrelevant Information

(Psychovisual Redundancy) • Measuring Image Information: Entropy, Fidelity Criteria, Image Compression Model • Some Basic Compression Methods: Losssless Compression Methods: Huffman coding, LZW

coding, Run length coding, Lossy Compression Techniques: Block transform Coding • Image File Formats: BMP, GIF, TIFF • Image Compression Standards: Binary Image Compression Standards, Continuous Tone Still

Image Compression Standards

SECTION-B Unit 4: Image Segmentation (08 Hours)

• Fundamentals: Point, Line, Edge Detection, Detection of Isolated Points, Line Detection Edge Models, Basic Edge detection, Canny edge detector

• Thresholding: Foundation, Basic Global thresholding, Optimal global thresholding, Multiple thresholds, Multivariable Thresholding

• Region-based Segmentation Methods: Region Growing, Region Splitting and Merging, • Segmentation using Morphological watersheds

Unit 5: Morphological Image Processing and Color Image Processing (06 Hours) Morphological Image processing:

• Preliminaries, Erosion and dilation, opening and closing • The Hit-or-Miss Transformation

• Some Basic Morphological Algorithms: Boundary extraction, Region filling, thinning Color Image processing:

• Color Fundamentals and color models • Basics of Full color image processing • Color transformations

Unit 6: Image Representation and Description (06 Hours)

• Representation • Boundary Descriptors • Regional Descriptors

Object Recognition: • Patterns and pattern Classes • Recognition based on Decision Theoretic Methods

Text Books: 1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”, Third Edition, Pearson Education. 2. S. Jayaraman, S. Esakkirajan, T. Veerakumar “Digital Image Processing”, McGraw Hill Publication. 3. Rafael C. Gonzalez, Richard E. Woods, Eddins, “Digital Image Processing using MATLAB”, Pearson Education.

Reference Books: 1. Anil K. Jain, “Fundamentals of Digital Image Processing”, PHI 2. B. Chanda, Dutta Majumdar, “Digital Image Processing and Analysis”, PHI PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus.



15 marks each



Course Code: CSE343 Title: Embedded Systems (Elective-I) Teaching Scheme Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Knowledge of Microprocessor/Microcontroller 2. Knowledge of Computer Organization and Architecture Objectives: 1. Understanding embedded system, processor & Embedded systems architecture. 2. Be familiar with Embedded Devices and Platforms. 3. Understanding Real Time system, Real time task scheduling & Real time operating system. 4. Understand concept of Embedded Linux and Network Configuration.

CONTENTS

SECTION-A Unit 1: Introduction to Embedded Systems (6 Hours) Architecture, Classification and Characteristics of Embedded System, Typical Components of embedded systems. Design Process, Design Metrics and optimization of various parameters of embedded system. Programming of Embedded Systems, assembly language vs embedded C Programming. Components of Embedded hardware and embedded software. Case study of Digital Camera. Unit 2: Embedded Processors (6 Hours) Difference between microprocessors and microcontrollers. 8 bit and 32 bit, processors, architecture of 8-bit 8051 microcontroller and its features. ARM processor family, Difference between RISC and CISC architectures. Architecture of ARM7 and comparison of 8051 and ARM7 architecture. Introduction to ARM7 TDMI architecture, 32-bit pipelined architecture. CPSR and SPSR, VIC in ARM7, memory management and bus architecture. Unit 3: Embedded Devices and Platforms (8 Hours) Different IO interfaces and communication protocols used in embedded systems,

I/O Devices like Parallel Ports, ADC, DAC, keypad and LCD. Communication interfaces Serial Communication vs parallel communication, Communication Protocols : Bluetooth/zigbee, SPI and I2C protocols. RS232, RS485, CAN and USB as host and USB Device. Latest Embedded Development Platform (introduce board Details, features and Applications of) mbed, Arduino Uno, Raspberry Pi (versions) beagle bone black. Project Case Study: Complete Temperature Controller Design, including Arduino board, 16x2 LCD, LM35 Temperature Sensor, Relay for Turning On/off a DC Fan, switches / keypad to enter the setpoint.

SECTION-B

Unit 4:: Introduction to Real Time Operating Systems (8 Hours) RTOS services in contrast with traditional OS, Architecture of the kernel, Tasks and Task states in RTOS (idle, wait,ready), Clock Tick, Task Scheduler, Interrupt service routine, Semaphore, Mutex, mailboxes, Message Queues, Event Registers, Pipes, Signals, Timers, Socket Functions, RPC Functions, Memory Management, Priority Inversion problem. Unit 5:: Micro-Controller Real-time Operating Systems (6 Hours) Off-the-shelf operating system, Embedded Operating System, Introduction to uCOS-II RTOS, Salient Features of uCOSII, Study of kernel structure of uCOSII, Synchronization in uCOS-II,semaphore management, mutual exclusion semaphores, event flag management, Inter-task communication in uCOS-II, message mailbox management in uCOS-II Unit 6: Embedded Linux (6 Hours) Introduction to the Linux kernel, Configuring and booting the kernel, The root file system, Root file directories, /bin, /lib etc., Linux file systems, Types of file system: Disk, RAM, Flash and Network Some debug techniques- Syslog and Strace, GDB, TCP/IP Networking- Network configuration Text Books: 1. Dr. K.V.K.K. Prasad, “Embedded /Real-Time System: Concepts, Design & Programming”, Dreamtech, Edition 2010. 2. Raj kamal, “Embedded Sytems: Architecture, Programming and Design”, TMH. 3. Andrew. N. Sloss, DomnicSymes, Chris Wright, “ARM System Developer’s Guide”, Elsevier, edition 2004. 4. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051 Microcontroller and Embedded Systems: Using Assembly and C”, Second Edition, Pearson Education, 2011 5. KarimYaghmour , “Building Embedded Linux Systems”, 2003 O'Reilly & Associates, 6. Jean Labrosse “MicroC/OS-II The Real Time Kernel” CMP Books 2nd Ed. Reference Books: 1. David Simon, “Embedded systems software primer”, Pearson

2. Steve Furber, “ARM System-on-Chip Architecture”, Pearson 3. Matt Richardson“Getting Started with Raspberry Pi” , 2nd Edition. PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus.



15 marks each.



Course Code: CSE321 Title: LAB – I Database Management System Teaching Scheme Examination Scheme Practical: 02 Hours/week Practical /Oral Examination (Marks): 50 Marks

Practical /Oral Examination (Duration): 03 Hours

Suggestive List of Practical Assignments: Design, develop and implement any ten assignments from the following in SQL using Oracle/DB2 environment. Assignment No.: 1

Implementation of DDL and DML Commands of SQL with suitable example

Assignment No.: 2 Implementation of different types of SQL functions with suitable example

• Number Function • Character Function • Aggregate Function • Conversion Function • Date Function

Assignment No.: 3

Implementation of different types of SQL operators with suitable example • Arithmetic operators • Logical operators • Comparison Operators • Special operators • Set operators

Assignment No.:4

Study and Implementation of different types of Constraints

Assignment No.:5 Implementation of different types of joins

• Equijoin • Non Equijoin • Outer join

• Self join Assignment No.:6

Study and implementation of: • Group by & Having Clause • Order by • Indexing

Assignment No.:7

Study and implementation of: • Sub queries • Views • Sequences

Assignment No.:8

Study and implementation of: • TCL commands : Rollback, Commit, Save point • DCL commands : Grant, Revoke, Creating & Managing users

Assignment No.:9

Study and Implementation of PL/SQL Block

Assignment No.: 10 Study and Implementation of PL/SQL Exceptions

Assignment No.:11

Study and Implementation of Triggers

Assignment No.:12 Study and Implementation of Cursors

Note: It is compulsory for the Students to perform one additional application based on assignment which should cover maximum possible queries. Practical Examination: Practical Examination should be conducted by internal examiner for three hours under the supervision of external examiner. External examiner should evaluate student by checking practical performance and conducting viva.



Course Code: CSE322 Title: LAB-2 Programming in Java Teaching Scheme Examination Scheme Practical: 2 Hours/Week Practical /Oral Examination: 50 Marks

Practical /Oral Examination (Duration): 03 Hours Suggestive List of Practical Assignments: Design, develop and implement the following Assignments. 1. Write a program to demonstrate basic syntactical constructs of java.

a> Operators & Expressions b> Looping Statement c> Decision Making Statement

2. Write a program to define a class, descried its constructor & overload its constructor. 3. Write a program to implement inheritance & demonstrate use of method overriding & various access controls. 4. Write a program to implement Multiple Inheritance with interfaces. 5. Write a program to create a package & use it in another program. 6. Write a program to implement exception handling using built-in & user defined exceptions. 7. Write a program to implement concept of multithreading. 8. Write a program for database connectivity using JDBC. 9. Write a program using Applet to demonstrate parameter passing. 10. Write a program to implement event handling 11. Write a program to implement object Serialization & deserialization. 12. Write a program to implement socket programming.

Practical Examination: Practical Examination should be conducted by internal examiner for three hours under the supervision of external examiner. External examiner should evaluate student by checking practical performance and conducting viva.



Course Code: CSE 323 Title: LAB-3: Computer Network Architecture and Protocols (Elective-I) Teaching Scheme Examination Scheme

Practical: 02 Hours/Week Term Work: 50 Marks Suggestive List of Practical Assignments: Design, develop and implement the following Assignments ….... Assignment No.: 1 :- Study of Basic Networking commands Assignment No.: 2 :- Implementing IPV4 and IPV6 addressing. Assignment No.: 3 :- Configure a network using RIP protocol. Assignment No.: 4 :- Configure a network using EIGRP protocol. Assignment No.: 5 :- Configure a network using OSPF protocol. Assignment No.: 6 :- Configure a network using BGP protocol. Assignment No.: 7 :- Implementing client-server model using socket programming. Assignment No.: 8 :- Implement Wi-Fi network and study wireless protocols. Assignment No.: 9 :- Remote login by using SSH or Telnet. Assignment No.: 10 :- Design an enterprise network by using simulator. TERM WORK The term work shall consist of at least 8 experiments/ assignments based on the syllabus above. Assessment of term work should be done as follows:

• Continuous lab assessment. • Actual practical performance in Laboratory. • Oral Examination conducted (internally) at the time of submission.



Course Code: CSE324 Title: LAB-3: Digital Image Processing (Elective-I) Teaching Scheme Examination Scheme Practical: 02Hours/Week Term Work: 50 Marks

Suggestive List of Practical Assignments: Implement the following Assignments using MATLAB/SCILAB/OCTAVE/JAVA Assignment No.: 1 Image Enhancement using point processing methods Assignment No.: 2 Image Enhancement using spatial domain methods.

• Smoothing Filters • Sharpening Filters

Assignment No.: 3 Image Enhancement using low pass filter in frequency domain methods • LowPass Filters • HighPass Filters

Assignment No.: 4 Demonstration of image compression Methods

• Lossless Compression methods • Lossy Compression methods

Assignment No.: 5 Demonstration of Image Segmentation Methods

• Threshholding methods • Region Based Methods

Assignment No.: 6 Morphological image operations- erosion, dilation, opening and closing. Assignment No.: 7 Programs for illustrating color image processing Assignment No.: 8 Programs for region description and boundary representation. Assignment No.: 9 Program for object recognition Assignment No.: 10 Case studies Guidelines for case studies:

• Group of 2-3 Students should select real life DIP problem Domain And implement any of its DIP module.

Problem Domains • Biometric Imaging • Medical imaging • Satellite imaging etc

DIP Modules • Image enhancement • Image Segmentation etc

OR

• Group of 2-3 Students should study any recent international journal research paper based on DIP/Computer vision

TERM WORK The term work shall consist of at least 8 experiments/ assignments based on the syllabus above and a group of 2-3 students must prepare and present a case study. Assessment of term work should be done as follows::

• Continuous lab assessment • Actual practical performance in Laboratory. • Oral Examination conducted (internally) at the time of submission.



Course Code: CSE325 Title: LAB-3 Embedded Systems (Elective-I) Teaching Scheme Examination Scheme Practical: 2 Hours/Week Term Work: 50 Marks Suggestive List of Practical Assignments:

1. Arduino IDE installation and testing of simple blink program 2. Write a program to interface 8 LEDs with Arduino and make them ON and OFF 3. Interface 2 switches with Arduino and write a program for blinking LEDs when switch is

pressed 4. Interface 1 switch with Arduino and write a program to count the number of switch presses and

print it on serial port 5. Interface LM35 Temperature Sensor with Arduino and print temperature on serial terminal 6. Interface DHT11 Sensor with Arduino and print humidity / temperature on serial terminal 7. Interface a 16x2 LCD with Arduino and print temperature on it 8. Interface a micro servo motor with Arduino and write a program to rotate it clockwise (0-180

degree) and anticlockwise (180degree to 0) 9. Interface a moisture sensor with Arduino and write a program to turn on LEDs when the

moisture is dry and turn it off when there is enough moisture 10. Interface a memory card and create a data logger with Arduino 11. Install Operating System (Raspbian) on a raspberry Pi 3 Board, update the OS, change time

zone and keyboard layout 12. Install GPIO libraries and interface 4 LEDs with Raspberry pi and perform an LED blink

program in Python 13. Interface a DHT22 Sensor with Raspberry Pi and send temperature and humidity as email using

Python 14. Create a text to speech module using python and speech synthesis library to create a talking

thermometer Note: Students should perform at least 10 Assignments. TERM WORK The term work shall consist of at least 8 experiments/ assignments based on the syllabus above. Assessment of term work should be done as follows:

• Continuous lab assessment. • Actual practical performance in Laboratory. • Oral Examination conducted (internally) at the time of submission.



Course Code: CSE326 Title: Lab IV Software Development Lab I (ASP .NET using C#) Teaching Scheme Examination Scheme Practical: 02 Hours/Week Practical / Oral Examination (Marks): 50 Marks

Practical / Oral Examination (Duration): 03 Hours Prerequisite: 1. Programming in C / C++ 2. HTML, Javascript 3. MySQL Objectives: 1. To learn C# features 2. To Perform database operations using ADO.Net and exception handling 3. To learn different server controls of asp.net 4. To learn navigation, session, cookies, event handling 5. To learn web services

CONTENTS

SECTION-A Unit 1: Introduction to the ASP .NET Framework and C# (03 Hours) Introduction To Visual Studio IDE, ASP .NET & the .NET Framework , Introduction to C#, Data Types, Variables and expressions, control statements , functions, namespaces, Assembly, Components of Assembly, Private and Shared Assembly Unit 2: Web Application with ASP.NET (04 Hours) Introduction to Web Applications, ASP.NET page lifecycle, Server Side Controls, Client Side Controls, Basic Controls ,Validation Controls , Master &Content Pages in ASP .NET Unit 3: Web Application with ASP.NET (03 Hours) Navigation Controls, State management techniques - Session , Query string, Cookies, View State , Event Handling, Creating and deploying web services, Deployment of Web Application

SECTION-B Unit 4: Database Handling (03 Hours) ADO.NET, Static and Dynamic Data Binding, ADO.NET architecture, data control, data source control, Introduction to Language Integrated Query (LINQ), Querying a Database with LINQ, Unit 5: Introduction to SharePoint (03 Hours) The Programming Model - The Evolution of SharePoint Programming, Challenges with CSOM in SharePoint 2010, Challenges with Server-Side Code. Deployment Scenarios - On-Premise Deployment, Office 365 Deployment, Hosted Deployment, Hybrid Deployment. The App Model - SharePoint-Hosted Apps, Provider-Hosted Apps, Azure Auto-Hosted Apps, The App Security Model. Unit 6: Introduction to SharePoint Content Management (04 Hours) Enterprise Content Management - Site Policies, Managed Meta Data. Web Content Management, Search - The Structural Publishing Model, The Dynamic Publishing Model, Taxonomy-Driven Navigation, Term-Driven Publishing Pages, Cross-Site Publishing, Hostname Site Collections. Text/Reference Books: 1. C# 2010 Programing, Black Book, Dreamtech Press 2. ASP.NET Unleashed 4, Stephen Walther,Nate Dudek,Kevin Hoffman, Pearson 3. Beginning Visual C# 2010, Karli Watson, Christian Nagel, Jacob Hammer Pedersen, Jon D. Reid, Morgan Skinner - WILEY 4. PROFESSIONAL SHAREPOINT 2013 DEVELOPMENT, Reza Alirezaei Brendon Schwartz Matt Ranlett Scot Hillier Brian Wilson Jeff Fried Paul Swider 5. Pearson Visual C# 2010 How to program. Prentice-Hall Inc, 2011, Fourth Edition Suggestive List of Practical Assignments: Design, develop and implement the following Assignments …....

1. Design & develop ASP.net Web Application using validation controls. 2. Design & develop ASP.net Web Application use master & content page. 3. Design a web form to insert, update, delete & show student information through database

connectivity with (SQL/Oracle). 4. Create a web service and use it in web site. 5. Design & develop ASP.net Web Application using session. 6. Call an external web service through SharePoint workflow. 7. Create custom action using SharePoint workflow. 8. Create a simple Calculator using SharePoint workflow. 9. Create a Web forms application that integrated with Office 365.

10. Create a web form application for building Resume. 11. Mini Project.




Course Code: BSH305 Title: Communication Skill-II Teaching Scheme Examination Scheme Theory: 02Hours/Week Term Work: 50 Marks

Prerequisite: 1. Basic Knowledge of Soft Skills 2. Good understanding of English Objectives: 1. To imbibe leadership skills 2. To develop interpersonal Skills 3. To introduce corporate etiquettes 4. To imbibe team skills CONTENTS Unit 1: Understanding self and Goal Setting ( 5 Hours)

- Self-Assessment: Understanding Self Core Competency (SWOT/SWOC) - Long term and short-term Goal Setting - Execution Skills

Unit 2: Interpersonal Skills (6 Hours)

- Interpersonal Communication - Conflict Management - Problem Solving - Decision Making - Persuasion and Influence

Unit 3: Group Dynamics and Team Building ( 4 Hours)

- Group Vs Team - Team Building - Team Work - Developing Leadership Skills

Unit 4: Corporate Etiquette (5 Hours)

- Clothing Etiquette, Personal hygiene and grooming - Time Management

- Influencing Skills (Impression) - Balancing personal and professional Life - Ethics, Values and Laws

Text Book:

1. The Ace of Soft Skills (Gopalaswamy Ramesh) Pearson Publication Reference Books: 1. Execution; :Ram Charan (Publisher: Crown Business; 1 edition (June 15, 2002) Language: EnglishISBN-10: 0609610570ISBN-13: 978-0609610572 2. Laws of Teamwork : John C Maxwell 3. Master of Business Etiquette: Cyrus Gonda (Author: Cyrus Gonda, Publisher EMBASSY BOOKS, 2017, ISBN 9385492721, 9789385492723) 4. Goals : (Author: Brain Tracy ISBN: 1-57675-235-6Published by Berrett-Koehler Publishers, Inc) 5. Interpersonal Skills at work : (Author: John Hayes Second Edition: Routledge) 6. People Smart : (Author: Freda Hansburgby Berrett-Koehler Publishers, Inc) Term Work Assessment (50 marks): The term work shall consist of internal online examination of 50 Marks, conducted at institute level. The marks of the examination shall be forwarded to the University.


Third Year Engineering (CSE/IT) Semester – II

Course Code: CSE351 Title: Advanced Java Teaching Scheme Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Data Structure 2. Core Java 3. Basic Programming skills in C/C++ Objectives: 1. Develop skills in Enterprise Java 2. Understanding advanced concepts in Java Programming 3. Understanding importance of Service oriented Architecture of todays web application CONTENTS

SECTION-A Unit 1: Java Enterprise Edition (04 Hours) Introduction, Overview of J2EE, J2EE Architecture 1 tire, 2 tire, and N tire, Standard Java EE Services, Java EE 8 features, Introduction to AJAX, Ajax using JSON. XMl, Intoduction to JAVA RMI Unit 2: Servlet (08 Hours) Servlet Overview and Architecture, Servlet API, Servlet Life Cycle, Working with ServletConfig and ServletContext, Handling HTTP, get Requests, Handling HTTP post Requests, Redirecting Requests to Other Resources, Session Tracking, Cookies, Session Tracking with HttpSession, Deployment descriptor, Building Java Projects with Maven Unit 3: Java Server Pages (08 Hours) JSP: Overview, Lifecycle, Architecture, JSP Elements: Directives, Scripting, Action tags, Implicit Objects, Comments, Custom Tags, Scope: page, request, session, JSP Exception handling

SECTION-B

Unit 4: Enterprise JavaBeans (06 Hours)

Understanding Enterprise JavaBeans, Types of beans, Creating a JavaBean, JavaBean Properties,, Stateful Session bean, Stateless Session bean, Entity bean. Introduction to Java mail service,Component of JMS Unit 5: Web Services (08 Hours) SOAP Web Services: SOAP, WSDL, UDDI, ebXML, transport protocol, Writing SOAP web services, Invoking SOAP web services, JEE 7 for web service RESTful Web Services: Resources and URIs, RESTful Web Services Specifications Overview, Java API for RESTful Web Services, JAX-RS 2.0, Writing RESTful Web Services, Invoking RESTful Web Services Unit 6: Hibernate & Spring (06 Hours) Hibernate: Architecture, component of Hibernate, Hibernate query language, Hibernate O/R mapping, Spring :Overview of Spring, Spring Architecture and Container, dependancy injection, Spring Web MVC Framework. Text Books: 1. Antonio Goncalves, Beginning Java EE 6 Platform with GlassFish 3, Apress 2. Java Server Programming(Java EE 5) Black Book by Willey Publication 3. Subrahmanyam Allamaraju, Samir Tyagi, Karl Avedal, John Griffin, “Professional Java Server Programming”, Wrox Publication. Reference Books: 1. Java Platform, Enterprise Edition The Java EE Tutorial, Release 7, Eric Jendrock, Ricardo Cervera-Navarro, Ian Evans, Kim Haase, William Markito, 2014, Oracle 2. RESTful Java with JAX-RS 2.0, Second Edition by Bill Burke, Second Edition, O’REILLY PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus. For 80 marks Paper: 1. Minimum ten questions 2. Five questions in each section 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be


15 marks each.



Course Code: CSE352 Title: Software Engineering Teaching Scheme Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Students should have prior basic knowledge on Software attributes, Process models. 2. Students should have some basic knowledge on Testing, Maintenance.

Objectives:

1. This course is intended to provide the students with an overall view over Software Engineering discipline and with insight into the processes of software development.

2. To learn about generic models of software development process. 3. To understand the different design techniques and their implementation. 4. To learn various testing and maintenance measures.

CONTENTS SECTION -A

Unit 1: Software Engineering – Overview ( 4 Hours) Introduction–Characterstics of Sfotware Engineering, FAQs about software engineering – Professional and ethical responsibility – Socio-Technical systems – emergent system properties – System Engineering – Organizations – people and computer systems–Legacy systems. Unit 2: Software Process Models (8 Hours) The Evolving role of Software – Software – The changing Nature of Software – Legacy software –– A generic view of process– A layered Technology – A Process Framework – The Capability Maturity Model Integration (CMMI) – Process Assessment – Personal and Team Process Models – Product and Process – Process Models – The Waterfall Model – Incremental Process Models – Incremental Model – The RAD Model – Evolutionary Process Models – Prototyping – The Spiral Model – The Concurrent Development Model – Specialized Process Models – the Unified Process. Unit 3: Requirement Engineering (8 Hours) Software Engineering Practice – communication Practice – Planning practice modeling practice– Construction Practice –Deployment. Requirements Engineering - Requirements Engineering tasks – Initiating the requirements Engineering Process- Eliciting Requirements

– Developing Use cases – Building the Analysis Models – Elements of the Analysis Model – Analysis pattern – Negotiating Requirements – Validating Requirements.

SECTION -B Unit4:Analysis Modeling (5 Hours) Requirements Analysis – Analysis Modeling approaches – data modeling concepts – Object oriented Analysis – Scenario based modeling – Flow oriented Modeling – Class based modeling – creating a behaviour model. Unit5:Design & Testing (8 Hours) Design Engineering – Design process -Design Quality-Design model-User interface Design – Testing strategies- Testing Tactics - strategies Issues for conventional and object oriented software-validation testing –system testing –Art of debugging – Project management. Unit 6: Quality Asssurance (7 Hours) Software evolution - Verification and Validation - Critical Systems Validation – Metrics for Process, Project and Product-Quality Management - Process Improvement –Risk Management Configuration Management – Software Cost Estimation Text Books: 1. Roger S. Pressman, Software Engineering: A Practitioner’s Approach, McGraw Hill

International edition, Seventh edition, 2009. 2. Ian Sommerville, Software Engineering, 8th Edition, Pearson Education, 2008. Reference Books: 1. Stephan Schach, Software Engineering, Tata McGraw Hill, 2007 2. Pfleeger and Lawrence Software Engineering: Theory and Practice, Pearson Education, second edition, 2001 3. Software Engineering Principles and Practice by Waman.S.Jawadekar, Tata McGraw Hill, 2004. PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus.




DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY AURANGABAD FACULTY OF ENGINEERING AND TECHNOLOGY


Course code: CSE353 Title: Design and Analysis of Algorithms Teaching Scheme Examination Scheme Lectures: 4 Hrs/Week Class test: 20 Marks


Course objectives:

1. To build a solid foundation of the most important fundamental subject. 2. To study paradigms and approaches used to analyze and design algorithms and

to appreciate the impact of algorithm design in practice. 3. To understand how to measure performance of any algorithm.

Prerequisite

1. Programming in C Language (Covered at FE level). 2. Discrete Mathematical Structure (Covered at SE level). 3. Data Structures (Covered at SE level).

CONTENTS

SECTION-A Unit 1-: Fundamental concept of algorithm design & analysis (8 hrs)

• Algorithm: characteristics, specifications • Writing Pseudo-Code • Frequency count and its importance in analysis of an algorithm, • Asymptotic Notations: Time complexity & Space complexity of an algorithm, Big

‘O’, ‘’ & ‘Ω’ notations, Best, Worst and Average case analysis of an algorithm. • Analysis of searching algorithms: sequential, binary search, • Analysis of sorting methods: bubble, insertion, selection, heap sort. Analysis of

each sorting technique for best, worst and average case, Concept of Internal & External sorting.

Unit 2-: Divide and conquer algorithmic design method (6 hrs)

• Divide and conquer: basic algorithm and characteristics. • Binary Search: method and analysis of binary search for best, worst and average

case for searches. • Quick Sort, Merge Sort : method and analysis of algorithms • Finding the largest and smallest number in a list using DnC.

Unit 3-: Greedy Method (6 hrs)

• The Greedy Method: basic algorithm and characteristics. • Fractional Knapsack Problem solving using greedy method. • Optimal merge patterns and optimal storage on tapes. • Job sequencing with deadlines. • Huffman Coding : greedy method • Minimum cost spanning trees: Prim’s and Kruskal’s Algorithm • Single source shortest path

SECTION-B

Unit 4.1-: Dynamic Programming Method (6 hrs)

• Dynamic Programming Method: basic algorithm and characteristics. • 0/1 Knapsack Problem solving using DP method. • Multistage graphs • All pair shortest Path • Optimal binary search trees • Travelling salesperson problem

Unit 4.2-: Tree traversal and graph traversal techniques (4 hrs)

• Tree traversal techniques • Graph traversal techniques :DFS,BFS • Connected components • Bi-connected components & spanning trees

Unit 5-: Backtracking Method (4 hrs)

• Backtracking Method: basic algorithm and characteristics. • Solving n-queens problem • Sum of subsets problem • Graph colouring • Hamiltonian cycle (TSP)

Unit 6-: Branch and Bound technique (6 hrs)

• Branch and bound: basic algorithm and characteristics. • Solving n-queens using branch & bound • FIFO Branch and Bound & Least Cost Branch & Bound • Least Cost Search • 15-puzzle • Solving Travelling salesperson problem using branch & bound

Text Books:

1. Ellis Horowitz, Sarataj Sahni, S.Rajasekaran, “Fundamentals of Computer Algorithms”, Galgotia Pub.

2. Udit Agarwal,“ Algorithms, Design and Analysis”, Dhanpat Rai & Co.

3. Hari Mohan Pandey, “Design Analysis and Algorithms”, An imprint of Laxmi Publications Pvt. Ltd.

4. Michael Goodrich, Roberto Tamassia. “Algorithm Design”, Wiley Student Edition Reference books:

1. R1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman , “The Design and Analysis of Computer Algorithms”, Addison Wesley

2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, ” Introduction to algorithms”, MIT Press







Course code: ITD354 Title: E-Business System Teaching Scheme Examination Scheme Lectures: 4 Hrs/Week Class test: 20 Marks


Prerequisite: 1. Concepts of Website Development. 2. Concepts of Online Shopping. Objectives: 1. To explain Basics of e-Business and e-Business Strategies 2. To classify the e-Business models 3. To describe the Architecture of basic e-Business model 4. To explain the CRM and SCM Process 5. To analyse the e-procurement models and security techniques CONTENTS

SECTION A Unit 1: Overview of e-Business and its Strategy: (06 Hrs) An Overview of e-Business: Introduction to e-Business, e-Business vs e-Commerce, Characteristics of e-Business, Elements of an e-Business Solution, e-Business Roles and their Challenges, e-Business Requirements, Inhibitors of e-Business like Management, Financial, Security, Legal, and Technological Issues. e-Business Strategy: Definition, Types of Strategies like Supply Chain Management, Marketing and IS, Strategic positioning, Levels of e-Business Strategy like Supply Chain, Line of Business and Corporate Level, Strategic Planning Process. Unit 2: e-Business Models and Architecture: (06 Hrs) e-Business Models: Definitions, Classifications of Business Models like Internet Enabled, Value Web, e-Business Enabled, Market Participants and Cybermediaries Business Models. e-Business Architecture: Introduction, Trends Driving e-Business Architecture, New Customer Care Objectives, New Competitive Conditions, Fast moving Competitors, Problems Caused by Lack of Integration. Unit 3: CRM and Selling Chain Management: (08 Hrs) Customer Relationship Management: Basics, Definitions, Phases of CRM, CRM Process Competencies, Building a CRM Infrastruct

Selling Chain Management: Basics, Definitions and goals of Selling Chain Management, Order Acquisition Process, Elements of Selling Chain Infrastructure.

SECTION B Unit 4: SCM and ERP: (06Hrs) Supply Chain Management: Basics, Definitions, Intenet Enabled SCM - Interenterprise Integration, Supply Chain Planning, Supply Chain Execution, e-Supply Chain Fusion, Diagnosing Root Causes of Supply Chain Problems, Fixing Root Causes. Enterprise Resource Planning: Basics and Elements, ERP Architecture Planning, Software Decision, Capabilities of COTS ERP Solutions. Unit 5: e-Procurement and KM (06Hrs) e-Procurement: e-Procurement Models, B2E: Purchasing and Requisitioning Applications, Corporate Procurement Portals, e-Procurement Infrastructure: Integrating Ordering, Fulfilment and Payment. Knowledge Management: Elements of Knowledge Management Applications - Data Organization and Collection, Analysis and Segmentation, Real-Time Personalization, Infrastructure for Broadcast, Retrieval and Interaction, Performance Monitoring and Measurement. Unit 6: E-Commerce Security System (08 Hrs) Security threats in E-Commerce environment, Requirements for safe e-payments/transactions, Measures, Denial of services, Concepts of Encryption and Decryption, Encryption Techniques Symmetric and Asymmetric Algorithm, Security protocols in Internet, Secure electronic transaction, EDI, Payment Gateway, Digital signature, Secure E-Wallet, E-Commerce Act

Text Books: 1. Michael P. Papazoglou and Pieter M. A. Ribbers, 'e-Business organizational and

Technical Foundations', Wiley India Edition. 2. Dr. Ravi Kalakota and Marcia Robinson, 'e-Business 2.0 roadmap for Success, Pearson

Edition. 3. en.wikipedia.org/wiki/Business_process Reference Books: 1. Daniel Amor, E-business (R) Evolution, 2nd Ed. Prentice Hall, New York 2002. Note: Case Studies from the books, e-Office, amazon.com, flipkart.com, etc Pattern of Question Paper: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section

For 80 marks Paper: • Minimum ten questions • Five questions in each section • Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will

be compulsory. • From the remaining questions in section A and B students are supposed to solve any

two questions from each section, 15 marks each.



Course code: CSE354 Title: Systems Programming Teaching Scheme Examination Scheme Lectures: 4 Hrs/Week Class test: 20 Marks Theory Examination (Marks): 80 Marks


Prerequisite Data structures and Operating System

Objectives Students will be able to

1. Understand concepts of system programming, machine language and assembly language 2. Understand concepts of lexical, syntax and semantic analysis 3. Understand assemblers, macros and macro call 4. Understand compilers, loaders, linkers, interpreters and debuggers

CONTENTS

SECTION –A

Unit-1. Introduction to System Programming (06 hrs) Concept, historical development,components of system software, life cycle of source program, programming languages and language processors, fundamentals of language processing, symbol table, foundation of system software.

Unit-2. Assembler (06 hrs) General design procedure, design the assembler, types of assemblers, one pass assembler, advanced assembly process, design of two pass assembler

Unit-3. Macro language and Macro processors (08) Macro instructions, features of macro facility, macro instruction arguments, conditional macro expansion, macro call within macros, macro instruction defining macros Implementation- Implementation of restricted faculty : two pass algorithm, single pass algorithm, implementation of macro calls within macros, implementation within assembler.

SECTION –B

Unit-4. Loaders and Linkers (06) Loaders scheme : “compile and go loaders”, general loader schemes, absolute loaders, subroutine linkages, relocating loaders, direct linking loaders, other loader schemes, binders, linking loaders overlays, dynamic binders. Design of absolute loaders, design of direct linking loaders, linkers vs loaders.

Unit-5. Scanning and Parsing (06) Programming language grammar, classification of grammar, ambiguity in grammatic specification, scanning, parsing, top down and bottom up parsing, language processor development tools Unit- 6. Compilers, Interpreters and Debuggers (08) Causes of large semantic gap, binding and binding times, data structure used in compiling scope rules, memory allocation, compilation of expression, compilation of control structure, code optimization. Benefits of interpretation, overview of interpretation, classification of debuggers, dynamic/interactive debugger Text Books

1. John J. Donovan, 'System Programming',Tata Mc- Graw Hill. 2. D. M. Dhamdhere, 'System Programming and operating system',Tata Mc- Graw Hill. 3. G. Sudha Sadashiv, 'Compiler design', SciTech. 4. Rajesh K. Maurya,'System Programming',Dreamtech.

Pattern of Question Paper: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section For 80 marks Paper:

• Minimum ten questions • Five questions in each section • Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will

be compulsory. • From the remaining questions in section A and B students are supposed to solve any two




Course Code: CSE391 Title: Distributed Operating System (Elective –II) Teaching Scheme: Examination Scheme Theory: 04 Hours/Week Class Test: 20 Marks Theory Examination (Marks): 80 Marks Theory Examination (Duration): 03 Hours Prerequisite: 1. Operating System 2. Computer Network 3. Java Programming Objectives: 1. To understand basic concepts and need of Distributed systems. 2. To provide students with contemporary knowledge in distributed systems. 3. To provide master skills to measure the performance of distributed algorithms. 4. To build up distributed system using distributed algorithms. 5. To equip students with skills to analyze and design distributed applications.

CONTENTS

SECTION-A Unit 1: Introduction to Distributed Systems (06 Hours) Definition, Issues, Goals, and Types of distributed systems, Distributed System Models. Case study of World Wide Web Unit 2: Communication (06 Hours) Inter-process communication (IPC): MPI, Remote Procedure Call (RPC): Design Issues of RPC, Object Oriented Communication, Message Oriented Communication, Case study of Java RMI and CORBA Unit 3: Synchronization (08 Hours) Need of clock synchronization in Distributed system, Physical Clock Synchronization: Server-initiated, Client-initiated and Averaging Algorithms, Logical Clock Synchronization: Lamports and Vector Clock Algorithms, Comparative Performance Analysis of Physical Clock synchronization algorithms and logical Clock synchronization algorithms. Classification of Mutual Exclusion Algorithm: Centralized Mutual Exclusion: Election

Algorithms, Distributed (Decentralized) Mutual Exclusion Algorithms, Classification of Decentralized Algorithms: Token Based Algorithms and Non-token based Algorithms. Token Based Algorithms: Suzuki-Kasami’s Broardcast Algorithms, Singhal’s Heurastic Algorithm, Raymond’s Tree based Algorithm. Non Token based Algorithms: Ricart–Agrawala’s Algorithm, Maekawa’s Algorithm.

SECTION-B Unit 4: Resource and Process Management (06 Hours) Desirable Features of global Scheduling algorithm, Task assignment approach, Load balancing approach, load sharing approach. Introduction to process management, process migration, Threads: Worker-Dispatcher Model, Virtualization, Clients, Servers, Code Migration. Case study of Java Applets Unit 5: Consistency and Replication (06 Hours) Introduction, Data-Centric and Client-Centric Consistency Models, Replica Management. Unit 6: Distributed File System (08 Hours) Introduction and features of DFS, File models, File Accessing models, File Sharing Semantics ,File-Caching Schemes, File Replication, Fault Tolerance, Case study of Hadoop distributed File System and Map reduce. Text Books: 1. Andrew S. Tanenbaum and Maarten Van Steen, “Distributed Systems: Principles and Paradigms, 2nd edition, Pearson Education, Inc., 2007, ISBN: 0-13-239227-5. 2. Pradeep K Sinha, “Distributed Operating Systems : Concepts and design”, IEEE computer society press.

Reference Books: 1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems: Concepts and Design” (4th Edition), Addison Wesley/Pearson Education. 2. Sunita Mahajan, Seema Shah, “Distributed Computing”, 2nd Edition, Publisher: Oxford University Press. 3. Advanced concepts in Operating Systems, Mukesh Singhal & N.G.Shivaratri, TMH.

PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus. For 80 marks Paper: 1. Minimum ten questions

2. Five questions in each section 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be





Semester – II

Course Code: CSE392 Title: Artificial Intelligence (Elective-II) Teaching Scheme Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks Theory Examination (Marks): 80 Marks Theory Examination (Duration): 03 Hours

Prerequisite: 1. Discrete Mathematics 2. Knowledge of any programming language 3. Data structures Objectives: The student should be made to 1. Study the concepts of Artificial Intelligence. 2. Learn the methods of solving problems using Artificial Intelligence. 3. Introduce the concepts of Expert Systems and machine learning. 4. To be familiar with the applicability, strengths, and weaknesses of the basic knowledge

representation, problem solving, machine learning, knowledge acquisition and learning methods in solving particular engineering problems.

CONTENTS

SECTION-A Unit 1: Introduction (6 Hrs) Introduction to AI, Foundation of AI, History, AI Techniques, AI Problems, Production systems, Problem characteristics, Production System Characteristics, Issues in the Design of Search Problems Unit 2: Heuristic Search and Knowledge Representation (6 Hrs) Heuristic search, Hill Climbing, Best firth search, Problem Reduction, Means-Ends Analysis, Representations and Mapping, Knowledge Representation, issues in Knowledge Representation, Representing simple facts in logic, representing instance and ISA relationships, Computable functions and predicates. Unit 3: Logic Programming (8 Hrs) Procedural Versus Declarative Knowledge, Logic Programming, Forward and backward reasoning, Forward and backward, Matching, Control Knowledge, Nonmonotonic reasoning,

Logics for Nonmonotonic reasoning, Truth Maintenance Systems, Probability and Bayes’ Theorem, Certainty Factors and Rule-Based Systems, Bayesian Networks, Fuzzy Logic.

SECTION-B

Unit 4: Planning (6 Hrs) Planning: Introduction, An example domain: The blocks world, component of planning system, goal stack planning, non linear planning using constraint pasting, hierarchical planning, Reactive system. Unit 5 : Advanced AI (6 Hrs) Game playing: Min max search procedure, Alpha-Beta cutoffs, Natural Language Processing: introduction, Symantic Processing, Semantic Analysis, Discourse and Pragmatic Processing. Unit 6: Learning & Expert systems (8 Hrs) Introduction to learning, Rote learning, learning by taking advice, learning in problem solving, learning from examples: Induction, explanation based learning , Representing and using Domain knowledge, Architecture of expert systems, knowledge acquisition. Text Books: 1. Elaine rich and Kevin Knight, Shivshankar Nair, “Artificial Intelligence”, 3rd Edition, Tata

McGraw-Hill, ISBN-10-0070087709, ISBN-13-9780070087705 2. Stuart Russell, Peter Norvig, “Artificial Intelligence-A Modern Approach”, 2nd Edition,

Pearson Education / Prentice Hall of India, ISBN:01379023952

Reference Books: 1. Eugene Charniak, Drew McDermott, “Introduction to Artificial Intelligence”, Pearson

Education, ISBN 81-7808-033-8 2. Ivan Bratco, “PROLONG: Programming for Artificial Intelligence”, Pearson Education, 3rd

edition, ISBN 10:0-201-40375-7 3. Saroj Kaushik, “Artificial Intelligence”, Cengage learning, ISBN-13:9788131510995 4. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”, Prentice

Hall of India, ISBN: 81-203-0777-1 5. Rjschat-Koft “Artificial Intelligence & Engineering Approach “, Tata Mc-Graw Hill


For 80 marks Paper: 1. Minimum ten questions

2. Five questions in each section 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be





Course Code: CSE393 Title: Network Security (Elective-II) Teaching Scheme Examination Scheme Theory: 4 Hours/Week Class Test: 20 Marks


Prerequisite: 1. Introductory course on computer Networks Objectives: To study principal and latest practices for building reliable and secure code to defend against various attack techniques, harmful viruses and threats. CONTENTS

SECTION-A Unit 1: Introduction (06 Hours) Need for Security, Security trends, Security Attacks, Security Services and Mechanisms. Classical encryption Techniques: Symmetric cipher model, Substitution techniques, transportation techniques, Steganography. Block ciphers and data encryption standard: Block cipher principles, the data encryption standard, block cipher design principles. Unit 2: Symmetric ciphers (06 Hours) Multiple encryption and triple DES, Block cipher modes of operation, Stream ciphers and RC4, Stream ciphers – Blowfish, Modern Symmetric encryption - IDEA, Confidentiality using Symmetric Encryption, Placement of encryption function, traffic confidentiality, Random number generation. Unit 3: Introduction to number theory (08 Hours) Prime numbers, Fermat’s and Euler’s theorems, Chinese Remainder Theorem, Discrete logarithms Public key cryptography - Principles of public keycrypto systems and RSA, Key management, Diffie-Hellman key exchange, Elliptic curve arithmetic, Elliptic curve cryptography, Key

Distribution, Message authentication and Hash functions, Security and Hash functions and MACs, HMAC, CMAC, Digital signatures and authentication protocols.

SECTION-B Unit 4: Attacks (06 Hours) DoS/DDoS attacks, Back door, Spoofing, Man-in-the-middle, Replay, TCP/Hijacking, Fragmentation attacks, Weak keys, Mathematical attacks, Port scanning, Dumpster diving, Birthday attacks, Software exploitation, Inappropriate system use, Eavesdropping, War driving, TCP sequence number attacks, War dialing/demon dialing attacks. Unit 5: Other public Key Cryptosystems (06 Hours) Public key algorithms using GMP, Introduction to packet sniffing tool, Architecture of SSL, Attacks on SSL, Introduction to Intruder detection System, Snort and stenographic tools. Protecting against programmed threats, viruses and worms. Security for modems Unit 6: Wireless and IP Security (08 Hours) IEEE 802.11 Wireless Security, WEP, WEP security upgrades, IEEE 802.11i, Wireless application protocol, IP Security architecture, Authentication header, Encapsulating security pay load, combining security associations. Brief on Cloud Security and Forensics- Media, Cyber, S/W and Mobile forensics (With Case study). Text Books: 1. William Stallings, Cryptography and Network Security, Pearson Education 2. Eric Cole, Dr. Ronald Kurtz and James W. Conley, Network Security Bible, Wiley Publishers 3. Jason Albanese and Wes Sonnenreich, Network Security Illustrated, MGH Publishers

Reference Books: 1. Bruce Schneier, "Applied Cryptography", John Wiley & Sons 2. Bragg, Keith Strassberg, and Mark Rhodes- “Network Security: The Complete Reference”, Ousley 3. Atul Kahate. “Cryptography and Network Security.” Tata McGraw-Hill Education, NPTEL : Prof. D. Mukhopadhyay, Cryptography and Network Security PATTERN OF QUESTION PAPER: Six units in the syllabus shall be divided in two equal parts i.e. 3 units in each part. Question paper shall be set having two sections A and B. Section A questions shall be set on first part and Section B questions on second part. Question paper should cover the entire syllabus.

For 80 marks Paper:

1. Minimum ten questions 2. Five questions in each section 3. Question no. 1 from section A and Question no. 6 from section B, 10 marks each, will be





Course Code: CSE371 Title: LAB-I Advanced Java Teaching Scheme Examination Scheme Practical: 02 Hours/Week Practical /Oral Examination: 50 Marks Practical /Oral Examination (Duration): 03 Hours

Suggestive List of Practical Assignments: Assignment No.: 1 Develop simple application using AJAX and JSON. Assignment No.: 2 Develop application using for Servlet life cycle Assignment No.: 3 Develop a Servlet program to print HTTP header information. Assignment No.: 4 Develop application using JSP Assignment No.: 5 Develop application using JSP Elements: Directives, Scripting, Action tags Assignment No.: 6 Develop applicatiion using JSP Directives, Scripting, Action tags, Assignment No.: 7 Develop application using JSP object scope page, request, session Assignment No.: 8 Develop application program using custom tags Assignment No.: 9 Develop application stateless JavaBeans Assignment No.: 10 Develop application statelful JavaBeans Assignment No.: 11 Develop application entity JavaBeans Assignment No.: 12 Develop a hibernate application to store the feedback of website visitors in database Assignment No.: 13 Develop Simple MVC Spring application. Assignment No.: 14 Develop simple Hibernate application using any Database. Assignment No.: 15 Develop SOAP web service based application. Assignment No.: 16 Develop RESTful web service for based application. Practical Examination: Practical Examination should be conducted by internal examiner for three hours under the supervision of external examiner. External examiner should evaluate student by checking practical performance and conducting viva.



Course Code: CSE372 Title: LAB VI Software Testing & Quality Analysis Teaching Scheme Examination Scheme Practical: 2 Hours/Week Term Work: 50 Marks Suggestive List of Practical Assignments: Design, develop and implement the following Assignments. Study of Manual and Automated Testing. 1. Write a program in C for Matrix multiplication and check its failure also introspect the

causes for its failure and write down the possible reasons for its failure. 2. Take any system (e.g. ATM system) and study its system specifications and report the

various bugs. 3. Write the test cases for any known application (e.g. Banking application) 4. Create a test plan document for any application (e.g. Library Management system) 5. Test any one web application using Selenium testing tool. 6. Study of any bug tracking tool (e.g. Bugbit) 7. Test any Java application using JMeter. 8. Creating a test report using BugZilla. 9. Design and Develope test cases for Mobile application.0 Term Work: The Term Work shall consist of at least 8 experiments / assignments based on the suggestive list of practical assignments. Assessment of term work should be done as follows:

• Continuous lab assessment • Actual practical performance in laboratory • Oral examination conducted ( internally ) at the time of submission



Course Code: CSE373 Title: LAB 7: Design and Analysis of Algorithms Teaching Scheme Examination Scheme Practical: 2Hrs/week Practical & Oral: 50 Marks Practical Exam Duration: 3 Hours Suggestive List of Practical Assignments: Design, develop and implement the following programs using C or C++ language in LINUX/Windows environment.

1. Program to implement Heapsort. 2. Program to implement Insertion sort, Bubble sort and Selection sort 3. Program to implement Binary search using Divide and Conquer. 4. Program for finding the minimum and maximum using Divide and Conquer. 5. Program to implement merge sort using Divide and Conquer. 6. Program to implement Knapsack problem using Greedy method. 7. Program to implement Prims Algorithm using greedy method. 8. Program to implement Kruskal’s Algorithm using Greedy method. 9. Program to implement Multistage Graphs using Dynamic Programming. 10. Program to implement All pairs Shortest Path using Dynamic Programming. 11. Program to implement Graph traversal: - Breadth First Traversal. 12. Program to implement Graph traversal: - Depth First Traversal. 13. Program to implement 8- Queens’ problem using Backtracking.




Course Code: CSE374 Title: LAB-8: Distributed Operating System (Elective –II) Teaching Scheme: Examination Scheme: Practical: 02 Hours/Week Term Work: 50 Marks

Suggestive List of Practical Assignments: Design, develop and implement the following Assignments (Minimum 8). Assignment No.:1 Client/server using RPC/RMI. Assignment No.:2 Implementation of multi tread application Assignment No.:3 Inter-process communications Assignment No.:4 Group Communications Assignment No.:5 Load Balancing Algorithms Assignment No.:6 Name Resolution protocol Assignment No.:7 Election Algorithms Assignment No.:8 Clock Synchronization algorithms Assignment No.:9 Mutual Exclusion Algorithms Assignment No.:10 Deadlock management in Distributed system Assignment No.:11 Distributed File Systems Assignment No.:12 CORBA File Term Work: The Term Work shall consist of at least 8 experiments / assignments based on the suggestive list of practical assignments. Assessment of term work should be done as follows:




Semester – II

Course Code: CSE375 Title: LAB-8 Artificial Intelligence (ELECTIVE-II) Teaching Scheme Examination Scheme Practical: 02 Hours/Week Term Work: 50 Marks

Suggestive List of Practical Assignments: Design, develop and implement the following Assignments ….... 1. Study of Prolog 2. Program to generate family tree 3. Program for Water Jug Problem. 4. Program checking a person eligible for voting. 5. Write a program to implement Single Player Game (Using Heuristic Function) 6. Write a program to Implement A* Algorithm. 7. Program to calculate factorial of a number 8. Program for generating Fibonacci series 9. Program for generating pyramid 10. Program for Towers of Hanoi puzzle 11. Design an expert system (Ex. Medical Diagnosis System) Term Work: The term work shall consist of at least 8 experiments/ assignments based on the syllabus above. Assessment of term work should be done as follows

Continuous lab assessment Actual practical performance in Laboratory.



Course Code: CSE376 Title: LAB-8: Network security (Elective-II) Teaching Scheme Examination Scheme Practical: 2 Hours/Week Term Work: 50 Marks Suggestive List of Practical Assignments:

1. Write a socket program to implement TCP quiz 2. Write a program for a tic-tac-toe game with any attack model 3. Write socket programs for authentication problems 4. Implement a File Transfer Protocol and analyze attack pattern. 5. Write a problem of secure communication between two groups 6. Design a communication protocol to anonymous routing. 7. Design and code security association between computers in a network through shared

access 8. Exercises on Snort, Wireshark, network simulator tools.

NOTE: At least 08 Experiments along with a mini application must be done in the semester. Term Work: The Term Work shall consist of at least 8 experiments / assignments based on the suggestive list of practical assignments. Assessment of term work should be done as follows:




Semester – II

Course Code: CSE377 Title: Lab IX Software Development Lab-II (Mobile Application Development for Android)

Teaching Scheme Examination Scheme Practical: 2 Hours/Week Practical Exam(Marks): 50

Practical/Oral Exam (Duration): 3 hrs.

Prerequisite 1. Concepts in Object Oriented Programming Language 2. Knowledge of XML

Objectives: 1. To know the difference between android and other mobile development platform. 2. To understand how android app work through life cycle, intents, manifests etc. 3. To develop different android app with compelling user interfaces using menus, layouts and

Views. 4. To use android API for data storage, retrieval, content providers, SMS and Telephony. 5. Tap into location based services and different sensors.

CONTENTS

SECTION-A

Unit 1: Introduction to Android A little Background about mobile technologies, Android – An Open Platform for Mobile development, Native Android Application, Android SDK Features, what does Android run on? Free Additional Benefits Only At WEBCOM, Why Develop for Mobile?, Why develop for Android? , Android Development Framework, Android Application Architecture, Android Libraries Unit 2: User Interface Developing for Android, First Android application Using Android Studio/Visual studio xamarin, Running and Debugging, Creating Application and Activities, Application Manifest Introduction, Android Application Life Cycle, Application Priority and process states, Fundamental Android UI

Design, Study of different layouts (Linear, relative, table, absolute, frame, Constraint), Introducing Views, Creating new Views, Draw able Resources, Creating and Using menus Unit 3: Intents, Broadcast Receivers and Files Introducing Intents, Intents and Intent filters, What are Pending Intents, Adapters, Internet

Resources, Notifications, Introducing Dialogs, Saving Application Data in external and internal memory, Creating and saving preferences, Retrieving shared preferences, Creating a standard preference activity, Saving Activity State, Saving and Loading Files, Including static files as Resources, File management tools Unit 4: Database and Content Providers Introducing Android Databases, Introducing SQLite, Cursors and content values, Working with SQLite Database, Creating new content Provider, Introduction to Firebase, Real time/ Cloud, Authentication in firebase, Introduction to MySQL database, Connecting to MySQL by JSON, PHP scripts. Unit 5: Telephony, Hardware and Network Services Telephony, Reading Phone device details, Reading Sims Details, Incoming and outgoing call monitoring, Tracking Service Change, Introducing SMS and MMS, Sending SMS and MMS, Sending SMS messages manually, Use of Bluetooth, Managing Network Connectivity, Managing Wi-Fi Unit 6: Google Services/Maps, Sensors and Multimedia Google Map - Layout file, Google Map – Android Manifest file, Customizing Google Map, Adding Marker, Changing Map Type, Enable/Disable zoom, Using Sensors and Sensor Manager Interpreting sensor values, Using Compass, Accelerometer and orientation services, Controlling Device Vibration, Working with multimedia players (Audio/Video) Text Books/ Reference Books/ Internet Resource: 5. Hello Android: Pragmatic Book Shelf 2009 6. Professional Android Development, Wrox 7. Mobile App Development 8. https://www.tutorialspoint.com,

List of Suggestive Experiments

Design, develop and implement following assignments using Android Studio/ Visual studio xamarin. 1. Design and develop Android Application to display “Hello World” using basic Widgets 2. Design and develop Android Application to demonstrate Activity Life Cycle

3. Design and develop Android Application to demonstrate GUI by using different Layouts/widgets

4. Design and develop Android Application to demonstrate views in Android 5. Design and develop Android Application to demonstrate Intents(Implicit/ Explicit) 6. Design and develop Android Application to demonstrate Broadcast Receivers/Services 7. Design and develop Android Application to demonstrate Saving Files in External/Internal

Storage 8. Design and develop Android Application to demonstrate Content Providers 9. Design and develop Android Application to demonstrate SQLite database (Dictionary, Quiz,

etc.) 10. Design and develop Android Application to demonstrate firebase operations (data push,

retrieval, delete, update etc.) 11. Design and develop Android Application to demonstrate MySQL database 12. Design and develop Android Application to demonstrate use of Telephony (Call/SMS) 13. Design and develop Android Application to demonstrate use of Bluetooth/wi-fi 14. Design and develop Android Application to demonstrate use of google map API 15. Design and develop Android Application to play audio/video files 16. Design and develop Android Application to demonstrate sensors (Accelerometer/Campass)

List of Suggestive Assignments

1. Develop an application for Hospital(Patient/Doctor portal) 2. Develop an application for online Quiz 3. Develop chat application

MINI PROJECT (Compulsory): Students has to submit a mini project at end of semester with report in a group of maximum 3 students

Practical Examination: Practical Examination should be conducted by internal examiner for three hours under the supervision of external examiner. External examiner should evaluate student by checking practical performance and conducting viva. ----------------------------------------------------------------------------------------------------------------------

Scanned by CamScanner

Software

Testing

Algorithms for

Big Data

Structures

Software

Language

Engineering

Cryptography and

Network Security

Introduction to

Cognative

Systems

Virtual

Reality

Mobile

Computing

Stroage

Systems

Functional

Programming

Object

Oriented

Systems

Reinforcement

Learning

Pattern

Recognitio

n

1 Mr. S. B. Kalyankar

2 Mrs. P. A. Joshi

3 Mr. S. G. Shah

4 Ms. P. P. Tribhuvan

5 Mrs. S. C. Nandedkar

6 Mr. P. M. Katkar

7 Mrs. M. P. Chaudhari

8 Mrs. S. K. Shelke

9 Mr. P. R. Rathod

10 Mrs. S. M. Chavan

11 Mrs. P. B. Dhas

12 Mr. P. B. Bhalerao

13 Mr. P. H. Durole

14 Mrs. S. S. Ponde

15 Mrs. A. S. Gaikwad

16 Mrs. P. N. Borase

Elective II Elective II

Subject Choice for M. Tech Engineering as Per Syllabus of BATU

Sr.

No

Name of Faculty/

Subjects

Data

Science

Software

Architect

ure

Elective III

17 Mrs. A. A. Joshi

18 Mr. V. S. Kolte

19 Mr. K. V. Reddy

20 Ms.M.R. Mundhe

21 Mr. P. B. Mahadik

22 Mr. V. S. Shinde

23 Mr. C. P. Jadhav

Hadoop

Technologies

Network

Infrastructure

Management

Data Science

With R


2 Mrs. P. A. Joshi

3 Mr. S. G. Shah



6 Mr. P. M. Katkar


8 Mrs. S. K. Shelke

9 Mr. P. R. Rathod


11 Mrs. P. B. Dhas


13 Mr. P. H. Durole

14 Mrs. S. S. Ponde



Elective II

Subject Choice for Final Year Engineering as Per Syllabus of BAMU

Sr. No Name of Faculty/ Subjects

Computer

System

Security and

Laws

Mobile

Computing

Soft

Computing

17 Mrs. A. A. Joshi

18 Mr. V. S. Kolte

19 Mr. K. V. Reddy

20 Ms.M.R. Mundhe


22 Mr. V. S. Shinde

23 Mr. C. P. Jadhav

Object Oriented

Programming in

C++

Object

Oriented

Programming

in Java

Numerical

Methods

Physics of

Engineering

Materials

Soft Skill and

Personality

Development


2 Mrs. P. A. Joshi

3 Mr. S. G. Shah



6 Mr. P. M. Katkar


8 Mrs. S. K. Shelke

9 Mr. P. R. Rathod


11 Mrs. P. B. Dhas


13 Mr. P. H. Durole

14 Mrs. S. S. Ponde


Subject Choice for Second Year Engineering as Per Syllabus of BATU

Product

Design

Engineering

Elective I

Sr.

No

Name of Faculty/

Subjects

Design and

Analysis of

Alogrithm

Probability

and

Statistics

Operating

System

Elective II


17 Mrs. A. A. Joshi

18 Mr. V. S. Kolte

19 Mr. K. V. Reddy

20 Ms.M.R. Mundhe


22 Mr. V. S. Shinde

23 Mr. C. P. Jadhav

Distributed

Operating

System

Artifical

Intelligence

Network

Security


2 Mrs. P. A. Joshi

3 Mr. S. G. Shah



6 Mr. P. M. Katkar


8 Mrs. S. K. Shelke

9 Mr. P. R. Rathod


11 Mrs. P. B. Dhas


13 Mr. P. H. Durole

14 Mrs. S. S. Ponde



System

Programming

Elective I

Subject Choice for Third Year Engineering as Per Syllabus of BAMU

Sr. No Name of Faculty/ SubjectsAdvanced

Java

Software

Engineering

Design and

Analysis of

Algorithm

17 Mrs. A. A. Joshi

18 Mr. V. S. Kolte

19 Mr. K. V. Reddy

20 Ms.M.R. Mundhe


22 Mr. V. S. Shinde

23 Mr. C. P. Jadhav

CO for DEMP

On successful completion of this course, student should be able to:

1. Define basic logical circuits, Boolean algebra, minimization methods,

methods for writing Boolean functions, combinational and sequential

circuits

2. To verify the theoretical and practical knowledge about synthesis of

combinational and sequential circuits, and programmable structures.

3. Students will be able to Design and analyze of electronic circuits.

4. To understand the applications of Microprocessors.

5. To understand need of Microprocessors in computer system.

6. To understand architecture and features of typical Microprocessors.

CO for DSR

On successful completion of this course, student should be able to:

1. Describe a flow process for data science problems (Remembering)

2. Classify data science problems into standard typology (Comprehension)

3. Develop R codes for data science solutions (Application)

4. Correlate results to the solution approach followed (Analysis)

5. Assess the solution approach (Evaluation)

6. Construct use cases to validate approach and identify modifications required

(Creating)

/

Digital Electronics and MicroprocessorTeacher: Sanjay Kalyankar

Python for Data Science and Machine LearningJust Getting Started? dive in.Python is a language with a simple syntax, and a powerful set oflibraries. It is an interpreted language, with a rich programmingenvironment, including a robust debugger and profiler.

python is a popular language in the fields such as Data Science,Machine Learning. the reason behind it is that most people whoare data scientists or Machine Learning professionals need not tobe from a Computer Science background, most of the people arestatistics experts, or Economists, etc. and as python is easy tounderstand, as well as to learn, python is their first preference.and Hey, so as ours! Language such as R is also popular in thisfield and there has been a debate all the time about which one isbetter. but don't get into it, both languages are similarly powerfulto apply all kinds of ML and DL algorithm.

We, AI School, have designed this course for the beginners, andalso for the ones who want to brush up the skills of python.Wewill be covering the basic python programming in this course, andwe will learn numpy, pandas, matplotlib, seaborn, scikit-learn,tensorflow, pytorch,etc. in the advanced course. but this coursewill be a prerequisite to the advanced course.

Instructor: Yash Balwir

Elearn DIEMS Portal

The Deogiri Institute of Engineering and Management Studies CSE Dept. has configured this Portal , coursemanagement medium, for use by faculty members and students for the courses running in the current semester. Apartfrom online dissemination of course study materials, Portal supports a host of other features for every course like news,blogs, discussion forums and facility for online submission of assignments and quizzes.

All students and faculty members are pre-enrolled in various courses according to the course registration data for thecurrent semester provided by the academic sections. Guest logins for all courses are enabled by default, but the the coursecoordinators may disable them for their specific courses if they so choose. Course coordinators/creators have full editingrights for their courses. Some tutorials for using Moodle can be foundat http://docs.moodle.org/en/Getting_started_for_teachers and http://docs.moodle.org/en/Student_tutorials.

The CSE Dept. wishes to thank Dept. Support Team for their invaluable help in setting up this facility quickly. Pleasecontact for queries or help at [email protected]

Available courses

http://elearndietms.org/course/view.php?id=57

http://elearndietms.org/user/view.php?id=1606&course=1



http://docs.moodle.org/en/Getting_started_for_teachers

http://docs.moodle.org/en/Student_tutorials

/

Internet of ThingsInstructor : Prof. PRAVIN B. MAHADIK Hours :40

Prerequisite:

1. Introductory course on Computer Networks

2. Sensors Technology

Course Objectives:

· An Understanding of the IoT value chain structure(device,cloud,data),application area and technologies involved

· IoT applications and example overview

· An Understanding of various sensor technologies

Introduction To ResearchLarge numbers of students are actively considering and taking upresearch and associated higher studies. This course aims tointroduce students to the important aspects of research. Theintent of the course is to make students aware of the detailsassociated with formal research and to help students overcomecommon misconceptions that may be present in their minds. Bygoing through this course, students are likely to be able to takeup research activities in a more systematic and formal mannerright from the beginning.

Teacher: Sanjay Kalyankar

Data StructureTeacher: Padmapani Tribhuvan

Design & Analysis of AlgorithmThis course will cover basic concepts in the design and analysis ofalgorithms.

Asymptotic complexity, O() notationSorting and searchAlgorithms on graphs: exploration, connectivity, shortestpaths, directed acyclic graphs, spanning treesDesign techniques: divide and conquer, greedy, dynamicprogramming, back tracking,branch and bound

Teacher: Prachi Joshi

DATA SCIENCE FOR BE CSEData scientist is the pinnacle rank in an analytics organization.Glassdoor has ranked data scientist first in the 25 Best Jobs for2016, and good data scientists are scarce and in great demand.









/

As a data scientist you will be required to understand thebusiness problem, design the analysis, collect and format therequired data, apply algorithms or techniques using the correcttools, and finally make recommendations backed by data.

Operating SystemUnit 1

Introduction and Operating system structures: Definition, Typesof Operating system, Real-

Time operating system, System Components- System Services,Systems Calls, System Programs,

System structure. Virtual Machines, System Design andImplementation, System Generations.

Unit 2

Processes and CPU Scheduling: Process Concept, ProcessScheduling, Operation on process,

Cooperating processes. Threads, Inter-process Communication,Scheduling criteria, scheduling

Algorithms, Multiple-Processor Scheduling, Real-Time Scheduling,Scheduling Algorithms and

performance evaluation.

Unit 3

Process Synchronization The critical-section problem, Criticalregions, Synchronization

Hardware, Semaphores, Classical Problems of synchronization,and Monitors Synchronizations in Solaris.

Unit 4

Teacher: pankaj durole



/

Deadlocks: Systems Model, Deadlock characterization, Methodsfor handling Deadlocks,

Deadlock Prevention, Deadlock Avoidance, Deadlock Detection,Recovery from Deadlock,

Combined approach to deadlock Handling.

Unit 5

Memory Management: Basic concept, Logical and Physicaladdress map, Memory allocation:

Continuous Memory Allocation, Fixed and variable partition,Internal and external fragmentation

and compaction, Paging: Principle of operation, Page allocation –Hardware support for paging,

Protection and sharing, Disadvantages of paging.

Virtual Memory: Basics of Virtual Memory – Hardware and controlstructures – Locality of

reference, Page fault, Working Set, Dirty page/Dirty bit – Demandpaging, Page Replacement

algorithms: Optimal, First in First Out (FIFO), Second Chance(SC), Not recently used (NRU) and

Least Recently used (LRU).

Unit 6

I/O Hardware: I/O devices, Device controllers, Direct memoryaccess Principles of I/O Software:

Goals of Interrupt handlers, Device drivers, sDevice independentI/O software, Secondary-Storage

Structure: Disk structure, Disk scheduling algorithms.

File Management: Concept of File, Access methods, File types,File operation, Directory

structure, File System structure, Allocation methods (contiguous,linked, indexed), Free-space

management (bit vector, linked list, grouping), directoryimplementation (linear list, hash table), efficiency andperformance.

Soft Skills and Personality DevelopmentTeacher: Roma Ludrik

Object Oriented Programming using JavaTeacher: Padmapani Tribhuvan

CSSLTeacher: Sanjay Kalyankar







/

Advanced JAVA

Instructor : Prof. PRAVIN B. MAHADIK / Prof. Priyanka B.Dhas Hours :50

Prerequisite

1. Object oriented Programming in C++.

2. Programming in core JAVA.

3. Basics of Web Technology.

Objectives:

1. Construct a Web Application using Servlets

2. Construct a Web application using Java Server Pages

3. To understand working of Web service

4. Construct an asynchronous enterprise application usingMessage-Driven Beans

5. Fetch data effectively from database using traditional SQL andHibernate Query Language

Microprocessor and Computer OrganizationInstructor : Prof. SANJAY KALYANKAR/ Prof.PANKAJDUROLE

Hours :40

Prerequisite:

1. Digital Electronics

2. Logic Design

3. Programming Concept

Objectives:

1.To Learn the architecture and Assembly Language Programmingof 8086 Microprocessor

2. To provide in depth knowledge to the students about thedesign and organization of digital computer, operation of variousfunctional units, instruction set design and factors that influencethe performance of a computer


Object Oriented Programming Using C++Instructor: Padmapani Tribhuvan

Hours: 40

Prerequisite:

Teacher: Padmapani Tribhuvan






/

1. Fundamental knowledge about computers.

2. Computing knowledge

3. Basics of programming paradigms/constructs.

Objectives:

1. To study and understand the object oriented programmingconcepts and methodology

2. Be able to build C++ classes using appropriate encapsulationand design principles.

3. Be able to solve computational problems using C++ featuressuch as composition of objects, operator overloads, dynamicmemory allocation, inheritance and polymorphism, file I/O,exception handling, etc.

Hadoop TechnologyInstructor: Prof. K.V. Reddy / Prof. V.S. Kolte

Hours: 40

Prerequisite:

· Operating Systems.

· OOPS

· JAVA

· RDBMS

· Linux(Suggested)

Objectives:

· To train the students with the concepts of Hadoop.

· To develop programs in Hadoop because of the need tohandle Big Data in the enterprise.

To train the students with the projects (Hive, Pig, Sqoop,HBase…) in the Hadoop

Teacher: Vijay Kolte

Data Analytics Using RData analytics refers to qualitative and quantitative techniquesand processes used to enhance productivity and business gain.Data is extracted and categorized to identify and analyzebehavioral data and patterns, and techniques vary according toorganizational requirements.

Data analytics is primarily conducted in business-to-consumer(B2C) applications. Global organizations collect and analyze dataassociated with customers, business processes, market economicsor practical experience. Data is categorized, stored and analyzedto study purchasing trends and patterns.

Teacher: Vishal Reddy





/

Evolving data facilitates thorough decision-making. For example,a social networking website collects data related to userpreferences, community interests and segment according tospecified criteria such as demographics, age or gender. Properanalysis reveals key user and customer trends and facilitates thesocial network's alignment of content, layout and overall strategy.

Data analytics is the pursuit of extracting meaning from raw datausing specialized computer systems. These systems transform,organize, and model the data to draw conclusions and identifypatterns.

Mobile ComputingTeacher: pramod bhalerao

Network Infrastructure ManagementTitle: - Elective II Network Infrastructure Management(NIM)

Instructor: Prof. S. G. Shah

Hours: 40

Prerequisite:

Fundamentals of OSI & Basic Networking Concepts.

Objectives:

· To get acquainted with the concepts of networking.

· To understand the concepts of routing and switching.

· To get acquainted with configuration of router and switch,network monitoring tools

Teacher: sandeep shah

Mobile Computing(UG)Teacher: PRAVIN RATHOD

Soft ComputingAbout The Course

Soft computing is an emerging approach to computing whichparallel the remarkable ability of the human mind to reason andlearn in an environment of uncertainty and imprecision. Softcomputing is based on some biological inspired methodologiessuch as genetics, evolution, ant’s behaviors, particles swarming,human nervous systems, etc. Now, soft computing is the onlysolution when we don’t have any mathematical modeling ofproblem solving (i.e., algorithm), need a solution to a complexproblem in real time, easy to adapt with changed scenario andcan be implemented with parallel computing. It has enormous










/

applications in many application areas such as medical diagnosis,computer vision, hand written character recondition, patternrecognition, machine intelligence, weather forecasting, networkoptimization, VLSI design, etc.

Instructional Method and Pedagogy

1. At the start of course, the course delivery pattern, prerequisiteof the subject will be discussed.

2.Lectures will be conducted with the aid of Multi-media projector,Green board etc.

3. Attendance is compulsory in laboratory which carries 10 marksin overall

evaluation.

4. One internal exam will be conducted as a part of internaltheory evaluation.

5. Assignments based on the course content will be given to thestudents for each unit and will be evaluated at regular intervalevaluation.

6.Surprise tests/Quizzes/Seminar/tutorial will be conductedhaving a share of five marks in the overall internal evaluation.

7.The course includes a laboratory, where students have anopportunity to build an appreciation for the concepts being taughtin lectures.

8.Experiments shall be performed in the laboratory related tocourse contents.

COMPUTER GRAPHICSPrerequisite:

1. Computer programming skills in C programming language

2. Basic understanding of use of data structures

3. Basic Mathematical concepts related to matrices and geometry

Objectives:

1. Introduce the students to graphics fundamentals

2. Make them aware of 2-D and 3-D graphics primitives

3. Provide the programmer’s perspective of working of ComputerGraphics using OpenGL

4. Know the basics of multimedia applications

Teacher: Sonali Shelke

Cryptography and NetworksecurityThis Course is as per M.Tech CSE second semester course underelective 3 of BATU syllabus.

Teacher: Rahat Afreen Khan

Python Programming






/

Instructor : Prof. PRAVIN B. MAHADIK Hours :40

Prerequisite

1. C Language Basics

2. Programming Language Basics

Objectives:

1. Construct an Application / Project

2. To understand working of Python Interpreter

3. To understand Network communication through Python

4. Fetch data effectively from database using MySql & PythonScript

Programming in JavaPrerequisite:

1. Basics of programming languages.

2. Concepts of Object Oriented Programming languages.

Objectives:

The students will be able to:

1. Apply object oriented features to real time entities.

2. Handle exceptions & implement multithreaded programs.

3. Implement database programming.

4. Design & implement GUI with event handling

5. Develop I/O & networking programs.

Teacher: Padmapani Tribhuvan

Engineering Mathematics-IIIInstructor : Prof. C. P. Jadhav

Hours :40

Prerequisite:

1. Basics Knowledge of Derivative and Integration .

2. Concepts of Functions.

Learning Objectives:

Module: Laplace Transform and Inverse Laplace Transform

LEVEL OBJECTIVES Course Outcomes

Recall

Students will be able todefine Laplace Transform.

Teacher: Changdev Jadhav





/

Students will be ableto formulate varioustypes of systems andsolve by using LaplaceTransform.

Understand

Students will be able to findthe Laplace Transform ofdifferent functions.

Apply

Students will be able to usedifferent properties to findLaplace Transform.

Analyze

Students will be able toselect appropriate propertyto find Laplace Transform

Evaluate

Students will be able solvedifferential equations using Laplace Transform

Create

Student will be able tomake a mathematicalmodel and solve by usingLaplace Transform.

Programming in Java1Prerequisite: 1.Basic programmingconcepts. 2.OOP concepts.

Objective: The students will be ableto: 1. Apply object orientedfeatures to real time entities. 2. Handle exceptions &implement multithreaded programs. 3. Implement databaseprogramming 4. Design & implementGUI with event handling 5. Develop I/O &networking programs.

Teacher: priyanka dhas

Digital Electronics and MicroprocessorTeacher: sugandha nandedkar


http://elearndietms.org/mod/folder/view.php?id=803




/

Computer Architecture and OrganizationInstructor : Prof. SANJAY KALYANKAR / Prof.PANKAJDUROLE

Course Summary:

Introduction to Computer abstractions and technologyComputer systems performanceInstruction Set Architecture (ISA); MIPSSigned / unsigned number representationsRepresenting instructionsCentral Processing Unit: datapath and controlMemory and Memory HierarchyVirtual memoryStorageInput-Output organizationMultiprocessors and clustersDigital computer logic


Data StructuresData structures provide a means to manage large amounts ofdata for use in databases and internet indexing services. Efficientdata structures are key for designing efficient algorithms andobtaining maintainable software design.

In this Computer Science course, you will start by learning basicdata types, such as numbers, and gradually build a conceptualframework for organizing and managing efficient structures.

Topics covered:

Basic Data Types, Notion of an Abstract Data TypeMathematical Properties of SequencesSpecial Types of Sequences: Stacks, QueuesImplementation of Sequence Type: Arrays and Linked ListsSingly,Doubly and Circular Linked ListTreesGraphs


Discrete MathematicsDiscrete Mathematics is a branch of mathematics involvingdiscrete elements that uses algebra and arithmetic. It isincreasingly being applied in the practical fields of mathematicsand computer science. It is a very good tool for improvingreasoning and problem-solving capabilities. This tutorial explainsthe fundamental concepts of Sets, Relations and Functions,

Teacher: Smita Ponde







/

Mathematical Logic, Group theory, Counting Theory, Probability,Mathematical Induction and Recurrence Relations, Graph Theory,Trees and Boolean Algebra

HTML and JavascriptAn overview:

HTML provides the basic structure of sites, which is enhancedand modified by other technologies like CSS andJavaScript. It's the starting point for anyone learning how tocreate content for the web.CSS is used to control presentation, formatting, and layout.CSS is what gives your entire website its style. It's also whatallows websites to adapt to different screen sizes and devicetypes.JavaScript is a programming language that lets webdevelopers design interactive sites. Most of the dynamicbehavior you'll see on a web page is thanks to JavaScript,which augments a browser's default controls and behaviors.

Teacher: Natasha Patel

Cloud Computing For Final Year (2019-20 SEM I)

Advanced Computer NetworksTeacher: Rahat Afreen Khan

Intrusion Detection SystemTeacher: Padmapani Tribhuvan

Computer AlgorithmsTeacher: Smita Ponde

Machine Design

Mechanical EngineeringDesign Process

Teacher: Amitpal Singh Punewale

http://elearndietms.org/mod/url/view.php?id=551











http://elearndietms.org/course/view.php?id=62#section-1


/

Traditional design methods, general industrial design procedure,design considerations, phases in design, creativity in design, useof standardization, preferred series, introduction to ISO9000, useof design data book, aesthetic and ergonomic considerations indesign.

Demo

Site announcementsSubscribe to this forum

Search courses:

Go

Sign Up Issueby Pravin Mahadik - Monday, 8 January 2018, 12:07 PM

Your college Firewall login is the same Login to sign in into this portal , if you are not have any login thensign up here and send the mail to [email protected] containing your name.

Permalink

View the discussion (0 replies so far)


http://elearndietms.org/mod/forum/subscribe.php?id=1&sesskey=2sXMxcFUft

http://elearndietms.org/user/profile.php?id=2


http://elearndietms.org/mod/forum/discuss.php?d=10#p12

http://elearndietms.org/mod/forum/discuss.php?d=10

66

68

68

67

68

68

67

65

65

65

65

61

65

60

64

63

62

65

62

61

64

66

64

63

62

63

0 10 20 30 40 50 60 70 80 90 100

The faculty is able to motivate the students who are facing difficulty in the givensubject.

The faculty reacts positively to the students questions during ongoing sessions.

The feedback from the faculty to the students on their performance is honest.

The faculty is able to accept the mistakes made (if any) in a session.

The faculty is open minded and friendly with the students.

I can ask whatever i want to the faculty. (relevant to the subject)

The environment in the classroom is friendly and inviting.

I am satisfied with the way i have been taught the subject by the faculty.

The faculty has a command on the language he/she uses in the sessions.

I believe the Professor has indepth knowledge of the subject he/she is teaching.

I am able to follow the language pattern/ communication pattern of the faculty.

I am able to clearly understand the content taught in the session.

I am able to clearly understand the speech of the faculty.

Are you able to reach the faculty unofficially i.e. using media communication.

The faculty is available to you post classroom session for doubt clarification.

The content of the subject taught to me by the faculty is going to prove veryuseful as a practical application in later life.

The reference and supporting materials prescribed by the faculty is relevant andupdated.

The faculty plans the assignments, projects and practicals before hand.

The faculty is able to teach the entire coursework allotted in a given semester.

The faculty has planned sessions and distributed the course work for a subject atthe start of the semester.

The faculty arranges for "Industry Field Trips" and SME Lectures for a better andpractical understanding of the subject.

The faculty uses Audio visual aides in teaching along with regular classroomsessions and books.

The faculty provides constructive feedback in areas where student may befaltering.

The progress and deliveries of the session are as per lesson plan provided to thestudent.

Faculty conduct sessions in an effective and systematic way clarifying objectives,method and final takeaways

I am able to understand what is being taught to me

Feedback of: Prof. P. B.Dhas (TH) Class: TE-CSE Subject: AJ Sem. II

Year : 2018-19

72

72

71

73

73

72

72

69

69

70

70

70

69

68

72

70

68

68

68

68

65

67

68

68

66

65

0 10 20 30 40 50 60 70 80 90 100

The faculty is able to motivate the students who are facing difficulty in thegiven subject.

The faculty reacts positively to the students questions during ongoing sessions.

The feedback from the faculty to the students on their performance is honest.

The faculty is able to accept the mistakes made (if any) in a session.

The faculty is open minded and friendly with the students.

I can ask whatever i want to the faculty. (relevant to the subject)

The environment in the classroom is friendly and inviting.

I am satisfied with the way i have been taught the subject by the faculty.

The faculty has a command on the language he/she uses in the sessions.

I believe the Professor has indepth knowledge of the subject he/she isteaching.

I am able to follow the language pattern/ communication pattern of thefaculty.

I am able to clearly understand the content taught in the session.

I am able to clearly understand the speech of the faculty.

Are you able to reach the faculty unofficially i.e. using media communication.

The faculty is available to you post classroom session for doubt clarification.

The content of the subject taught to me by the faculty is going to prove veryuseful as a practical application in later life.

The reference and supporting materials prescribed by the faculty is relevantand updated.

The faculty plans the assignments, projects and practicals before hand.

The faculty is able to teach the entire coursework allotted in a given semester.

The faculty has planned sessions and distributed the course work for a subjectat the start of the semester.

The faculty arranges for "Industry Field Trips" and SME Lectures for a betterand practical understanding of the subject.

The faculty uses Audio visual aides in teaching along with regular classroomsessions and books.

The faculty provides constructive feedback in areas where student may befaltering.

The progress and deliveries of the session are as per lesson plan provided tothe student.

Faculty conduct sessions in an effective and systematic way clarifyingobjectives, method and final takeaways

I am able to understand what is being taught to me

Feedback of: Prof. S.G. Shah (PR) Class: TE-CSE Subject: SE Sem. II

Year : 2018-19

DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Mid Semester Examination – Oct 2019

Course: B. Tech in Computer Science and Engineering Sem: III

Subject Name: Computer Architecture and Organization Subject Code:BTCOC305

Max Marks:20 Date:-06/10/2019 Duration:- 1 Hr.

QUESTION PAPER

(Level/CO) Marks

Q. 1 Attempt any two from following (2*3=6) 6 Marks

(A) Elaborate the basic components of Computer System Understand

(B) Represent (359.50)10 in Single precision short real format. Apply

(C) Compare and Contrast any two addressing modes with examples Remember

Q.2 Attempt any two from following (2*3=6) 6

(A) Express types of arithmetic operations with instruction examples Understand

(B) Write an assembly language program to subtract two 8-Bit Numbers Apply

(C) Subtract 100110 from 11001 using 2’s Complement subtraction Apply

Q. 3 Solve Any One of the following. (1*8=8) 8

(A) Depict and Explain Hardware implementation of Floating point addition and

subtraction

Remember

(B) While executing an Instruction how State Transition takes place? Explain it

with the help of Diagram in detail

Understand

*** End ***

SOLUTION:

Q. 1 Attempt any two from following (2*3=6)

(A) Elaborate the basic components of Computer System

Computer designs are based on concepts developed by John von Neumann at the Institute for Advanced

Studies, Princeton. Such a design is referred to as the von Neumann architecture and is based on three key

concepts:

• Data and instructions are stored in a single read–write memory.

• The contents of this memory are addressable by location, without regard to the type of data contained there.

• Execution occurs in a sequential fashion (unless explicitly modified) from one instruction to the next.

The basic function performed by a computer is execution of a program, which consists of a set of instructions

stored in memory. The processor does the actual work by executing instructions specified in the program. In its

simplest form, instruction processing consists of two steps: The processor reads ( fetches) instructions from

memory one at a time and executes each instruction. Program execution consists of repeating the process of

instruction fetch and instruction execution. The instruction execution may involve several operations and

depends on the nature of the instruction

The processing required for a single instruction is called an instruction cycle. Using the simplified two-step

description. The two steps are referred to as the fetch cycle and the execute

cycle. Program execution halts only if the machine is turned off, some sort of unrecoverable

error occurs, or a program instruction that halts the computer is encountered.

Instruction Fetch and Execute

At the beginning of each instruction cycle, the processor fetches an instruction from memory. In a typical

processor, a register called the program counter (PC) holds the address of the instruction to be fetched next.

Unless told otherwise, the processor always increments the PC after each instruction fetch so that it will fetch

the next instruction in sequence (i.e., the instruction located at the next higher memory address). So, for

example, consider a computer in which each instruction occupies one 16-bit word of memory. Assume that the

program counter is set to location 300.The processor will next fetch the instruction at location 300. On

succeeding instruction cycles, it will fetch instructions from locations 301, 302, 303, and so on.This sequence

may be altered, as explained presently. The fetched instruction is loaded into a register in the processor known

as the instruction register (IR). The instruction contains bits that specify the action the processor is to take. The

processor interprets the instruction and performs the required action. In general, these actions fall into four

categories:

• Processor-memory: Data may be transferred from processor to memory or from memory to processor.

• Processor-I/O: Data may be transferred to or from a peripheral device by transferring between the processor

and an I/O module.

• Data processing: The processor may perform some arithmetic or logic operation on data.

• Control: An instruction may specify that the sequence of execution be altered. For example, the processor

may fetch an instruction from location 149, which specifies that the next instruction be from location 182. The

processor will remember this fact by setting the program counter to 182.Thus, on the next fetch cycle, the

instruction will be fetched from location 182 rather than 150.

(B) Represent (359.50)10 in Single precision short real format.

Steps:

Step 1: Convert the number into binary (1 Mark)

(359)10= (101100111)2

(0.50)10 = 0.50*2=1

(0.5)10=(.1)2

Step 2: Normalize the number (1 Mark)

101100111.1=(-1)0

*1.011001111*28

Step 3: Baised Exponent= True Exponent + Bais (1 Mark)

= 8+127=135

Step 4: Convert Baised Exponent to Binary (1 Mark)

135=10000111

Step 5:Single Precision 32 Bit Format (1 Mark)

010000111011001111

(C) Compare and Contrast any two addressing modes with

examples

The address field or fields in a typical instruction format are relatively small. We would like to be able to

reference a large range of locations in main memory or, for some systems, virtual memory. To achieve this

objective, a variety of addressing techniques has been employed. They all involve some trade-off between

address range and/or addressing flexibility, on the one hand, and the number of memory references in the

instruction and/or the complexity of address calculation, on the other.

Different addressing techniques are:

• Immediate

• Direct

• Indirect

• Register

• Register indirect

• Displacement

• Stack

These modes are illustrated in Figure 11.1. In this section, we use the following notation:

(X) = contents of memory location X or register X

EA = actual (effective) address of the location containing the referenced operand

R = contents of an address field in the instruction that refers to a register

A = contents of an address field in

Immediate addressing.

The simplest form of addressing is immediate addressing, in which the operand value is present in the

instruction

Operand = A

This mode can be used to define and use constants or set initial values of variables. Typically, the number will

be stored in twos complement form; the left-most bit of the operand field is used as a sign bit. When the

operand is loaded into a data register, the sign bit is extended to the left to the full data word size.

In some cases, the immediate binary value is interpreted as an unsigned nonnegative integer.

The advantage of immediate addressing is that no memory reference other than the instruction fetch is required

to obtain the operand, thus saving one memory or cache cycle in the instruction cycle. The disadvantage is that

the size of the number is restricted to the size of the address field, which, in most instruction sets, is small

compared with the word length.

Ex: MOV AL, 25H

ADD CL, 56H

Direct addressing

A very simple form of addressing is direct addressing, in which the address field contains the effective address

of the operand:

EA = A

The technique was common in earlier generations of computers but is not common on contemporary

architectures. It requires only one memory reference and no special calculation. The obvious limitation is that it

provides only a limited address space.

Ex: MOV AL, [25H]

ADD CL, [56H]

Q.2 Attempt any two from following (2*3=6)

(A) Express types of arithmetic operations with instruction

examples Ans: the set of machine instructions must be sufficient to express any of the instructions from a high-level

language. With this in mind we can categorize instruction types as follows:

• Data processing: Arithmetic and logic instructions

ADD AL, BL

SUB AL, BL

DIV AX, BL

• Data storage: Movement of data into or out of register and or memory locations.

• Data movement: I/O instructions

MOV AL, BL

PUSH AX

• Control: Test and branch instructions

Arithmetic instructions provide computational capabilities for processing numeric data. Logic (Boolean)

instructions operate on the bits of a word as bits rather than as numbers; thus, they provide capabilities for

processing any other type of data the user may wish to employ. These operations are performed primarily on

data in processor registers. Therefore, there must be memory instructions for moving data between memory and

the registers. I/O instructions are needed to transfer programs and data into memory and the results of

computations back out to the user. Test instructions are used to test the value of a data word or the status of a

computation. Branch instructions are then used to branch to a different set of instructions depending on the

decision made.

Opcode Operand Explanation Example

ADD R A = A + R ADD B

ADD M A = A + Mc ADD 2050

ADI 8-bit data A = A + 8-bit data ADD 50

ADC R A = A + R + prev. carry ADC B

ADC M A = A + Mc + prev. carry ADC 2050

ACI 8-bit data A = A + 8-bit data + prev. carry ACI 50

SUB R A = A – R SUB B

SUB M A = A – Mc SUB 2050

SUI 8-bit data A = A – 8-bit data SUI 50

SBB R A = A – R – prev. carry SBB B

SBB M A = A – Mc -prev. carry SBB 2050

SBI 8-bit data A = A – 8-bit data – prev. carry SBI 50

INR R R = R + 1 INR B

INR M M = Mc + 1 INR 2050

INX r.p. r.p. = r.p. + 1 INX H

DCR R R = R – 1 DCR B

DCR M M = Mc – 1 DCR 2050

DCX r.p. r.p. = r.p. – 1 DCX H

DAD r.p. HL = HL + r.p. DAD H

(B) Write an assembly language program to subtract two 8-Bit

Numbers

DATA SEGMENT

NUM1 DB 03H

NUM2 DB 02H

DATA ENDS

CODE SEGMENT

ASSUME CS:CODE,DS:DATA

START:

MOV AX,DATA

MOV DS,AX

MOV AL,NUM1

MOV BL,NUM2

SUB AL,BL

ADD AL,30H

MOV DL,AL

MOV AH,02H

INT 21H

MOV AH,4CH

INT 21H

CODE ENDS

END START

(C) Subtract 100110 from 11001 using 2’s Complement subtraction

Steps:

Step 1: Determine two’s complement of larger number

011010

Step 2: Add Two’s complement to small number

011010

+ 11001

110011

Step 3: Take the two’s complement of result

001101= (13)

Step 4: Assign Negative Sign

-(13)

Q. 3 Solve Any One of the following. (1*8=8)

(A) Depict and Explain Hardware implementation of Floating point

addition and subtraction

FLOATING POINT ADDITION

To understand floating point addition, first we see addition of real numbers in decimal as same logic is applied

in both cases.

For example, we have to add 1.1 * 103 and 50.

We cannot add these numbers directly. First, we need to align the exponent and then, we can add significand.

After aligning exponent, we get 50 = 0.05 * 103

Now adding significand, 0.05 + 1.1 = 1.15

So, finally we get (1.1 * 103 + 50) = 1.15 * 10

3

Here, notice that we shifted 50 and made it 0.05 to add these numbers.

Now let us take example of floating point number addition

We follow these steps to add two numbers:

1. Align the significand

2. Add the significands

3. Normalize the result

Let the two numbers be

x = 9.75

y = 0.5625

Converting them into 32-bit floating point representation,

9.75’s representation in 32-bit format = 0 10000010 00111000000000000000000


Now we get the difference of exponents to know how much shifting is required.

(10000010 – 01111110)2 = (4)10

Now, we shift the mantissa of lesser number right side by 4 units.

Mantissa of 0.5625 = 1.00100000000000000000000

(note that 1 before decimal point is understood in 32-bit representation)

Shifting right by 4 units, we get 0.00010010000000000000000

Mantissa of 9.75 = 1. 00111000000000000000000

Adding mantissa of both

0. 00010010000000000000000

+ 1. 00111000000000000000000

————————————————-

1. 01001010000000000000000

In final answer, we take exponent of bigger number

So, final answer consist of :

Sign bit = 0

Exponent of bigger number = 10000010

Mantissa = 01001010000000000000000

32 bit representation of answer = x + y = 0 10000010 01001010000000000000000

FLOATING POINT SUBTRACTION

Subtraction is similar to addition with some differences like we subtract mantissa unlike addition and in sign bit

we put the sign of greater number.

Let the two numbers be

x = 9.75

y = – 0.5625

Converting them into 32-bit floating point representation


– 0.5625’s representation in 32-bit format = 1 01111110 00100000000000000000000

Now, we find the difference of exponents to know how much shifting is required.

(10000010 – 01111110)2 = (4)10

Now, we shift the mantissa of lesser number right side by 4 units.

Mantissa of – 0.5625 = 1.00100000000000000000000

(note that 1 before decimal point is understood in 32-bit representation)

Shifting right by 4 units, 0.00010010000000000000000

Mantissa of 9.75= 1. 00111000000000000000000

Subtracting mantissa of both

0. 00010010000000000000000

– 1. 00111000000000000000000

————————————————

1. 00100110000000000000000

Sign bit of bigger number = 0

So, finally the answer = x – y = 0 10000010 00100110000000000000000

(B) While executing an Instruction how State Transition takes

place? Explain it with the help of Diagram in detail

Each instruction must contain the information required by the processor for execution. Figure 10.1, shows the

steps involved in instruction execution and, by implication, defines the elements of a machine instruction. These

elements are as follows:

• Operation code: Specifies the operation to be performed (e.g., ADD, I/O). The operation is specified by a

binary code, known as the operation code, or opcode.

• Source operand reference: The operation may involve one or more source operands, that is, operands that

are inputs for the operation.

• Result operand reference: The operation may produce a result.

• Next instruction reference: This tells the processor where to fetch the next instruction after the execution of

this instruction is complete.

The address of the next instruction to be fetched could be either a real address or a virtual address, depending

on the architecture. Generally, the distinction is transparent to the instruction set architecture. In most cases, the

next instruction to be fetched immediately follows the current instruction. In those cases, there is no explicit

reference to the next instruction. When an explicit reference is needed, then the main memory or virtual

memory address must be supplied.

Source and result operands can be in one of four areas:

• Main or virtual memory: As with next instruction references, the main or virtual memory address must be

supplied. • Processor register: With rare exceptions, a processor contains one

or more registers that may be referenced by machine instructions. If only one register exists, reference to it may

be implicit. If more than one register exists, then each register is assigned a unique name or number, and the

instruction must contain the number of the desired register.

• Immediate: The value of the operand is contained in a field in the instruction being executed.

• I/O device: The instruction must specify the I/O module and device for the operation. If memory-mapped I/O

is used, this is just another main or virtual memory address.

Dr. Babasaheb Ambedkar Technological University, Lonere

Documents

Transcript of Dr. Babasaheb Ambedkar Technological University, Lonere