B.E. Computer Science and Engineering DEPARTMENT VISIONbldeacet.ac.in/PDF/CourseFile/CS/CSE_5th_Sem_CourseFile_2017_18.pdf · engineering community and with society at large, such

B.L.D.E.A’s Dr. P. G. Halakatti College of Engineering and Technology, Vijayapur-586103

B.E. Computer Science and Engineering

Department of Computer Science & Engineering (2017-18) Page 1

DEPARTMENT VISION

To provide valuable human resources to the society through Quality Technical Education and

Research with moral values

DEPARTMENT MISSION

To educate the students in Computer Science and Engineering by imparting Quality Technical

Education and Research to meet the needs of profession and society with ethical values.

Programme Educational Objectives (PEOs)

I. A Graduate will be a successful IT professional and function effectively in

multidisciplinary domains.

II. A Graduate will have the perspective of lifelong learning for continuous improvement of

knowledge in Computer Science & Engineering, higher studies, and research.

III. A Graduate will be able to respond to local, national and global issues by imparting

his/her knowledge of Computer Science & Engineering in Educational, Government,

Financial and Private sectors.

IV. A Graduate will be able to function effectively as an individual, as a team member and as

a team leader with highest professional and ethical standards.




Programme Outcomes(POs)

A graduate of the Computer Science and Engineering Program will demonstrate:

PO1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems. PO2: Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences PO3: Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations. PO4: Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions. PO5: 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 PO6: 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. PO7: 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. PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice. PO9: Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings. PO10: Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions. PO11: Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. PO12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change.

Programme Specific Outcomes (PSOs)

Graduates will be able to

1. Computational skills: Apply the knowledge of Mathematics and Computational Science to solve societal problems in various domains.

2. Programming Skills: Design, Analyze and Implement various algorithms using broad range of programming languages.

3. Product Development Skills: Utilize Hardware and Software tools to develop solutions to IT problems.







Table of Contents

V Semester

Sl.

No.

Subject

Code Subject Page No.

1 15CS51 Management and Entrepreneurship 4

2 15CS52 Computer Networks 14

3 15CS53 Database Management System 24

4 15CS54 Automata Theory and Computability 47

5 15CS553 Advanced Java and J2EE 70

6 15CS553 .NET Framework for Application Development

82

7 15CSL57 Computer Network Laboratory 90

8 15CSL58 DBMS Laboratory with Mini Project 92




MANAGEMENT, ENTREPRENEURSHIP AND CYBER LAW

Semester: V Year: 2017-2018

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. 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, the nature and characteristics of management and different management approaches; analyze the functional area of management CO2: Define the term entrepreneur and entrepreneurship; analyze the evolution of Entrepreneurship and role of entrepreneur in economic development of India. CO3: Explain different management processes such as planning, staffing, directing, controlling and also importance of ERP. CO4: Evaluate the importance of small scale industries in economic development and also the intuitional support provided by Government of India in order to support the development of small scale industries. CO5: Write project reports on his/her business proposals CO6: Explain importance of IPR and cyber law to protect infringement of secret documents




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. 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 12. Staffing- meaning, process of recruitment and selection

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


1 T4/2, R1

L4. Brief overview of Evolution of management


1,2 T4/2, R1

L5. Planning- Nature, Importance


3 T4/2, R1

L6. Types of plans PPT, Chalk and Board

3 T4/2, R1

L7. Steps in planning


3 T4/2, R1

L8. Organizing- nature and purpose


3 T4/4,R1

L9. Types of organization


3 T4/4, R1

L10. Staffing- PPT, 3 T4/4, R1




meaning, process of recruitment and selection

Chalk and Board

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 3 4. Explain steps in planning. 3 5. Explain different types of organization. 3 6. Explain the selection process. 3

MODULE-2

Module Number: 2 No. of Hours: 10

Learning Objectives: The main objectives of this module are to 1. Meaning and nature of directing 2. Motivation theories 3. Steps and methods of establishing control 4. 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.

L1

Directing and controlling- meaning and nature of directing,


7, 8, 9, 10, 11, 12

3

3

T4/5,R1

L2

leadership styles, motivation theories.


3

T4/5, R1

L3 motivation theories


3

T4/5, R1

L4 methods of establishing control,


3

T4/6, R1

L5 methods of establishing control,


3

T4/6, R1

L6 Coordination- meaning and importance


3

T4/6, R1




L7 Coordination- meaning and importance


3

T4/6, R1

L8 Steps in Controlling


3

T4/4,R1

L9 Methods of establishing control


3

T4/6, R1

L10 Methods of establishing control


3 T4/6, R1


Questions COs

Attained

1. Explain different approaches of leadership styles. 3 2. Explain Maslows theory of motivation. 3 3. Explain different types of communication according to direction of communication.

3

4. Explain different techniques of co-ordination. 3

5. Explain methods of establishing control 3

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.

L11. Introduction to entrepreneurship

PPT, Chalk and

7, 8, 9, 10 ,11, 12

3 2 T4/12,R2




& how it was evolution

Board

L12.

Functions of entrepreneur, Types of entrepreneur

PPT, Chalk and

Board 2 T4/12,R2

L13. stages of

entrepreneurial process

T4/12,R2

L14. Meaning of Intrapreneur

PPT, Chalk and

Board 2 T4/12,R2

L15.

Role played by entrepreneurs in economic development

PPT, Chalk and

Board

2

T4/12,R2

L16. Entrepreneurship in INDIA before independence

PPT, Chalk and

Board

2 T4/12,R2

L17. Barriers to

entrepreneurship.

PPT, Chalk and

Board

2 T4/12,R2

L18. Identification of

business opportunities-

PPT, Chalk and

Board

2 T4/15

L19. Market feasibility study, technical feasibility study

PPT, Chalk and

Board

2 T4/15

L20.

Financial feasibility study

and social feasibility study

PPT, Chalk and

Board 2 T4/15


Questions COs Attained

1. Define entrepreneurship & explain functions of entrepreneur

2

2. Differentiate between entrepreneur & Intrapreneur

2

3. Explain role played by entrepreneur in economic development of our country

2

4. Explain evolution of entrepreneurship in INDIA before independence & after independence

2

5. Explain the barriers of entrepreneurs. 2 6. Define feasibility. Explain market, Technical,

Financial &social feasibility studies. 2




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.

L21. Meaning of project, project identification,


7, 8, 9, 10 , 11, 12

3

5 T4/15

L22. Project selection, project report


5 T4/15

L23.

Need and significance of report, and contents of project report


5 T4/15

L24. Project formulation


5 T4/15

L25.

Guidelines by planning commission for project report


5 T4/15

L26. Meaning and Importance- ERP


3 T4/15

L27. Functional areas of Management


1 T4/15

L28. Marketing / Sales- Supply Chain Management


3 T4/15

L29. Finance and Accounting – Human Resources


3 T4/15

L30. Types of reports and methods of

PPT, Chalk and

3 T2/2




report. Board


Questions COs

Attained

1. Define project & explain how to select a project. 3 2. Briefly outline the contents of a project report. 3 3. Explain the guidelines given by planning commission of

INDIA for project report. 3

4. Explain the errors of project report. 3 5. What is project appraisal ? what are the steps to check it? 3

