karnatak law society’s gogte institute of … · karnatak law society’s gogte institute of...

KARNATAK LAW SOCIETY’S

GOGTE INSTITUTE OF TECHNOLOGY

UDYAMBAG, BELAGAVI-590008

(An Autonomous Institution under Visvesvaraya Technological University, Belagavi)

(APPROVED BY AICTE, NEW DELHI)

Department of Information Science & Engineering

Scheme and Syllabus (2015 Scheme)

6th

Semester Information Science & Engineering

INSTITUTION VISION

Gogte Institute of Technology shall stand out as an institution of excellence in technical

education and in training individuals for outstanding caliber, character coupled with creativity

and entrepreneurial skills.

INSTITUTION MISSION

To train the students to become Quality Engineers with High Standards of Professionalism and

Ethics who have Positive Attitude, a Perfect blend of Techno-Managerial Skills and Problem

solving ability with an analytical and innovative mindset.

QUALITY POLICY

Imparting value added technical education with state-of-the-art technology in a congenial,

disciplined and a research oriented environment.

Fostering cultural, ethical, moral and social values in the human resources of the institution.

Reinforcing our bonds with the Parents, Industry, Alumni, and to seek their suggestions for

innovating and excelling in every sphere of quality education.

DEPARTMENT VISION

Department of Information Science and Engineering shall provide excellent learning

environment with focus on innovation, research and entrepreneurship among aspiring

engineers to contribute to the workforce of the nation

DEPARTMENT MISSION

To impart Quality Technical Education in the field of Information Technology and enhance

intellectual and professional competence amongst the aspiring engineers

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

1. To develop the ability among students to synthesize data and technical concepts for

software design and development hence prepare students for successful careers in

software industry that meet the needs of Indian and multinational companies or to excel

in higher studies.

2. To inculcate professional and ethical attitude amongst students with effective

communication skills, teamwork skills, and an ability to relate engineering issues to

broader social context.

3. To provide students with an excellent academic environment, entrepreneur capabilities

and to enable students for life-long learning needed to lead a successful professional

career.

PROGRAM OUTCOMES (POs)

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

fundamentals, and an engineering specialization to the solution of complex engineering

problems.

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

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

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

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

modern engineering and IT tools including prediction and modeling to complex

engineering activities with an understanding of the limitations.

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

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

relevant to the professional engineering practice.

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

solutions in societal and environmental contexts, and demonstrate the knowledge of, and

need for sustainable development.

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

and norms of the engineering practice.

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

leader in diverse teams, and in multidisciplinary settings.

10. Project management and finance: 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.

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

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

PROGRAM SPECIFIC OUTCOMES (PSOs)

1. Problem solving Skills: An ability to analyze a problem design, implement and

evaluate software solutions related to algorithms, system software, web design big data

analytics & networking.

2. Professional skills: An ability to develop standard software solutions for existing and

emerging industry verticals and research domains.

3. Career Skills: An ability to harness Information Science & Engineering knowledge

with ethics and societal concern for career and further educational abilities along with

entrepreneurial skills.

Sixth Semester 2015

S.No. Course

Code Course

Contact

Hours

Total

Contact

Hours/week

Total

credits

Marks

L – T - P CIE SEE Total

1. 15IS61 Management and

Entrepreneurship HS 4 – 0 – 0 4 4 50 50 100

2. 15IS62 Distributed

Computing

PC1 3 – 0 – 0 3 3 50 50 100

3. 15IS63 Data Mining PC2 3 – 0– 0 3 3 50 50 100

4. 15IS64 System Software PC3 3 – 0– 0 3 3 50 50 100

5. 15IS65

Computer

Networks

PC4 3 – 1 – 0 4 4 50 50 100

6. 15IS66X Open Elective OE 3 – 0 – 0 3 3 25 25 50

7. 15ISL67

File Structures

Lab L1 2 – 0 – 3 5 4 25 25 50

8. 15ISL68 Networking Lab L2 0 – 0 – 3 3 2 25 25 50

9.

15IS69

Professional

Ethics and Human

Values

2 – 0 – 0 2 2 25 25 50

Total 30 28 350 350 700

S. No. Course Code 6th

