COURSE FILE - B.L.D.E.A's V.P. Dr. P.G. Halakatti …bldeacet.ac.in/wp-content/uploads/2019/06/5thsemfinal.pdf2019/06/05 · B.L.D.E.A’s Vachana Pitamaha Dr. P.G. Halakatti College

B.L.D.E.A’s

Vachana Pitamaha Dr. P.G. Halakatti

College of Engineering & Technology,

Vijayapur – 586 103

COURSE FILE

2018-19

Semester – V

Department of Information Science &

Engineering

Name :

USN :

Roll No. :

Dear student,

Wish you happy academic year 2018-19.

You can go through this course file which gives overview of each course you are

going to study and its relevance to your program. You will find each course interesting /

understandable if you have complete knowledge of prerequisites. Learning objectives are

defined for each unit followed by lesson plan.

Assignment questions are given at the end of each unit which will help you to

prepare well during I.A. Tests and VTU Exams. Portion for I.A. Tests is known to you in

advance to plan your studies. VTU question papers are put at the end.

This course file will help you and your teacher in delivering curriculum

systematically. Kindly note following to achieve academic excellence.

1) Ask for return of your assignments submitted for checking from

teacher’s atleast three days prior to commencement of I.A. Tests. This will

help you in your preparation.

2) Ensure that each teacher solves VTU question papers in the class room /

Tutorial class.

3) For subject difficulties, each teacher will be announcing contact hours in

the class and display the same outside his cubicle. Utilize these contact

hours to improve your performance.

4) Each teacher will display I.A. Marks within 3 days after completion of last

subject Test.

5) To be eligible to appear for I.A. Tests, cumulative 85% attendance in

theory classes is mandatory.

6) If you abstain from theory classes after II I.A. Test because of scoring well

in I & II I.A. Tests, you will not be allowed to appear for laboratory

internals.

7) Attend meetings with counselors whenever arranged. Speak freely to

counselors about your academic difficulties.

8) Kindly request your parents to attend parents meet whenever your dept.

organizes the same.

If Sl.No. 1 to 4 are not fulfilled contact concerned HOD or Academic Coordinator

immediately for necessary action. If you have any suggestions for further improvement of

course file kindly contact Academic Coordinator.

Prof. R.G.Talasadar Dr. V.P. Huggi Coordinator (Academic) Principal

http://bldeacet.ac.in/civil/teams/prof-r-g-talasadar/

B.L.D.E. Associations

V.P. Dr. P.G. Halakatti College of Engineering & Technology, Vijayapur.

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

VISION

To become a Centre of Excellence in Information Technology Education and Research that is

adaptable to the ever-changing needs of the mankind.

MISSION

1. To provide quality technical education coupled with innovative research to boost the

career of students in IT industry, entrepreneurship, higher education and research.

2. To instill moral values, professional ethics and leadership qualities in students to

achieve professional success.

Program Educational Objectives (PEOs)

1. A graduate will be a successful IT professional, with ability to provide solutions to

real-world problems.

2. A graduate will understand the need for and engage in life-long learning and research

to contribute in IT domain.

3. A graduate develops project management techniques by the virtue of leadership

qualities and team work capabilities.

4. A graduate inculcates moral values, understands professional, social and

environmental responsibilities.

Program Outcomes (POs):

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and engg. specialization to the solution of complex engineering

problems.

2. Problem analysis: Identify, formulate, research literature, and analyze engineering

problems to arrive at substantiated conclusions using first principles of mathematics,

natural, and engineering sciences.

3. Design/development of solutions: Design solutions for complex engineering problems

and design system components, processes to meet the specifications with

consideration for the public health and safety, and the cultural, societal, and

environmental considerations.

4. Conduct investigations of complex problems: Use research-based knowledge

including design of experiments, analysis and interpretation of data, and synthesis of

the information to provide valid conclusions.

5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and

modern engineering and IT tools including prediction and modeling to complex

engineering activities with an understanding of the limitations.

6. The engineer and society: Apply reasoning informed by the contextual knowledge to

assess societal, health, safety, legal, and cultural issues and the consequent

responsibilities relevant to the professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and demonstrate the

knowledge of, and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities

and norms of the engineering practice.

9. Individual and team work: Function effectively as an individual, and as a member or

leader in teams, and in multidisciplinary settings.

10. Communication: Communicate effectively with the engineering community and with

society at large. Be able to comprehend and write effective reports documentation.

Make effective presentations, and give and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of

engineering and management principles and apply these to one’s own work, as a

member and leader in a team. Manage projects in multidisciplinary environments.

12. Life-long learning: Recognize the need for, and have the preparation and ability to

engage in independent and lifelong learning in the broadest context of technological

change.

Program Specific Outcomes:

The Graduates demonstrates the ability to

1. Apply the knowledge of basic science, mathematics and Information Technology to

facilitate automation of various scientific applications.

2. Analyze, design, simulate and implement solutions to multi-disciplinary real-world

problems using relevant hardware and software tools.

3. Develop the IT related product, with the understanding of business aspects and

economic impacts, showcasing the leadership qualities required for IT project

management, and exhibiting ethical, social and environmental responsibilities.

INDEX

SL.NO CONTENTS PAGE NO

1 MANAGEMENT, ENTREPRENEURSHIP AND

CYBER LAW 1

2 COMPUTER NETWORKS 11

3 DATABASE MANAGEMENT SYSTEMS 21

4 AUTOMATA THEORY AND COMPUTABILITY 36

5 ADVANCED JAVA AND J2EE 46

6 CLOUD COMPUTING 58

7 COMPUTER NETWORKS LABORATORY 75

8 DBMS LABORATORY & MINI PROJECT 77

B.L.D.E.A’s

Dr. P. G. Halakatti College of Engineering and Technology, Vijayapur-586103

Department of Information Science and Engineering

Information Science and Engineering Page No 1

1. MANAGEMENT, ENTREPRENEURSHIP AND CYBER LAW Semester: V Year: 2018-19

Subject Title: MANAGEMENT,

ENTREPRENEURSHIP AND

CYBER LAW Subject Code: 15CS51

Number of Lecture

Hours/Week 04 IA Marks 20

Total Number of Lecture

Hours 50 Exam Marks 80

Credits 04 Exam Hours 03

MODULE – 1 10 Hours

Introduction – Meaning, nature and characteristics of management, scope and functional

areas of management, goals of management, levels of management, brief overview of

evolution of management. Planning- Nature, importance, types of plans, steps in planning,

Organizing- nature and purpose, types of organization.

MODULE - 2 10 Hours

Staffing- meaning, process of recruitment and selection. Directing and controlling- meaning

and nature of directing, leadership styles, motivation theories. Controlling- meaning, steps in

controlling, methods of establishing control, Communication- Meaning and importance,

Coordination- meaning and importance

MODULE - 3 10 Hours

Entrepreneur – meaning of entrepreneur, types of entrepreneurship, stages of entrepreneurial

process, role of entrepreneurs in economic development, entrepreneurship in India, barriers to

entrepreneurship. Identification of business opportunities- market feasibility study, technical

feasibility study, financial feasibility study and social feasibility study.

MODULE - 4 10 Hours

Preparation of project and ERP - meaning of project, project identification, project selection,

project report, need and significance of report, contents, formulation, guidelines by planning

commission for project report Enterprise Resource Planning: Meaning and Importance- ERP

and Functional areas of Management – Marketing / Sales- Supply Chain Management –

Finance and Accounting – Human Resources – Types of reports and methods of report

generation.

MODULE – 5 10 Hours

Small Scale Industry: case study(Microsoft), Shahnaz Husain(Ayurveda Entrepreneur),

Government policy towards SSI, Case study(Captain G R Gopinath), case study (N R

Narayana Murthy & Infosys) Institutional support: case study: Amar Gopal Bose and Bose

corporation, supporting agencies of Govt for SSI, Different schemes, Types of Help, Case

study Dr Devi Prasad Shetty. Introduction to IPR.

Text Books:

1. Principles of Management -P. C. Tripathi, P. N. Reddy; Tata McGraw Hill, 4th Edition,

2010.

2. Dynamics of Entrepreneurial Development & Management -Vasant Desai Himalaya

Publishing House.

3. Entrepreneurship Development -Small Business Enterprises -Poornima M Charantimath

Pearson Education – 2006.

B.L.D.E.A’s




4. Management and Enterpreneurship- Kanishka Bedi- Oxford University Press-2017

Reference Books:

1. Management Fundamentals -Concepts, Application, Skill Development Robert

LusiThomson.

2. Entrepreneurship Development -S S Khanka -S Chand & Co.

3. Management -Stephen Robbins -Pearson Education /PHI -17th Edition, 2003

MANAGEMENT, ENTREPRENEURSHIP AND CYBER LAW COURSE PLAN

1) Prerequisites:

This subject requires the student to have basic concept organizations and knowledge

regarding language & Vocabulary .

2) Course overview and its relevance to this programme:

Management & entrepreneurship is designed to give you a basic understanding of the role &

functions of a manger& explain the principles ,concepts & techniques used by managers

carrying out their work .The course is intended for students who are going to hold

,management responsibilities in an organization or enterprise. Topics covered in this course

include valves & communicating, planning decision making, organizing leading, controlling

.The course emphasizes the skills needed to apply management principles & concepts to real

life situations, students will analyze management issues & problems & how to formulate

realistic practical plans to resolve them .This subject is designed to give you a basic

understanding of entrepreneur, stages of entrepreneurship. It deals with steps to start SSI,

realization of government policies, Effect of WTO & GATT on small scale industries. A

student realize here to prepare project report .How to evaluative a project report .

Applications: In almost all the Manufacturing as well as service oriented organizations they can apply tools

& techniques studied in subject.

Course Outcomes:

After studying this course, students will be able to

CO1: Define management, organization, entrepreneur, planning, staffing, ERP and outline

their importance in entrepreneurship.

CO2: Utilize the resources available effectively through ERP.

CO3: Make us of IPRs and institutional support in entrepreneurship.

MODULE WISE PLAN

Module Number:1 No. of Hours: 10

Learning Objectives: The main objectives of this module are to

1. Define the meaning & nature of management.

2. Define the terms organization & administration.

3. Explain the scope & functional areas of management.

4. Explain the various roles of management.

5. Explain various levels of management & skills needed for managers.

6. Explain how management thought evolved.

B.L.D.E.A’s




7. Write various approaches to management.

8. Define and bring out nature & characteristics of Planning

9. Explain types and steps in planning.

10. Explain nature and purpose of organizing

11. Define types of organization

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

attained

PSOs

attained

Cos

attained

Text or

Reference

Book/Chapter

No.

L1.

Meaning, nature and

characteristics of

management

PPT

Chalk

and

Board

7, 8, 9,

10 ,11,

12

3

1

T4/1,R1

L2.

Scope and

functional areas of

management.

PPT,

Chalk

and

Board

1

T4/2, R1

L3.

Goals of

management, levels

of management

PPT,

Chalk

and

Board

1

T4/2, R1

L4.

Brief overview of

Evolution of

management

PPT,

Chalk

and

Board

1

T4/2, R1

L5.

Planning- Nature,

Importance

PPT,

Chalk

and

Board

1

T4/2, R1

L6. Types of plans

PPT,

Chalk

and

Board

1

T4/2, R1

L7. Steps in planning

PPT,

Chalk

and

Board

1

T4/2, R1

L8. Organizing- nature

and purpose

PPT,

Chalk

and

Board

1

T4/4,R1

L9. Types of

organization

PPT,

Chalk

and

Board

1

T4/4, R1

B.L.D.E.A’s




L10. Types of

organization.

PPT,

Chalk

and

Board

1

T4/4, R1

Questions for practice:

Questions COs Attained

1. Explain the functional areas of management 1

2. Briefly explain the evolution of management 1

3. Define planning and explain its types 1

4. Explain steps in planning. 1

5. Explain different types of organization . 1

MODULE-2

Module Number: 2 No. of Hours: 10


1. Staffing- meaning, process of recruitment and selection

2. Meaning and nature of directing

3. Motivation theories

4. Steps and methods of establishing control

5. Meaning and importance of communication and co-ordination

Lesson Plan:

Lecture

No.

Topics

Covered

Teaching

Method

POs

Attained

PSOs

Attained

Cos

Attained

Text or

Reference

Book/Chapter

No.

L11.

Meaning,

process of

recruitment

and selection

PPT,

Chalk and

Board

7, 8, 9, 10

,11, 12 3

1

T4/5,R1

L12. Process of

recruitment

PPT,

Chalk and

Board

1

T4/5, R1

L13. Process of

selection

PPT,

Chalk and

Board

1

T4/5, R1

L14.

Directing and

controlling-

meaning and

nature of

directing,

PPT,

Chalk and

Board

1

T4/6, R1

L15. leadership

styles,

PPT,

Chalk and 1

T4/6, R1

B.L.D.E.A’s




motivation

theories.

Board

L16. motivation

theories

PPT,

Chalk and

Board

1

T4/6, R1

L17.

methods of

establishing

control,

PPT,

Chalk and

Board

1

T4/6, R1

L18.

methods of

establishing

control,

PPT,

Chalk and

Board

1

T4/4,R1

L19.

Coordination-

meaning and

importance

PPT,

Chalk and

Board

1

T4/6, R1

L20.

Coordination-

meaning and

importance

PPT,

Chalk and

Board

1 T4/6, R1


Questions COs

Attained

1. Explain various sources of recruitment 1

2. Explain different approaches of leadership styles. 1

3. Explain Maslows theory of motivation. 1

4. Explain different types of communication according to direction of

communication. 1

5. Explain different techniques of co-ordination. 1

MODULE-3

Module Number: 3 No. of Hours: 10

Learning Objectives: The main objectives of this MODULE are to

1. Meaning and types of entrepreneurship.

2. Express the concepts of entrepreneurship.

3. Identify the characteristics of an entrepreneur.

4. Explain the importance of an entrepreneur.

5. Define entrepreneurial behavior, attributes & skills.

6. Express the various types of entrepreneurial process .

7. Express role of entrepreneurs in economic development

8. Explain barriers to entrepreneurship

9. Identify the business opportunity and perform feasibility study.

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSOs

Attained

Cos

Attained

Text or

Reference

Book/Chapter

No.

L21. Introduction to

entrepreneurship

PPT,

Chalk and

7, 8, 9,

10 ,11, 3 1 T4/12,R2

B.L.D.E.A’s




& how it was

evolution

Board 12

L22.

Functions of

entrepreneur,

Types of

entrepreneur

PPT,

Chalk and

Board

1 T4/12,R2

L23.

stages of

entrepreneurial

process

T4/12,R2

L24.

Meaning of

Intrapreneur

PPT,

Chalk and

Board

1 T4/12,R2

L25.

Role played by

entrepreneurs in

economic

development

PPT,

Chalk and

Board

1 T4/12,R2

L26.

Entrepreneurship

in INDIA before

independence

PPT,

Chalk and

Board

1 T4/12,R2

L27.

Barriers to

entrepreneurship.

PPT,

Chalk and

Board

1 T4/12,R2

L28.

Identification of

business

opportunities-

PPT,

Chalk and

Board

1 T4/15

L29.

Market

feasibility study,

technical

feasibility study

PPT,

Chalk and

Board

1 T4/15

L30.

Financial

feasibility study

and social

feasibility study

PPT,

Chalk and

Board

1 T4/15



1. Define entrepreneurship & explain functions of entrepreneur 1

2. Differentiate between entrepreneur & Intrapreneur 1

3. Explain role played by entrepreneur in economic

development of our country 1

4. Explain evolution of entrepreneurship in INDIA before

independence & after independence 1

5. Explain the barriers of entrepreneurs. 1

6. Define feasibility. Explain market, Technical, Financial

&social feasibility studies. 1

B.L.D.E.A’s




MODULE-4


Learning Objectives: The main objectives of this Module are to

1. Define Project.

2. Express the project identification process.

3. Explain the project selection phase.

4. Express project report & its need.