MODULE-5


Learning Objectives: The main objectives of this module are to

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 Explain IPR.

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

Attai

ned

PSOs

Attained

Cos

Attained

Text or

Reference

Book/Chapter

No.

L31. Meaning and characteristics of SSI


7, 8, 9, 10 ,11, 12

3

4 T4/13,R2

L32.

case study(Microsoft), Shahnaz Husain(Ayurveda Entrepreneur),,


4 T4/13,R2

L33. Government policy towards SSI


4 T4/13,R2

L34.

Case study(Captain G R Gopinath), case study (N R Narayana Murthy & Infosys)


4 T4/13,R2

L35.

Institutional support: case study:

Amar Gopal Bose and Bose corporation


4 T4/13,R2

L36. supporting agencies PPT, Chalk 4 T4/13,R2




of Govt for SSI, and Board

L37. Different schemes under SSI


4 T4/13,R2

L38. Types of Help


4 T4/13,R2

L39. Case study Dr Devi Prasad Shetty


6 T4/13,R2

L40. Introduction to IPR.


6 T4/13,R2





Questions COs

Attained

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

2. Government policy towards SSI. 4

3. Explain the Case study of N R Narayana Murthy & Infosys. 4

4. Explain the supporting agencies of Govt for SSI. 4

5. Explain the Different schemes for SSI 4

Assignment Questions:

Assignment 1:

Questions COs

Attained

1. Explain the functional areas of management 1 2. Briefly explain the evolution of management 1 3. Explain different types of organization . 3

4. Explain different approaches of leadership styles. 1 5. Explain Maslows theory of motivation. 3

Assignment 2:

Questions COs

Attained

1. Define entrepreneurship & explain functions of entrepreneur. 2

2. Explain role played by entrepreneur in economic development of our country

2

3. Explain evolution of entrepreneurship in INDIA before independence & after independence

2

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

3

5. Explain the errors of project report. 5

Assignment 3:

Questions COs

Attained

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

2. Government policy towards SSI. 4

3. Explain the Case study of N R Narayana Murthy & Infosys. 4

4. Explain the supporting agencies of Govt for SSI. 4

5. Explain the Different schemes for SSI 4

MANAGEMENT, ENTREPRENEURSHIP AND CYBER LAW

IA PORTION

I. A. Test No. Modules

I 1,2 II 3 III 4,5




2. COMPUTER NETWORKS SYLLABUS

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

(Effective from the academic year 2017-2018)

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. S. L. Kattimani & D. M. Ijeri

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

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 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:

3.5.2.1 Explain principles of application layer protocols and demonstrate knowledge in using Socket Interface to design and implement network protocols. 3.5.2.2 Recognize transport layer services and interpret UDP and TCP protocols 3.5.2.3 Classify routers, IP and Routing Algorithms in network layer 3.5.2.4 Understand the Wireless and Mobile Networks covering IEEE 802.11 Standard and Identify different Nodes and the interfaces of the 3G and beyond 3G network architecture. 3.5.2.5 Describe the system design principles of multimedia communications systems. 3.5.2.6 Discuss the need for the synchronization of multimedia streams and describe several related approaches to measure QOS

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

MODULE WISE PLAN

Module I


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:

Lectur

e NO Topics Covered

Teaching

method

Pos

attained

PSO’s

attained

Cos

attained

Reference

Book/Chapt

er No

L1. Principles of Network Applications: Network Application Architectures

Chalk & Board, PPT

1, 3, 7, 8, 9,

10, 11

1 T1: Chap 2 pp (83-184)

L2. Processes Communicating, Transport Services Available to Applications

Chalk & Board, PPT

1 T1: Chap 2 pp (83-184)

L3. Transport Services Provided by the Internet, Application-Layer Protocols

Chalk & Board, PPT

1 T1: Chap 2 pp (83-184)

L4. The Web and HTTP: Overview of HTTP, Non-persistent and Persistent Connections

Chalk & Board, PPT

2, 3

1 T1: Chap 2 pp (83-184)

L5. HTTP Message Format, User-Server Interaction: Cookies, Web Caching

Chalk & Board, PPT

1

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 T1: Chap 2 pp (83-184)

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 T1: Chap 2 pp (83-184)

L8 Peer-to-Peer Applications: P2P File Distribution, Distributed Hash Tables

Chalk & Board, PPT

1

T1: Chap 2 pp (83-184)

L9 Socket Programming: creating Network Applications: Socket Programming with UDP

Chalk & Board, PPT

1 T1: Chap 2 pp (83-184)

L10 Socket Programming with TCP & Revision

Chalk & Board, PPT

1 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




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

Lect

ure

NO

Topics Covered Teaching

method

Pos

attai

ned

PSO’s

attained

Cos

attained

Reference

Book/Chapt

er No

L11. Transport Layer Introduction and Transport-Layer Services

Chalk & Board, PPT

1, 2, 3, 7, 8, 9,

10, 11

1,2 T1: Chap 3

pp (185-300)

L12. Relationship Between Transport and Network Layers, Overview of the Transport Layer in the Internet

Chalk & Board, PPT

1,2 T1: Chap 3

pp (185-300)

L13. Multiplexing and De-multiplexing: Connectionless Transport: UDP,UDP Segment Structure

Chalk & Board, PPT

1, 2, 3

1,2 T1: Chap 3

pp (185-300)

L14. UDP Checksum, Principles of Reliable Data Transfer Building a Reliable Data Transfer Protocol

Chalk & Board, PPT

1,2 T1: Chap 3

pp (185-300)

L15. Pipelined Reliable Data Transfer Protocols, Go-Back-N, Selective repeat, Connection-Oriented Transport TCP: The TCP Connection

Chalk & Board, PPT

1,2 T1: Chap 3

pp (185-300)

L16 TCP Segment Structure, Round-Trip Time Estimation and Timeout Reliable Data Transfer

Chalk & Board, PPT

1,2 T1: Chap 3

pp (185-300)

L17 Flow Control, TCP Connection Management Chalk & Board, PPT

1,2 T1: Chap 3

pp (185-300)

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

Chalk & Board, PPT

1,2

T1: Chap 3 pp (185-300)

L19 Network-assisted congestion-control example Chalk & Board, PPT

1,2

T1: Chap 3 pp (185-300)

L20 ATM ABR Congestion control, TCP Congestion Control: Fairness. Revision

Chalk & Board, PPT

1,2

T1: Chap 3 pp (185-300)


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





Module Name : The Network layer 10 Hrs

Learning Objectives: The main objectives of this unit are to : 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

Lectur

e NO


method

Pos

attained

PSO’s

attained

Cos

attained

Reference

Book/Chapt

er No

L21 What’s Inside a Router?: Input Processing, Switching, Output Processing

Chalk & Board, PPT

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

1,2,3

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L22 Where Does Queuing Occur? Routing control plane

Chalk & Board, PPT

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L23 IPv6,A Brief foray into IP Security

Chalk & Board, PPT

1,2,3 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

1,2,3 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

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L26 Intra-AS Routing in the Internet: OSPF

Chalk & Board, PPT

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L27 Inter/AS Routing: Border Gateway Protocol