Semester

1 15IS651 Web Application Design & Programming

2 15IS652 Software Engineering Practices

3 15IS653 Basics of Networking

4 15IS654 Bio-Informatics

MANAGEMENT AND ENTREPRENEURSHIP

Course Code 15IS61 Credits 4

Course type HS CIE Marks 50 marks

Hours/week: L-T-P 4 – 0 – 0 SEE Marks 50 marks

Total Hours: 48 SEE Duration 3 Hours for

100 marks

Course learning objectives

1. To understand the Characteristics of management , Role of Management, Importance and

Purpose of Planning, Organizing, Staffing, directing and Controlling

2. To understand Meaning of entrepreneur, Development of Entrepreneurship.

3. To understand Source of New Idea, Ideas into Opportunities. Creative Problem Solving

4. To apply the aggregate planning strategies.

5. Understanding of the different Schemes like Make In India, Start Up India, Digital India

Unit - I 10 Hours

Management: Introduction, nature and characteristics of Management, Scope and Functional

areas of management

Planning: Nature, importance and purpose of planning process, Types of plans, Decision

making, Importance of planning, steps in planning

Organizing: Nature and purpose of organization, Principles of organization, Types of

organization, Span of control, MBO

Self learning topics: Management as a science, art of profession

Unit - II 10 Hours

Staffing, Directing & Controlling: Nature and importance of staffing, Process of Selection &

Recruitment, Training Methods

Directing: Meaning and nature of directing, Leadership styles, Motivation Theories,

Communication- Meaning and importance

Controlling: Meaning and steps in controlling, Essentials of a sound control system, Methods

of establishing control.

Unit - III 10 Hours

Entrepreneur: Meaning of entrepreneur: Evolution of the concept: Functions of an

Entrepreneur, Types of Entrepreneur, Concept of Entrepreneurship, Evolution of

Entrepreneurship, The Entrepreneurial Culture and Stages in entrepreneurial process.

Creativity and Innovation: Creativity, Source of New Idea, Ideas into Opportunities, Creative

Problem Solving: Heuristics, Brainstorming, Synectics, Significance of Intellectual Property

Rights.

Self learning topics: Case studies of Entrepreneurs

Unit - IV 8 Hours

Micro, Small and Medium Enterprises [MSMEs] and Institutional Support: Business

environment in India, Role of MSMEs, Government policies towards MSMEs, Impact of

Liberalization, Privatization and Globalization on MSMEs.

Institutional support: NSIC, TECKSOK, KIADB, KSSIDC, SIDBI; KSFC

Self learning topics: Make In India, Start Up India, Digital India

Unit - V 10 Hours

Preparation of Project report and Business Plan: Meaning of Project, Project Identification,

Project Selection, Project Report, Need and Significance of Report, Contents.

Business Plan: Need of business plan, anatomy of business plan, executive summary, business

description, Business environment analysis, background information.

Venture Capital: Meaning, Need, Types and Venture capital in India

Self learning topics: Case studies on story of Silicon, Women Entrepreneur

Books

1. Henry Koontz : “Essentials of Management” Latest Edition

2. Poornima.M.Charantimath : Entrepreneurship Development – Pearson Education – 2014

Edition

3. Donald Kurtko and Richard “Entrepreneurship in new Millennium” South Western

Carnage Learning

4. N V R Naidu, “Management & Entrepreneurship”- IK International, 2008

5. P.C.Tripathi, P.N.Reddy “Principles of Management” –– Tata McGraw Hill.

6. Dr.M.M.Munshi,Prakash Pinto and Ramesh Katri “Entrepreneurial Development”

Himalaya Publishing House, 2016.

Course Outcome (COs)

At the end of the course, the student will be able to Bloom’s

Level

1.

To explain the Functions of management , Characteristics of Management,

Importance and Purpose of Planning, organizing, staffing, directing and

controlling

L1

2. To explain Meaning of entrepreneur, Development of Entrepreneurship and

steps in developing entrepreneurship L2, L3

3. To describe Source of New Idea, Ideas into Opportunities. Creative Problem

Solving etc. L4

4. Describe the different Schemes like TECKSOK, KIADB etc. and also Make In

