gokul global university department of computer …

GOKUL GLOBAL UNIVERSITY

DEPARTMENT OF COMPUTER ENGINEERING

COURSE: B.E

SUBJECT NAME: COMPILER DESIGN

SUBJECT CODE: FEB170401

SEMESTER - VII

Type of Course: Professional Core Courses

Prerequisite: Data Structures and Algorithms, Theory of Computation

Rationale: Compiler Design is a fundamental/core subject of Computer Engineering. It teaches

how Compiler of a Programming Language works. It also focuses on various designs of

Compiler and structuring and optimizing various phases of a Compiler. It is also necessary to

learn types of Grammar, Finite state machines, lex, yacc and related concepts of languages.

Teaching and Examination Scheme:

Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150

Th:-Theory, Tu: - Tutorial, P:- Practical, SEE: - Semester End Examinations, PA :- Progressive

Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Overview of the Translation: Process, A Simple Compiler,

Difference between interpreter, assembler and compiler.

Overview and use of linker and loader, types of Compiler,

Analysis of the Source Program, The Phases of a Compiler,

Cousins of the Compiler, The Grouping of Phases, Lexical

Analysis, Hard Coding and Automatic Generation Lexical

Analyzers, Front-end and Back-end of compiler, pass structure

06 15%

2

Lexical Analyzer: Introduction to Lexical Analyzer, Input

Buffering, Specification of Tokens, Recognition of Tokens, A

Language for Specifying Lexical Analyzers, Finite Automata 06 15%

Reference Books:

1. Compilers: Principles, Techniques and Tools By Aho, Lam, Sethi, and Ullman, Second

Edition,Pearson, 2014

2. Compilers: Principles, Techniques and Tools By Aho, Sethi, and Ullman, Addison-Wesley,

1986

3. Compiler Design in C By Allen I. Holub, Prentice-Hall/Pearson.

4. Advanced Compiler Design and Implementation By Muchnick, Morgan and Kaufmann,

1998.

From a Regular Expression, Design of a Lexical Analyzer

Generator, Optimization of DFA

3

Parsing Theory: Top Down and Bottom up Parsing

Algorithms, Top-Down Parsing, Bottom-Up Parsing, Operator-

Precedence Parsing, LR Parsers, Using Ambiguous Grammars,

Parser Generators, Automatic Generation of Parsers. Syntax-

Directed Definitions, Construction of Syntax Trees, Bottom-Up

Evaluation of S-Attributed Definitions, L-Attributed

Definitions, syntax directed definitions and translation schemes

09 22%

4 Error Recovery: Error Detection & Recovery, Ad-Hoc and

Systematic Methods 03 08%

5

Intermediate Code Generation: Different Intermediate Forms,

Syntax Directed Translation Mechanisms And Attributed

Mechanisms And Attributed Definition. 04 10%

6

Run Time Memory Management: Source Language Issues,

Storage Organization, Storage-Allocation Strategies, and Access

to Non local Names, Parameter Passing, Symbol Tables, and

Language Facilities for Dynamic Storage Allocation, Dynamic

Storage Allocation Techniques.

04 10%

7

Code Optimization: Global Data Flow Analysis, A Few

Selected Optimizations like Command Sub Expression

Removal, Loop Invariant Code Motion, Strength Reduction etc. 04 10%

8

Code Generation: Issues in the Design of a Code Generator,

The Target Machine, Run-Time Storage Management, Basic

Blocks and Flow Graphs, Next-Use Information, A Simple

Code Generator, Register Allocation and Assignment, The DAG

Representation of Basic Blocks, Peephole Optimization,

Generating Code from DAGs, Dynamic Programming Code-

Generation Algorithm, Code Generator Generators.

04 10%

Course Outcome:

After learning the course the students should be able to:

1. Understand the basic concepts and application of Compiler Design

2. Apply their basic knowledge Data Structure to design Symbol Table, Lexical Analyser ,

Intermediate

1. Code Generation, Parser (Top Down and Bottom Up Design) and will able to understand

strength of

2. Grammar and Programming Language.

3. Understand various Code optimization Techniques and Error Recovery mechanisms.

4. Understand and Implement a Parser.

Suggested List of Practical:

1. Design a lexical analyzer for given language and the lexical analyzer should ignore

redundant spaces, tabs and new lines. It should also ignore comments. Although the syntax

specification states that identifiers can be arbitrarily long, you may restrict the length to

some reasonable value. Simulate the same in C language

2. Write a C program to identify whether a given line is a comment or not

3. Write a C program to test whether a given identifier is valid or not.

4. Write a C program to simulate lexical analyzer for validating operators

5. To Study about Lexical Analyzer Generator(LEX) and Flex(Fast Lexical Analyzer)

6. Implement following programs using Lex.

a. Create a Lexer to take input from text file and count no of characters, no. of lines &no. of

words.

b. Write a Lex program to count number of vowels and consonants in a given input string.

7. Implement following programs using Lex.

a. Write a Lex program to print out all numbers from the given file.

b. Write a Lex program to printout all HTML tags in file.

c. Write a Lex program which adds line numbers to the given file and display the same onto

the standard output.

8. Write a Lex program to count the number of comment lines in a given C program. Also