Chalk & Board, PPT

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L28 Broadcast and Multicast Routing Chalk & Board, PPT

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L29 Broadcast Routing Algorithms and Multicast Algorithms

Chalk & Board, PPT

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)

L30 Problems and Revision Chalk & Board, PPT

1,2,3 T1: Chap 4:4.3-4.7 Pp(320-412)





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

Learning Objectives: The main objectives of this unit are to : 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 Topics Covered

Teaching

method

Pos

attaine

d

PSO’s

attain

ed

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)

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)


Module Name : Mobile and Multimedia Networks 10 Hrs




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

Learning Objectives: The main objectives of this unit are to : 1 Over view of multimedia application as either streaming stored audio/video,

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

2 Illustrating Principles behind video streaming, including client buffering, prefetching

3 Investigate mechanisms within the network that can be used to distinguish one class of traffic 4 Examine video streaming in some details

Lectur

e NO


method

Pos

attai

ned

PSO’s

attaine

d

Cos

attaine

d

Reference

Book/Chapter No

L41 Multimedia Networking Applications: Properties of video

Chalk & Board, PPT

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

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L42 properties of Audio, Types of multimedia Network Applications

Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L43 Streaming stored video: UDP Streaming, HTTP Streaming

Chalk & Board, PPT

1,2,3 5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L44 Adaptive streaming and DASH, content distribution Networks

Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L45 Netflix, You Tube and Kankan. Network Support for Multimedia

Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L46 Dimensioning Best-Effort Networks,

Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L47 Providing Multiple Classes of Service, Diff serv

Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)




L48 Per-Connection Quality-of- Service (QoS) Guarantees

Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L49 Resource Reservation and Call Admission

Chalk & Board, PPT

6,5 T1: Chap: 7:7.1,7.2,7.5 Pp(588-655)

L50 Problems and Review Chalk & Board, PPT

5,6 T1: Chap: 7:7.1,7.2,7.5 Pp(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?

Assignment III

Q 1. What are the properties of Video.

Q 2. Explain CDN

Q 3. Define a multimedia network application

Q 4. What are the Categories of streaming video applications

Q 5. Mention all the quality paprameters




3.DATABASE MANAGEMENT SYSTEMS


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. Prakash H Unki

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 to 4.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 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.

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 Module Title: Introduction ,Overview of Database Languages and Architectures, Modeling

using Entities and Relationships

Objectives: The main objectives of this module are to 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/Chapt

er 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.


1 T1/1

L3. History of database applications


1 T1/1

L4.

Data Models, Schemas, and Instances. Chalk and

Board, PPT 1,2 T1/2

L5. Three schema architecture and data independence.


1,2 T1/2

L6 Database languages, and interfaces


1,2 T1/2

L7. The Database System environment


1,2 T1/2

L8. Entity types, Entity sets, attributes, roles, and structural constraints


1,2 T1/3

L9. Weak entity types. Chalk and

Board, PPT 1,2 T1/3

L10. ER diagrams, Examples


1,2 T1/3

L11. Specialization and Generalization.


1,2 T1/3

Assignment Questions for practice:

Assignment Questions CO’s

Attained

1. Define the following terms 1




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. 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 8. Define the following the terms with example.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 12. Discuss the conventions for displaying an ER schema as an ER diagram. 1, 2

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


POs 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;


L15.

Unary Relational Operations: SELECT and PROJECT;


L16.

Additional relational operations (aggregate, grouping, etc.)


L17. Examples of Queries in relational algebra


L18. Relational Database Design using ER-to-Relational mapping


L19. SQL data definition and data types


3 T1/6

L20. Specifying constraints in SQL, retrieval queries in SQL


L21. INSERT, DELETE, and UPDATE statements in SQL


L22. Additional features of SQL


3 T1/8


Assignment Questions

CO’s

attain

ed

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

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

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 3




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




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


PO’s attain

ed

PSO’s Attained

CO’s 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


4 T2/6

L29 The three-Tier application architecture


4 T2/7

L30 The presentation layer, The Middle Tier


4 T2/7



CO’s

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

Objectives: The main objectives of this unit are to: 1. Design database based on normalization

2. Implement normalization algorithms

Lesson Plan:

Lecture No

Topic covered Teachin

g Method

PO’s attain

ed

PSO’s attaine

d

CO’s attained


er No.

L31.

Introduction to Normalization using Functional and Multivalued Dependencies

Chalk and

Board, PPT

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

1, 2, 3

5 T1/14

L32.

Informal design guidelines for relation schema, Functional Dependencies

Chalk and

Board, PPT

5 T1/14

L33.

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

Chalk and

Board, PPT

5 T1/14

L34. Boyce-Codd Normal Form, Multivalued Dependency and Fourth Normal Form

Chalk and

Board, PPT

5 T1/15

L35. Join Dependencies and Fifth Normal Form.

Chalk and

Board, PPT

5 T1/15

L36

Inference Rules, Equivalence, and Minimal Cover, Properties of Relational Decompositions

Chalk and

Board, PPT

5 T1/15

L37 Algorithms for Relational Database Schema Design

Chalk and

5 T1/15




Lecture No

Topic covered Teachin

g Method

PO’s attain

ed

PSO’s attaine

d

CO’s attained


er No. Board, PPT

L38

Nulls, Dangling tuples, and alternate Relational Designs

Chalk and

Board, PPT

5 T1/15

L39

Further discussion of Multivalued dependencies and 4NF

Chalk and

Board, PPT

1, 2, 3

5 T1/15

L40

Other dependencies and Normal Forms

Chalk and

Board, PPT

1,6 T1/15



CO’s

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 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

10. Define multi valued dependencies(MVDs 5 11. Define 4NF. 5 12. Explain the 5th Normal form with an example. 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

Objectives: The main objectives of this unit are to:

1. Analyze the transaction processing

2 Design protocols for concurrency control

3. Identify and analyze database recovery protocols

Lesson Plan:

Lecture No


PO’s attained

PSO’s

attained

CO’s attained

Reference Book/Chapter No.

L41. Introduction to Transaction Processing, Transaction and System concepts


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

1, 2, 3

6 T1/20

L42.

Desirable properties of Transactions, Characterizing schedules based on recoverability


6 T1/20

L43. Characterizing schedules based on Serializability


6 T1/20

L44. Transaction support in SQL Chalk and

Board, PPT

6 T1/20

L45.

Two-phase locking techniques for Concurrency control, Concurrency control based on Timestamp ordering


6 T1/21

L46. Other Dependencies and Normal Forms


6 T1/21

L47 Multiversion Concurrency control techniques


6 T1/21

L48

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


6 T1/21

L49 Recovery Concepts, NO-UNDO/REDO recovery based on Deferred


6 T1/22




update

L50

Recovery techniques based on immediate update, Shadow paging, Database backup and recovery from catastrophic failures


6

T1/22


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


CO’s

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.

2



CO’s

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. Write a note on aggregate functions in SQL with examples. 3 5. Explain insert, delete and update statements in SQL with example 3






CO’s

attained

1. Define the functional dependency (FD). Explain the rule of FD 5 2. Define normalization Explain the 1NF,2NF and 3NF. 5 3. Explain the JDBC. 4 4. Explain Database backup and recovery from catastrophic failures? 6 5. What is a transaction? What properties transactions have? 6

IA TEST PORTION

IA test IA test portion COs attained

I IA Test Module 1,Module 2 (2 chapters) 1,2,3

II IA Test Module 2 (2 chapters), Module 3, Module 4 (1 chapter) 2,3,4,5 III IA Test Module 4(1 chapter), Module 5 5,6


































AUTOMATA THEORY AND COMPUTABILITY

1. Syllabus:


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

Total Contact Hours: 50 Duration of Exam : 03 Total Exam Marks: 80 Total IA Marks : 20 Staff : Prof. Sujata S. Desai and Prof. Shriharsha S. Veni Credits: 04 Module – 1

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. 10 Hours

Module – 2

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. 10 Hours

Module – 3

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

10 Hours

Module – 4

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.

10 Hours




Module – 5

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. 10 Hours

Text Books: T1. Elaine Rich, Automata, Computability and Complexity, 1st Edition, Pearson Education, 2012/2013 T2. K L P Mishra, N Chandrasekaran , 3rd Edition, Theory of Computer Science, McGraw hill, 2012

Reference Books: R1. John E Hopcroft, Rajeev Motwani, Jeffery D Ullman, Introduction to Automata Theory, Languages, and Computation, 3rd Edition, Pearson Education, 2013 R2. Michael Sipser: Introduction to the Theory of Computation, 3rd edition, Cengage learning, 2013 R3. John C Martin, Introduction to Languages and The Theory of Computation, 3rd Edition, Tata McGraw Hill Publishing Company Limited, 2013 R4. Peter Linz, “An Introduction to Formal Languages and Automata”, 3rd Edition, Narosa Publishers, 1998 R5. Basavaraj S. Anami, Karibasappa K G, Formal Languages and Automata theory, Wiley India, 2012

2. Prerequisites:

1. Knowledge of 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. 3. Familiarity with data structures, recursion and compilers.

3. 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 their

applications. To model the hardware of a computer, the notation of an automaton is introduced. An

automaton is a construct, which 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 symbols 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

4. Course Outcomes:

The students will be able to:

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

Computation.

C354.2 Learn how to translate between different models of Computation (e.g., Deterministic and

Non- Deterministic and Software models).

C354.3 Design Grammars and Automata (recognizers) for different language classes.

C354.4 Gain knowledge about restricted models of Computation (Regular, Context Free) and their

relative Powers.

C354.5 Develop skills in formal reasoning and reduction of a problem to a formal model, with an

emphasis on semantic precision and conciseness.

C354.6 Classify a problem with respect to different models of Computation.

5. 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. 4. To strengthen students ability to carry out formal and rigorous mathematical arguments.




6. Module Wise Plan:

MODULE-1

Module-1 No of Hours: 10

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

Learning Objectives: The main objectives of this module are to

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- Є)

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSOs

Attained

COs

Attained

Text Book/

Chapter No.

L1 Strings, Languages

PPT

1 1 C354.1 T1/1

L2 A Language Hierarchy,

Computation 1 1 C354.1 T1/2

L3 Finite State Machines

(FSM): Deterministic FSM

Chalk

and

Board

1 1 C354.1 T1/2

L4 Regular languages 1 3 C354.1 T1/5.1

L5 Designing FSM 3 2 C354.1 T1/5.2

L6

Nondeterministic FSMs,

From FSMs to Operational

Systems

1 2 C354.2 T1/5.3,5.4

L7 Simulators for FSMs 2 2 C354.1 T1/5.5

L8 Minimizing FSMs,

languages 3 2 C354.2 T1/5.6,5.7

L9 Canonical form of Regular

languages 1 1 C354.1 T1/5.8

L10 Finite State Transducers,

Bidirectional Transducers 1 3 C354.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 C354.1 Q2) Define i) DFA ii) NFA iii) NFA- Є C354.1 Q3) Design the DFA for the language L = {w : |w| mod 3 = 0, w Є (a+b)*

C354.2

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”

C354.2

Q5) Design a DFA to accept the following language over the alphabet {0,1} L = {w | w is a even number}