India, Start Up India, Digital India concepts L2, L3

Program Outcome of this course (POs) PO No.

1.

Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of

complex engineering problems. PO1

2.

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

3.

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

4. Ethics: Apply ethical principles and commit to professional ethics and

responsibilities and norms of the engineering practice. PO8

5.

Individual and team work: Function effectively as an individual, and as a

member or leader in diverse teams, and in multidisciplinary settings. PO9

Course delivery methods Assessment methods

1. Lecture 1. Quiz

2. Videos 2. IA

3. PPT 3. Assignment/case study presentation

4. Field study 4.

Scheme of Continuous Internal Evaluation (CIE):

Components

Average of best

two IA tests out of

three

Average of

assignments (Two) /

activity/Presentation

of Case Studies

Quiz

Class

participation

Total

Marks

Maximum Marks:

50 25 10 5 10 50

Writing two IA test is compulsory.

Minimum marks required to qualify for SEE : 20

Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10%

weightage shall be given in SEE question paper.

Scheme of Semester End Examination (SEE):

1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for

the calculation of SGPA and CGPA.

2. Minimum marks required in SEE to pass: 40

3. Question paper contains 08 questions each carrying 20 marks. Students have to answer

FIVE full questions. SEE question paper will have two compulsory questions (any 2 units)

and choice will be given in the remaining three units.

DISTRIBUTED COMPUTING


Course type PC CIE Marks 50 marks

Hours/week: L-T-P 3– 0 – 0 SEE Marks 50 marks

Total Hours: 40 SEE Duration 3 Hours for

100 marks


1. To learn Basic Concepts of Distributed Systems

2. To understand File Sharing, DFS Implementation in DFS.

3. To understand the concepts of Cryptanalysis, Access control.

4. To learn Basic concepts of Cloud Computing

Pre-requisites :

Basic Computer Concepts, Operating Systems.

Unit - I 8 hours

Characterization of Distributed Systems: Introduction, Examples of Distributed Systems,

Challenges: Heterogeneity, Openness, Security, Scalability, Failure Handling.

System Model: Architectural Models, Fundamental models.

Self-learning: Security Model. 2 hours

Unit - II 8 hours

Inter Process Communication: Introduction, API for Internet Protocols, External Data

Representation and Marshalling, Client – Server Communication.

Distributed Object and RMI: Introduction, Communication between Distributed Objects,

RPC, Events and Notifications.

Self-learning: Group Communication. 2 hours

Unit - III 8 hours

Distributed File System: Introduction, File Service architecture, Sun Network File System .

Security in distributed systems: Introduction, Overview of security techniques: Cryptography,

Certificates, Access control. Cryptographic Algo: Symmetric :Ex Substitution algo. ,

Asymmetric:RSA.

Unit - IV 8 hours

Time and Global States: Introduction, Clocks, events and process status, Synchronizing

physical clocks, Logical time and logical clocks, Global states.

Coordination and Agreement: Introduction, Distributed mutual exclusion, Elections.

Self-learning: The ’snap shot’ algorithm of Chandy and Lamport. 2 hours

Unit - V 8 hours

Introduction to Cloud Computing: Introduction, Network Centric computing and Network

Centric Content, Peer to Peer Systems, Cloud Computing :An old idea Whose Time has Come,

Cloud Computing :Delivery Models and Services, Ethical Issues in Cloud Computing, Cloud

Velnerabilities, Major Challenges Faced by Cloud Computing.

Case Studies: Amazon Web Studies.

Books

1. George Coulouris, Jean Dollimore, Tim Kindberg: Distributed Systems Concepts and

Design, Pearson Education, Third edition,

2. Dan Marinescu : Cloud Computing Theory and Practice, ELSEVIER

References:

1. Kai Hwang, Geofrey C, Fox, Jack J, Dongarra: Distributed and Cloud Computing From

Parallel processing to the Internet of Things.

2. Sunita Mahajan, Seema Shah: Distributing Computing, Published by Oxford University

press 2010.



Level

1. Explain the Shared memory concepts L2

2. Explain the advantages of DFS L2

3. Analyse mechanisms to manage security in Distributed systems. L4

Program Outcome of this course (POs) PO