5. Explain components of project report.

6. Identify the steps in formulation of project report.

7. Write guidelines of planning commission on project work.

8. Explain the meaning and importance of ERP

9. Explain Functional areas of Management

10. Identify the types of report.

Lesson Plan:

Lecture

No.

Topics

Covered

Teaching

Method

POs

Attained

PSOs

Attained

Cos

Attained

Text or

Reference

Book/Chapter

No.

L31.

Meaning of

project,

project

identification,

PPT,

Chalk and

Board

7, 8, 9, 10

,11, 12 3

1,2 T4/15

L32.

Project

selection,

project report

PPT,

Chalk and

Board

1,2 T4/15

L33.

Need and

significance of

report, and

contents of

project report

PPT,

Chalk and

Board

1,2 T4/15

L34. Project

formulation

PPT,

Chalk and

Board

1,2 T4/15

L35.

Guidelines by

planning

commission

for project

report

PPT,

Chalk and

Board

1,2 T4/15

L36.

Meaning and

Importance-

ERP

PPT,

Chalk and

Board

1,2 T4/15

L37.

Functional

areas of

Management

PPT,

Chalk and

Board

1,2 T4/15

B.L.D.E.A’s




L38.

Marketing /

Sales- Supply

Chain

Management

PPT,

Chalk and

Board

1,2 T4/15

L39.

Finance and

Accounting –

Human

Resources

PPT,

Chalk and

Board

1,2 T4/15

L40.

Types of

reports and

methods of

report.

PPT,

Chalk and

Board

1,2 T2/2



1. Define project & explain how to select a project. 1,2

2. Briefly outline the contents of a project report. 1,2

3. Explain the guidelines given by planning commission of INDIA for project report.

1,2

4. Explain the errors of project report. 1,2

5. What is project appraisal ? what are the steps to check it? 1,2

6. Explain the Functional areas of Management 1,2

MODULE-5



01 Explain case study(Microsoft), Shahnaz Husain(Ayurveda

Entrepreneur),

02 Express the characteristics of small scale industries and its need.

03 Government policy towards SSI.

04 Explain the Case study(Captain G R Gopinath),

case study (N R Narayana Murthy & Infosys)

05 Explain the supporting agencies of Govt for SSI.

06 Explain the Different schemes, Types of Help towards SSI.

07 Introductionto IPR.

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSOs

Attained

Cos

Attained

Text or

Reference

Book/Chapter

No.

L41.

Meaning and

characteristics of

SSI

PPT,

Chalk

and

Board

7, 8, 9, 10

,11, 12 3

1,2,3 T4/13,R2

B.L.D.E.A’s




L42.

case

study(Microsoft),

Shahnaz

Husain(Ayurveda

Entrepreneur),,

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L43. Government

policy towards

SSI

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L44.

Case

study(Captain G

R Gopinath),

case study (N R

Narayana Murthy

& Infosys)

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L45.

Institutional

support: case

study:

Amar Gopal

Bose and Bose

corporation

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L46. supporting

agencies of Govt

for SSI,

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L47. Different

schemes under

SSI

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L48.

Types of Help

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L49.

Case study Dr

Devi Prasad

Shetty

PPT,

Chalk

and

Board

1,2,3 T4/13,R2

L50.

Introduction to

IPR.

PPT,

Chalk

and

Board

1,2,3 T4/13,R2



1. Explain case study(Microsoft), Shahnaz Husain(Ayurveda

Entrepreneur),. 1,2,3

B.L.D.E.A’s




2. Government policy towards SSI. 1,2,3

3. Explain the Case study of N R Narayana Murthy & Infosys. 1,2,3

4. Explain the supporting agencies of Govt for SSI. 1,2,3

5. Explain the Different schemes for SSI 1,2,3

Assignment Questions:

Assignment 1:


1. Explain the functional areas of management 1

2. Briefly explain the evolution of management 1

3. Explain different types of organization . 1

4. Explain different approaches of leadership styles. 1

5. Explain Maslows theory of motivation. 1

Assignment 2:


1. Define entrepreneurship & explain functions of entrepreneur. 1

2. Explain role played by entrepreneur in economic

development of our country 1

3. Explain evolution of entrepreneurship in INDIA before

independence & after independence 1

4 .Explain the guidelines given by planning commission of

INDIA for project report. 1,2

5. Explain the errors of project report. 1,2

Assignment 3:


1. Explain case study(Microsoft), Shahnaz Husain(Ayurveda

Entrepreneur),. 1,2,3

2. Government policy towards SSI. 1,2,3

3. Explain the Case study of N R Narayana Murthy & Infosys. 1,2,3

4. Explain the supporting agencies of Govt for SSI. 1,2,3

5. Explain the Different schemes for SSI 1,2,3

MANAGEMENT, ENTREPRENEURSHIP AND CYBER LAW

IA PORTION

I. A. Test No. Modules

I 1,2

II 3

III 4,5

B.L.D.E.A’s




2. COMPUTER NETWORKS SYLLABUS

COMPUTER NETWORKS [As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2016 -2017) SEMESTER – V

Subject Code 15CS52 IA Marks 20

Number of Lecture Hours/Week 4 Exam Marks 80

Total Number of Lecture Hours 50 Exam Hours 03

Staff : Prof. K.B.Pawar

CREDITS – 04 Course objectives: This course will enable students

to Demonstration of application layer protocols Discuss transport layer services and understand UDP and TCP protocols Explain routers, IP and Routing Algorithms in network layer Disseminate the Wireless and Mobile Networks covering IEEE 802.11 Standard Illustrate concepts of Multimedia Networking, Security and Network Management

Module – 1 Teaching

Hours

Application Layer 10 Hrs

Principles of Network Applications: Network Application Architectures, Processes

Communicating, Transport Services Available to Applications, Transport Services

Provided by the Internet, Application-Layer Protocols. The Web and HTTP: Overview of

HTTP, Non-persistent and Persistent Connections, HTTP Message Format, User-Server

Interaction: Cookies, Web Caching, The Conditional GET, File Transfer: FTP Commands &

Replies, Electronic Mail in the Internet: SMTP, Comparison with HTTP, Mail Message Format,

Mail Access Protocols, DNS; The Internet's Directory Service: 0Services Provided by DNS,

Overview of How DNS Works, DNS Records and Messages, Peer-to-Peer Applications: P2P

File Distribution, Distributed Hash Tables, Socket Programming: creating Network

Applications: Socket Programming with UDP, Socket Programming with TCP.

T1: Chap 2

Module – 2

Transport Layer 10 Hrs

Transport Layer : Introduction and Transport-Layer Services: Relationship Between

Transport and Network Layers, Overview of the Transport Layer in the Internet, Multiplexing

and Demultiplexing: Connectionless Transport: UDP,UDP Segment Structure, UDP

Checksum, Principles of Reliable Data Transfer Building a Reliable Data Transfer Protocol,

Pipelined Reliable Data Transfer Protocols, Go-Back-N, Selective repeat, Connection-

Oriented Transport TCP: The TCP Connection, TCP Segment Structure, Round-Trip Time

Estimation and Timeout Reliable Data Transfer, Flow Control, TCP Connection Management,

Principles of Congestion Control: The Causes and the Costs of Congestion, Approaches to

Congestion Control, Network-assisted congestion-control example, ATM ABR Congestion

control, TCP Congestion Control: Fairness.

T1: Chap 3

Module – 3

B.L.D.E.A’s




The Network layer 10 Hrs

What’s Inside a Router?: Input Processing, Switching, Output Processing, Where Does Queuing

Occur? Routing control plane, IPv6,A Brief foray into IP Security, Routing Algorithms: The

Link-State (LS) Routing Algorithm, The Distance-Vector (DV) Routing Algorithm, Hierarchical

Routing, Routing in the Internet, Intra-AS Routing in the Internet: RIP, Intra-AS Routing in the

Internet: OSPF, Inter/AS Routing: BGP, Broadcast and Multicast Routing: Broadcast Routing

Algorithms and Multicast.

T1: Chap 4:4.3-4.7

Module – 4

Mobile and Multimedia Networks 10 Hrs

Mobile and Multimedia Networks: Cellular Internet Access: An Overview of Cellular Network

Architecture, 3G Cellular Data Networks: Extending the Internet to Cellular subscribers, On

to 4G:LTE,Mobility management: Principles, Addressing, Routing to a mobile node, Mobile IP,

Managing mobility in cellular Networks, Routing calls to a Mobile user, Handoffs in GSM,

Wireless and Mobility: Impact on Higher-layer protocols.

T1: Chap: 6 : 6.4-6.8

Module – 5

Multimedia Networking Applications 10 Hrs

Multimedia Networking Applications: Properties of video, properties of Audio, Types of

multimedia Network Applications, Streaming stored video: UDP Streaming, HTTP

Streaming, Adaptive streaming and DASH, content distribution Networks, case studies:

Netflix, You Tube and Kankan. Network Support for Multimedia : Dimensioning Best-Effort

Networks, Providing Multiple Classes of Service, Diff serv, Per-Connection Quality-of-

Service (QoS) Guarantees: Resource Reservation and Call Admission

T1: Chap: 7:7.1,7.2,7.5

Question paper pattern: The question paper will have TEN questions. There will be TWO questions from each module.

Each question will have questions covering all the topics under a module. The students will have to answer FIVE full questions, selecting ONE full question from each module.

Text Books: 1. James F Kurose and Keith W Ross, Computer Networking, A Top-Down Approach,

Sixth edition, Pearson,2017 . Reference Books:

1. Behrouz A Forouzan, Data and Communications and Networking, Fifth Edition,

McGraw Hill, Indian Edition 2. Larry L Peterson and Brusce S Davie, Computer Networks, fifth edition, ELSEVIER

3. Andrew S Tanenbaum, Computer Networks, fifth edition, Pearson

4. Mayank Dave, Computer Networks, Second edition, Cengage Learning.

1) Prerequisites:

1. Basic understanding of concepts of Data and communications.

2. Basic knowledge of TCP/IP protocol suite format

B.L.D.E.A’s




3. Protocols of all layers design

4. Basic knowledge of analog and digital signals

5. Basics of ATM networks.

6. Security of wired and wireless networks

2) Course Overview and its relevance to this programme:

Communication networks are in a period of transition from networks that are

based on telephone architecture and standards to networks based on the IP

architecture. The reason for the change is that new services and applications can be

deployed with unexpected speed over an Internet that has attained the global reach of

the telephone network. Many of these new applications and services are quite visible

to all. Many other applications and services are having profound impact on business,

manufacturing, international commerce, medicine and government

The infrastructure of communication network is undergoing dramatic change

under pressure from the new services and enabled by technology innovation. A new

generation of Wireless device combines the aspects of cellular phones. Personal

digital assistants and even digital cameras and is enabling new modes of mobile

communication such as short text messaging, event notification, email and web

browsing. These wireless services are blazing a trail away from traditional telephony

to new modes of IP-based multimedia communications. A new generation of IP-

based protocols will control and manage the resources in the next generation of

networks.

3) Course outcomes: The students should be able to:

Explain principles of application layer protocols Recognize transport layer services and infer UDP and TCP protocols Classify routers, IP and Routing Algorithms in network layer Understand the Wireless and Mobile Networks covering IEEE 802.11 Standard Describe Multimedia Networking and Network Management

Applications:

1. Describe the basis and structure of an abstract layered protocol model 2. Describe, analyze and compare a number of data link, network, and transport layer

protocols. 3. Design and implement data link or network layer protocols within a simulated

networking environment. 4. Describe and analyze various related technical, administrative and social aspects

of specific computer network protocols from standards documents and other primary materials found through research

B.L.D.E.A’s




MODULE WISE PLAN

Module I


Hours

Module Name : Application Layer 10 Hrs

Learning Objectives: The main objectives of this unit are to :

1. Define conceptual and implementation aspects of network applications

2. Analyze network services required by applications, clients and servers, processes, and transport-layer

interfaces

3. Demonstrate network application development, over both TCP and UDP

4. Examine several network applications Web, e-mail, DNS, and peer-to-peer (P2P) file distribution focuses on multimedia applications, including streaming video and VoIP.

Lesson Plan:

Lecture

NO Topics Covered Teaching

method Pos attained PSO’s

attained Cos

attained Reference

Book/Chapter

No

L1. Principles of

Network

Applications:

Network

Application

Architectures

Chalk &

Board,

PPT

1,3,7,8,9,10,11

1,3 T1: Chap 2 pp

(83-184)

L2. Processes

Communicating,

Transport

Services

Available to

Applications

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)

L3. Transport

Services Provided

by the Internet,

Application-Layer

Protocols

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)

L4. The Web and

HTTP: Overview

of HTTP, Non-

persistent and

Persistent

Connections

Chalk &

Board,

PPT

1,2 1,2 T1: Chap 2 pp

(83-184)

L5. HTTP Message

Format, User-

Server

Interaction:

Cookies, Web

Caching

Chalk &

Board,

PPT

1,2 T1: Chap 2 pp

(83-184)

L6 The Conditional

GET, File

Transfer: FTP

Commands &

Replies,

Electronic Mail in

the Internet:

SMTP,

Comparison with

HTTP, Mail

Message Format

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)

B.L.D.E.A’s




L7 Mail Access

Protocols, DNS;

The Internet's

Directory Service:

0Services

Provided by DNS,

Overview of How

DNS Works, DNS

Records and

Messages

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)

L8 Peer-to-Peer

Applications: P2P

File Distribution,

Distributed Hash

Tables

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)

L9 Socket

Programming:

creating Network

Applications:

Socket

Programming with

UDP

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)

L10 Socket

Programming with

TCP & Revision

Chalk &

Board,

PPT

1,3 T1: Chap 2 pp

(83-184)


1. Explain two different types of Network Application Architectures

2. Illustrate socket communication between two processes that communicate over the Internet

3. List and explain the Transport Services Available to Applications

4. Differentiate between persistent connections and Non persistent connections wrt HTTP

5. Illustrate General format of an HTTP request message

6. Explain Internet e-mail system and SMTP

7. Illustrate DNS message format

8. Explain an file distribution problem in Peer-to-Peer Applications

Module – 2 Teaching Hours

Module Name : Transport Layer 10 Hrs


1. Explain the role of Transport Layer protocols and services in supporting

communications across data networks 2. ƒ Analyze the application and operation of TCP mechanisms that support reliability 3. Analyze the application and operation of TCP mechanisms that support reassembly

and manage data loss 4. Analyze the operation of UDP to support communicate between two processes on

end devices 5. Illustration of how two entities can communicate reliably over a medium that may

lose and corrupt data.

Assignment Questions M2:

1. List the services provided by Transport layer

2. Explain Reliable data transfer Service model in TCP

3. Explain the approaches of Congestion Control in Transport layer

4. What are three additional protocol capabilities are required in ARQ protocols

B.L.D.E.A’s





1.

Explain an overview of the network layer and the services it can provide and how

the network layer implements the host-to-host communication service

2. Analyze the data-gram and the virtual-circuit model

3. Illustrate an important distinction between the forwarding and routing functions

of the network layer

4. Investigate network-layer addressing and the IPv4 datagram format

5. Explore network address translation (NAT), datagram fragmentation, the Internet

Control Message Protocol (ICMP), and IPv6

6. Analyze role of different routing algorithm


Module Name : The Network layer 10 Hrs

Lecture

NO

Topics Covered Teaching

method

Pos attained PSO’s

attained

Cos

attained

Reference

Book/Chapter

No

L21 What’s Inside a Router?: Input

Processing, Switching,

Output Processing

Chalk &

Board,

PPT

1,2,3,4,7,8,9,10,11

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

L22 Where Does Queuing

Occur? Routing control plane

Chalk &

Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

L23 IPv6,A Brief foray into

IP Security

Chalk & Board,

PPT

1,2,3 2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412) L24 Routing Algorithms:

The Link-State (LS) Routing Algorithm, The

Distance-Vector (DV)

Routing Algorithm

Chalk &

Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

L25 Hierarchical Routing,