C354.2

Q6) Design a DFA for the language L = {(01)i12j | i ≥ 1, j ≥ 1} C354.2 Q7) Design a DFA for the language having set of all strings that either begins or ends or both with substring ‘ab’ C354.2

Q8) Design a DFA for set of all strings that ends with substring ‘abb’ C354.2 Q9) Design a DFA for the language L = {w : |w| mod 5 ‹ › 0}

C354.2

Q10) Define NFA-Є & design the NFA-Є or NFA for the languages i) abc, abd, & aacd ii) {ab, abc}*

C354.2

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

C354.2

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

C354.2

0

4

5 3 2 1




MODULE-2 Module-II No of Hours: 10

Title: Regular Expressions (RE)

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

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSOs Attained

Cos

Attained

Text Book/

Chapter No.

L11 What is a RE?

PPT

1 1 C354.1 T1/6.1

L12 Kleene’s theorem 1 1 C354.1 T1/6.2

L13 Applications of REs 1 1 C354.1 T1/6.3

L14 Manipulating and Simplifying REs

Chalk and

Board

1 1 C354.1 T1/6.4

L15 Regular Grammars: Definition

1 3 C354.4 T1/7.1

L16 Regular Grammars and Regular languages

1 3 C354.4 T1/7.2

L17 Regular Languages (RL) and Nonregular Languages

1 3 C354.4 T1/8.1

L18 To show that a language is regular

2 2 C354.3 T1/8.2

L19 Closure properties of RLs 1 1 C354.3 T1/8.3,8.4

L20 To show some languages are not RLs.

1 1 C354.3 T1/9

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




Assignment Questions Cos attained

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

C354.1

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}

C354.1

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 number of 0’s

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

C354.3

C354.4

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}

C354.3

C354.4

Q5 Write Regular expression for the language

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

Q6. Write Regular expression for the language

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

Q7 Write Regular expression for the language of all strings w such that w contains exactly one 1 & even number of 0’s

C354.4

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.

C354.4




MODULE-3 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

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSOs Attained

Cos

Attained

Text Book/

Chapter No.

L21 Introduction to Rewrite Systems and Grammars

Chalk and

Board

1 1 C354.3 T1/11.1,11.2

L22 CFGs and languages, designing CFGs

1 1 C354.4 T1/11.3,11.4

L23 Simplifying CFGs, proving that a Grammar is correct

1 3 C354.4 T1/11.5,11.6

L24 Derivation and Parse trees, Ambiguity

3 3 C354.4 T1/11.7,11.8

L25 Normal Forms 3 1 C354.4 T1/12.1

L26

Pushdown Automata (PDA): Definition of non-deterministic PDA Systems

1 3 C354.5 T1/12.2

L27 Deterministic and Non-deterministic PDAs

3 3 C354.5 T1/12.3

L28 Non-determinism and Halting

3 3 C354.5 T1/12.4




L29 Alternative equivalent definitions of a PDA

3 1 C354.5 T1/12.5

L30 Alternatives that are not equivalent to PDA

3 1 C354.5 T1/12.6

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



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.

C354.5

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”

C354.4

C354.5

Q3.Explain the following terms