eliminate them and copy that program into separate file.

9. Write a C program for implementing the functionalities of predictive parser for the mini

language.

10. Write a C program for constructing of LL (1) parsing.

11. Write a C program for constructing recursive descent parsing

12. Write a C program to implement LALR parsing.

13. Write a C program to implement operator precedence parsing.

14. To Study about Yet Another Compiler-Compiler(YACC).

15. Create Yacc and Lex specification files to recognizes arithmetic expressions involving +, -,

* and / .

16. Create Yacc and Lex specification files are used to generate a calculator which accepts

integer and float type arguments.



COURSE: B.E

SUBJECT NAME: DATA MINING & BUSINESS

INTELLIGENCE


SEMESTER - VII

Type of Course: Professional Elective Courses

Prerequisite: Zeal to learn the subject

Rationale: Business is the act of doing something productive to serve someone’s needs, and

thus earn a living and make the world a better place. Business activities are recorded on paper

or using electronic media, and then these records become data. There is more data from

customers’ responses and on the industry as a whole. All this data can be analyzed and mined

using special tools and techniques to generate patterns and intelligence, which reflect how the

business is functioning. These ideas can then be fed back into the business so that it can evolve

to become more effective and efficient in serving customer needs. And the cycle continues on.

Fundamental for Data Mining & Business Intelligence this course concentrates on delivering

the necessary concepts and features.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150


Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Overview and concepts Data Warehousing and Business

Intelligence

Why reporting and Analysing data, Raw data to valuable

information-Lifecycle of Data - What is Business Intelligence -

04 10%

BI and DW in today’s perspective - What is data warehousing -

The building Blocks: Defining Features - Data warehouses and

data 1marts - Overview of the components - Metadata in the

data warehouse - Need for data warehousing - Basic elements of

data warehousing - trends in data warehousing.

2

The Architecture of BI and DW

BI and DW architectures and its types - Relation between BI

and DW - OLAP (Online analytical processing) definitions -

Difference between OLAP and OLTP - Dimensional analysis -

What are cubes? Drill-down and roll-up - slice and dice or

rotation - OLAP models - ROLAP versus MOLAP - defining

schemas: Stars, snowflakes and fact constellations

07

16%

3

Introduction to data mining (DM)

Motivation for Data Mining - Data Mining-Definition and

Functionalities – Classification of DM Systems - DM task

primitives - Integration of a Data Mining system with a

Database or a Data Warehouse - Issues in DM – KDD Process

04 09%

4

Data Pre-processing

Why to pre-process data? - Data cleaning: Missing Values,

Noisy Data - Data Integration and transformation - Data

Reduction: Data cube aggregation, Dimensionality reduction -

Data Compression - Numerosity Reduction - Data Mining

Primitives - Languages and System Architectures: Task relevant

data - Kind of Knowledge to be mined - Discretization and

Concept Hierarchy.

07 16%

5

Concept Description and Association Rule Mining

What is concept description? - Data Generalization and

summarization-based characterization - Attribute relevance -

class comparisons Association Rule Mining: Market basket

analysis - basic concepts - Finding frequent item sets: Apriori

algorithm - generating rules – Improved Apriori algorithm –

IncrementalARM – Associative Classification – Rule Mining

07 16%

6

Classification and Prediction

What is classification and prediction? – Issues regarding

Classification and prediction:

Classification methods: Decision tree, Bayesian Classification,

Rule based, CART, Neural Network

Prediction methods: Linear and nonlinear regression, Logistic

RegressionIntroduction of tools such as DB Miner

/WEKA/DTREG DM Tools

07 16%

7

Data Mining for Business Intelligence Applications

Data mining for business Applications like Balanced Scorecard,

Fraud Detection, Clickstream Mining, Market Segmentation,

retail industry, telecommunications industry, banking & finance

and CRM etc.,Data Analytics Life Cycle: Introduction to Big

data Business Analytics - State of the practice in analytics role

04 09%

Reference Books:

1. J. Han, M. Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann

2. M. Kantardzic, “Data mining: Concepts, models, methods and algorithms, John Wiley

&Sons Inc.

3. PaulrajPonnian, “Data Warehousing Fundamentals”, John Willey.

4. M. Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education.

5. G. Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts,

Techniques, and Applications in Microsoft Office Excel with XLMiner”, Wiley India.

Course Outcome:


1.Students will be able to use mining tool.

2.Students are able to perform various data warehouse related exercise.

List of Practical:

Minimum 10 practical and 1 group exercise to be carried out based on the content of the

syllabus.

of data scientistsKey roles for successful analytic project - Main

phases of life cycle - Developing core deliverables for

stakeholders.

8

Advance topics

Introduction and basic concepts of following topics.Clustering,

Spatial mining, web mining, text mining,Big Data: Introduction

to big data: distributed file system – Big Data and its

importance, Four Vs, Drivers for Big data, Big data analytics,

Big data applications. Algorithms using map reduce, Matrix-

Vector Multiplication by Map Reduce. Introduction to Hadoop

architecture: Hadoop Architecture, Hadoop Storage: HDFS,

Common Hadoop Shell commands , Anatomy of File Write and

Read., NameNode, Secondary NameNode, and DataNode,