Routing in the Internet,

Intra-AS Routing in the Internet: RIP

Chalk & Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

L26 Intra-AS Routing in the Internet: OSPF

Chalk &

Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412) L27 Inter/AS Routing:

Border Gateway

Protocol

Chalk & Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412) L28 Broadcast and Multicast

Routing

Chalk &

Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

L29 Broadcast Routing

Algorithms and

Multicast Algorithms

Chalk &

Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

L30 Problems and Revision Chalk &

Board,

PPT

2,3,4 T1: Chap

4:4.3-4.7

Pp(320-412)

B.L.D.E.A’s




1. Explain an over view of Wireless and mobile networks

2. Expresses distinction between the challenges posed by the wireless nature of the

communication links 3. Illustrating code division multiple access (CDMA)

4. Examine the link-level aspects of the IEEE 802.11 (WiFi)

5. Explain an over view of cellular Internet access, including 3G and emerging 4G

cellular technologies

Lecture

NO


method


attained

Cos

attained

Reference

Book/Chapter

No

L31 Mobile and

Multimedia

Networks

Chalk &

Board,

PPT

1,2,3,4,7,8,9,10,11

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L32 Cellular

Internet

Access

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L33 An Overview

of Cellular

Network

Architecture

Chalk & Board,

PPT

1,2,3 3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L34 3G Cellular

Data

Networks

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L35 Extending the

Internet to

Cellular

subscribers,

On to 4G:LTE

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)


1. Explain high-level view of a generic router architecture along with its Four

router components

2. Illustrate with neat diagram three switching techniques

3. Explain IPv4 datagram format and Key fields of it

4. Explain the process of IP fragmentation and reassembly

5. Problem on DHCP


7. Problem on Distance-Vector (DV) Routing Algorithm


Module Name : Mobile and Multimedia Networks 10 Hrs

B.L.D.E.A’s




L36 Mobility

management:

Principles,

Addressing,

Routing to a

mobile node

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L37 Mobile IP,

Managing

mobility in

cellular

Networks

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L38 Routing calls

to a Mobile

user,

Handoffs in

GSM

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L39 Wireless and

Mobility

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)

L40 Impact on

Higher-layer

protocols and

REVISION

Chalk &

Board,

PPT

3,4 T1: Chap: 6 :

6.4-6.8

Pp(545-577)


Q1. Explain GSM 2G cellular network architecture

Q2.Illustrate 3G system architecture

Q3. 3GPP has two important innovations over 3G systems .Explain them?

Q4.Explain mobile network architecture


Module Name : Multimedia Networking Applications: 10 Hrs

1.

2. Over view of multimedia application as either streaming stored audio/video,

conversational voice/video-over-IP, or streaming live audio/video

3. Illustrating Principles behind video streaming, including client buffering,

prefetching 4. Investigate mechanisms within the network that can be used to distinguish one class

of traffic 5. Examine video streaming in some details

Lecture

NO


method


attained

Cos

attained

Reference

Book/Chapter No

L41 Multimedia

Networking

Applications:

Properties of

video

Chalk &

Board,

PPT

1,2,3,4,7,8,9,10,11

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L42 properties of

Audio, Types of

multimedia

Network

Applications

Chalk &

Board, PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

B.L.D.E.A’s




L43 Streaming

stored video:

UDP Streaming,

HTTP

Streaming

Chalk &

Board,

PPT

1,2,3,4 4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L44 Adaptive

streaming and

DASH, content

distribution

Networks

Chalk &

Board,

PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L45 Netflix, You

Tube and

Kankan.

Network

Support for

Multimedia

Chalk &

Board,

PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L46 Dimensioning

Best-Effort

Networks,

Chalk &

Board,

PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L47 Providing

Multiple Classes

of Service, Diff

serv

Chalk & Board,

PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L48 Per-Connection

Quality-of-

Service (QoS)

Guarantees

Chalk & Board,

PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L49 Resource

Reservation and

Call Admission

Chalk &

Board,

PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)

L50 Problems and

Review

Chalk &

Board, PPT

4,5 T1: Chap:

7:7.1,7.2,7.5Pp(588-

655)


Q1. What are the properties of Video.

Q2.Explain CDN

Q3. Define a multimedia network application

Q4. What are the Categories of streaming video applications

Assignment I

1. Explain two different types of Network Application Architectures

2. Illustrate socket communication between two processes that communicate over the Internet

3. List and explain the Transport Services Available to Applications

5. List the services provided by Transport layer

6. Explain Reliable data transfer Service model in TCP

7. Explain the approaches of Congestion Control in Transport layer

Assignment II

1. Explain high-level view of a generic router architecture along with its Four

router components

2. Illustrate with neat diagram three switching techniques


4. Explain the process of IP fragmentation and reassembly

5. Explain GSM 2G cellular network architecture

6. Illustrate 3G system architecture

7. 3GPP has two important innovations over 3G systems .Explain them?

B.L.D.E.A’s




Assignment III

Q1. What are the properties of Video.

Q2.Explain CDN

Q3. Define a multimedia network application

Q4. What are the Categories of streaming video applications

Q5. Mention all the quality paprameters

B.L.D.E.A’s




3. DATABASE MANAGEMENT SYSTEMS Semester: V Year: 2018-19

Subject Title: DATABASE MANAGEMENT SYSTEMS Subject Code: 15CS53 Total Contact Hours: 50 Duration of Exam : 03 Total Exam Marks: 80 Total IA Marks : 20 Staff : Prof.S.B.Biradar

Course objectives: This course will enable students to:

Provide a strong foundation in database concepts, technology, and practice.

Practice SQL programming through a variety of database problems.

Demonstrate the use of concurrency and transactions in database

Design and build database applications for real world problems.

Module – 1 Introduction to Databases: Introduction, Characteristics of database approach, Advantages

of using the DBMS approach, History of database applications.

Overview of Database Languages and Architectures: Data Models, Schemas, and

Instances. Three schema architecture and data independence, database languages, and

interfaces, The Database System environment.

Conceptual Data Modeling using Entities and Relationships: Entity types, Entity sets,

attributes, roles, and structural constraints, Weak entity types, ER diagrams, examples,

Specialization and Generalization. 10 Hours

Textbook 1: Ch 1.1 to 1.8, 2.1 to 2.6, 3.1 to 3.10

Module – 2 Relational Model: Relational Model Concepts, Relational Model Constraints and relational

database schemas, Update operations, transactions, and dealing with constraint violations.

Relational Algebra: Unary and Binary relational operations, additional relational operations

(aggregate, grouping, etc.) Examples of Queries in relational algebra.

Mapping Conceptual Design into a Logical Design: Relational Database Design using ER

to-Relational mapping.

SQL:SQL data definition and data types, specifying constraints in SQL, retrieval queries in

SQL, INSERT, DELETE, and UPDATE statements in SQL, Additional features of SQL.

10 Hours

Textbook 1: Ch 4.1 to4.5, 5.1 to 5.3, 6.1 to 6.5,8.1; Textbook 2: 3.5

Module – 3 SQL : Advances Queries: More complex SQL retrieval queries, Specifying constraints as

assertions and action triggers, Views in SQL, Schema change statements in SQL.

Database Application Development: Accessing databases from applications, An

introduction to JDBC, JDBC classes and interfaces, SQLJ, Stored procedures, Case study:

The internet Bookshop.

Internet Applications:The three-Tier application architecture, The presentation layer, The

Middle Tier 10 Hours

Textbook 1: Ch 7.1 to 7.4; Textbook 2: 6.1 to 6.6, 7.5 to 7.7.

Module – 4

B.L.D.E.A’s




Normalization: Database Design Theory – Introduction to Normalization using Functional

and Multivalued Dependencies: Informal design guidelines for relation schema, Functional

Dependencies, Normal Forms based on Primary Keys, Second and Third Normal Forms,

Boyce-Codd Normal Form, Multivalued Dependency and Fourth Normal Form, Join

Dependencies and Fifth Normal Form.

Normalization Algorithms: Inference Rules, Equivalence, and Minimal Cover, Properties

of Relational Decompositions, Algorithms for Relational Database Schema Design, Nulls,

Dangling tuples, and alternate Relational Designs, Further discussion of Multivalued

dependencies and 4NF, Other dependencies and Normal Forms. 10 Hours

Textbook1 :Ch 14.1 to 14.7,15.1 to 15.6

Module – 5 Transaction Processing: Introduction to Transaction Processing, Transaction and System

concepts, Desirable properties of Transactions, Characterizing schedules based on

recoverability, Characterizing schedules based on Serializability, Transaction support in SQL.

Concurrency Control in Databases: Two-phase locking techniques for Concurrency

control, Concurrency control based on Timestamp ordering, Multiversion Concurrency

control techniques, Validation Concurrency control techniques, Granularity of Data items and

Multiple Granularity Locking.

Introduction to Database Recovery Protocols: Recovery Concepts, NO-UNDO/REDO

recovery based on Deferred update, Recovery techniques based on immediate update,

Shadow paging, Database backup and recovery from catastrophic failures 10 Hours

TextBook 1:Ch. 20.1 to 20.6,21.1 to 21.7,22.1 to 22.7

Question paper pattern:

The question paper will have TEN questions.

There will be TWO questions from each module.

Each question will have questions covering all the topics under a module.

The students will have to answer FIVE full questions, selecting ONE full question

from eachmodule.

TEXT BOOKS:

T1. Database systems Models, Languages, Design and Application Programming, Ramez

Elmasri and Shamkant B. Navathe, 7th Edition, Pearson.

T2. Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014, McGraw

Hill

Reference Books:

R1. Silberschatz Korth and Sudharshan: Database System Concepts, 6th Edition, Mc-Graw

Hill, 2013.

R2. Coronel, Morris, and Rob, Database Principles Fundamentals of Design, Implementation

and Management, Cengage Learning 2012.

DBMS COURSE PLAN PREREQUISITES:

The students must be familiar with elementary programming and data-structuring

concepts. They should have hd some exposure to traditional database applications such as

airline / train / bus reservation.

B.L.D.E.A’s




COURSE OVERVIEW AND RELEVANCE TO THE CURRENT PROGRAM:

The amount of information available to us is literally exploding, and the value of data

as an organizational asset is widely recognized. To get the most out of their large and

complex datasets, users require tools that simplify the tasks of managing the data and

extracting useful information in a timely fashion. Otherwise data become a liability, with the

cost of acquiring it and managing it far exceeding the value derived from it. Thus the

database management systems(DBMS) are now an indispensable tool for managing

information, and a course on the principles and practices of database systems is now an

integral part of computer science curricula.

The data models of DBMS provide a high-level view of the issues in database

design, and of the problems that we encounter in capturing the semantics of realistic

applications. The normalization in DBMS based on decomposition reduces the

redundancy. The recovery manager of a DBMS is responsible for handling system

crashes and media failures.

COURSE LEARNING OUTCOMES: At the end of the course, the students will be able to:

C353.1: Identify, analyze and define database objects, enforce integrity constraints on a

database using RDBMS.

C353.2:Analyze and develop relational models, relational algebra concepts & ER

diagrams.

C353.3:Demonstrate the Structured Query Language (SQL) in the design of database

systems.

C353.4:Design and build simple real-world database systems and applications using

GUI.

C353.5: Implement normalization algorithms using database design theory for different

Applications.

C353.6:Analyze and implement transaction processing, concurrency control and

database recovery protocols in databases.

APPLICATIONS: 1. Developing the models for real world database application. 2. Designing any real world database applications like

Library Management Bank Transaction Airline Reservation System Railway Reservation System

MODULE WISE COURSE PLAN:

MODULE-1

Textbook 1: Ch 1.1 to 1.8, 2.1 to 2.6, 3.1 to 3.10 No. of Hours: 10 Unit Title: Introduction ,Overview of Database Languages and Architectures, Modeling using Entities and Relationships

Objectives: The main objectives of this module are to

B.L.D.E.A’s




1. Understand the basics of database approach and definitions of basic terms.

2. Study and analyze database languages and architectures

3. Analyze conceptual data modeling using entities and relationships

4. Design and analyze ER diagrams for different applications such as hospital

management, bank database, University database and company database etc.

Lesson Plan:

Lecture

No Topic covered

Teaching

Method

PO’s

attained

PSO’s

attained

CO’s

attained

Reference

Book/Chapter

No.

L1.

Introduction,

Characteristics of

database approach

Chalk

and

Board,

PPT

1,2,3,4,6,8,9

1,2

1 T1/1

L2.

Advantages of using

the DBMS approach.

Chalk

and

Board,

PPT

1 T1/1

L3.

History of database

applications

Chalk

and

Board,

PPT

1 T1/1

L4.

Data Models,

Schemas, and

Instances.

Chalk

and

Board,

PPT

1,2 T1/2

L5.

Three schema

architecture and data

independence.

Chalk

and

Board,

PPT

1,2 T1/2

L6

Database languages,

and interfaces

Chalk

and

Board,

PPT

1,2 T1/2

L7. The Database

System environment

Chalk

and

Board,

PPT

1,2 T1/2

L8.

Entity types, Entity

sets,

attributes, roles, and

structural constraints

Chalk

and

Board,

PPT

1,2 T1/3

L9. Weak entity types.

Chalk

and

Board,

1,2 T1/3

B.L.D.E.A’s




PPT

L10. ER diagrams,

Examples

Chalk

and

Board,

PPT

1,2

T1/3

L11. Specialization and

Generalization.

Chalk

and

Board,

PPT

1,2

T1/3

Assignment Questions for practice:

Assignment Questions

Cos

Attained

1. Define the following terms

a)Database b) Database management system c) Metadata d) Data

model e)OLTP f) transaction g)canned transaction h)triggers

i)database designer j)recurring relationship.

1

2. Explain characteristics of the database approach. 1

3. What are the responsibilities of database administrators? 1 4. List advantages of DBMS over traditional file systems. Briefly explain

them 1

5. Describe the three schema architecture. What are the problems

associated with three schema architecture. 1,2

6. Discuss the different types of user friendly interfaces. Mention

different types of users. 1, 2

7. Discuss the main categories of data model. 1, 2

Define the following the terms with example.

8. Multivalued attribute b) composite attribute c) weak entity d)

relationship e)key attribute f) partial key g)canned transaction

h)metadata i)database designer j)recurring relationship.

1, 2

9. A database is being constructed to keep track of the teams and games

of a sports league. A team has a number of players, not all of whom

participate in each game. It is desired to keep track of the players

participating in each game for each team, the positions they played in

that game and the result of the game. Design an ER diagram for this

application, stating any assumptions you make. Convert the ER

diagram into tables applying mapping algorithm.

1, 2

10. Draw the ER diagram of a company database assuming the 5 -7entity

types. 1, 2

11. Draw the ER diagram of a bank database assuming the 5 -7entity

types 1, 2

B.L.D.E.A’s




MODULE-2

Textbook 1: Ch 4.1 to4.5, 5.1 to 5.3, 6.1 to

6.5,8.1; Textbook 2: 3.5

No. of Hours: 10

Module Title: Relational Model, Relational Algebra, Mapping Conceptual Design into a

Logical Design, SQL

Objectives: The main objectives of this Module are to

1 Illustrate a relational Model

2 Implement the queries in relational algebra

3 Design Algorithm to perform ER to relational mapping.

4 Implement the queries in SQL.

Lesson Plan:

Lecture

No Topic covered

Teaching

Method PO’s attained PSO’s

attained

CO’s

attained

Reference

Book/Chapter

No.

L12.

Relational Model

Concepts

Chalk

and

Board,

PPT

1,2,3,4,5,6,9,11

1,2

2 T1/4

L13.

Relational Model

Constraints and

Relational

Database

Schemas

Chalk

and

Board,

PPT

2

T1/4

L14.

Update

Operations ,

Transactions and

Dealing with

Constraint

Violations

Chalk

and

Board,

PPT 2

T1/5

L15.

Unary Relational

Operations:

SELECT and

PROJECT

Chalk

and

Board,

PPT

2

T1/5