i) Languages of the PDA ii) Instantaneous description C354.4

Q4. Design the PDA for the language

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

Q5. What is Deterministic PDA & non deterministic PDA C354.5

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

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

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

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

Q8. Consider the grammar

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

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

C354.4

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




on the string “aab”

S → aS | aSbS | Є

Q10. Write grammar for the following language

L = { an b2n : n >=1} C354.3

Q11. Construct the CFG for the following language

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

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

C354.4




MODULE-4 Module-IV No of Hours: 10

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


1 Properties of Context Free Languages

2 Working of Turing Machine(TM)

3 Languages accepted by TM

4 Pumping Lemma for CFLs

5 Techniques of Turing Machines

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSO’s Attained

COs

Attained

Text Book/

Chapter No.

L31 Where do the Context-Free Languages(CFL) fit

PPT 1 1 C354.4 T2/13.1

L32 Showing a language is context-free

Chalk and Board

2 2 C354.4 T2/13.1

L33 Pumping theorem for CFL 1 2 C354.4 T2/13.2

L34 Important closure properties of CFLs, Deterministic CFLs

1 2 C354.4 T2/13.3

L35 Algorithms and Decision Procedures for CFLs: Decidable questions

1 1 C354.3 T2/13.4

L36 Un-decidable questions 1 1 C354.6 T2/13.5

L37 Turing Machine: Turing machine model, Representation

1 1 C354.6 T2/9.1,9.2,

9.3

L38 Language acceptability by TM

1 1 C354.6 T2/9.4

L39 Design of TM 2 1 C354.6 T2/9.5

L40 Techniques for TM construction

2 1 C354.6 T2/9.6

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






1. What is Turing Machine and Multi tape turing machine? Show that the language accepted by these machines is same.

C354.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

C354.6

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

4. Design a TM to accept all set of palindrome over {0,1}*. Also write its transition diagram and ID on the string “10101”.

C354.6

5. Explain with neat diagram, the working of Nondeterministic TM C354.6

6. Write short notes on Universal TM. C354.6




MODULE-5 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

Lecture

No. Topics Covered

Teaching

Method

POs

Attained

PSOs Attained

COs

Attained

Text Book/

Chapter No.

L41 Definition of an algorithm

Chalk and

Board

1 1 C354.1 T2/9.7

L42 Decidability 1 1 C354.1 T2/9.8

L3 Decidable languages, 1 1 C354.1 T2/10.1,10.2

L44 Undecidable languages 1 1 C354.1 T2/10.3,10.4

L45 Halting problem of TM 1 1 C354.1 T2/10.5

L46 Post correspondence problem Systems

2 3 C354.1 T2/10.6,10.7

L47 Complexity: Growth rate of functions

2 2 C354.1 T2/12.1

L48 The classes of P and NP 2 2 C354.5 T2/12.2

L49 Quantum Computation: quantum computers

2 3 C354.5 T2/12.8,12.8.1

L50 Church-Turing thesis. 1 1 C354.5 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



Q1. Write a note on Recursive languages C354.1




Q2. Write a note on Chomsky hierarchy C354.1

Q3. Write a note on halting problem C354.5

Q4.Write a note on Post’s correspondence problem C354.5

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

Q6. Write note on church-turing thesis. C354.1




Assignment I Questions

Assignment Questions COs attained 1. Design a DFA to accept the following language over the alphabet {0,1} L = {w | w is a even number}

C354.2

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

3. State & prove pumping Lemma for regular languages C354.1

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

contains exactly one1 & even number of 0’s C354.3

5. Write Regular expression for the language

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

Assignment II Questions

Assignment Questions COs attained 1. Design the PDA for the language

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

2. Write grammar for the following language

L = { an b2n : n >=1} C354.3

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

4. Design a TM for the language to accept the set of strings with equal number of 0’s and 1’s C354.2

5. Consider the grammar

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

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

C354.3

Assignment III Questions

Assignment Questions COs attained 1. Write a note on Recursive languages C354.1

2. Write a note on Chomsky hierarchy C354.1




3. Write a note on halting problem C354.5

4.Write a note on Post’s correspondence problem C354.5

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

ATC I.A. PORTION

I. A. Test Units

I I.A. Test Module I, Module II (8 Hours)

II I.A. Test Module II (2 Hours), Module III, Module IV (5 Hours)

III I.A. Test Module IV (5 Hours), Module V




7. VTU Question Papers:






















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 03 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, Auto boxing and Annotations. Understand the need for Collections and Framework. Implement JDBC concepts 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.

Module – 1 Teaching

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

8 hours




Text Book 1: Ch 15

Module – 4

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

Course outcomes: The students should be able to: 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 concepts of C and C++ programming languages. 2. Basic knowledge of Object Oriented concepts. 3. Basic knowledge of Java Programming concepts.

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, Auto-boxing 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 Course outcomes: The students should be able to: C355.1 Incorporate the need of advanced Java concepts like enumerations, auto-boxing and annotations. C355.2 Demonstrate the use of Collections framework in developing modular and efficient programs. C355.3 Use String class and its functions in programming. C355.4 Describe how servlets are used to build Java-based web application architecture. C355.5 Use JSP to write efficient server side programs. C355.6 Illustrate database access and details for managing information using the JDBC API.

3. Applications: Java and J2ee concepts are used for implementing various real-world applications. Some are listed below. 1. Used to develop customized java application and packages. 2. Modular and efficient java applications are implemented through Enumeration and java Collections framework. 3. Used to develop secured web based client/server applications. 4. Used to implement database-driven enterprise applications to access and manipulate information.

4) Module wise plan Module -1

Module – 1 No. of Hours: 8

Title: Enumerations, Auto-boxing and Annotations(metadata)

Learning Objectives: At the end of this module students will be able to:

1. Understanding Enumeration class and its methods. 2. Describe Auto-boxing/unboxing, Annotation concepts and its methods. 3. Develop simple java applications using enumerations and annotation concepts.

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()

Chalk & Board, PPT

1, 2, 3, 12

1 1 T1/12




Methods, L2. java enumerations are

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

Chalk & Board, PPT

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/Unboxing helps prevent errors, A word of Warning.

Chalk & Board,PP

T 1,2 1 T1/12

L5. Annotations, Annotation basics, specifying retention policy,

Chalk & Board

1,2 1 T1/12

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. Illustrate with an example the capabilities of enumerations. And list out the enumeration restrictions.

1

2. Explain with a syntax and example the various methods defined by enum class.

1

3. List out the significance of wrapper classes. Illustrate with an example the boxing and un-boxing for primitive data types.

1

4. What do you mean by Auto-boxing/un-boxing how it is different from boxing/un-boxing illustrate with an example.

1

5. Explain with an example different uses of Auto-boxing/un-boxing. 1 6. What are Annotations? Write a program that uses retention policy and Reflection.

1

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

1

8. List out and explain different types of built-in annotations. 1

MODULE-2




Module: 02 No of Hours: 8 Hours

Title: : Collections Framework


1 Define Collections framework and its interfaces and classes.

2 Develop a program to access collection via an Iterator.

3 Use the maps and Comparators.

4 Understand legacy Classes and Interfaces.