Hadoop MapReduce paradigm, Map and Reduce tasks, Job,

Task trackers - Cluster Setup – SSH & Hadoop Configuration –

HDFS Administering –Monitoring & Maintenance.

04

08%



COURSE: B.E

SUBJECT NAME: MOBILE COMPUTING WITH ANDROID


SEMESTER - VII

Type of Course: Open Elective Courses


Rationale: Mobile Computing and Communication mobility, flexibility and convenience. It

also shows that how to communication happen between mobile to mobile or mobile to other

network.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150

Th:-Theory, Tu: - Tutorial, P: - Practical, SEE: - Semester End Examinations, PA: - Progressive

Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Communication Networks-LANs, MANs, and WANs,

Switching Techniques, Circuit Switching, Packet Switching

Protocols and the TCP/IP Suite- The Need for a Protocol

Architecture, The TCP/IP Protocol Architecture, The OSI Model,

Internet working

Introduction, Transmission Fundamentals-Signals for

Conveying Information, Analog and Digital Data Transmission,

Channel Capacity, Transmission Media, Multiplexing

03 10%

2

Cellular Wireless Networks-Principles of Cellular

Networks,First-Generation Analog Second-Generation TDMA

Second-Generation CDMA,Third-Generation Systems

10 20%

Modulation Techniques-Signal Encoding Criteria, Digital Data-

Analog Signals, Analog Data-Analog Signals, Analog Data-

Digital Signals

Spread Spectrum-The Concept of Spread Spectrum, Frequency

Hopping Spread Spectrum, Direct Sequence Spread spectrum,

Code Division Multiple Access,

Coding and Error Control-Error Detection, Block Error

Correction Codes , Convolutional Codes, Automatic Repeat

Request

3

Multiple access in Wireless System – Multiple access scheme,

frequency division multiple access, Time division multiple

access, code division multiple access, space division multiple

access, packet radio access, multiple access with collision

avoidance.

Global system for mobile communication - Global system for

mobile communication, GSM architecture, GSM entities, call

routing in GSM,PLMN interface, GSM addresses and identifiers,

network aspects in GSM,GSM frequency allocation,

authentication and security

General packet radio service(GPRS) - GPRS and packet data

network, GPRS network architecture, GPRS network operation,

data services in GPRS, Applications of GPRS, Billing and

charging in GPRS

Wireless System Operations and standards - Cordless

Systems,Wireless Local Loop, WiMAX and IEEE 802.16

Broadband Wireless Access Standards, Mobile IP and Wireless

Application, Protocol

12 25%

4

Wi-Fi and the IEEE 802.11 Wireless LANStandards – IEEE

802 architecture, IEEE 802.11 architecture and services, IEEE

802.11 Medium access control, IEEE 802.11 physical layer, Wi-

Fi protected access.

03 10%

5 Bluetooth, - Radio specification, baseband specification, link

manager specification, logical link control and adaption protocol. 03 10%

6

Introduction to Android

History of Mobile Software Development, The Open Handset

Alliance, The Android Platform, Android SDK, Building a

sample Android application, Design Essentials Anatomy of an

Android applications, Android terminologies, Application

Context, Activities, Services, Intents, Receiving and Broadcasting

Intents, Android Manifest File and its common settings, Using In

07 15%

Reference Books:

1. Wireless Communications & Networks, Second Edition,William Stallings by Pearson

2. Mobile Computing Technology,Applications and service creation ,Asoke K Telukder,

Roopa R Yavagal by TMH

3. Wireless and mobile networks, Dr. Sunilkumar S. Manvi, Dr. Mahabaleshwar

S.Kakkasageri by WILEY

4. Wireless networks, P. Nicopolitidis,M.S. Obaidat,G.I.Papadimitriou,A.S.Pomportsis by

WILEY

5. Android Application Development Black Book, Pradeep Kothari, dreamtech press.

6. Mobile Computing,Raj Kamal by Oxford

7. Mobile Computing Theory and Practice-KumkumGarg-Pearson

Course Outcome:


1. Understand mobile and wireless network systems such as 2G/3G/4G mobile telephony/data

networks,

2. Understand GSM and GPRS

3. Understand the working of wireless local area network, Bluetooth.

List of Suggested Experiments:

1. Write a program to simulate Fixed Time Division Multiplexing. Take 12 stations. Every

station has time slice of 417 microseconds. Delay should be 10ms. Every time the station

gets turn, it shows message.

2. Write a program that identifies the Bluetooth devices in the wireless range.

3. Write a program that prints the signal strength of WiFi connection of the given computer.

4. Prepare a wireless ad hoc network and show its working.

tent Filter, Permissions, Managing Application resources in a

hierarchy, Working with different types of resources, Design

Essentials User Interface Screen elements, Designing User

Interfaces with Layouts, Drawing and Working with Animation

7

Using Common Android APIs

Using Android Data and Storage APIs, Managing data using

SQLite, Sharing Data Between Applications with Content

Providers, Using Android Networking APIs, Using Android Web

APIs, Using Android Telephony APIs

04 10%

5. Write a program to find hamming distance. For example Hamming distance d(v1,v2)=3 if

v1=011011,v2=110001.

6. Write a program to perform infrared communication.