L16.

Additional

relational

operations

(aggregate,

grouping, etc.)

Chalk

and

Board,

PPT

2

T1/5

L17.

Examples of

Queries in

relational algebra

Chalk

and

Board,

2

T1/5

12. Discuss the conventions for displaying an ER schema as an ER

diagram. 1, 2

B.L.D.E.A’s




PPT

L18.

Relational

Database Design

using ER-to-

Relational

mapping

Chalk

and

Board,

PPT

2 T2/3

L19.

SQL data

definition and

data types

Chalk

and

Board,

PPT

3 T1/6

L20.

Specifying

constraints in

SQL, retrieval

queries in SQL

Chalk

and

Board,

PPT

3 T1/6

L21.

INSERT,

DELETE, and

UPDATE

statements in

SQL

Chalk

and

Board,

PPT

3 T1/8

L22.

Additional

features of SQL

Chalk

and

Board,

PPT

3 T1/8



Cos

attained

1. List and explain the characteristics of a relation. 2

2. Explain 1)Domain constraints. 2) Key constraints. 3) Semantic integrity

constraints. 2

3. Explain with an example, the mapping algorithm to convert the ER diagram

into the tables. 2

4. Explain all the unary relational operations in relational algebra. 2

5. Write relational query for following :

To retrieve the list of names of each female employees dependents.

To retrieve the SSN of all employees who either work in dept 5 or

directly supervise an employee who works in dept 5.

2

B.L.D.E.A’s




6. Consider the two tables T1 and T2 show the result of the following

operations:

i) T1 T1.P=T2.A T2

ii) T1 T1.Q=T2.B T2

iii) T1 = T1.P=T2.A T2

iv) T1 = T1.Q=T2.B T2

Table T1

Table T2

P Q R

10

15

25

a

b

a

5

8

6

A B C

10

15

10

b

c

b

6

3

5

2

6. With respect to SQL ,explain the following with an example

a) The drop command b) The alter command

3

7. Explain the ALTER TABLE command. Explain how a new constraint can be

added and also an existing constraint can be removed using suitable

examples.

3

8. Explain the ALTER TABLE command. Explain how a new constraints can

be added and also an existing constraint can be removed using suitable

examples.

3

9. How does SQL allow implementation of the entity integrity and referential

integrity constraints ?

3

10. How does the relations (tables) in SQL differ from the relations defined

formally ? Discuss the difference in terminology. Why does SQL allow

duplicate tuples in a table or in a query result?

3

11. Make a list of all project numbers for projects that involve an employee

whose last name is 'Smith', either as a worker or as a manager of the

department that controls the project.

3

12. Retrieve the name of managers who donot have female dependent. 3

13. Retrieve the name of each employee who works on all the projects controlled

by department number 5.

3

B.L.D.E.A’s




14. For each project, retrieve the project number, the project name,and the

number of employees who work on that project.

3

15. Find the sum of the salaries of all employees of the research department, as

well as the maximum salary and the average salary in this department.

3

MODULE-3

Textbook 1: Ch 7.1 to 7.4; Textbook 2: 6.1 to 6.6, 7.5 to 7.7. Planned Hours: 10

Module Title : SQL : Advances Queries, Database Application Development, Internet

Applications

Objectives: The main objectives of this unit are to:

1. Implement advanced queries using SQL

2 Develop the databases for real-time application

3. Analyze the different Internet applications

Lesson Plan:

Lecture

No

Topic covered Teaching

Method

Pos attained PSO

Attained

Cos

attained

Text

Book/Chapter

No.

L23.

More complex

SQL retrieval

queries

Chalk

and

Board

PPT

1,2,3,4,5,6,9,11,l2 1,2,3

3 T1/7

L24.

Specifying

constraints as

assertions and

action triggers

Chalk

and

Board

PPT

3 T1/7

L25.

Views in

SQL, Schema

change

statements in

SQL

Chalk

and

Board

PPT

3 T1/7

L26.

Accessing

databases

from

applications

Chalk

and

Board

PPT

4 T2/6

L27.

An

introduction to

JDBC, JDBC

classes and

interfaces.

Chalk

and

Board

PPT

4 T2/6

L28.

SQLJ, Stored

procedures,

Case study:

The internet

Bookshop

Chalk

and

Board,

PPT

4 T2/6

B.L.D.E.A’s




L29

The three-Tier

application

architecture

Chalk

and

Board,

PPT 1,2,3,4,6,9,11,l2

1,2

4 T2/7

L30

The

presentation

layer, The

Middle Tier

Chalk

and

Board,

PPT

4 T2/7



Cos

attained

1. Write a note on aggregate functions in SQL with examples. 3

2. Explain insert, delete and update statements in SQL with example 3

3. Briefly explain the following with respect to SQL, give example?

i)joins

ii)views

iii)Aggregate functions

iv)correlated queries

3

4. Explain the three-Tier application architecture? 4

5. Explain the presentation layer and the Middle Tier ? 4

MODULE-4

Chapter Number: 14.1 to 14.7,15.1 to 15.6 Planned Hours: 10

Module Title: Normalization: Database Design Theory


1. Design database based on normalization

2. Implement normalization algorithms

Lesson Plan:

Lectur

e No

Topic covered Teachin

g

Method

Pos attained PSO

attaine

d

Cos

attaine

d

Reference

Book/Chapte

r No.

L31.

Introduction to

Normalization

using

Functional and

Multivalued

Dependencies

PPT

1,2,3,4,5,6,9,11,1

2

5 T1/14

L32.

Informal design

guidelines for

relation schema,

Functional

Dependencies

PPT 5 T1/14

L33. Normal Forms

based on

Primary

PPT 5

T1/14

B.L.D.E.A’s




Keys, Second

and Third

Normal Forms

1,2,3

L34.

Boyce-Codd

Normal Form,

Multivalued

Dependency

and Fourth

Normal Form

Chalk

and

Board

5

T1/15

L35.

Join

Dependencies

and Fifth

Normal

Form.

Chalk

and

Board

5

T1/15

L36

Inference

Rules,

Equivalence,

and Minimal

Cover,

Properties of

Relational

Decompositions

.

Chalk

and

Board

5

T1/15

L37

Algorithms for

Relational

Database

Schema Design

Chalk

and

Board

5

T1/15

L38

Nulls, Dangling

tuples, and

alternate

Relational

Designs

Chalk

and

Board

5

T1/15

L39

Further

discussion of

Multivalued

dependencies

and 4NF

Chalk

and

Board

1,2,3,4,5,6,9,11,

12

1,2,3

5

T1/15

L40

Other

dependencies

and Normal

Forms

Chalk

and

Board

1,6 T1/15



Cos

attained

1. State the informal guidelines for relation schema design. . 5

2. Why should nulls in a relation be avoided as far as possible? Discuss the

problem of spurious tuples and how we may prevent it.

5

3. Define the functional dependency (FD). 5

B.L.D.E.A’s




4. Explain the rule of FD 5

5. . Define normalization 5

6. Explain the 1NF,2NF and 3NF. 5

7. Explain Boyce-Codd Normal Form with an example. 5

8. Compare BCNF and 3NF 5

9. Determine the following decomposition is lossless join or not

D={R1,R2,R3,R4,R5} R={A,B,C,D,EF,G,H,I,J}

R1= {ABC} R2= {ADE} R3= {BF} R4= {FGH} R5={DI}

F= {{A, B} →C, A→DE, B→F, F→GH, D→IJ}

5

1. 10. Define multi valued dependencies(MVDs 5

1. 11. Define 4NF. 5

12.Explain the 5th Normal form with an example.

2.

5

MODULE-5

Chapter Number: 20.1 to 20.6,21.1 to 21.7,22.1 to 22.7

Planned Hours: 10

Module Title: Transaction Processing, Concurrency Control in

Databases, Introduction to Database Recovery Protocols


1. Analyze the transaction processing

2 Design protocols for concurrency control

3. Identify and analyze database recovery protocols

Lesson Plan:

Lecture

No

Topic covered Teaching

Method

Pos attained PSO

attained

Cos

attained

Reference

Book/Chapter

No.

L41.

Introduction to

Transaction

Processing,

Transaction

and System

concepts

Chalk

and

Board

1,2,3

6 T1/20

L42.

Desirable

properties of

Transactions,

Characterizing

schedules

based on

recoverability

PPT

6

T1/20

L43. Characterizing

schedules PPT 6 T1/20

B.L.D.E.A’s




based on

Serializability

L44.

Transaction

support in

SQL

PPT

6

T1/20

L45.

Two-phase

locking

techniques for

Concurrency

control,

Concurrency

control based

on Timestamp

ordering

PPT

6

T1/21

L46.

Other

Dependencies

and Normal

Forms

PPT

6

T1/21

L47

Multiversion

Concurrency

control

techniques

PPT

6

T1/21

L48

Validation

Concurrency

control

techniques,

Granularity of

Data

items and

Multiple

Granularity

Locking

PPT

6

T1/21

L49

Recovery

Concepts, NO-

UNDO/REDO

recovery

based on

Deferred

update

PPT

1,2,3,4,5,6,9,11,12

1,2,3

6

T1/22

L50

Recovery

techniques

based on

immediate

PPT

6

T1/22

B.L.D.E.A’s




update,

Shadow

paging,

Database

backup and

recovery from

catastrophic

failures


Assignment Questions Cos attained

1. What is a transaction? 1,5

2. What properties transactions have? 1,5

3. Why do we want to interleave transactions? 1,5

4. How does the DMBS deal with transactions. 1,5

5. Explain serial schedule and serializable schedule 1,5

6. Explain the different types of anamolies? 1,2,5

7. Explain Recovery concepts? 1,2,5

8. Explain shadow paging? 1,2,5

9. Explain Database backup and recovery from catastrophic failures? 4,5

10. ExplainMultiversion Concurrency controltechniques 4,5

Assignment 1 Questions


Cos

Attained

1. Define the following terms

a)Database b) Database management system c) Metadata d) Data

model e)OLTP f) transaction g)canned transaction h)triggers

i)database designer j)recurring relationship.

1

2. Explain characteristics of the database approach 1

3. List advantages of DBMS over traditional file systems. Briefly explain

them 1

4. Describe the three schema architecture. What are the problems associated

with three schema architecture. 1

5. Draw the ER diagram of a company database assuming the 5 -7entity

types. 1,2



Cos

attained

1. List and explain the characteristics of a relation. 1,2

2. Explain 1)Domain constraints. 2) Key constraints. 3) Semantic integrity

constraints. 1,2

3. Explain with an example, the mapping algorithm to convert the ER

diagram into the tables. 1,2

4. Write a note on aggregate functions in SQL with examples. 1,4

B.L.D.E.A’s




5. Explain insert, delete and update statements in SQL with example 1,4



Cos

attained

1. Define the functional dependency (FD). Explain the rule of FD 1,6

2. Define normalization Explain the 1NF,2NF and 3NF. 1,6

3. Explain Boyce-Codd Normal Form with an example. 1,6

4. Explain Database backup and recovery from catastrophic failures? 1,2,5

5. What is a transaction? What properties transactions have? 1,2,5

IA TEST PORTION

IA test IA test portion COs attained

I IA Test Module 1,Module 2 1,2,3,4

II IA Test Module 3,Module 4 1,4,6

III IA Test Module 5 1,2,5

Course Coordinator Module Coordinator

B.L.D.E.A’s




4. AUTOMATA THEORY AND COMPUTABILITY Semester: V Year: 2018-19

Subject Title: Automata Theory and Computability Subject Code: 15CS54

Total Contact Hours: 50 Duration of Exam : 03

Total Exam Marks: 80 Total IA Marks : 20

Staff : Prof. S.K .Honawad CREDITS – 04

Module – 1 10 Hours Why study the Theory of Computation, Languages and Strings: Strings, Languages. A

Language Hierarchy, Computation, Finite State Machines (FSM): Deterministic FSM,

Regular languages, Designing FSM, Nondeterministic FSMs, From FSMs to Operational

Systems, Simulators for FSMs, Minimizing FSMs, Canonical form of Regular languages,

Finite State Transducers, Bidirectional Transducers.

Module – 2 10 Hours

Regular Expressions (RE): what is a RE?, Kleene’s theorem, Applications of REs,

Manipulating and Simplifying REs. Regular Grammars: Definition, Regular Grammars and

Regular languages. Regular Languages (RL) and Nonregular Languages: How many RLs, To

show that a language is regular, Closure properties of RLs, to show some languages are not

RLs.

Module – 3 10 Hours Context-Free Grammars(CFG): Introduction to Rewrite Systems and Grammars, CFGs

and languages, designing CFGs, simplifying CFGs, proving that a Grammar is correct,

Derivation and Parse trees, Ambiguity, Normal Forms. Pushdown Automata (PDA):

Definition of non-deterministic PDA, Deterministic and Non-deterministic PDAs, Non-

determinism and Halting, alternative equivalent definitions of a PDA, alternatives that are not

equivalent to PDA


Context-Free and Non-Context-Free Languages: Where do the Context-Free

Languages(CFL) fit, Showing a language is context-free, Pumping theorem for CFL,

Important closure properties of CFLs, Deterministic CFLs. Algorithms and Decision

Procedures for CFLs: Decidable questions, Un-decidable questions. Turing Machine: Turing

machine model, Representation, Language acceptability by TM, design of TM, Techniques

for TM construction.


Variants of Turing Machines (TM), The model of Linear Bounded automata,

Decidability: Definition of an algorithm, decidability, decidable languages, Undecidable

languages, halting problem of TM, Post correspondence problem. Complexity: Growth rate

of functions, the classes of P and NP, Quantum Computation: quantum computers, Church-

Turing thesis.

Text Books:

1. Elaine Rich, Automata, Computability and Complexity, 1st Edition, Pearson

Education,2012/2013

2. K L P Mishra, N Chandrasekaran , 3rd Edition, Theory of Computer Science, McGraw

hill, 2012

Reference Books:

1. John E Hopcroft, Rajeev Motwani, Jeffery D Ullman, Introduction to AutomataTheory,

Languages, and

Computation, 3rd Edition, Pearson Education, 2013

B.L.D.E.A’s




2. Michael Sipser : Introduction to the Theory of Computation, 3rd edition, Cengage

learning,2013

3. John C Martin, Introduction to Languages and The Theory of Computation, 3rd Edition,

Tata McGraw Hill Publishing Company Limited, 2013

4. Peter Linz, “An Introduction to Formal Languages and Automata”, 3rd Edition, Narosa

Publishers,

1998

5. Basavaraj S. Anami, Karibasappa K G, Formal Languages and Automata theory, Wiley

India, 2012

1) Prerequisites:

1. Discrete mathematics that includes set theory, mathematical induction, functions

relations, elements of mathematical reasoning, and proof techniques

2. Knowledge of some high level programming languages

Familiarity with data structures, recursion, compilers

2) Course Overview and its relevance to program:

This course contains the theory of automata, turing machine, different forms of

grammars and so much more scientific information which is required in the area of Computer

Science. This subject acts as a base for variety of areas of computer engineering such as

Compiler Construction, Language Processing, Operating System Design etc. It can be used in

the field of computer vision where the new idea of syntactic pattern recognition is coming up

The field of Computer Science includes a wide range of special topics machine design

to programming. The use of computers in the real world involves a wealth of specific detail

that must be learned for a successful application. This makes computer science a very diverse

a broad discipline. But in spite of this diversity, there are some common underlying

principles. To study these basic principles, we construct abstract models of computers and

computation. Firstly these models embody the important features that are common to both

hardware and software, and that are essential to many of the special and complex constructs

we encounter while working with computers. The second and perhaps not so obvious answer

is that the ideas we will discuss have some immediate and important applications. Te field of

digital design, programming languages, and compilers are the most obvious examples, but

there are many others. The concepts we study here run like a thread through much of

computer science, from operating systems to pattern recognition. The third answer is this

subject matter is intellectually stimulating and fun. It provides many challenging, puzzle- like