5 Demonstrate different Collection Algorithms.

Lesson Plan:

Lectur

e No. Topics Covered

Teaching

Method

PO

s

atta

ine

PSOs

attaine

d

COs

attaine

d

Text

Book/Chapte

r No.

L9 Collections Overview, Recent Changes to Collections

Chalk and Board,PPT

1, 2, 3, 4, 5, 12

1 1,2 T1/17

L10 The Collection Interfaces, The Collection Classes

Chalk and Board &

PPT 1 1,2 T1/17

L11 Accessing a collection Via an Iterator

Chalk and Board,PPT

1,3 1,2,3 T1/17

L12 Storing User Defined Classes in Collections

Chalk and Board,PPT

1 1,2 T1/17

L13 The Random Access Interface, Working With Maps

Chalk and Board &

PPT 1 1,2 T1/17

L14 Comparators, The Collection Algorithms,

Chalk and Board &

PPT 1,3 1,2 T1/17

L15 Why Generic Collections?, The legacy Classes and Interfaces

Chalk and Board,PPT

1,3 1,2 T1/17

L16 Parting Thoughts on Collections

Chalk and Board,PPT

1,3 1,2 T1/17


Questions:

COs

attained

1. What is Collections framework in java? List out the goal of Collections framework?

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

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 Apply different String handling functions for building java applications. 3 Distinguish the String and StringBuffer class and its significance.

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

1, 2, 4, 5, 12

1,3 1,3 T1/15

L18

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

Chalk and Board,PPT

1,3 1,3 T1/15

L19

String Comparison, equals( ) and equalsIgnoreCase(

Chalk and Board &

PPT 1,2,3 1,3 T1/15




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

L20

compareTo( ) Searching Strings, Modifying a String, substring( ),

Chalk and Board &

PPT 1 1,3 T1/15

L21

concat( ), replace( ), trim( ), Data Conversion Using valueOf( ),


1 2,3 T1/15

L22

Changing the Case of Characters Within a String, Additional String Methods,

Chalk and Board &

PPT 1 1,2,3 T1/15

L23

StringBuffer , StringBuffer Constructors, length( ) and capacity( ), ensureCapacity( ), setLength( ), charAt( ) and setCharAt( ),

Chalk and Board &

PPT 1,2 2,3 T1/15

L24

getChars( ),append( ), insert( ), reverse( ), delete( ) and deleteCharAt( ), replace( ), substring( ), Additional StringBuffer Methods, StringBuilder

Chalk and Board &

PPT 1,2 2,3 T1/15


Questions Cos

attained

1. What is String? Explain different String constructors. 3 2. Explain with a syntax and example the following string operations a). String concatenation b). String conversion c). 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 7. Explain following StringBuffer( ) constructors. Length( ), capacity( ), ensureCapacity( ), setLength( ), charAt( ), setCharAt( ), getChars( ), append( ), insert( ), reverse( ), delete( ), deleteCahrAt( ), replace( ), SubString( )

3

MODULE-4


1 Define servlet and its life cycle. 2 Understand Apache Tomcat for developing servlets and JSP. 3 Identify Servlet API classes, interfaces and its methods. 4 Develop web applications to Handle HTTP request and responses. 5 Understand importance of JSP tags. 6 Develop JSP programs for Cookies and 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;


1, 2, 3, 4, 5, 12

1,2

1,4

T1/31

L26 A simple Servlet; The Servlet API; The Javax.servlet Package;


1,2 1,4

T1/31

L27

Reading Servlet Parameter; The Javax.servlet.http package;

Chalk and , Board &

PPT 1,2

1,4

T1/31

L28 Handling HTTP Requests and Responses;

Chalk Board, PPT

1,2 1,4

T1/31

L29 Using Cookies; Session Tracking.


1,2 1,4

T1/31

L30 Java Server Pages (JSP): JSP, JSP Tags,


1,2 1,5

T2/11

L31 Tomcat, Request String, Chalk and Board &

PPT 1,2,3 1,5 T2/11





Questions: Cos

attained 9. Explain 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. Write a short note on i) Http Request and Response ii)Cookie and session tracking

4

14. Write a servlet program to handle the HTTP GET request. 4 15. Write the below two programs to explain about Cookie. 4 i) AddCookie.html Allow a user to specify a value for the cookie named MyCookie.

4

ii) 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: The concept of JDBC


1 Understand the concept of JDBC and its process. 2 Describe different JDBC driver types and its usage. 4 Develop a java programs to connect to DBMS and manipulate a table data. 5 Incorporate a transaction processing and exception handling concepts for JDBC

applications. 6 Discuss DataBaseMetadata and its methods.

Lesson Plan:

L32 User Sessions, Cookies, Session Objects

Chalk, Board,PPT

1,3 1,5

T2/11




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 1,4,5,6 T2/6

L34 JDBC Packages; A Brief Overview of the JDBC process;

Chalk and Board &

PPT 3 1,4,5,6 T2/6

L35

Database Connection; Associating the JDBC/ODBC Bridge with the

Chalk and Board &

PPT 3 1,4,5,6 T2/6

L36 Statement Objects; Chalk and

Board 1,3 1,4,5,6 T2/6

L37 Result Set; Chalk and

Board, PPT 1,3 1,4,5,6 T2/6

L38 Transaction Processing;


1,3 1,4,5,6 T2/6

L39 Metadata, Data types;

Chalk and Board &

PPT 1,3 1,4,5,6 T2/6

L40 Exceptions. Chalk and Board &

PPT 1,3 1,4,5,6 T2/6


Questions:

Cos

attained

1. Explain with a syntax and example JDBC Process. 4 2. Explain different types of statement objects with examples. 4 3. Explain about the i) ResultSet Holdability ii) RowSets iii) AutoGnerated Keys iv) Metadata v) ResultSet Metadata.

4

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

5.What is ResultSet? Explain with an example scrollable Result Set. 3,4

5. Explain about the Delete Row and InsertRow in the ResultSet With example.

3,4

6. What is DataBaseMetaData?List out and explain various methods. 3,4,6

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

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




6. DOT NET FRAMEWORK FOR APPLICATION DEVELOPMENT


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

CREDITS – 03

Subject Code 15CS564 IA Marks 20

Number of Lecture Hours/Week 3 Exam Marks 80

Total Number of Lecture Hours 40 Exam Hours 03

Course objectives: This course will enable students to

Inspect Visual Studio programming environment and toolset designed to build applications for Microsoft Windows

Understand Object Oriented Programming concepts in C# programming language. Interpret Interfaces and define custom interfaces for application. Build custom collections and generics in C# Construct events and query data using query expressions

Module – 1

Teaching

Hours

Introducing Microsoft Visual C# and Microsoft Visual Studio 2015: 8 Hours

Welcome to C#, Working with variables, operators and expressions, Writing methods and applying scope, Using decision statements, Using compound assignment and iteration statements, Managing errors and exceptions

T1: Chapter 1 – Chapter 6

Module – 2 Understanding the C# object model: Creating and Managing classes and 8 Hours

objects, Understanding values and references, Creating value types with enumerations and structures, Using arrays

Textbook 1: Ch 7 to 10

Module – 3 Understanding parameter arrays, Working with inheritance, Creating interfaces 8 Hours