7. Write a program to perform Bluetooth file transfer.

8. Develop an android app which displays “Hello, welcome to Android Lab” message.

9. Develop an android app which displays a form to get following information from user.

i. Username

ii. Password

iii. Email Address

iv. Phone Number

v. Country

vi. State

vii. State

viii. Gender

ix. Interests

x. Birth Date

xi. Birth Time

10. Form should be followed by a Button with label “Submit”. When user clicks the button, a

message should be displayed to user describing the information entered.

11. Utilize suitable UI controls (i.e. widgets). [When user enters country in

AutoCompleteTextView, list of states should be displayed in Spinner automatically.]

a. Using Android, Create a login Activity. It asks “username” and “password” from user.

If username and password are valid, it displays Welcome message using new activity.

b. Develop calculator Android Application.

Design based Problems (DP)/Open Ended Problem:

1. Radio connectivity is inherently poor. How to ensure data delivery without retransmission?

2. Resource manager might have allocated resources to applications. How to revoke those

resources? How to utilize available resources optimally?



COURSE: B.E

SUBJECT NAME: DISTRIBUTED DBMS


SEMESTER - VII

Type of Course:Professional Elective Courses

Prerequisite: Database Management Systems & Networking

Rationale: Students are familiar with Centralized DBMS. This subject will give introduction to

Distributed DBMS and associated problems. Students will be able to understand various

algorithms and techniques for managing distributed database.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150


Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Introduction:

Distributed Data Processing, Distributed Database Systems,

Promises of DDBSs, Complicating factors, Problem areas 03 07%

2 Overview of RDBMS:

Concepts, Integrity, Normalization 02 05%

3

Distributed DBMS Architecture :

Models- Autonomy, Distribution, Heterogeneity DDBMS

Architecture – Client/Server, Peer to peer, MDBS 03 07%

4

Data Distribution Alternatives:

Design Alternatives – localized data, distributed data

Fragmentation – Vertical, Horizontal (primary & derived),

hybrid, general guidelines, correctness rules Distribution

05

15%

Reference Books:

1. Principles of Distributed Database Systems, Ozsu, Pearson Publication

2. Distributed Database Management Systems, Rahimi & Haug, Wiley

3. Distributed Database Systems, Chanda Ray, Pearson Publication

4. Distributed Databases, Sachin Deshpande, Dreamtech

transparency – location, fragmentation, replication Impact of

distribution on user queries – No Global Data Dictionary(GDD),

GDD containing location information, Example on

fragmentation

5

Semantic Data Control :

View Management, Authentication – database authentication,

OS authentication, Access Rights, Semantic Integrity Control –

Centralized &Distributed , Cost of enforcing semantic integrity

03 10%

6

Query Processing :

Query Processing Problem, Layers of Query Processing Query

Processing in Centralized Systems – Parsing & Translation,

Optimization, Code generation, Example Query Processing in

Distributed Systems – Mapping global query to local,

Optimization

04 10%

7

Optimization of Distributed Queries:

Query Optimization, Centralized Query Optimization, Join

Ordering Distributed Query Optimization Algorithms 06 10%

8

Distributed Transaction Management & Concurrency

Control: Transaction concept, ACID property, Objectives of transaction

management, Types of transactions, Objectives of Distributed

Concurrency Control, Concurrency Control anomalies, Methods

of concurrency control, Serializability and recoverability,

Distributed Serializability, Enhanced lock based and timestamp

based protocols, Multiple granularity, Multi version schemes,

Optimistic Concurrency Control techniques

08 18%

9

Distributed Deadlock & Recovery Deadlock concept,

Deadlock in Centralized systems Deadlock in Distributed Systems – Detection, Prevention,

Avoidance, Wait-Die Algorithm, Wound-Wait algorithm

Recovery in DBMS - Types of Failure, Methods to control

failure, Different techniques of recoverability, Write- Ahead

logging Protocol,

Advanced recovery techniques- Shadow Paging, Fuzzy

checkpoint, ARIES, RAID levels, Two Phase and Three Phase

commit protocols

08 18%

Course Outcome:


1. Understand what is Distributed DBMS

2. Understand various architectures of DDBMS

3. Apply various fragmentation techniques given a problem

4. Understand and calculate the cost of enforcing semantic integrity control

5. Understand the steps of query processing

6. How optimization techniques are applies to Distributed Database

7. Learn and understand various Query Optimization Algorithms

8. Understand Transaction Management & Compare various approaches to concurrency

control in Distributed database

9. Understand various algorithms and techniques for deadlock and recovery in Distributed

database

List of Suggested Practical:

1. Create two databases either on single DBMS and Design Database to fragment and share

the fragments from both database and write single query for creating view.

2. Create two databases on two different computer systems and create database view to

generate single DDB.

3. Create various views using any one of examples of database and Design various

constraints.

4. Write and Implement algorithm for query processing using any of Example in either C

/C++ /Java / .NET

5. Using any of example, write various Transaction statement and show the information about

concurrency control [i.e. various lock’s from dictionary] by executing multiple update and

queries.

6. Using Transaction /commit rollback, Show the transaction ACID properties.

7. Write java JDBC program and use JTA to show various isolation level’s in transaction.

8. Implement Two Phase Commit Protocol