No.

1.

Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of

complex engineering problems.

PO1

2.

Problem analysis: Identify, formulate, review research literature, and analyze


principles of mathematics, natural sciences, and engineering sciences.

PO2

3.

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.

PO3

4.

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.

PO12

Course delivery methods

Assessment methods

1. Lecture & Board 1. Assignments

2. Power-point Presentation 2. Quizzes

3. Online Videos / Learning 3. Internal Assessment Tests

4. NPTEL / Edusat 4. Course Seminar


Components Average of best two

IA tests out of three

Average of

assignments

(Two) / activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50

Writing two IA tests is compulsory.







2. Minimum marks required in SEE to pass: 40 (out of 100 )




DATA MINING

Course Code: 15IS63 Credits: 3

Course Type: PC CIE Marks: 50

Hours/week: L – T –

P 3 – 0 – 0 SEE Marks: 50

Total Hours: 40 SEE Duration: 3 Hours for 100 Marks

Sl.

No. Course Learning Objectives (CLOs)

1 To understand the terminology, definition terms, of Data Warehousing and Data

Mining.

2 To develop the skill of analyzing the Design Issues of Data Warehousing and

Algorithms of data Mining, with the perspective of current technology and industry

paradigms.

3 To evaluate Data Warehousing and Data Mining Algorithms.

4 To apply &present the techniques of Data Warehousing and Data Mining.

Prerequisites 1 Statistics

2 DBMS

Unit I 08 Hours

Data Warehousing:

Introduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data

Warehouses. Design Issues, Guidelines for Data Warehouse Implementation, Data Warehouse

Metadata.Online Analytical Processing (OLAP).

Unit II 08 Hours

Data Mining:

Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of

Similarity and Dissimilarity, Data Mining Applications.

Unit III 08 Hours

Association Analysis:

Basic Concepts and Algorithms: Frequent Itemset Generation, Rule Generation, Compact

Representation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FP

Growth Algorithm, Evaluation of Association Patterns.

Unit IV 08 Hours

Classification :

Basics, General approach to solve classification problem,Decision Trees, Rule Based

Classifiers, Nearest Neighbor Classifiers.Bayesian Classifiers.

Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of

Similarity and Dissimilarity, Data Mining Applications.

Unit V 08 Hours

Clustering Techniques:

Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of

Cluster Analysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods,

Quality and Validity of Cluster Analysis.

Text Books

1 Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining,

Pearson Education, 2005.Mauro Pezze, Michal Young: Software Testing and Analysis

– Process, Principles and Techniques, Wiley India, 2008.

2 G. K. Gupta: Introduction to Data Mining with Case Studies, 3rd Edition, PHI, New

Delhi, 2009.

Reference Books

1 Arun K Pujari: Data Mining Techniques, 2nd Edition, Universities Press,

2009.Srinivasan Desikan, Gopalaswamy Ramesh: Software testing Principles and

Practices, 2nd Edition, Pearson Education, 2007.

2 Jiawei Han and MichelineKamber: Data Mining -Concepts and Techniques, 2nd

Edition, Morgan Kaufmann Publisher, 2006.

3 Alex Berson and Stephen J. Smith: Data Warehousing, Data Mining, and OLAP

Computing, McGrawHill Publisher, 1997.

Sl.

No. Course Outcomes (COs)

Blooms’

Level

1 Organizer raw data to make it suitable for various data mining algorithms. L3

2 Discover and measure interesting patterns from different kinds of databases. L4 3 Evaluate the techniques of clustering, classification, association finding,

feature selection and visualization to real world data. L5

4 Design algorithms to solve related problems in the related domain. L6

Sl.