and defining abstract classes, Using garbage collection and resource management Textbook 1: Ch 11 to 14

Module – 4 Defining Extensible Types with C#: Implementing properties to access fields, 8 Hours

Using indexers, Introducing generics, Using collections Textbook 1: Ch 15 to 18

Module – 5

Enumerating Collections, Decoupling application logic and handling events, Querying in-memory data by using query expressions, Operator overloading 8 Hours

Textbook 1: Ch 19 to 22 Course outcomes: The students should be able to: C356.1- Explain the syntax and semantics of C# using Visual Studio .NET platform. (L1) C356.2- Illustrate the use of arrays, parameters mechanisms, properties, generics, and collections in C#. (L2) C356.3- Develop an Object Oriented Programming concepts using C# programming language. (L3, L6)




C356.4-Explain concept of custom interfaces by designing C# applications. Leverage and examine the available built-in interfaces in building complex applications. (L4, L5, L6) C356.5-Compose queries to query in-memory data and define own operator behavior. (L1, L6) C356.6- Develop stand alone and graphical user interface applications on .NET Framework to solve the problems in different domains. (L3, L6)

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. John Sharp, Microsoft Visual C# Step by Step, 8th

Edition, PHI Learning Pvt. Ltd. 2016

Reference Books:

1. Christian Nagel, “C# 6 and .NET Core 1.0”, 1st Edit ion, Wiley India Pvt Ltd, 2016. Andrew Stellman and Jennifer Greene, “Head First C# ”, 3rd Edition, O’Reilly Publications, 2013. 2. Mark Michaelis, “Essential C# 6.0”, 5th Edition, Pe arson Education India, 2016. 3. Andrew Troelsen, “Prof C# 5.0 and the .NET 4.5 Fram ework”, 6th Edition, Apress and Dreamtech Press, 2012.

DOT NET FRAMEWORK FOR APPLICATION DEVELOPMENT COURSE PLAN

1) Prerequisites:

1. Fundamentals of Java Programming. 2. Fundamentals of Inheritance. 3. Object Oriented-Programming concepts with C++. 2) Course Overview and its relevance to programme: This course contains the philosophy of the .NET, building C# applications, and object oriented programming with C#, etc. It provides the platform independency. The significant features of this course are language interoperability, cross language inheritance, complete and total language integration. The .NET supports more than 30 languages and provides a common language runtime engine shared by all .NET aware languages. C# is a language designed specifically for the .NET platform. It helps to build the real time applications. The Microsoft .NET Framework is a software framework that can be installed on computers running Microsoft Windows operating systems. It includes a large library of coded solutions to common programming problems and a virtual machine that manages the execution of programs written specifically for the framework. The .NET Framework supports multiple programming languages in a manner that allows language interoperability, whereby each language can utilize code written in other languages; in particular, the .NET library is available to all the programming languages that .NET encompasses. The framework's Base Class Library provides a large range of features including user interface, data access, database connectivity, cryptography, web application development, numeric algorithms, and network communications. The class library is used by programmers, who combine it with their own code to produce applications. Programs written for the .NET Framework execute in a software environment that manages the program's runtime requirements. Main part of the .NET Framework is known as the Common Language Runtime (CLR). The CLR provides the appearance of an application virtual machine so that programmers need not consider the capabilities of the specific CPU that will execute the program. The CLR also provides other important services such as security, memory management, and exception handling. The class library and the CLR together constitute the .NET Framework.

3)Applications:




1. Developing the application oriented program software. 2. Constructing the web based applications. 3. Defining ASP.NET web pages and Database applications.

Module wise plan

Module -1

Module : 01 No. of Hours: 08

Title: Introducing Microsoft Visual C# and Microsoft Visual Studio 2015:

Learning Objectives: At the end of this module students will be able to: 1 Define the basic data types in C#, control statements and structure of c# program

2 Demonstrate to write console applications in C# and difference between value types and Reference types 3 Demonstrate the use of Microsoft Visual Studio 2015 4 Explain the syntax and semantics of C#.

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

attained

PSOs

attained COs

attained

Reference

Book/

Chapter

No.

L1 Introducing Microsoft Visual C# Chalk and Talk

1,3,5,7,9,l2

1,2 1,6 T1/1 L2 Microsoft Visual Studio 2015 Demonstration 1,2 1,6 T1/1 L3 Welcome to C#, Working with

variables Chalk & Talk

PPT 1,2 1,6 T1/2

L4 operators and expressions, Writing methods and applying scope

Think Pair and Share

1,2 1,6 T1/2,T1/3

L5

Using decision statements


1,2 1,6 T1/4

L6 Using compound Assignment


1,2 1,6 T1/5

L7 Using iteration statements


1,2 1,6 T1/5

L8 Managing errors and exceptions PPT 1,2 1,6 T1/6 T1: Chapter 1 – Chapter 6

Practice Questions COs Attained

1. Write a sample C# program and explain. 1 2. What are namespaces? Why name spaces are used? Explain. 1 3. Explain variables and expressions used in c# programming. 1,6 4. List and explain the decision statements used in c#. 1 5. What are operators? Explain different operators used in c#. 1,6 6. How compound assignment statements are used in C#. 1,6 7. Explain how errors and exceptions are manages in C# with an example. 1,6 8. Which are the iteration statements used in c# programming. 1,6

Module -2





Title: Understanding the C# object model:


1 Analyzing has-a relationship and polymorphic behavior in C#

2 Construct an object oriented program in C#

3 Demonstrate to write console applications in C# and difference between value types and Reference types 4 Define the Array, string, structure in C#

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method POs attained

PSOs

attained

COs

attained

Reference

Book/

Chapter

No.

L9 Understanding the C# object model

PPT

1,2,3,59,10,12

1,2 1,3 T1/7

L10 Creating and Managing classes PPT 1,2,3 1,3,6 T1/7 L11 Creating and Managing objects PPT 1,2,3 1,3,6 T1/7 L12 Understanding values and

references Demonstration 1,2,3 1,2,3 T1/8

L13 Creating value types with Enumerations

Chalk and Talk 1,2,3 1,2,3,6 T1/8

L14 Structures PPT 1,2,3 1,2,3,6 T1/8 L15

Using arrays Chalk and Talk/PPT

1,2,3 1,2,3,6 T1/9

L16 Using arrays

Chalk and Talk/PPT

1,2,3 1,2,3,6 T1/9



1. Explain with an example, how objects are created in c# programming. 1,3 2. What is a class? Explain the access specifiers of class. 1,3,6

3.What are enumerations? Explain with an example. 1,2,3,6 4.What are structures? Explain how structures are used in c#. 1,2,3,6 5.What is an array? Explain how arrays are declared and initialized in c#. 1,2,3,6

6. Explain the value types and reference types of C#. 1,2,3,6

Module -3 Module : 03 No. of Hours: 08

Title: Understanding the C# object model:


1 Describe the parameter arrays and inheritance

2 Create and Build the application on Interfaces

3 Explain the Garbage a Mechanism in C#

4 Illustrate the use of Resource Management

Lesson Plan:




Lecture No. Topics Covered Teaching

Method

POs

attained

PSOs

attained