problems that can lead to some sleepless nights. This is problem-solving in is pure essence.

In this course, we will look at model that represent feature at the core of all computers

and there applications. To model the hardware of a computer, the notation of an automaton is

introduced. An automaton is a construct, that possesses all the indispensable features of a

digital computer. It accepts input, produces output, may have some temporary storage, and

can make decision in transforming the input into the output. A formal language is an

abstraction of the general characteristics of programming languages. A formal language

consists of a set of symbols and some rules of formation by which these symbol can be

combined into entities called sentences. A formal language is the set of all strings permitted

by the rules of formation. Although some of the formal languages we study here are simpler

than programming languages, they have many of the same essential features. We can learn a

great deal about programming languages from formal languages

Course outcomes: The students should be able to:

C1 Acquire fundamental understanding of the core concepts in automata theory and Theory

of Computation and design of finite automata

B.L.D.E.A’s




C2 Expressing Regular Expressions (RE) for different regular languages

C3 Design Grammars and Automata (recognizers) for different language classes and become

Knowledgeable about restricted models of Computation (Regular, Context Free) and their

relative Powers.

C4 Design of pushdown Automata (recognizers) for Context Free language

C5 About context free languages

C6 Design of Turing Machines

Applications:

1. In developing programming languages & compilers of various programming languages.

2. In designing digital circuits using the concepts of automata theory.

3. To familiarize students with the foundations and basic principles of computer science To

strengthen students ability to carry out formal and rigorous mathematical arguments.

MODULE WISE PLAN:

MODULE-1

Module-1 No of Hours: 10

Title: Why study the Theory of Computation, Languages and Strings


1 Acquire fundamental understanding of the core concepts in automata theory and

Theory of Computation

2 Define Deterministic Finite Automata(DFA)

3 Express Languages accepted by DFA 4 Define Non-Deterministic Finite Automata(NFA)

5 Define Non-Deterministic Finite Automata with epsilon moves(NFA- Є)

Lect

No.

Topics covered Teaching

method

POs

attained

PSO’s

attained

Cos

attained

Text

Book/

Chapter No.

L1 Strings, Languages Chalk

and

board

1,2,3,4 1,2

1 T1/1

L2 A Language Hierarchy,

Computation

Chalk

and

board

1,2,3,4 1,2

1 T1/2

L3 Finite State Machines

(FSM): Deterministic

FSM

Chalk

and

board

1,2,3,4 1,2

1 T1/2

L4 Regular languages Chalk

and

board

1,2,3,4 1,2

1 T1/5.1

L5 Designing FSM Chalk

and

board

1,2,3,4 1,2

1 T1/5.2

L6 Nondeterministic

FSMs, From FSMs to

Operational

Systems

Chalk

and

board

1,2,3,4

1,2

1 T1/5.3,5.4

L7 Simulators for FSMs Chalk

and

board

1,2,3,4 1,2

1 T1/5.5

L8 Minimizing FSMs,

languages

Chalk

and

board

1,2,3,4 1,2

1 T1/5.6,5.7

B.L.D.E.A’s




L9 Canonical form of

Regular

languages

Chalk

and

board

1,2,3,4 1,2

1 T1/5.8

L10 Finite State

Transducers,

Bidirectional

Transducers

Chalk

and

board

1,2,3,4 1,2

1 T1/5.9,5.10

Textbook 1: Ch 1, 2, 5.1 to 5.10


Assignment Questions Cos

attained

Q1) Define Automata & discuss why study automata 1

Q2) Define i) DFA ii) NFA iii) NFA- Є 1

Q3) Design the DFA for the language

L = {w : |w| mod 3 = 0, w Є (a+b)*

1

Q4) Design the DFA for the language having set of strings on the alphabet ∑

= {0,1} that either begins or end or both with substring “01”

1

Q5) Design a DFA to accept the following language over the alphabet {0,1}

L = {w | w is a even number}

1

Q6) Design a DFA for the language L = {(01)i12j | i ≥ 1, j ≥ 1} 1

Q7) Design a DFA for the language having set of all strings that either begins

or ends or both with substring ‘ab’

1

Q8) Design a DFA for set of all strings that ends with substring ‘abb’ 1

Q9) Design a DFA for the language

L = {w : |w| mod 5 ‹ › 0}

1

Q10) Define NFA-Є & design the NFA-Є or NFA for the languages

i) abc, abd, & aacd ii) {ab, abc}*

1

Q11) Convert the following NFA-Є to DFA using “Subset construction

scheme”

1

Q12) Consider the following NFA-Є

Є a b c

p Ф {p} {q} {r}

q {p} {q} {r} Ф

r {q} {r} Ф {p}

i)Compute Є- closure of each state ii) Convert the automata to a DFA

1

MODULE-II

Module-II No of Hours: 10

Title: Regular Expressions (RE):

0

4

5 3 2 1

B.L.D.E.A’s




Learning Objectives: The main objectives of this module are to:

1 Express Regular expressions(RE) for different regular languages.

2 Construct Finite Automata with epsilon transitions

3 Obtaining RE for various types of FA’s

4 Convert DFAs to RE by different methods

5 Demonstrate applications FA’s & RE’s.

6 Analyze properties of regular languages

7 Demonstrate Limitations of regular languages

Lect

No.


method

POs

attained

PSO’s

attained

Cos

attained

Text

Book/

Chapter

No. L11 What is a RE? Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/6.1

L12 Kleene’s theorem Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/6.2

L13 Applications of REs Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/6.3

L14 Manipulating and

Simplifying REs

Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/6.4

L15 Regular Grammars:

Definition

Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/7.1

L16 Regular Grammars

and Regular languages

Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/7.2

L17 Regular Languages

(RL) and Nonregular

Languages: How

many RLs

Chalk

and

board

1,2,3,4,5,11

1,2

2 T1/8.1

L18 To show that a

language is regular

Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/8.2

L19 Closure properties of

RLs

Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/8.3,8.4

L20 to show some

languages are not RLs.

Chalk

and

board

1,2,3,4,5,11 1,2

2 T1/9

Textbook 1: Ch 6, 7, 8, 9: 6.1 to 6.4, 7.1, 7.2, 8.1 to 8.4


attained

Q1. If L1 & L2 are regular languages then prove that family of regular

languages are closed under L1 – L2. 2

Q2. State & prove pumping Lemma for regular languages apply pumping

lemma for following languages & prove that it is not regular. L = {an : n is

prime}

2

Q3Define Regular expression. Write the regular expression for the

following languages.

i) Language of all strings w such that w contains exactly one 1 & an even

2

B.L.D.E.A’s




number of 0’s

ii) Set of strings over {0,1,2} containing atleast one 0 & atleast one 1

Q4 Define Regular expression & write Regular expression for the following

languages

i ) L= {a2nb2m+1: m ≥0, n ≥ 0}

ii) L= {an bm : (m+n) is even}

iii) L = {an bm : n ≥ 4, m ≤ 3}

2

Q5 Write Regular expression for the language

L = {an, bm : (m + n) is even) 2

Q6. Write Regular expression for the language

L = { anbm : m ≥ 1, n ≥ 1, nm ≥ 3} 2

Q7 Write Regular expression for the language of all strings w such that w

contains exactly one 1 & even number of 0’s 2

Q8 Write Regular expression for the language having set of strings over

{0,1,2} containing at least One 0 and at least one 1. 2

MODULE-III

Module-III No of Hours: 10

Title: Context-Free Grammars(CFG)


1 Normal forms of CFG

2 How to obtain CFGs for various types of context free languages 3 Leftmost & rightmost derivations 4 Derivation trees

5 Ambiguous & unambiguous grammars

6 Applications of CFG

7 Various ways of constructing PDA for the given languages

8 Deterministic & nondeterministic PDA

Lect

No.


method

POs

attained

PSO’s

attained

Cos

attained

Text

Book/

Chapter No.

L21 Introduction to

Rewrite Systems and

Grammars

Chalk

and

board

1,2,3,4,5,11 1,2

3 T1/11.1,11.2

L22 CFGs and languages,

designing CFGs

Chalk

and

board

1,2,3,4,5,11 1,2

3 T1/11.3,11.4

L23 simplifying CFGs,

proving that a

Grammar is correct

Chalk

and

board

1,2,3,4,5,11 1,2

3 T1/11.5,11.6

L24 Derivation and Parse

trees, Ambiguity

Chalk

and

board

1,2,3,4,5,11 1,2

3 T1/11.7,11.8

L25 Normal Forms Chalk

and

board

1,2,3,4,5,11 1,2

3 T1/12.1

L26 Pushdown Automata

(PDA): Definition of

non-deterministic

PDA Systems

Chalk

and

board

1,2,3,4,5,11

1,2

4 T1/12.2

B.L.D.E.A’s




L27 Deterministic and

Non-deterministic

PDAs

Chalk

and

board

1,2,3,4,5,11 1,2

4 T1/12.3

L28 Non-determinism and

Halting

Chalk

and

board

1,2,3,4,5,11 1,2

4 T1/12.4

L29 alternative equivalent

definitions of a PDA

Chalk

and

board

1,2,3,4,5,11 1,2

4 T1/12.5

L30 alternatives that are

not equivalent to PDA

Chalk

and

board

1,2,3,4,5,11 1,2

4 T1/12.6

Textbook 1: Ch 11, 12: 11.1 to 11.8, 12.1 to 12.6



attained

Q1. Discuss the languages accepted by a PDA. Design a PDA for the language

that accepts the strings with na(w) < nb(w) where w Є (a+b)* & show the

instantaneous descriptions of the PDA on input abba.

4

Q2. Define PDA & construct a PDA that accepts the following language

L = {w : w Є (a+b)* and na(w) = nb(w). write the ID for the string “aababb”

4

Q3.Explain the following terms

i) Languages of the PDA ii) Instantaneous description

4

Q4. Design the PDA for the language