9. Case study on noSQL

10. Case study on Hadoop



COURSE: B.E

SUBJECT NAME: .NET TECHNOLOGY


SEMESTER - VII


Prerequisite: Concepts of Object Oriented Programming Approach

Rationale: Object oriented programming has gain momentum because of the object reuse.

.NET provides object oriented development framework. .NET provides a base class library that

supports innovative web development. It enables to fulfill varied functions like graphic

rendering and file reading. It has all the resources to provide websites with different

functionality and manage it smoothly at the same time. .NET provides Consistent programming

model, Direct Support for Security, Simplified Development efforts and Easy application

deployment and Maintenance.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150


Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Introduction to .NET Framework:

NET framework, MSIL, CLR, CLS, CTS, Namespaces,

Assemblies The Common Language Implementation,

Assemblies, Garbage Collection, The End to DLL Hell -

Managed Execution

4 12%

2

C# - The Basics and Console Applications in C#:

Name Spaces - Constructor and Destructors, Function

Overloading & Inheritance, Operator Overloading, Modifiers 5 14%

- Property and Indexers , Attributes & Reflection API, When

to use Console Applications - Generating Console Output,

Processing Console Input

3

C#.NET:

Language Features and Creating .NET Projects, Namespaces

Classes and Inheritance -, Namespaces Classes and

Inheritance -, C, Exploring the Base Class Library -,

Debugging and Error Handling -, Data Types -, Exploring

Assemblies and Namespaces, String Manipulation ,Files and

I/O ,Collections

4 10%

4

ADO.NET:

Benefits of ADO.NET, ADO.NET compared to classic ADO -

, Datasets, Managed Providers -, Data Binding: Introducing

Data Source Controls -, Reading and Write Data Using the

SqlDataSource Control

4 10%

5

Windows Forms and Controls in details:

The Windows Forms Model, Creating Windows Forms

Windows Forms Properties and Events, Windows Form

Controls, Menus - Dialogs – ToolTips

Visual Inheritance in C#.NET:

Apply Inheritance techniques to Forms, Creating Base Forms,

Programming Derived Forms

5 12%

6

Mastering Windows Forms:

Printing - Handling Multiple Events, GDI+, Creating

Windows Forms Controls 3 10%

7

ASP.NET:

Introduction to ASP.NET, Working with Web and HTML

Controls, Using Rich Server Controls, Login controls,

Overview of ASP.NETValidation Controls, Using the Simple

Validations, Using the Complex Validators Accessing Data

using ADO.NET, Using the Complex Validators Accessing

Data using ADO.NET, Configuration Overview

4 11%

8

Themes and Master Pages:

Creating a Consistent Web Site, ASP.NET 2.0 Themes -

Master Pages, Displaying Data with the GridView Control

Introducing the GridView Control, Filter Data in the

GridView Control, Allow Users to Select from a

DropDownList in the Grid, Add a Hyperlink to the Grid,

Deleting a Row and Handling Errors

4 8%

9

Managing State:

Preserving State in Web Applications and Page-Level State,

Using Cookies to Preserve State, ASP.NET Session State

,Storing Objects in Session State, Configuring Session State,

Setting Up an Outof-Process State Server, Storing Session

State in SQL Server, Using Cookieless Session IDs,

Application State Using the DataList and Repeater Controls,

4 8%

Reference Books:

1. Christian Nagel, Professional C# .Net, Wrox Publication

2. Matthew Macdonald and Robert Standefer, ASP.NET Complete Reference, TMH

3. Vijay Mukhi, C# The Basics, BPB Publications

Course Outcome:


1. Use .net framework architecture, various tools, and Validation techniques, use of

different templates available in Visual Studio, Implementation and testing strategies in

real time applications.

2. Use advanced concepts related to Web Services, WCF, and WPF in project development


1. Write a program to check whether empty query string is entered in Asp .net

2. Write a program to change color of Label text control programmatically in Asp .Net

3. Write a program to Enable-Disable Textbox and change width of TextBox

programmatically in Asp .Net

4. Write a program to increase and decrease font size programmatically.

5. Write C# code to display the asterisk pattern as shown below:

*****

*****

*****

*****

*****

6. Write C# code to prompt a user to input his/her name and country name and then the

output will be shown as an example below:

Hello Ram from country India!

Overview of List-Bound Controls, Creating a Repeater

Control and DataList Control

10

Creating and Consuming Web Services:

The Motivation for XML Web Services, Creating an XML

Web Service with Visual Studio, Designing XML Web

Services, Creating Web Service Consumers, Discovering Web

Services Using UDDI

Advanced in .NET:

Introduction to Windows Presentation Foundation (WPF),

Window Communication Foundation and its Application

4 5%

7. Write C# code to do the following

- Convert binary to decimal

- Convert decimal to hexadecimal

- Convert decimal to binary

- Convert decimal to octal

8. Write C# code to convert infix notation to postfix notation.

9. Write a C# code to convert digits to words

10. Write a C# code to convert following currency conversion. Rupees to dollar, frank, euro.

11. Write a C# code to Perform Celsius to Fahrenheit Conversion and Fahrenheit to Celsius

conversion.

12. Write ASP.Net program to Store Objects in Session State and Storing Session State in