No. Program Outcomes (POs PO’s

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

engineering fundamentals, and an engineering specialization to the solution

of complex engineering problems.

PO1

2 Problem analysis: Identify, formulate, review research literature, and analyze



PO2

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




PO3


1. Chalk and talk 1. Quiz

2. Power Point Presentations 2. Assignment

3. Demonstrations / Animations 3. IA Test

4. Audio and Videos

Scheme of Continuous Internal Evaluation (CIE)

Components

Average of

best two tests

out of three

Average of

two

assignments

Quiz/

Seminar/Project

Class

Participation Total Marks

Maximum

Marks 25 10 10 5 50

Scheme of Semester End Examination (SEE) 1 It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks

for the calculation of SGPA and CGPA.

2 Minimum marks required in SEE to pass is 40.

3 Question paper contains 08 questions each carrying 20 marks. Students have to answer

FIVE full questions. SEE question paper will have two compulsory questions (any 2

units) and choice will be given in the remaining three units.

SYSTEM SOFTWARE


Course type PC CIE Marks 50 marks

Hours/week: L-T-P 3-0-0 SEE Marks 50 marks

Total Hours: 40 SEE Duration 3 Hours for 100 marks


1. To introduce the basic functions of various system software.

2. To familiarize the structure of a compiler and activities of different phases of compilation

process.

3. To provide an insight into the design strategy for front end of a compiler.

4. To get acquainted with the techniques to optimize and to build the efficient target code.

Pre-requisites: Computer organization

Unit – I 10 Hours

Introduction to System Software:

Introduction to System Software, Machine Architecture of SIC and SIC/XE. Assemblers: Basic

Assembler Functions-A simple SIC Assembler, Machine Dependent Assembler Features.-

Instruction formats & addressing modes, Machine Independent Assembler Features-Literals,

Program blocks, Control sections and programming linking ,assembler design options: one-

pass assembler, multi-pass assembler.

Unit – II 8 Hours

Loaders and Linkers Basic Loader Functions-Design of an Absolute Loader, A simple Bootstrap Loader, Machine-

Dependent Loader Features-Relocation, Program Linking, Algorithm and Data structures for a

Linking Loader; Machine Independent Loader Features-Automatic Library search, Loader

options, Loader Design Options-Linkage Editor, Dynamic Linkage.

Unit – III 6 Hours

Editors and Debugging Systems

Text Editors-Overview of Editing Process, Editor structure, User Interface, Interactive

Debugging Systems-Debugging Functions and Capabilities.

Unit – IV 8 Hours

Macro Processor

Basic Macro Processor Functions-Macro Definitions and Expansion, Macro processor

Algorithm and Data structures, Machine Independent Macro processor features-Concatenation

of Macro parameters, Generation of Unique Labels, Conditional Macro expansion, keyword

Macro Parameters.

Unit – V 8 Hours

Compiler

Basic Compiler Function Compiler phases, Lexical Analysis – The role of the lexical analyzer,

specification and recognition of tokens, finite automata; Syntax analysis – The role of a parser,

Top down v/s bottom up parsing; Intermediate code generation-intermediate languages,

declarations, assignment statements.

Text Books

1. Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd

edition

onwards, Pearson, 1997.

2. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman- Compilers- “Principles,

Techniques and Tools”, 2/E, Addison-Wesley, 2007.

Reference Book

1. D.M.Dhamdhere, “System Programming and Operating Systems”, 2nd revised edition, Tata

McGraw - Hill, 2009 reprint


At the end of the course, the student will be able to Bloom’s Level

1. Experiment with the design principles of simple assembler L3 2. Develop an awareness of the function and complexity of modern

compilers, loaders, linkers. L4

3. Apply the concepts for the design of editors and macro processor. L3 4. Build an intermediate code for any high level construct and generate

optimized target code. L6


1. Problem analysis: Identify, formulate, review research literature, and analyze


principles of mathematics, natural sciences, and engineering sciences. PO2

2. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per the needs and specifications. PO4

3 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

PO12

Course delivery methods(planned) Assessment methods(planned)

1. Chalk and board 1. Internal assessment

2. PPT 2. Assignment

3. Video lectures 3. Quiz

4. Seminar / project




Average of

assignments

(Two) / activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50






2. Minimum marks required in SEE to pass:40




COMPUTER NETWORKS

Subject Code: 15IS65 Credits: 04

Course Type: PC CIE Marks: 50 marks

Hours/week: L – T – P 3 – 1 – 0 SEE Marks: 50 marks

Total Hours: 40 SEE Duration: 3 Hours for 100

marks


1. Recognize the importance of networks and need for layered approach in the design of

networks.

2. Explain the relevance of bandwidth and data rate in the transmission of information and

justify the need to convert the signals from analog to digital.

3. Encode and decode for the given transmitted data byte and apply the hardware or

software algorithms for different error checking and correction codes.

4. Compare and discuss algorithms for flow control protocols to reduce congestion.

Pre-requisites: Fundamentals of basic mathematics, Data Structures and algorithms, Computer

Organization, Operating systems,

Unit – I 6 Hours

Introduction and Network Models: Data Communications, Networks, Internet, Protocols and

Standards, Layered tasks, OSI model-layers in the OSI model, TCP/IP Protocol suite,

Addressing.

Unit – II 9 Hours

Data, Signals and Transmission Media: Analog and Digital, Periodic Analog Signals, Digital

Signals, Transmission Impairment, Data Rate Limits, Performance, Circuit Switched Networks,

Datagram Networks, and Virtual Circuit Networks.

Tutorial:

Study of different communication media(IEEE 802.15 and 802.15.4 standards) and

manufacturers with technical specifications report.


Data Link Layer: Error Detection and Correction-Introduction, Block Coding, Linear Block

Codes, Cyclic Codes, Checksum, Framing, Flow and Error Control, Protocols, Noiseless

Channels and Noisy channels.

Tutorial:

Installation of NS2 and its validation.

Unit – IV 9 Hours

Network Layer: Logical Addressing-IPv4 and IPv6 Addresses. Internet Protocol-

Internetworking, IPv4 and IPv6, Comparison between IPv4 and IPv6. Network Layer Delivery

Forwarding and Routing: Delivery, Forwarding and Unicast Routing Protocols.

Tutorial:

Simulation of distance vector and link state routing algorithms for performance analysis(run

time, space, delay, hops, reliability and load) in wired networks using NS2 simulator.

Unit – V 8 Hours

Transport Layer: Transport and End to End protocol, Transport layer, TCP, UDP, Mobile

Transport Protocols, TCP Congestion Control, Application and Network Management:

Application Layer Overview, Domain Name System, DHCP, Remote Login Protocols, Email,

File transfer and FTP.

Tutorial:

Simulation of FTP and UDP based traffic analysis in wired networks using NS2 simulator.

Text Books

1. BehrouzForouzon-Data Communications and Networking, McGraw Hill Edition, 4th

Edition,

2006 and onwards.

2. Nader F Mir-Computer and Communication Networks, Pearson Publication, 2009 and

onwards.

3 Larry Peterson and Bruce Davie- Computer Networks- A Systems Approach, Elsevier, 5th

Edition, 2012 and onwards.

Reference Book

1. Alberto Leon Garcia & Indra Widjaja - Communication Networks – Fundamental Concepts

& key architectures, Tata McGraw Hill, 2nd

Edition, 2004 and onwards.



Level

1. List the different network topological models and explain the different

functions of OSI Architectural model and the TCP/IP model. L1, L2

2. Differentiate between Analog and Digital signals, Virtual Circuit and

Datagram Circuits. L2

3.

Compare the difference between Error Detection and Error Correction

techniques for Noisy and Noiseless channels L2

4. Illustrate an appropriate subnet and Super netAddressing schemes using

the concepts of IP addressing. L2

5. Apply the theoretical concepts learnt to solve different types of network

problems. L3


1. Lecture delivery with discussion (black

board teaching) 1. Student Assignments

2. Presentations 2. Internal Assessment Test

3. Semester end Examination




Average of

assignments

(Two) / activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50




1 Problem analysis: Identify, formulate, review research literature, and analyze



PO2

2 Design/development of solutions: Design solutions for complex engineering




PO3

3 Project management and finance: 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.

PO10






2. Minimum marks required in SEE to pass:

FILE STRUCTURES LAB

Course Code 15ISL67 Credits 4

Course type L1 CIE Marks 50 marks

Hours/week: L-T-P 2 – 0 – 3 SEE Marks 50 marks

Total Hours: 50 SEE Duration 3 Hours for 100 marks


1. To elucidate the methods of data storage and retrieve huge amount of data in minimal access

2. To provide a basic understanding of "low level" aspects of file manipulation such as basic file

operations

3. To gain an insight of the most important high-level file structure tools like indexing, co

sequential processing, B-Trees, Hashing, etc.

4. To apply object oriented concepts in developing file structures techniques.

5. To understand comparatively the performance efficiency and other criteria of different file

structures.

Pre-requisites: Object Oriented Concepts

Unit – I

5 Hours

Introduction To File Structures File Structures: The Heart Of The File Structure Design, A Short

History Of File Structure Design, A Conceptual Toolkit; Fundamental File Operations: Physical

Files And Logical Files, Opening Files, Closing Files, Reading And Writing, Seeking, Special

Characters, The Unix Directory Structure, Physical Devices And Logical Files, File - Related

Header Files, Unix File System Commands

Unit – II 5 Hours

Fundamental File Structure Concepts, Managing Files Of Records: Field And Record

Organization, Using Classes To Manipulate Buffers, Using Inheritance For Record Buffer Classes,

Managing Fixed Length, Fixed Field Buffers, An Object - Oriented Class For Record Files, Record

Access, More About Record Structures, Encapsulating Record Operations In A Single Class, File

Access And File Organization


Organization Of Files For Performance, Indexing: Reclaiming Space in Files, Key sorting; What

Is an Index? A Simple Index for Entry - Sequenced File, Using Template Classes in C++ for Object

I/O, Indexing to Provide Access by Multiple Keys, Retrieval Using Combinations Of Secondary

Keys, A Model For Implementing Co sequential Processes

Unit – IV 6 Hours

Multi - Level Indexing And B – Tree : Avl Trees, Multi-Level Indexing, B -Trees, Example Of

Creating A B - Tree, An Object - Oriented Representation Of B - Trees, B - Tree Methods; Formal

Definition Of B - Tree Properties, Worst - Case , Merging And Redistribution,; B -Trees, B+ Trees

And Simple Prefix B+ Trees

Unit – V 5 Hours

Hashing and Extendible Hashing: Introduction, A Simple Hashing Algorithm, Collision

Resolution by Progressive Overflow, Buckets, Extendible Hashing

List of experiments (Programming language C++)

1. Write a C++ program to read series of names and write these names on to a file. Read this file and sort alphabetically.Display the result. 2. Write a C++ program to read and write and student objects with variable-length records and the fields delimited by “|”.implement pack(),unpack(). 3. Write a c++ program to write student objects with fixed-length records using any suitable record structure and to read from this file a student record using RRN. 4. Write a C++ program to reclaim the free space resulting from the deletion of records using linked lists..

5. Write a C++ program to implement simple index on primary key for a file of student objects.

6. Write a C++ program to implement secondary index for a file of student objects.

7. Write a C++ program to read two lists of names and then match the names in the two lists using

Consequential Match based on a single loop. Output the names common to both the lists. 8. Write a C++ program to read k Lists of names and merge them using kway merge algorithm with k = 8. 9. Write a C++ program to implement B-Tree for a given set of integers and its operations insert ( ). Display the tree. 10. Write a C++ program to store and retrieve student data from file using hashing. Use any collision

resolution technique.

Text Books:

1. File Structures-An Object Oriented Approach with C++ - Michael J. Folk, Bill

Zoellick, Greg Riccardi, 3rd

Edition, Addison- Wesley, 1998.

Reference Books:

1. File Structures Using C++ - K.R. Venugopal, K.G. Srinivas, P.M.Krishnaraj, Tata

McGraw- Hill, 2008



1. Explain and demonstrate C++ File I/O and String handling functions. L 2

2. Design and Implement different field and record structures L 3

3. Create and design classes and methods for buffer manipulation to handle

fixed and variable length records

L 3

4. Design and Implement primary index structures and demonstrate its working L3 5. Design and Implement B-Tree index structures and demonstrate its working L3

6. Design and Implement Simple hashing algorithm, collision resolution

technique and demonstrate its working L3

7. Construct K-way merge algorithm and explain its working L2,3


1. Graduates will demonstrate the knowledge of mathematics, basic sciences,

logical reasoning and engineering. PO1

2. Graduates will demonstrate the ability to identify, formulate and solve

computer systems engineering problems. PO2

3. Graduates will demonstrate the ability to design and experiment both in PO3

hardware and software, analyze and interpret data.

4. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per the needs and specifications.

PO4

Assessment methods

1. Regular Journal Evaluation & Attendance Monitoring. 2. Lab Internal Assessment


Components Conduct of the lab Journal submission Lab test Total

Marks

Maximum Marks: 25 10 10 5 25

Submission and certification of lab journal is compulsory to qualify for

SEE.


Scheme of Semester End Examination (SEE): It will be conducted for 50 marks of 3 hours duration. It will be reduced to 25 marks for the

1. calculation of SGPA and CGPA.

2. Minimum marks required in SEE to pass: 40 %

Initial write up 10 marks Conduct of experiments 20 marks 50

marks Viva- voce 20 marks

Network Laboratory

Course Code 15ISL68 Credits 2

Course type L3 CIE Marks 25

Hours/week: L-T-P 0-0-3 SEE Marks 25

Total Hours: 30 SEE Duration 3 Hours

Course learning objectives (CLOs):

1.Demonstrate the concept of TCP and UDP using network simulator

2.Implementations of networking concepts such as sockets and FIFOs

3. Able to demonstrate the use of error checking by using CRC

Prerequisites: C programming Skills

List of experiments:

Note: Student is required to solve one problem from PART-A and one problem from

PART-B. The questions are allotted based on lots. Both Questions carry equal marks.

Part –A

The following experiments shall be conducted using either NS228/OPNET or any other

simulators.

1. Simulate a three nodes point-to-point network with duplex links between them. Set the queue

size vary the bandwidth and find the number of packets dropped.

2. Simulate a four node point-to-point network, and connect the links as follows: n0-n2, n1- n2

and n2-n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply relevant

applications over TCP and UDP agents changing the parameter and determine the number of

packets sent by TCP/UDP.

3. Simulate the transmission of ping messages over a network topology consisting of 6 nodes

and find the number of packets dropped due to congestion.

4. Simulate an Ethernet LAN using N-nodes (6-10), change error rate and data rate and

compare the throughput.

5. Simulate an Ethernet LAN using N nodes and set multiple traffic nodes and plot congestion

window for different source/destination.

Part-B

The following experiments shall be conducted using C/C++

6. Write a program for error detecting code using CRC-CCITT(16 bits)

7. Write a program to implement RSA algorithm

8. Using TCP/IP sockets write a client-server program to make the client send a file name and

the server to send back the contents of the requested file if present

9. Implement the above program using Message queues or FIFOs as IPC channels.

10. Write a program for congestion control using Leaky Bucket algorithm.

Books:

1. Behrouz A. Forouzan: Data Communication and Networking ,4th

Edition,TataMcGraw-

Hill,2006

2. Computer Networks-Fundamental concepts and key architectures, Alberto Leon Garcia and

Indra Widjaja,2nd

Edition, Tata McGraw-Hill, India

.



1. Demonstrate the understanding of various networking related concepts such

as error checking, data transfer, congestion control etc.

L 3

2. Analyze the problem statement and able to choose right network related

concepts for implementation

L 4

3. Develop an ability to learn and use different simulators for understanding

various networking issues.

L 3


1. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per the needs and specifications.

PO4

2 An ability to create, select, apply, adapt, and extend appropriate techniques, resources, and modern engineering tools to a range of engineering activities, from simple to complex, with an understanding of the associated limitations

PO6

3 An ability to identify and to address their own educational needs in a changing world in ways sufficient to maintain their competence and to allow them to contribute to the advancement of knowledge.

PO12


CIE lab attendance/conducting the experiment 10

25 Journal writing 15


Rules to be followed for SEE exams:

1. Students have to execute a program selected from a lot of all experiments.

2. The breakup of evaluation will be

SEE

Initial write up 10

50 Conduct of experiments 20

Viva- voce 20

3. Minimum passing criteria is : 40% SEE marks.

4. Change of experiment is allowed only once.

Practical examination (SEE) of 3 hours duration will be conducted for 50 marks. It will be

reduced to 25 marks for the calculation of SGPA and CGPA.

karnatak law society’s gogte institute of … · karnatak law society’s gogte institute of...

Documents