COs

attained

Reference

Book/

Chapter

No.

L17 Understanding parameter

arrays

Demonstration

1,2,3,5,9,12

1,2,3 1,2,6 T1/11

L18 Working with inheritance


1,2,3 1,3,6 T1/12

L19 Creating interfaces Demonstration 1,2,3 1,2,4,6 T1/13 L20 defining abstract classes PPT 1,2,3 1,2,3,4,6 T1/13 L21 defining abstract classes PPT 1,2,3 1,2,3,4,6 T1/13 L22

Using garbage collection Chalk and

Talk 1,2,3 1,2,6 T1/14

L23 resource management

Chalk and Talk

1,2,3 1,2,6 T1/14

L24 resource management

Chalk and Talk

1,2,3 1,2,6 T1/14



1. Define inheritance? Explain with example. 1,3,6 2. Define Interface? Explain how interfaces are created with an example. 1,2,4,6

3. How an abstract classes are created? Explain the importance of abstract. 1,2,3,4,6 4. How c# manages resources. Explain. 1,2,6 5. Explain in brief the importance of garbage collection. 1,2,6

Module -4


Title: Defining Extensible Types with C#:


1 Define Extensible types with C#

2 Implement properties to access fields

3 Illustrate the concepts of Indexer, Generics and Collection

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

attained

PSOs

attained

COs

attained

Reference

Book/

Chapter No.

L25 Defining Extensible Types with C#:

Chalk and Talk 1, 2, 3, 5, 9,

11, 12

1,2 1,2,6 T1/15

L26 Implementing properties to access fields

Demonstration 1,2,3 1,2,6 T1/15

L27 Implementing properties to access fields

Demonstration 1,2,3 1,2,6 T1/15

L28 Using indexers Chalk and Talk 1,2 1,2,6 T1/16 L29 Using indexers Chalk and Talk 1,2 1,2,6 T1/16




L30 Introducing generics Chalk and Talk 1,2 1,2,6 T1/17 L31 Introducing generics Chalk and Talk 1,2 1,2,6 T1/17 L32 Using collections Chalk and Talk 1,2,3 1,2,6 T1/18



1. Briefly explain the properties in C#. 1,2,6 2. Define indexers ? Explain the use of indexers. 1,2,6 3. What are generics? Explain the importance of generics. 1,2,6 4. Explain the members of collections class 1,2,6




Module -5


Title: Defining Extensible Types with C#:

Learning Objectives: At the end of this module the students will be able to: 1 Design and Develop application to handle event

2 Implement Querying in-memory data by using query expressions

3 Define the concept of Operator Overloading

Lesson Plan:

Lecture

No. Topics Covered

Teaching

Method

POs

attained

PSOs

attained

COs

attained

Reference

Book/

Chapter No.

L33 Enumerating Collections Chalk and

Talk

1, 2, 3, 5, 9,

10, 12

1,2,3 1,2,6

T1/19

L34 Decoupling application logic

Chalk and Talk

1,2,3 1,2,6 T1/20

L35 handling events Demonstration 1,2,3 1,2,5,6 T1/20

L36 Querying in-memory data by using query expressions

PPT 1,2,3 1,5,6 T1/21


PPT 1,2,3 1,5,6 T1/21


PPT 1,2,3 1,5,6 T1/21

L39 Operator overloading Flipped

Classroom 1,2,3 1,5,6 T1/22

L40 Operator overloading Flipped

Classroom 1,2,3 1,5,6 T1/22



1. Define Enumerations? Explain with an example. 1,2,6 2. what is Decoupling application logic? 1,2,6 3. what is operator overloading? Explain with an example. 1,5,6 4. Explain how we can query in-memory data using expressions. 1,5,6 5. What are events? Explain “Handling events” in brief. 1,5,6

Assignment Questions Note: Before writing the program briefly explain the concept used in each

program

Assignment- I COs Attained

Module-1

1. a) Write a C# program to add two integers, float, and double i) use the concept of static methods ii) use the concept of non static methods iii) use the concept of function overloading

1,2,6

2. Create windows application for mathematical operations. Use suitable exceptions to handle errors

1,2,6




3 Create Windows application in C# to read the file and display it in textbox 1,2,6 Module -2 1. Write a C# program to compute the average of N array elements 1,2,6 2. Write a C# Program to implement the stack of integer items. Write the methods for PUSH and POP operations with suitable exception underflow and overflow

1,2,6

3. Write a C# program to illustrate the concept of Value Types and Reference types 1,2,6 4. Write a C# Program to illustrate concept of Boxing and Unboxing 1,2,6 5. Write a C# program to swap two chars, integers, float using out and ref parameters 1,2,6 6. Write a C# program to compute the i.) row sum of Jagged Array ii) Row Sum and Column Sum of Rectangular Array

1,2,6

Assignment II COs Attained

Module-3

1. Write the following classes with appropriate members: Customer that holds all the bank customer details. An interface Loan to calculate the premium and other details. Two subclasses Account and LoanAccount to create customers with and without loan respectively. Show an implementation for this problem.

1,2,3,4,6

2. Write C# application to illustrate the concept of polymorphism using Shape class hierarchy. 1,2,3,4,6 3. Write a C# application to illustrate the concepts of Explicit interface implementation 1,2,3,4,6 Module-4 1 Create a windows application to build the Phone Book with following options using Indexers i) Add information ii) Search by Phone number iii) Search by Name

1,2,3,6

2. Write a C# application to implement QUEUE operations Insert and Delete using Generics concepts

1,2,3,6

3. Design a class called Employee with data members Name, empId, age, salary. Write the properties for fields. i) Name (Read & Write Property) ii) empId (read only property)

1,2,3,6

Assignment III COs Attained Module-5

1. Design a Class a VECTOR for implementing 1D vector operations. Write the following methods for vector operations. Display suitable error message to handle different types of exception i) Vector addition ii) Vector Multiplication

1,2,3,5,6

2. Write a C# program to create a class STUDENT with state data’s Sname, Rno, and IAmarks, display the name of the student and his Rno, who scored highest IAmarks(Consider Two students). Use operator overloading programming technique

1,2,3,4,5,6

3. Create container Employees for employee class with state data name, empid, salary and perform the following operation on it. i)Add employee iv) Display all the employee name ii) Remove employee v) Search the given employee in list iii) Count the No. of employees in the container

1,2,3,4,6

IA TEST PORTION

IA test IA Test portion

I IA Test Module 1,Module 2 II IA Test Module 3, Module 4 III IA Test Module 5




COMPUTER NETWORK LABORATORY


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

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 wi th 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 progr am 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: Course outcomes: The students should be able to: • Analyze and Compare various networking protocols. • Demonstrate the working of different concepts of networking.




DBMS LABORATORY WITH MINI PROJECT


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

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. 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 appropriatedatabase 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’ 6. If FinalIA = 12 to 16 then CAT = ‘Average’ If FinalIA< 12 then CAT =

‘Weak’ 7. 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 a s 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. •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

B.E. Computer Science and Engineering DEPARTMENT VISIONbldeacet.ac.in/PDF/CourseFile/CS/CSE_5th_Sem_CourseFile_2017_18.pdf · engineering community and with society at large, such