L = {w | w Є (a+b)*, na(w) > nb(w)

4

Q5. What is Deterministic PDA & non deterministic PDA 4

Q6.Define Context Free Grammar & Write CFG for the following language

L = {ai bj ck : i + j = k, i >= 0, j >= 0}

3

Q7. Define Context Free Grammar & Write CFG for the following language

L= { an bm ck : n + 2m = k, n>=0, m>=0}

3

Q8. Consider the grammar

E → +EE | *EE | -EE | x | y

Find leftmost & rightmost derivation for the string +*- xyxy & write parse

tree

3

Q9. What is ambiguous grammar? Prove that the following grammar is

ambiguous on the string “aab”

S → aS | aSbS | Є

3

Q10. Write grammar for the following language

L = { an b2n : n >=1}

3

Q11. Construct the CFG for the following language

L = { a2n bm | n >=0, m >=0}

3

Q12 Write CFG for the following language

L = {0i 1j 2k : i = j or j = k }

And generate left most derivation for the string 01122

3

MODULE-IV

Module-IV No of Hours: 10

Title: Context-Free and Non-Context-Free Languages


1 Properties of Context Free Languages

B.L.D.E.A’s




2 Working of Turing Machine(TM)

3 Instantaneous Description of TM

4 Languages acceoted by TM

5 Pumping Lemma for CFLs

Lect

No.


method

POs

attained

PSO’s

attained

Cos

attained

Text

Book/

Chapter No.

L31 Where do the

Context-Free

Languages(CFL) fit

Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/13.1

L32 Showing a language

is context-free

Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/13.1

L33 Pumping theorem for

CFL

Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/13.2

L34 Important closure

properties of CFLs,

Deterministic CFLs

Chalk

and

board

1,2,3,4,5,11

1,2

5 T2/13.3

L35 Algorithms and

Decision Procedures

for CFLs: Decidable

questions

Chalk

and

board

1,2,3,4,5,11

1,2

5 T2/13.4

L36 Un-decidable

questions

Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/13.5

L37 Turing Machine:

Turing machine

model,

Representation

Chalk

and

board

1,2,3,4,5,11

1,2

6 T2/9.1,9.2,9.3

L38 Language

acceptability by TM

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/9.4

L39 design of TM Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/9.5

L40 Techniques for TM

construction

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/9.6

Textbook 1: Ch 13: 13.1 to 13.5, Textbook 2: Ch 9.1 to 9.6



attained

1. What is Turing Machine and Multi tape turing machine? Show that the

language accepted by these machines are same.

6

2. Design a TM for the language to accept the set of strings with equal

number of 0’s and 1’s and also give the instantaneous description for the

input 110100

6

3. Explain with neat diagram, the working of a TM model 5

4. Design a TM to accept all set of palindrome over {0,1}*. Also write its

transition diagram and ID on the string “10101”.

6

5 Explain with neat diagram, the working of Nondeterministic TM 5

B.L.D.E.A’s




6.Write short notes on Universal TM. 6

MODULE-V

Module-V No of Hours: 10

Title: Variants of Turing Machines (TM), The model of Linear Bounded automata,

Decidability


1 Decidable problem & undecidability

2 Solvable & unsolvable problems

3 Languages that are recursively enumerable

4 Languages that are not recursively enumerable

Lect

No.


method

POs

attained

PSO’s

attained

Cos

attained

Text

Book/

Chapter No.

L41 Definition of an

algorithm

Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/9.7

L42 decidability Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/9.8

L3 decidable languages, Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/10.1,10.2

L44 Undecidable

languages

Chalk

and

board

1,2,3,4,5,11 1,2

5 T2/10.3,10.4

L45 halting problem of

TM

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/10.5

L46 Post correspondence

problem Systems

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/10.6,10.7

L47 Complexity: Growth

rate of functions

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/12.1

L48 the classes of P and

NP

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/12.2

L49 Quantum

Computation:

quantum computers

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/12.8,12.8.1

L50 Church-Turing

thesis.

Chalk

and

board

1,2,3,4,5,11 1,2

6 T2/12.8.2

Textbook 2: Ch 9.7 to 9.8, 10.1 to 10.7, 12.1, 12.2, 12.8, 12.8.1, 12.8.2


Assignment Questions Cos attained

Q1. Write a note on Recursive languages 5

Q2. Write a note on Chomsky hierarchy 5

Q3. Write a note on halting problem 6

Q4.Write a note on Post’s correspondence problem 6

Q5. Write a note on undecidable problem that is recursively enumerable 5

Q6. Write note on church-turing thesis. 6

B.L.D.E.A’s






attained

1. Design a DFA to accept the following language over the alphabet {0,1} L =

{w | w is a even number}

1

2. Design a DFA for set of all strings that ends with substring ‘abb’ 1

3. State & prove pumping Lemma for regular languages 1

4. Write Regular expression for the language of all strings w such that w

contains exactly one

1 & even number of 0’s

2

5. Write Regular expression for the language

L = {an, bm : (m + n) is even)

2



attained

1. Design the PDA for the language

L = {w | w Є (a+b)*, na(w) > nb(w)

4

2. Write grammar for the following language

L = { an b2n : n >=1}

3

3. Explain with neat diagram, the working of a TM model 6

4. Design a TM for the language to accept the set of strings with equal

number of 0’s and 1’s

6

5. Consider the grammar

E → +EE | *EE | -EE | x | y

Find leftmost & rightmost derivation for the string +*- xyxy & write

parse tree

3



Cos

attained

1. Write a note on Recursive languages 5

2. Write a note on Chomsky hierarchy 5

3. Write a note on halting problem 5

4.Write a note on Post’s correspondence problem 6

5. Write a note on undecidable problem that is recursively enumerable 6

ATAC IA PORTION

I.A. Test Units

IA Test –I Module(I&II) III(5hrs)

IA Test –II Module III(5hrs) (IV &V)

B.L.D.E.A’s




5. ADVANCED JAVA AND J2EE

[As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2016 -2017)

SEMESTER – V

Subject Code 15CS553 IA Marks 20

Number of Lecture Hours/Week 3 Exam Marks 80

Total Number of Lecture Hours 40 Exam Hours 03

CREDITS – 03

Course objectives: This course will enable students to

Identify the need for advanced Java concepts like Enumerations Autoboxing and Annotations

Understand the need for Collections and Framework

Make use of JDBC to access database through Java Programs

Make use of String class and operations on it

Adapt servlets to build server side programs

Adapt Java Server Pages to build server side programs.


Hours

Enumerations, Autoboxing and Annotations(metadata): Enumerations,

Enumeration fundamentals, the values() and valueOf() Methods, java enumerations are

class types, enumerations Inherits Enum, example, type wrappers, Autoboxing,

Autoboxing and Methods, Autoboxing/Unboxing occurs in Expressions,

Autoboxing/Unboxing, Boolean and character values, Autoboxing/Unboxing helps

prevent errors, A word of Warning. Annotations, Annotation basics, specifying

retention policy, Obtaining Annotations at run time by use of reflection, Annotated

element Interface, Using Default values, Marker Annotations, Single Member

annotations, Built-In annotations.

8 Hours

Module – 2

The collections and Framework: Collections Overview, Recent Changes to

Collections, The Collection Interfaces, The Collection Classes, Accessing a collection

Via an Iterator, Storing User Defined Classes in Collections, The Random Access

Interface, Working With Maps, Comparators, The Collection Algorithms, Why Generic

Collections?, The legacy Classes and Interfaces, Parting Thoughts on Collections.

8 Hours

Module – 3

String Handling :The String Constructors, String Length, Special String Operations,

String Literals, String Concatenation, String Concatenation with Other Data Types,

String Conversion and toString( ) Character Extraction, charAt( ), getChars( ),

getBytes( ) toCharArray(), String Comparison, equals( ) and equalsIgnoreCase( ),

regionMatches( ) startsWith( ) and endsWith( ), equals() Versus == , compareTo( )

Searching Strings, Modifying a String, substring( ), concat( ), replace( ), trim( ), Data

Conversion Using valueOf( ), Changing the Case of Characters Within a String,

Additional String Methods, StringBuffer , StringBuffer Constructors, length( ) and

capacity( ), ensureCapacity( ), setLength( ), charAt( ) and setCharAt( ), getChars(

),append( ), insert( ), reverse( ), delete( ) and deleteCharAt( ), replace( ), substring( ),

Additional StringBuffer Methods, StringBuilder

Text Book 1: Ch 15

8 hours

Module – 4

B.L.D.E.A’s




Background; The Life Cycle of a Servlet; Using Tomcat for Servlet Development; A

simple Servlet; The Servlet API; The Javax.servlet Package; Reading Servlet

Parameter; The Javax.servlet.http package; Handling HTTP Requests and Responses;

Using Cookies; Session Tracking. Java Server Pages (JSP): JSP, JSP Tags, Tomcat,

Request String, User Sessions, Cookies, Session Objects

Text Book 1: Ch 31 Text Book 2: Ch 11

8 Hours

Module – 5

The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview of the

JDBC process; Database Connection; Associating the JDBC/ODBC Bridge with the

Database; Statement Objects; ResultSet; Transaction Processing; Metadata, Data types;

Exceptions.

Text Book 2: Ch 06

8 Hours


Interpret the need for advanced Java concepts like enumerations and collections in developing

modular and efficient programs

Build client-server applications and TCP/IP socket programs

Illustrate database access and details for managing information using the JDBC API

Describe how servlets fit into Java-based web application architecture

Develop reusable software components using Java Beans

Question paper pattern:

The question paper will have TEN questions.

There will be TWO questions from each module.

Each question will have questions covering all the topics under a module.

The students will have to answer FIVE full questions, selecting ONE full question from each module.

Text Books:

1. Herbert Schildt: JAVA the Complete Reference, 7th/9th Edition, Tata McGraw Hill,2007.

2. Jim Keogh: J2EE-TheCompleteReference, McGraw Hill, 2007.

Reference Books:

1. Y. Daniel Liang: Introduction to JAVA Programming, 7thEdition, Pearson Education, 2007.

2. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education,2004.

3. Uttam K Roy, Advanced JAVA programming, Oxford University press, 2015.

ADVANCED JAVA AND J2EE

1. Prerequisites:

1. Basic understanding of concepts of programming languages.

2. Basic knowledge of Object Oriented programming.

3. Basic knowledge of Core Java.

2. Course Overview and its relevance to this programme:

This Advanced Java course aimed towards the Students who already have learned the

Fundamentals of Java Programming. In this Advanced Java and J2EE Programming course,

student builds on the beginners Java course, and goes deeper into programming topics that

helps students to understand more advanced Java concepts. Some of the advanced topics that

will cover in this Advanced Java courses includes; Enumerations, Autoboxing and

Annotations(metadata), sequential and associative data structures, The collections and

Framework, Networking, database programming with JDBC, Java Servlets and Java Server

Pages.

Course outcomes

B.L.D.E.A’s





1. Interpret the need for advanced Java concepts like enumerations, autoboxing and

annotations in developing modular and efficient programs.

2. Demonstrate the use of Collections framework in developing modular and efficient

programs.

3. Use String class and its functions in programming.

4. Describe how servlets fit into Java-based web application architecture.

5. Use JSP to write efficient server side programs.

6. Illustrate database access and details for managing information using the JDBC API.

3. Applications:

1. Helps to develop java application programs and packages.

2. Enumeration and Collection class helps to develop modular and efficient java programs.

3. Developing web based applications using servlets and JSP.

4. By using JDBC API accessing and managing the database.

4) Module wise plan

Module -1

Module – 1 No. of Hours: 8

Title: Enumerations, Autoboxing and Annotations(metadata)

Learning Objectives: The main objectives of this Module are to:

1. Understanding Enumeration class and its methods.

2. Explain Autoboxing class and its methods.

3. Annotation class and its applications.

Lesson Plan:

Lectur

e No. Topics Covered

Teachin

g

Method

POs

attaine

d

PSOs

attaine

d

COs

attaine

d

Text

Book/Chapt

er No.

L1. Enumerations,

Enumeration

fundamentals, the

values() and valueOf()

Methods,

Chalk &

Board,PP

T

1, 2, 3,

12

1 1 T1/12

L2. java enumerations are

class types, enumerations

Inherits Enum, example,

type wrappers,

Chalk &

Board,PP

T

1,2 1 T1/12

L3. Autoboxing, Autoboxing

and Methods,

Autoboxing/Unboxing

occurs in Expressions,

Chalk &

Board,PP

t

1,2,3 1 T1/12

L4. Autoboxing/Unboxing,

Boolean and character

values,Autoboxing/Unbo

xing helps prevent errors,

A word of Warning.

Chalk &

Board,PP

T

1,2 1 T1/12

L5. Annotations, Annotation Chalk & 1,2 1 T1/12

B.L.D.E.A’s




basics, specifying

retention policy,

Board

L6 Obtaining Annotations at

run time by use of

reflection,

Chalk &

Board,

PPT

1 1 T1/12

L7 Annotated element

Interface, Using Default

values,

Chalk &

Board,PP

T

1 1 T1/12

L8 Marker Annotations,

Single Member

annotations, Built-In

annotations

Chalk &

Board,PP

T

1 1 T1/12


Questions COs

attained

1. What is Enumeration? Explain with an example. 1

2. Explain value( ) and valueOf( ) methods. 1

3. With an example program explain ordinal(), compareTo(), and

equals(). 1

4. What are TypeWriters? List and explain different TypeWriters in

java. 1

5. Define Autoboxing and Auto-unboxing. Briefly explain with an

example. 1

6. Explain with an example program how autoboxing/unboxing occurs

in expressions. 1

7. What are Annotations? Write a program that uses retention policy and

Reflection. 1

8. Write a program to obtain all annotations associated with a class and

with a method. 1

9. Explain the following with example program.

i) Marker Annotations,

ii) Single-Member Annotations,

iii) The Built-In Annotations

1

10. Explain annotated element interface. 1

MODULE-2

Module: 02 No of Hours: 8 Hours

Title: : Collection Framework


1. Define Collections, its changes, interfaces and classes.

2. Write a program to access collection via an Iterator.

3. Store used defined classes in Collections.

4. Use the maps and Comparators.

5. Understand legacy Classes and Interfaces.

6. Demonstrate different Collection Algorithms.

B.L.D.E.A’s




Lesson Plan:

Lecture

No.

Topics

Covered

Teaching

Method

POs

attained

PSOs

attained

COs

attained

Text

Book/Chapter

No.

L9

Collections

Overview,

Recent Changes

to Collections

Chalk and

Board,PPT

1,2,3,4,5,12

1 2 T1/17

L10

The Collection

Interfaces, The

Collection

Classes

Chalk and

Board &

PPT

1 2 T1/17

L11

Accessing a

collection Via

an Iterator

Chalk and

Board,PPT 1,3 2 T1/17

L12

Storing User

Defined Classes

in Collections

Chalk and

Board,PPT 1 2 T1/17

L13

The Random

Access

Interface,

Working With

Maps

Chalk and

Board &

PPT

1 2 T1/17

L14

Comparators,

The Collection

Algorithms,

Chalk and

Board &

PPT

1,3 2 T1/17

L15

Why Generic

Collections?,

The legacy

Classes and

Interfaces

Chalk and


L16

Parting

Thoughts on

Collections

Chalk and



Questions:

COs

attained

1. What is Collection framework in java? What are the recent changes to

Collections? 2

2. What are different Collection interfaces? Explain any two. 2

3. What are different Collection classes? Explain ArrayList and TreeSet

classes. 2

4. Write a program that demonstrates Iterator and ListIterator interfaces. 2

5. Write a program to store mailing addresses using LinkedList class. 2

6. What is Map? List different interfaces and classes of map. Explain

TreeMap class. 2

B.L.D.E.A’s




7. What is Comparator? Write a program to illustrate comparators. 2

8. Write a program to demonstrate Collection algorithms. 2

9. List various legacy classes and interfaces. Explain any two. 2

10. Write a program to demonstrate Vector operations. 2

MODULE-3

Module : 03 No of Hours: 8

Title: String


1 Understand String class and its Constructors.

2 Use different String functions.

3 Understand StringBuffer class and its functions.

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

attained

PSOs

attained

COs

attained

Reference

Book/Chapter

No.

L17

The String

Constructors,

String Length,

Special String

Operations, String

Literals, String

Concatenation,

String

Concatenation

with Other Data

Types,

Chalk and

Board,PPT

c,e,j,k

1,3 2 T1/15

L18

String Conversion

and toString( )

Character

Extraction,

charAt( ),

getChars( ),

getBytes( )

toCharArray(),

Chalk and


L19

String

Comparison,

equals( ) and

equalsIgnoreCase(

), regionMatches(

) startsWith( ) and

endsWith( ),

equals() Versus ==

Chalk and

Board &

PPT

1,2,3 2 T1/15

B.L.D.E.A’s




,

L20

compareTo( )

Searching Strings,

Modifying a

String, substring(

),

Chalk and

Board &

PPT

1 2 T1/15

L21

concat( ), replace(

), trim( ), Data

Conversion Using

valueOf( ),

Chalk and

Board,

PPT

1 2 T1/15

L22

Changing the Case

of Characters

Within a String,

Additional String

Methods,

Chalk and

Board &

PPT

1 2 T1/15

L23

StringBuffer ,

StringBuffer

Constructors,

length( ) and

capacity( ),

ensureCapacity( ),

setLength( ),

charAt( ) and

setCharAt( ),

Chalk and

Board &

PPT

1,2 2 T1/15

L24

getChars(

),append( ), insert(

), reverse( ),

delete( ) and

deleteCharAt( ),

replace( ),

substring( ),

Additional

StringBuffer

Methods,

StringBuilder

Chalk and

Board &

PPT

1,2 2 T1/15


Questions Cos

attained

1. What is String? Explain different String constructors. 3

2. Explain string concatenation, String conversion, Character extraction

functions.

3

3. Explain different String comparison functions. 3

4. Explain following String functions with an example

substring( ), concat(), replace( ), trim( ).

3

5. How valueOf( ) function is used for data conversion? 3

6. What is StringBuffer class? Define its constructors. 3

B.L.D.E.A’s




7. Explain following StringBuffer( ) constructors.

Length( ), capacity( ), ensureCapacity( ), setLength( ), charAt( ),

setCharAt( ), getChars( ), append( ), insert( ), reverse( ), delete( ),

deleteCahrAt( ), replace( ), SubString( )

3

8. What is StringBuilder class? 3

MODULE-4


1 Define servlet and its life cycle.

2 Understand Tomcat for developing servlets.

3 Enlist different classes, interfaces and methods of Servlet API.

4 Handle HTTP request and responses.

5 Understanding JSP tags.

6 Write programs for Cookies, Session tracking.

Lesson Plan:

Module : 04 No of Hours: 8

Title: Servlets and JSP

Lecture

No. Topics Covered

Teaching

Method

POs

attained

PSOs

attained

COs

attained

Reference

Book/

Chapter

No.

L25

Background; The Life

Cycle of a Servlet;

Using Tomcat for

Servlet Development;

Chalk and

Board, PPT

1,2,3,4,5,12

1,2

4

T1/31

L26

A simple Servlet; The

Servlet API; The

Javax.servlet

Package;

Chalk and

Board, PPT 1,2

4

T1/31

L27

Reading Servlet

Parameter; The

Javax.servlet.http

package;

Chalk and ,

Board &

PPT 1,2

4

T1/31

L28

Handling HTTP

Requests and

Responses;

Chalk

Board, PPT 1,2

4

T1/31

L29 Using Cookies;

Session Tracking. Chalk and

Board, PPT 1,2

4 T1/31

L30 Java Server Pages

(JSP): JSP, JSP Tags, Chalk and

Board, PPT 1,2

5 T2/11

L31 Tomcat, Request

String,

Chalk and Board &

PPT 1,2,3 5 T2/11

L32

User Sessions,

Cookies, Session

Objects

Chalk,

Board,PPT 1,3

5

T2/11

B.L.D.E.A’s





Questions: Cos

attained

9. Explain about the Life Cycle of Servlet. 4

10. Write a simple servlet program to display the hello message? Write the steps

to building & testing a servlet program.

4

11. Explain about the javax.servlet and javax.servlet.http packages. 4

12. What are the advantages of servlets in comparison with CGI? 4

13. Explain about the i) ServletConfig & Servlet interface with its methods.

ii) ServletRequest & ServletResponse interface with its methods.

iii) HttpServletRequest & Cookie class with its methods.

4

14. Write a servlet program to handle the HTTP GET request. 4

15. Write the below two programs to explain about Cookie. 4

ii) AddCookie.html Allow a user to specify a value for the cookie

named MyCookie.

4

iii) AddCookieServlet.java Processes the submission of

AddCookie.html

4

16. Write a servlet program to display the last access time of your servlet

program.

4

17. Write a servlet program to displays the Cookie values. 4

18. What is JSP? Explain the different types of JSP tags? 5

19. Explain the following with respect to JSP. 5

a) Variables and Objects. b) Methods. C) Control Statements d) Loops

20. What is a cookie? List out the methods defined by cookie. Write a program in

HTML for adding a cookie.

5

21. What is Tomcat? List the steps to download and install Tomcat? 5

22. What is Request string? Explain with an example? 5

23. Explain what are session objects? Write HTML code to create and read

session attribute using JSP.

5

MODULE-5

Module: 05 No of Hours: 8

Title: JDBC


1 Understand the concept of JDBC.

2 Study different JDBC driver types and packages.

3 Overview JDBC process.

4 Discuss Connection, Statement and ResultSet objects.

B.L.D.E.A’s




5 Write program for transaction processing.

6 Explain Metadata, data types and Exceptions.

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

*POs

attained

*PSOs

attained

COs

attained

Reference

Book/Chapter

No.

L33 The Concept of

JDBC; JDBC Driver

Types;

Chalk and

Board &

PPT

2,3,5,6,

9,11,12

3 6 T2/6

L34 JDBC Packages; A

Brief Overview of

the JDBC process;

Chalk and

Board & PPT

3 6 T2/6

L35

Database

Connection;

Associating the

JDBC/ODBC

Bridge with the

Database;

Chalk and Board &