SQL Server.



COURSE: B.E

SUBJECT NAME: DISTRIBUTED OPERATING SYSTEM


SEMESTER - VII


Prerequisite: Operating Systems, Distributed Network

Rationale: To examine the fundamental principles of distributed systems, and provide students

hands-on experience in developing distributed protocols. While we still look at issues in

distributed operating systems, this course will address distributed systems in a broader sense.

Emphasis will be placed on communication, process, naming, synchronization, consistency and

replication, and fault tolerance.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150


Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Introduction to distributed Systems:

Definition and goals, Hardware and Software concepts,

Design issues 6 11%

2

Communication in Distributed System:

Computer Network and Layered protocols, Message passing

and related issues, synchronization, Client Server model & its

implementation, remote procedure call and implementation

issues, Case Studies: SUN RPC, DEC RPC

6 13%

Reference Books:

1. Distributed Operating Systems Concepts and Design, Pradeep K. Sinha, PHI

2. Distributed Systems: Concepts and Design by George Coulouris, Jean Dollimore,Tim

Kindberg, Pearson

3. Distributed Operating Systems by Andrew S Tannebaum, Pearson

4. Distributed Computing by Sunita Mahajan & Seema Shah OXFORD

5. Distributed Systems: Principles and Paradigms by Andrew S Tanebaum, Maarten Van

Steen, PHI

6. Distributed Computing, Fundamentals, Simulations and Advanced topics, 2nd Edition,

Hagit Attiya and Jennifer Welch, Wiley India

3

Synchronization in distributed systems:

Clock synchronization and related algorithms, mutual

exclusion, Deadlock in distributed systems 4 10%

4

Processes and processors in distributed systems:

Threads, system model, processor allocation, scheduling in

distributed systems: Load balancing and sharing approach,

fault tolerance, Real time distributed systems, Process

migration and related issues

3 10%

5

Distributed File Systems:

Introduction, features & goal of distributed file system, file

models, file accessing models, file sharing semantics, file

caching scheme, file replication, fault tolerance, trends in

distributed file system, case study.

4 10%

6

Distributed Shared Memory:

Introduction, general architecture of DSM systems, design

and implementation issues of DSM, granularity, structure of

shared memory space, consistency models, replacement

strategy, thrashing

5 11%

7

Naming

Overview, Features, Basic concepts, System oriented names,

Object locating mechanisms, Issues in designing human

oriented names, Name caches, Naming and security, DNS

4 10%

8

Distributed Web-based Systems

Architecture, Processes, Communication, Naming,

Synchronization, Consistency and Replication: Web Proxy

Caching, Replication for Web Hosting Systems, Replication

of Web Applications

3 10%

9

Security

Introduction of Security in Distributed OS, Overview of

security techniques, features, Need, Access Control, Security

Management

3 10%

10 Case Study

Java RMI, Sun Network File System, Google case study 3 5%

Course Outcome:


1. List the principles of distributed systems and describe the problems and challenges

associated with these principles.

2. Understand Distributed Computing techniques, Synchronous and Processes.

3. Apply Shared Data access and Files concepts.

4. Design a distributed system that fulfills requirements with regards to key distributed

systems properties.

5. Understand Distributed File Systems and Distributed Shared Memory.

6. Apply Distributed web-based system.

7. Understand the importance of security in distributed systems


1. Write a Program to implement Concurrent Echo Client Server Application.

2. Write the Programs for Remote Procedure call.

3. Write the Programs for Remote Method Invocation.

4. Write the Programs for Thread Programming in JAVA.

5. Implement CORBA file.

6. Write a Program to Increment a Counter in Shared Memory.

7. Implement Network File System (NFS).

8. Creation of a BPEL (Business Process Execution Language) Module and a Composite

Application.

9. Study of Web Service Programming.

10. Study of Grid Services using various Tools.



COURSE: B.E

SUBJECT NAME: BIG DATA ANALYTICS


SEMESTER - VII



Rationale:Fundamental for Big Data Analytics this course concentrates on delivering the necessary

concepts and features.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

3 0 2 5 4 70 30 30 20 150


Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Introduction To Big Data

Introduction– distributed file system–Big Data and its importance,

Four Vs, Drivers for Big data, Big data analytics, Big data

applications. Algorithms using map reduce

5 13%

2

Introduction To Hadoop And Hadoop Architecture

Big Data – Apache Hadoop & Hadoop EcoSystem, Moving Data

in and out of Hadoop – Understanding inputs and outputs of

MapReduce -, Data Serialization

10 25%

3

HDFS, HIVE AND HIVEQL, HBASE

HDFS-Overview, Installation and Shell, Java API; Hive

Architecture and Installation, Comparison with Traditional

Database, HiveQL Querying Data, Sorting And Aggregating, Map

Reduce Scripts, Joins & Sub queries, HBase concepts, Advanced

6

15%

Reference Books:

1. Boris lublinsky, Kevin t. Smith, AlexeyYakubovich, “Professional Hadoop Solutions”,

Wiley, ISBN: 9788126551071, 2015.

2. Chris Eaton,Dirkderooset al. , “Understanding Big data ”, McGraw Hill, 2012.