PPT 3 6 T2/6

L36 Statement Objects;

Chalk and

Board 1,3 6 T2/6

L37 ResultSet; Chalk and Board,PPT

1,3 6 T2/6

L38 Transaction

Processing; Chalk and

Board, PPT 1,3 6 T2/6

L39 Metadata, Data

types;

Chalk and

Board &

PPT 1,3 6 T2/6

L40 Exceptions. Chalk and

Board &

PPT 1,3 6 T2/6


Questions:

Cos

attained

1. Explain about the JDBC Driver Types and JDBC Packages. 4

2. Give the brief overview of the JDBC Process with example. 4

3. Explain different types of getconnection ( ) methods with examples. 4

4. Explain about the i) ResultSet Holdability ii) RowSets iii) AutoGnerated

Keys iv) Metadata v) ResultSet Metadata. 4

5. What is save point? Explain the below methods with example. 3,4

i) public Savepoint setSavePoint( String name)throws SQLException

ii) public void releaseSavePoint( Savepoint savepoint)throws

SQLException

iii) public void rollback( String name)throws SQLException

B.L.D.E.A’s




iv) public void commit( String name)throws SQLException

6. Explain about the Connection Pool in JDBC with example. 3, 4

7. Explain the Statement, PreparedStatement and CallableStatement object with

examples.

3, 4

8. Explain about the Scrollable Resultset with example. 3,4

9. Explain about the Delete Row and InsertRow in the ResultSet With example. 3,4

10. Explain about addBatch( ), executeBatch( ) and clearBatch( ) with example. 3,4

5) ASSIGNMENT QUESTIONS:

ASSIGNMENT - I

Questions COs

attained

1. What is Enumeration? Explain with an example. 1

2. With an example program explain ordinal(), compareTo(), and equals(). 1

3. Define Autoboxing and Auto-unboxing. Briefly explain with an example. 1

4. What are Annotations? Write a program that uses retention policy and

Reflection. 1

5. Write a program to obtain all annotations associated with a class and

with a method. 1

6. Explain the following with example program.

Marker Annotations, Single-Member Annotations, The Built-In

Annotations

1

7. What are different Collection classes? Explain ArrayList and TreeSet

classes. 2

8. What is Map? List different interfaces and classes of map. Explain

TreeMap class. 2

9. List various legacy classes and interfaces. Explain any two. 2

10. Write a program to demonstrate Vector operations. 2

ASSIGNMENT - II

Questions COs

attained

1. What is String? Explain different String constructors. Explain different

String comparison functions.

3

2. Explain string concatenation, String conversion, Character extraction

functions.

3

3. Explain following String functions with an example

substring( ), concat(), replace( ), trim( ).

3

4. Explain following StringBuffer( ) constructors.

Length( ), capacity( ), ensureCapacity( ), setLength( ), charAt( ),

setCharAt( ), getChars( ), append( ), insert( ), reverse( ), delete( ),

deleteCahrAt( ), replace( ), SubString( )

3

5. Explain about the Life Cycle of Servlet. Write a simple servlet program

to display the hello message? Write the steps to building & testing a

servlet program.

4

B.L.D.E.A’s




6. Explain about the i) ServletConfig & Servlet interface with its methods.

ii) ServletRequest & ServletResponse interface with its methods.

iii) HttpServletRequest & Cookie class with its methods.

4

7. What is JSP? Explain the different types of JSP tags? 5

8. What is a cookie? List out the methods defined by cookie. Write a

program in HTML for adding a cookie.

5

ASSIGNMENT - III

Questions COs

attained

1. Explain about the JDBC Driver Types and JDBC Packages. 4

2. Give the brief overview of the JDBC Process with example. 4

3. Explain different types of getconnection ( ) methods with examples. 4

4. Explain about the i) ResultSet Holdability ii) RowSets iii) AutoGnerated

Keys iv) Metadata v) ResultSet Metadata. 4

5. What is save point? Explain the below methods with example. 3,4

i) public Savepoint setSavePoint( String name)throws SQLException

ii) public void releaseSavePoint( Savepoint savepoint)throws

SQLException

iii) public void rollback( String name)throws SQLException

iv) public void commit( String name)throws SQLException

6. Explain about the Connection Pool in JDBC with example. 3, 4

7. Explain the Statement, PreparedStatement and CallableStatement object

with examples.

3, 4

8. Explain about the different Resultset objects with example. 3,4

6) Portion for I. A. Test:

I.A. TEST MODULES COs

I IA Test Modules 1,2 1,2,3

II IA Test Modules 3,4 2,3,4

III IA Test Module 5 3,5,6

B.L.D.E.A’s




6. CLOUD COMPUTING

Semester: V Year: 2018-19

Subject Title: CLOUD COMPUTING Subject Code:

15CS565

Total Lecture Hours: 40 Duration of Exam : 03

Total Exam Marks: 80 Total IA Marks : 20

Staff Name: SAHEBGOUDA R PATIL Credits-03

Course objectives: This course will enable students to

• Explain the technology and principles involved in building a cloud environment.

• Contrast various programming models used in cloud computing • Choose appropriate cloud model for a given application

Module -1 08 Hour

Introduction ,Cloud Computing at a Glance, The Vision of Cloud Computing, Defining a

Cloud, A Closer Look, Cloud Computing Reference Model, Characteristics and Benefits,

Challenges Ahead, Historical Developments, Distributed Systems, Virtualization, Web 2.0,

Service Oriented Computing, Utility-Oriented Computing, Building Cloud

Computing Environments, Application Development, Infrastructure and System

Development, Computing Platforms and Technologies, Amazon Web Services (AWS),

Google AppEngine, Microsoft Azure, Hadoop, Force.com and Salesforce.com, Manjrasoft

Aneka Virtualization, Introduction, Characteristics of Virtualized, Environments Taxonomy

of Virtualization Techniques, Execution Virtualization, Other Types of Virtualization,

Virtualization and Cloud Computing, Pros and Cons of Virtualization, Technology

Module -1I 08 Hours

Cloud Computing Architecture, Introduction, Cloud Reference Model,

Architecture, Infrastructure / Hardware as a Service, Platform as a Service, Software as a

Service, Types of Clouds, Public Clouds, Private Clouds, Hybrid Clouds, Community

Clouds, Economics of the Cloud, Open Challenges, Cloud Definition, Cloud Interoperability

and Standards Scalability and Fault Tolerance Security, Trust, and Privacy Organizational

Aspects Aneka: Cloud Application Platform, Framework Overview, Anatomy of the Aneka

Container, From the Ground Up: Platform Abstraction Layer, Fabric Services, foundation

Services, Application Services, Building Aneka Clouds, Infrastructure Organization, Logical

Organization, Private Cloud Deployment Mode, Public Cloud Deployment Mode, Hybrid

Cloud Deployment Mode, Cloud Programming and Management, Aneka SDK, Management

Tools

Module -1II 10 Hours

Concurrent Computing: Thread Programming, Introducing Parallelism for Single Machine

Computation, Programming Applications with Threads, What is a Thread?, Thread APIs,

Techniques for Parallel Computation with Threads, Multithreading with Aneka, Introducing

the Thread Programming Model, Aneka Thread vs. Common Threads, Programming

Applications with Aneka Threads, Aneka Threads Application Model, Domain

Decomposition: Matrix Multiplication, Functional Decomposition: Sine, Cosine, and

Tangent. High-Throughput Computing: Task Programming, Task Computing, Characterizing

a Task, Computing Categories, Frameworks for Task Computing, Task-based Application

Models, Embarrassingly Parallel Applications, Parameter Sweep Applications, MPI

Applications, Workflow Applications with

B.L.D.E.A’s




Task Dependencies, Aneka Task-Based Programming, Task Programming Model,

Developing Applications with the Task Model, Developing Parameter Sweep Application,

Managing Workflows.

Module -1V 08 Hours

Data Intensive Computing: Map-Reduce Programming, What is Data-Intensive Computing?,

Characterizing Data-Intensive Computations, Challenges Ahead, Historical Perspective,

Technologies for Data-Intensive Computing, Storage Systems, Programming Platforms,

Aneka MapReduce Programming, Introducing the MapReduce Programming Model,

Example Application

Module -V 08 Hours

Cloud Platforms in Industry, Amazon Web Services, Compute Services, Storage Services,

Communication Services, Additional Services, Google AppEngine, Architecture and Core

Concepts, Application Life-Cycle, Cost Model, Observations, Microsoft Azure, Azure Core

Concepts, SQL Azure, Windows Azure Platform Appliance. Cloud Applications Scientific

Applications, Healthcare: ECG Analysis in the Cloud, , Social Networking, Media

Applications, Multiplayer Online Gaming.

DATA STRUCTURES WITH C COURSE PLAN

Course Outcomes (CO)

CO.1 Recognize the strengths and limitations of cloud computing

CO.2 Identify the architecture, infrastructure and delivery models of cloud

computing

CO.3 Apply and demonstrate suitable virtualization concept.

CO.4 Choose the appropriate cloud resource management and scheduling algorithms

CO.5 Address the core issues of cloud computing such as security, privacy and

interoperability

CO.6 Design Cloud Services & set a private cloud

Question paper pattern: The question paper will have ten questions. There will be 2 questions from each module. Each question will have questions covering all the topics under a module. The students will have to answer 5 full questions, selecting one full question from

each module

Module wise plan

Text Book: T1. Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi Mastering Cloud. Computing

McGraw Hill Education

Reference Books:

NIL

B.L.D.E.A’s




Module -1

Module : 01 No. of Hours: 08

Title: Introduction to Cloud Computing


1 Explain the technology and principles involved in building a cloud environment

2 Contrast various programming models used in cloud computing

3 Choose appropriate cloud model for a given application

Lesson Plan:

Lecture

No.

Topics

Covered

Teaching

Method

Pos

attained

COs

attained

PSOs

attained

Reference

Book/Chapter

No.

L1 Introduction

,Cloud

Computing at

a Glance, The

Vision of

Cloud

Computing,

Defining a

Cloud, A

Closer Look

Chalk and

Board

1,2,3,4,5,9,12

1,2,5,6 2,3 T1

L2 Cloud Computing Reference Model, Characteristics and Benefits, Challenges Ahead, Historical Developments

Chalk and

Board 1,2,5,6 2,3 T1

L3 Distributed

Systems,

Virtualization,

Web

2.0,Service

Oriented

Computing,

Utility-

Oriented

Computing,

BuildingCloud

Computing

Environments Chalk and

Board

1,2,5,6 2,3 T1

L4 Application Chalk and 1,2,5,6 2,3 T1

B.L.D.E.A’s




Development,

Infrastructure

and System

Development,

Computing

Platforms and

Technologies

Board

L5 Amazon Web

Services

(AWS), Google

AppEngine,

Microsoft

Azure, Hadoop,

Force.com and

Salesforce.com

Chalk and

Board 1,2,5,6 2,3 T1

L6 Manjrasoft

Aneka

Virtualization,

Introduction,

Characteristics

of Virtualized,

Environments

Taxonomy of

Virtualization

Techniques

Chalk and

Board 1,2,5,6 2,3 T1

L7 Execution

Virtualization,

Other Types of

Virtualization,

Virtualization

and Cloud

Computing

Chalk and Board

1,2,5,6 2,3 T1

L8 Pros and Cons

of

Virtualization,

Technology

Chalk and

Board 1,2,5,6 2,3 T1

T1: Text book No.1 in VTU Syllabus.


Assignment Questions COs attained

Q1)What is Cloud Computing? Explain the vision of Cloud Computing

with diagram.

1,2

Q2)Explain the Cloud Computing Reference Model with neat diagram. 1,2

Q3)Web is the primary interface through which cloud computing delivers its

services. Justify

1,2

Q4)Explain Application Development, Infrastructure and system 1,2

B.L.D.E.A’s




development helpful in building Cloud Computing environments.

Q5) Draw and represent the Taxonomy of virtualization. Explain in brief 1,2

Q6) With neat diagram explain the Machine Reference Model. Also explain

Security Rings

1,2,5

Q7) Explain with graphical representation, the two types of hypervisors 2

Q8)List the 3 theorems that Popek and Goldberg provided for the classification of

the instruction set and proposed, in order to support virtualization.

1,2

Q9)Explain the pros and cons of Virtualization 1,2

Module -2


Title: Cloud Computing Architecture





Lesson Plan:

Lectu

re

No.

Topics

Covered

Teachi

ng

Metho

d

Pos

attained

COs

attain

ed

PSOs

attain

ed

Reference

Book/Chap

ter No.

L9 Cloud Computing

Architecture,Introduction

,Cloud Reference Model,

Architecture,

Infrastructure /Hardware

as a Service, Platform as

a Service, Software as a

Service

Chalk and

Board

1,2,3,4,5,9,1

0,12

1,3,5,6 2,3 T1

L10 Types of Clouds, Public

Clouds, Private Clouds,

Hybrid Clouds,

Community Clouds,

Economics of the Cloud

Chalk

and Board

1,3,5,6 2,3 T1

L11 Open Challenges, Cloud

Definition, Cloud

Interoperability and

Standards Scalability and

Fault Tolerance Security

Chalk

and

Board

1,3,5,6 2,3 T1

L12 Trust, and Privacy

Organizational Aspects

Aneka: Cloud

Chalk

and

Board

1,3,5,6 2,3 T1

B.L.D.E.A’s




Application Platform,

Framework Overview,

Anatomy of the Aneka

Container

L13 From the Ground Up:

Platform Abstraction

Layer, Fabric Services,

foundation Services,

Application Services

Chalk

and

Board

1,2,5,6 2,3 T1

L14 Building Aneka Clouds,

Infrastructure

Organization, Logical

Organization

Chalk and

Board

1,3,5,6 2,3 T1

L15 Private Cloud

Deployment Mode,

Public Cloud

Deployment Mode,

Hybrid Cloud

Deployment Mode

Chalk and

Board

1,3,5,6 2,3 T1

L16 Cloud Programming and

Management, Aneka

SDK, Management Tools

Chalk

and Board

1,3,5,6 2,3 T1


Assignment Questions: COs

attained

Q1) Explain the Cloud Computing arcitecture, a layered view covering the entire

stack of resources

1,3

Q2) Explain with neat diagram, PaaS reference model. 1,3,5

Q3) List the essential characteristics that identify a PaaS solution. 1,3

Q4) Explain the 4 aspects for which cloud computing allows for the benefit of

Economic of Cloud

1,3

Q5) . Explain the characteristics of Fabric Servies in Aneka 1,3

Q6) Explain the characteristics of Application Services in Aneka 1,3

Q7) Discuss the private deployment of Aneka Clouds 1,3

Q8) What is IaaS? Explian IaaS reference implementation with neat diagram

1,3,5

Module -3


Title: Concurrent Computing




B.L.D.E.A’s





Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

Pos

attained

Cos

attained

PSOs

attained

Reference

Book/

Chapter

No.

L17 Concurrent

Computing:

Thread

Programming,

Introducing

Parallelism for

Single Machine

Computation,

Programming

Applications with

Threads

Chalk and

Board

1,2,3,4,5,10,12

1,3,5,6 2,3 T1

L18 What is a Thread?,

Thread APIs,

Techniques for

Parallel

Computation with

Threads,

Multithreading

with Aneka

Chalk and

Board 1,3,5,6 2,3 T1

L19 Introducing the

Thread

Programming

Model, Aneka

Thread vs.

Common Threads,

Programming

Applications with

Aneka Threads

Chalk and

Board 1,3,5,6 2,3 T1

L20 Aneka Threads

Application

Model, Domain

Decomposition:

Matrix

Multiplication,

Functional

Decomposition:

Sine, Cosine, and

Tangent

Chalk and

Board 1,3,5,6 2,3 T1

L21 High-Throughput

Computing: Task

Chalk and

Board 1,2,5,6 2,3 T1

B.L.D.E.A’s




Programming,

Task Computing,

Characterizing a

Task, Computing

Categories,

Frameworks for

Task Computing