3. BIG Data and Analytics , Sima Acharya, SubhashiniChhellappan, Willey

4. MongoDB in Action, Kyle Banker,PiterBakkum , Shaun Verch, Dream tech Press

5. Tom White, “HADOOP: The definitive Guide”, O Reilly 2012.

6. VigneshPrajapati, “Big Data Analyticswith R and Haoop”, Packet Publishing 2013.

7. http://www.bigdatauniversity.com/

8. Learning Spark: Lightning-Fast Big Data Analysis Paperback by Holden Kara

Course Outcome:


1. Students will to build and maintain reliable, scalable, distributed systems with Apache

Hadoop.

2. Students will be able to write Map-Reduce based Applications

3. Students will be able to design and build MongoDB based Big data Applications and learn

MongoDB query language

4. Students will learn difference between conventional SQL query language and NoSQL basic

concepts

5. Students will learn tips and tricks for Big Data use cases and solutions.

Usage, Schema Design, Advance Indexing, PIG, Zookeeper , how

it helps in monitoring a cluster, HBase uses Zookeeper and how to

Build Applications with Zookeeper

4

SPARK

Introduction to Data Analysis with Spark, Downloading Spark

and Getting Started, Programming with RDDs, Machine Learning

with MLlib.

10 20%

5

NoSQL

What is it?, Where It is Used Types of NoSQL databases, Why

NoSQL?, Advantages of NoSQL, Use of NoSQL in Industry,

SQL vs NoSQL, NewSQL

4 12%

6

Data Base for the Modern Web

Introduction to MongoDB key features, Core Server tools,

MongoDB through the JavaScript’s Shell, Creating and Querying

through Indexes, Document-Oriented, principles of schema

design, Constructing queries on Databases, collections and

Documents, MongoDB Query Language.

7 15%


1. To understand the overall programming architecture using Map Reduce API.

2. Store the basic information about students such as roll no, name, date of birth, and address

of student using various collection types such as List, Set and Map.

3. Basic CRUD operations in MongoDB.

4. Retrieve various types of documents from student’s collection.

5. To find documents from Students collection.

6. Develop Map Reduce Work Application.

7. Creating the HDFS tables and loading them in Hive and learn joining of tables in Hive.



COURSE: B.E

SUBJECT NAME: PYTHON PROGRAMMING


SEMESTER - VII

Type of Course:Open Elective Courses

Prerequisite : Programming Language

Rationale: Python is modern higher level programming language useful writing compact code

specifically for programming in Server side, AI, Machine Learning and Deep Learning and Data

Analysis.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

0 2 2 4 3 00 00 80 20 100

Th:-Theory, Tu: - Tutorial, P: - Practical, SEE: - Semester End Examinations, PA: - Progressive

Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Introduction to Python

The basic elements of python, Branching Programs, Control

Structures, Strings and Input, Iteration, Functions and

scoping,Specifications, Recursion, Global variables, Modules,

Files System Functions and Parameters

06 18%

2

Structured Types, Mutability and Higher-Order Functions

Strings, Tuples, Lists and Dictionaries, Lists and Mutability,

Functions as Objects

03 8%

3

Testing, Debugging, Exceptions and Assertions

Types of testing – Black-box and Glass-box, Debugging,Handling

–Exceptions, Assertions

02 6%

Reference Books:

1. R. Nageswara Rao, “Core Python Programming”, dreamtech

2. John V Guttag. “Introduction to Computation and Programming Using Python”, Prentice

Hall of India.

3. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures and

Algorithms in Pyhon”, Wiley

4. Kenneth A. Lambert, “Fundamentals of Python – First Programs”, CENGAGE Publication

5. Wesley J. Chun. “Core Python Programming - Second Edition”, Prentice Hall

Course Outcome:

After learning the course, the student will be able:

1. To develop proficiency in creating based applications using the Python Programming

Language.

2. To be able to understand the various data structures available in Python programming

language and apply them in solving computational problems.

3. To be able to do testing and debugging of code written in Python.

4. To be able to draw various kinds of plots using PyLab.

5. To be able to do text filtering with regular expressions in Python

6. To be able to create socket applications in Python

7. To be able to create GUI applications in Python


Minimum 10 practical and 1 group exercise to be carried out based on the content of the

syllabus

4

Classes and Object-Oriented Programming

Abstract Data Types and Classes, Inheritance, Encapsulation and

Information Hiding

03 8%

5 Simple Algorithms and Data structures

Search Algorithms, Sorting Algorithms, Hash Tables 03 10%

6

Advanced Topics I

Regular Expressions – REs and Python,Plotting using PyLab

Networking and Multithreaded Programming – Sockets, Threads

and Processes, Chat Application

06 20%

7

Advance Topics II

Security – Encryption and Decryption , Classical Cyphers

Graphics and GUI Programming – Drawing using Turtle, Tkinter

and Python, Other GUIs

08 30%



COURSE: B.E

SUBJECT NAME: EMBEDDED SYSTEM


SEMESTER - VII

Type of course:Open Elective Courses


Rationale: Embedded System used with Microprocessor for programming and also for the

circuit design and configuration of hardware parts.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

0 2 2 4 3 00 00 80 20 100


Assessment.

Content:

Sr. Content Total

Hrs

%

Weightage

1

Introduction to Embeded System

Embedded Systems, Processor Embedded into a System, Embedded

Hardware Units and Devices In a System, Embedded Software in a

system, Examples of Embedded Systems, Embedded System-on-chip

(SOC) and Use of VLSI Circuit Design Technology, Complex

Systems Design and Processors, Design Process in Embedded

System, Formulization of System Design, Design Process and

Design Examples, Classification of Embedded Systems, Skills

Required for an Embedded System Designer

03 10%

2

Device and Communication Bus for Device Network

IO Types and examples, Serial communication devices, Parallel

Device ports, Sophisticated Interfacing Feature in Devices Ports,

06 20%

Wireless Devices, Timer and Counting Devices, Watch dog timer,

Real time clock, Network Embedded Systems, Serial Bus

Communication Protocols, parallel Bus Devices protocol-Parallel

communication Network using ISA, PCI, PCI-X and advanced

buses, Internet Enabled Systems- Network protocols, Wireless and

mobile system protocol.

3

Device Driver and Interrupt Service Mechanism

Programmed-I/O Busy-wait Approach without Interrupt Services

Mechanism, ISR Concept, Interrupt Sources, Interrupt

Servicing(Handling) Mechanism, Multiple Interrupts, Context and

the Periods for Context Switching, Interrupt Latency and Deadline,

Classification of Processor Interrupt Service Mechanism from

Context-Saving Angle, Direct Memory Access, Device Driver

Programming

04 15%

4

Inter-process Communication and Synchronization of processes,

Threads and Tasks

Multiple process in an application, Multiple Threads in an

application,Task and Task state, Task and Data, Clear-cut Distinction

between Functions, ISRS and Tasks by their Characteristics, Concept

of Semaphores, Shared Data, Inter process Communication, Signal

Function, Semaphore Functions, Message Queue Functions, Mailbox

Functions, Pipe Functions, Socket Functions, RPC Functions

08 20%

5

Real Time Operating System

Operating system service, Process management, Timer function,

Event function, Memory management, Device , File and I/O

subsystem management, Interrupt routine in RTOS environment and

handling of interrupt Sources calls, Real Time Operating Systems,

Basic Design Using an RTOS, RTOS Task Scheduling Models,

Interrupt Latency and Response of the Tasks as Performance

Metrics, OS Security Issues

06 15%

6

Case Studies

Case Study : Motivation for MSP 430 Microcontrollers:

MSP430 RISC CPU architecture, Compiler-friendly features,

Instruction set, Clock system, Memory subsystem. Understanding of

different MSP430 families.

Introduction to Code Composer Studio (CCS) and use CCS for

Embedded C.

Digital I/O – I/O ports programming using C, Understanding the

muxing scheme of the MSP430 pins, interrupt programming

On-chip peripherals - Watchdog Timer, Basic Timer, Real Time

Clock (RTC), ADC, Universal Serial Communication Interface

(USCI).

06 20%

Reference Books:

1. Embedded System: Architecture, Programming and Design by Rajkamal,2nd edition,2010,

Tata McGraw Hill.

2. MSP430 Microcontroller Basics by John H. Davies Elsevier; First edition (2010)

3. Computer as Components: Principles of Embedded Computing System Design, Wayne

Wolf,2nd edition,2008, Morgan Kaufmann Publication

Course Outcome:


1. Understand the concepts of Embedded Systems.

2. Understand interfacing of IO devices and other peripherals.

3. Device driver programming & interrupt service mechanisms.

4. Understand Inter-process Communication and Synchronization of processes, Threads and

Tasks.

5. Learn OS functions and Real Time Operating System.

6. Able to use MSP430 along with analog and digital peripherals.


1. Introduction to MSP430 Kit and Programming Environment with program to work with

ports.

2. Configure timer block with capture/compare channel 0 & 1 to generate 4.096 KHz & 1.024

KHz signal.

3. Configure watchdog timer in watchdog & interval mode.

4. Test various Power Down modes in MSP430.

5. Read Temperature of MSP430 with the help of ADC.

6. Use Timer to trigger ADC for reading analog signal in most efficient manner to reduce

power consumption.

7. Configure DAC to generate positive ramp signal.

8. Use Comparator to compare the signal threshold level.

9. Implement Hardware Multiplier to multiply two arrays to perform MAC operation.

10. Implement DMA controller for basic convolution algorithm.

11. Use I2C protocol for communication between more than two MSP430 connected on I2C

bus.

12. Use SPI protocol for communication between two MSP430.

Interfacing LED, LCD, Seven segment LED modules interfacing.

Example – Real-time clock, Low-power features of MSP430.



COURSE: B.E

SUBJECT NAME: PROJECT - II


SEMESTER - VII

Type of Course: Project

Prerequisite: Zeal to Learn

Rationale: This course is aimed to provide more weightage for project work. The project work

could be done in the form of a summer project or internship in the industry or even a minor

practical project in the college.


Teaching Scheme

Credits

Examination Marks

Total

Marks

Th

Tu

P

Total

Theory

Practical

SEE

(E)

PA

(M)

Viva

(V)

PA

(I)

0 0 12 12 6 00 00 80 20 100


Assessment.