L22 Task-based

Application

Models,

Embarrassingly

Parallel

Applications,

Parameter Sweep

Applications, MPI

Applications

Chalk and

Board 1,3,5,6 2,3 T1

L23 Workflow

Applications with

Task

Dependencies,

Aneka Task-Based

Programming,

Task

Programming

Model

Chalk and

Board 1,3,5,6 2,3 T1

L24 Developing

Applications with

the Task Model,

Developing

Parameter Sweep

Application,

Managing

Workflows.

Chalk and Board

1,3,5,6 2,3 T1



attained Q1) What is multiprocessing? Describe the different techniques for implementing multiprocessing.

1,3

Q2) Briefly describe the architecture & functionality of multicore system Q3) Define Thread. Explain the relationship between process and threads with a neat diagram.

1,3,5

Q4) List and explain the 2 types of Thread APIs provided for thread programming. 1,3 Q5) Briefly explain the Domain Decomposition technique for parallel computation. Also define 2 types of problems idetified under domain decomposition.

1,3

Q6) Explain the characteristics of functional decomposition with an example. 1,3

Q7) List out the difference between Aneka thread versus common thread. Explain 1,3

B.L.D.E.A’s




any two of them in detail

Q8) Explain the Matrix Multiplication under Domain decomposition using Aneka

Threads

1,3

Module -4


Title: Data Intensive Computing





Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method POs attained

Cos

attained

PSOs

attained

Reference

Book/

Chapter

No.

L25 Data Intensive

Computing:

Map-Reduce

Programming

Chalk and

Board

1,2,3,4,5,7,11,12

1,3,5,6 2,3 T1

L26 What is Data-

Intensive

Computing?,

Chalk and

Board 1,3,5,6 2,3

L27 Characterizing

Data-Intensive

Computations,

Challenges

Ahead

Chalk and

Board 1,3,5,6 2,3 T1

L28 Historical

Perspective,

Technologies for

Data-Intensive

Computing

Chalk and

Board 1,3,5,6 2,3 T1

L29 Storage Systems,

Programming

Platforms

Chalk and

Board 1,2,5,6 2,3 T1

L30 Aneka

MapReduce

Programming

Chalk and

Board 1,3,5,6 2,3 T1

L31 Introducing the

MapReduce

Programming

Model

Chalk and Board

1,3,5,6 2,3 T1

L32 Example Chalk and

Board 1,3,5,6 2,3 T1

B.L.D.E.A’s




Application



attained

Q1) What is a data-intensive computing? Describe the characteristics that

define data-intensive computing

1,3

Q2) Explain i) Data Grids ii) Data Clouds & Big Data 1,3,5

Q3) What is Distributed File System? List all the distributed file systems.

Explain any 3 of them

1,3,5

Q4) Explain the design features of Google File System 1,3,5

Q5) Define NoSQL system. Explain Amazon Dynamo with architecture 1,3,5

Q6) What is Map Reduce Programming Model? Explain MapReduce

Computation Workflow with a neat diagram

1,3,5

Q7) Explain Mapper design & implementation and Reducer design &

implementation in Log parsing.

1,3,5

Module -5


Title: Cloud Platforms





Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

Pos

attained

Cos

attained

PSOs

attained

Reference

Book/

Chapter

No.

L33

Cloud Platforms

in Industry,

Amazon Web

Services,

Compute

Services

Chalk and

Board

1,2,3,4,5,7,11,12

1,4,5,6 2,3 T1

L34

Storage

Services,

Communication

Services

Chalk and

Board 1,4,5,6 2,3 T1

L35

Additional

Services, Google

AppEngine

Chalk and

Board 1,4,5,6 2,3 T1

B.L.D.E.A’s




L36

Architecture and

Core Concepts,

Application

Life-Cycle

Chalk and

Board 1,4,5,6 2,3 T1

L37

Cost Model,

Observations,

Microsoft Azure,

Azure Core

Concepts

Chalk and

Board

1,4,5,6 2,3 T1

L38

SQL Azure,

Windows Azure

Platform

Appliance.

Cloud

Applications

Scientific

Applications

Chalk and Board

1,4,5,6 2,3 T1

L39

Healthcare: ECG

Analysis in the

Cloud, , Social

Networking

Chalk and Board

1,4,5,6 2,3 T1

L40

Media

Applications,

Multiplayer

Online Gaming

Chalk and

Board 1,4,5,6 2,3 T1



attained

Q1) What is AWS? What types of services does it provide? Explain with

ecosystem diagram

1,4,5,6

Q2) List and Explain Storage service of AWS 1,4,5,6

Q3) Explain Google App Engine platform architecture 1,4,5,6

Q4) With neat diaram, Explain Microsoft Windows Azure Platform

Architecture

1,4,5,6

Q5) Write a note on healthcare: ECG Analysis in Cloud with a neat diagram 1,4,5,6

Q6) Define CRM and ERP terms. Explain how they are implemented in Cloud

supporting Business & Consumer Applications

1,4,5,6

Q7) Explain the concept of EyeOS with a neat diagram 1,4,5,6

ASSIGNMENT QUESTIONS

ASSIGNMENT - I COs attained

Q1)What is Cloud Computing? Explain the vision of Cloud Computing with

diagram.

1,2

Q2)Explain the Cloud Computing Reference Model with neat diagram. 1,2

Q3)Web is the primary interface through which cloud computing delivers its

services. Justify

1,3

B.L.D.E.A’s




Q4) Explain the Cloud Computing arcitecture, a layered view covering the entire

stack of resources

1,3,5

Q5) Explain with neat diagram, PaaS reference model. 1,3

Q6) List the essential characteristics that identify a PaaS solution. 1,3

ASSIGNMENT - II COs attained Q1) What is multiprocessing? Describe the different techniques for implementing multiprocessing.

1,3

Q2) Briefly describe the architecture & functionality of multicore system

1,3

Q3) Define Thread. Explain the relationship between process and threads with a neat diagram.

1,3

Q4) Explain the design features of Google File System 1,3,5

Q5) Define NoSQL system. Explain Amazon Dynamo with architecture 1,3,5

Q6) What is Map Reduce Programming Model? Explain MapReduce

Computation Workflow with a neat diagram

1,3,5

ASSIGNMENT - III CO’s attained

Q1) What is AWS? What types of services does it provide? Explain with

ecosystem diagram

1,4,5,6

Q2) List and Explain Storage service of AWS 1,4,5,6

Q3) Explain Google App Engine platform architecture 1,4,5,6

Q4) With neat diaram, Explain Microsoft Windows Azure Platform

Architecture

1,4,5,6

Q5) Write a note on healthcare: ECG Analysis in Cloud with a neat

diagram

1,4,5,6

Q6) Define CRM and ERP terms. Explain how they are implemented in

Cloud supporting Business & Consumer Applications 1,4,5,6

PORTION FOR THE I.A. TEST

Test Modules

IA Test –I Module-1, Module-2

IA Test –II Module-3, Module-4

IA Test –III Module-5

COMPUTER NETWORK LABORATORY [As per Choice Based Credit System (CBCS) scheme]


Subject Code 15CSL57 IA Marks 20

Number of Lecture Hours/Week 01I + 02P Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03

CREDITS – 02 Course objectives: This course will enable students to

• Demonstrate operation of network and its management commands • Simulate and demonstrate the performance of GSM and CDMA • Implement data link layer and transport layer protocols.

Description (If any): For the experiments below modify the topology and parameters set for the experiment and take multiple rounds of reading and analyze the results available in log files. Plot necessary graphs and conclude. Use NS2/NS3. Lab Experiments: PART A

1. Implement three nodes point – to – point network with duplex links between them. Set the queue size, vary the bandwidth and find the number of packets dropped.

2. Implement transmission of ping messages/trace route over a network topology consisting of 6 nodes and find the number of packets dropped due to congestion.

3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion window for different source / destination.

4. Implement simple ESS and with transmitting nodes in wire-less LAN by simulation and determine the performance with respect to transmission of packets.

5. Implement and study the performance of GSM on NS2/NS3 (Using MAC layer) or equivalent environment.

6. Implement and study the performance of CDMA on NS2/NS3 (Using stack called Call net) or equivalent environment.

PART B

Implement the following in Java: 7. Write a program for error detecting code using CRC-CCITT (16- bits). 8. Write a program to find the shortest path between vertices using bellman-ford

algorithm.

9. Using TCP/IP sockets, write a client – server program to make the client send the file name and to make the server send back the contents of the requested file if present.

10. Write a program on datagram socket for client/server to display the messages on client side, typed at the server side.

11. Write a program for simple RSA algorithm to encrypt and decrypt the data. 12. Write a program for congestion control using leaky bucket algorithm.

Study Experiment / Project: NIL Course outcomes: The students should be able to:

• Analyze and Compare various networking protocols. • Demonstrate the working of different concepts of networking.

• Implement, analyze and evaluate networking protocols in NS2 / NS3 Conduction of Practical Examination: 1. All laboratory experiments are to be included for practical examination. 2. Students are allowed to pick one experiment from part A and part B with lot. 3. Strictly follow the instructions as printed on the cover page of answer script 4. Marks distribution: Procedure + Conduction + Viva: 80

Part A: 10+25+5 =40 Part B: 10+25+5 =40

5. Change of experiment is allowed only once and marks allotted to the procedure part to be made zero.

DBMS LABORATORY WITH MINI PROJECT [As per Choice Based Credit System (CBCS) scheme]


Subject Code 15CSL58 IA Marks 20

Number of Lecture Hours/Week 01I + 02P Exam Marks 80 Total Number of Lecture Hours 40 Exam Hours 03

CREDITS – 02 Course objectives: This course will enable students to

• Foundation knowledge in database concepts, technology and practice to groom students into well-informed database application developers.

• Strong practice in SQL programming through a variety of database problems. • Develop database applications using front-end tools and back-end DBMS.

Description (If any): PART-A: SQL Programming (Max. Exam Mks. 50)

• Design, develop, and implement the specified queries for the following problems using Oracle, MySQL, MS SQL Server, or any other DBMS under LINUX/Windows environment.

• Create Schema and insert at least 5 records for each table. Add appropriate database constraints.

PART-B: Mini Project (Max. Exam Mks. 30) • Use Java, C#, PHP, Python, or any other similar front-end tool. All

applications must be demonstrated on desktop/laptop as a stand-alone or web based application (Mobile apps on Android/IOS are not permitted.)

Lab Experiments: Part A: SQL Programming 1 Consider the following schema for a Library Database:

BOOK(Book_id, Title, Publisher_Name, Pub_Year) BOOK_AUTHORS(Book_id, Author_Name) PUBLISHER(Name, Address, Phone) BOOK_COPIES(Book_id, Branch_id, No-of_Copies) BOOK_LENDING(Book_id, Branch_id, Card_No, Date_Out, Due_Date) LIBRARY_BRANCH(Branch_id, Branch_Name, Address) Write SQL queries to

1. Retrieve details of all books in the library – id, title, name of publisher, authors, number of copies in each branch, etc.

2. Get the particulars of borrowers who have borrowed more than 3 books, but from Jan 2017 to Jun 2017.

3. Delete a book in BOOK table. Update the contents of other tables to reflect this data manipulation operation.

4. Partition the BOOK table based on year of publication. Demonstrate its working with a simple query.

5. Create a view of all books and its number of copies that are currently available in the Library.

2 Consider the following schema for Order Database: SALESMAN(Salesman_id, Name, City, Commission) CUSTOMER(Customer_id, Cust_Name, City, Grade, Salesman_id) ORDERS(Ord_No, Purchase_Amt, Ord_Date, Customer_id, Salesman_id) Write SQL queries to

1. Count the customers with grades above Bangalore’s average.

2. Find the name and numbers of all salesman who had more than one customer. 3. List all the salesman and indicate those who have and don’t have customers in

their cities (Use UNION operation.) 4. Create a view that finds the salesman who has the customer with the highest

order of a day. 5. Demonstrate the DELETE operation by removing salesman with id 1000. All

his orders must also be deleted. 3 Consider the schema for Movie Database:

ACTOR(Act_id, Act_Name, Act_Gender) DIRECTOR(Dir_id, Dir_Name, Dir_Phone) MOVIES(Mov_id, Mov_Title, Mov_Year, Mov_Lang, Dir_id) MOVIE_CAST(Act_id, Mov_id, Role) RATING(Mov_id, Rev_Stars) Write SQL queries to

1. List the titles of all movies directed by ‘Hitchcock’. 2. Find the movie names where one or more actors acted in two or more movies. 3. List all actors who acted in a movie before 2000 and also in a movie after

2015 (use JOIN operation). 4. Find the title of movies and number of stars for each movie that has at least

one rating and find the highest number of stars that movie received. Sort the result by movie title.

5. Update rating of all movies directed by ‘Steven Spielberg’ to 5. 4 Consider the schema for College Database:

STUDENT(USN, SName, Address, Phone, Gender) SEMSEC(SSID, Sem, Sec) CLASS(USN, SSID) SUBJECT(Subcode, Title, Sem, Credits) IAMARKS(USN, Subcode, SSID, Test1, Test2, Test3, FinalIA) Write SQL queries to

1. List all the student details studying in fourth semester ‘C’ section. 2. Compute the total number of male and female students in each semester and in

each section. 3. Create a view of Test1 marks of student USN ‘1BI15CS101’ in all subjects. 4. Calculate the FinalIA (average of best two test marks) and update the

corresponding table for all students. 5. Categorize students based on the following criterion:

If FinalIA = 17 to 20 then CAT = ‘Outstanding’ If FinalIA = 12 to 16 then CAT = ‘Average’ If FinalIA< 12 then CAT = ‘Weak’ Give these details only for 8th semester A, B, and C section students.

5 Consider the schema for Company Database: EMPLOYEE(SSN, Name, Address, Sex, Salary, SuperSSN, DNo) DEPARTMENT(DNo, DName, MgrSSN, MgrStartDate) DLOCATION(DNo,DLoc) PROJECT(PNo, PName, PLocation, DNo) WORKS_ON(SSN, PNo, Hours) Write SQL queries to

1. Make a list of all project numbers for projects that involve an employee whose last name is ‘Scott’, either as a worker or as a manager of the department that controls the project.

2. Show the resulting salaries if every employee working on the ‘IoT’ project is given a 10 percent raise.

3. Find the sum of the salaries of all employees of the ‘Accounts’ department, as well as the maximum salary, the minimum salary, and the average salary in this department

4. Retrieve the name of each employee who works on all the projects controlledby department number 5 (use NOT EXISTS operator).

5. For each department that has more than five employees, retrieve the department number and the number of its employees who are making more than Rs. 6,00,000.

Part B: Mini project • For any problem selected, write the ER Diagram, apply ER-mapping rules,

normalize the relations, and follow the application development process. • Make sure that the application should have five or more tables, at least one

trigger and one stored procedure, using suitable frontend tool. • Indicative areas include; health care, education, industry, transport, supply chain,

etc. Course outcomes: The students should be able to:

• Create, Update and query on the database. • Demonstrate the working of different concepts of DBMS • Implement, analyze and evaluate the project developed for an application.

Conduction of Practical Examination: 1. All laboratory experiments from part A are to be included for practical

examination. 2. Mini project has to be evaluated for 30 Marks. 3. Report should be prepared in a standard format prescribed for project work. 4. Students are allowed to pick one experiment from the lot. 5. Strictly follow the instructions as printed on the cover page of answer script. 6. Marks distribution:

a) Part A: Procedure + Conduction + Viva:10 + 35 +5 =50 Marks b) Part B: Demonstration + Report + Viva voce = 15+10+05 = 30 Marks

7. Change of experiment is allowed only once and marks allotted to the procedure part to be made zero.

Documents

COURSE FILE - B.L.D.E.A's V.P. Dr. P.G. Halakatti …bldeacet.ac.in/wp-content/uploads/2019/06/5thsemfinal.pdf2019/06/05 · B.L.D.E.A’s Vachana Pitamaha Dr. P.G. Halakatti College