Department of Information Science & Engineering Scheme …PPT 3. Assignment/case study presentation...

Department of Information Science & Engineering

Scheme and Syllabus

6th Semester Information Science & Engineering

Sixth Semester 2016

CourseContact Total

TotalMarks

S.No. Course Hours ContactCode credits

Hours/weekL – T - P CIE SEE Total

1.16IS61 Management and

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

2.16IS62 Distributed PC1

3 – 0 – 0 3 3 50 50 100Computing

3. 16IS63 Data Mining PC2 3 – 0– 0 3 3 50 50 1004. 16IS64 System Software PC3 3 – 0– 0 3 3 50 50 100

5.Object OrientedModeling and

Design

PC43 – 0 – 0 3 3 50 50 100

16IS656. 16IS66X Open Elective OE 3 – 0 – 0 3 3 50 50 100

7.File Structures

L1 2 – 0 – 3 5 4 25 25 5016ISL67 Lab

8. 16ISL68Software Design

Lab L2 0 – 0 – 3 3 2 25 25 50Professional

9. Ethics and Human 2 – 0 – 0 2 2 25 25 5016IS69 Values

Total 29 27 375 375 750

S. No. Course Code 6th Semester

1 16IS661 Web Application Design & Programming

2 16IS662 Software Engineering Practices

3 16IS663 Basics of Networking

4 16IS664 Bio-Informatics

5 16IS665 IoT –A practical Approach

MANAGEMENT AND ENTREPRENEURSHIP

Course Code 16IS61 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 for100 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 Functionalareas of managementPlanning: Nature, importance and purpose of planning process, Types of plans, Decisionmaking,Importance of planning, steps in planningOrganizing: Nature and purpose of organization, Principles of organization, Types oforganization, Span of control, MBOSelf 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 MethodsDirecting: Meaning and nature of directing, Leadership styles, Motivation Theories,Communication- Meaning and importanceControlling: Meaning and steps in controlling, Essentials of a sound control system, Methodsof establishing control.

Entrepreneur:Entrepreneur,

Meaning Types of

Unit - IIIof entrepreneur:

Entrepreneur,Evolution

Concept ofof

10 Hoursthe concept: Functions of

Entrepreneurship, Evolutionanof

Entrepreneurship, The Entrepreneurial Culture and Stages in entrepreneurial process. Creativity and Innovation: Creativity, Source of New Idea, Ideas into Opportunities, CreativeProblem 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: Businessenvironment in India, Role of MSMEs, Government policies towards MSMEs, Impact ofLiberalization, Privatization and Globalization on MSMEs.Institutional support: NSIC, TECKSOK, KIADB, KSSIDC, SIDBI; KSFCSelf learning topics: Make In India, Start Up India, Digital India

Unit - V 10 Hours

Preparation of Project report and Business Plan: Meaning of Project, ProjectIdentification,Project Selection, Project Report, Need and Significance of Report, Contents.Business Plan: Need of business plan, anatomy of business plan, executive summary, businessdescription, 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

Books1. Henry Koontz : “Essentials of Management” Latest Edition2. Poornima.M.Charantimath : Entrepreneurship Development – Pearson Education – 2014

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

Carnage Learning4. N V R Naidu, “Management & Entrepreneurship”- IK International, 20085. 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

To explain the Functions of management , Characteristics of Management,1. Importance and Purpose of Planning, organizing, staffing, directing and

controlling

2. To explain

Meaning of entrepreneur, Development of Entrepreneurship and steps in developing entrepreneurship

3. To describe Source of New Idea, Ideas into Opportunities. Creative Problem Solving etc.Describe the different Schemes like TECKSOK, KIADB etc. and also Make In

4.India, Start Up India, Digital India concepts

Program Outcome of this course (POs)Engineering knowledge: Apply the knowledge of mathematics, science,engineering fundamentals, and an engineering specialization to the solution of

1. complex engineering problems.

Problem analysis: Identify, formulate, review research literature, andanalyzecomplex engineering problems reaching substantiated conclusionsusing first

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

Conduct investigations of complex problems: Use research-based knowledgeand research methods including design of experiments, analysis and

3. interpretation of data, and synthesis of the information to provide valid conclusions.

4. Ethics: Apply ethical principles and commit to professional ethics andresponsibilities and norms of the engineering practice.Individual and team work: Function effectively as an individual, and as a

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

Bloom’sLevel

L1

L2, L3

L4

L2, L3

PO No.

PO1

PO2

PO4

PO8

PO9

Course delivery methods Assessment methods1. Lecture 1. Quiz2. Videos 2. IA3. PPT 3. Assignment/case study presentation4. Field study 4.

Scheme of Continuous Internal Evaluation (CIE):

Average of best Average ofassignments (Two) / Quiz Class TotalComponents two IA tests out of

three activity/Presentation participation Marksof Case Studies

Maximum Marks:25 10 5 10 50

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

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

Unit - II 8 hours

Inter Process Communication: Introduction, API for Internet Protocols, External DataRepresentation and Marshalling, Client – Server Communication.Distributed Object and RMI: Introduction, Communication between Distributed Objects,RPC,

Unit - III 8 hoursDistributed File System: Introduction, File Service architecture.Security in distributed systems: Introduction, Overview of security techniques:Cryptography,Certificates, Access control. Cryptographic Algo: Symmetric :Ex Substitutionalgo. , Asymmetric:RSA.

Unit - IV 8 hours

Time and Global States: Introduction, Clocks, events and process status, Synchronizingphysical clocks, Logical time and logical clocks, Global states.

.

Unit - V

Introduction to Cloud Computing: Introduction, Network Centric computing and NetworkCentric 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.

Books1. 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 Universitypress 2010.

Course Outcome (COs)

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

1. Explain the Shared memory concepts L22. Explain the advantages of DFS L23. Analysemechanisms to manage security in Distributed systems. L4

Program Outcome of this course (POs)

Engineering knowledge: Apply the knowledge of mathematics, science,

1. engi

8 hours

neering fundamentals, and an engineering specialization to the solution of complex engineering problems.Problem analysis: Identify, formulate, review research literature, and analyze

2. complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences. Design/development of solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified3.

needs with appropriate consideration for the public health and safety, and thecultural, societal, and environmental considerations.Life-long learning: Recognize the need for, and have the preparation and ability

4. to Engage in independent and life-long learning in the broadest context of technological change.

Course delivery methods Assessment methods1. Lecture & Board 1. Assignments2. Power-point Presentation 2. Quizzes3. Online Videos / Learning 3. Internal Assessment Tests4. NPTEL / Edusat 4. Course Seminar


PONo.

PO1

PO2

PO3

PO12

Average of best two Average ofQuiz Class TotalComponents assignmentsIA tests out of three participation Marks(Two) / activity

Maximum Marks: 50 25 10 5 10 50

Writing two IA tests 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 (out of 100 )

3. Question paper contains 08 questions each carrying 20 marks. Students have to answerFIVE full questions. SEE question paper will have two compulsory questions (any 2 units)and choice will be given in the remaining three units.

DATA MINING

Course Code: 16IS63 Credits: 3

Course Type: PC CIE Marks: 50

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

P

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

Sl.No.1

2

34

12

Course Learning Objectives (CLOs)

To understand the terminology, definition terms, of Data Warehousing and DataMining.To develop the skill of analyzing the Design Issues of Data Warehousing andAlgorithms of data Mining, with the perspective of current technology and industryparadigms.To evaluate Data Warehousing and Data Mining Algorithms.To apply &present the techniques of Data Warehousing and Data Mining.

PrerequisitesStatisticsDBMS

Unit I 08 HoursData Warehousing:Introduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), DataWarehouses. Design Issues, Guidelines for Data Warehouse Implementation, Data WarehouseMetadata.Online Analytical Processing (OLAP).

Unit II 08 HoursData Mining:Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures ofSimilarity and Dissimilarity, Data Mining Applications.

Unit III 08 HoursAssociation Analysis:Basic Concepts and Algorithms: Frequent Itemset Generation, Rule Generation, CompactRepresentation of Frequent Itemsets, Alternative methods for generating Frequent Itemsets, FPGrowth Algorithm, Evaluation of Association Patterns.

Unit IV 08 HoursClassification :Basics, General approach to solve classification problem,Decision Trees, Rule BasedClassifiers, Nearest Neighbor Classifiers.Bayesian Classifiers.Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures ofSimilarity and Dissimilarity, Data Mining Applications.

Unit V 08 HoursClustering Techniques:Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of ClusterAnalysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods, Qualityand Validity of Cluster Analysis.

Text Books1 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 Books1 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. Course Outcomes (COs) Blooms’No. Level1 Organizer raw data to make it suitable for various data mining algorithms. L3

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

feature selection and visualization to real world data.4 Design algorithms to solve related problems in the related domain. L6

Sl.No.

Program Outcomes (POs PO’sNo.

1 Engineering knowledge: Apply the knowledge of mathematics, science, PO1 engineering fundamentals, and an engineering specialization to the solutionof complex engineering problems.

2 Problem analysis: Identify, formulate, review research literature, and analyze PO2complex engineering problems reaching substantiated conclusions using firstprinciples of mathematics, natural sciences, and engineering sciences.

3 Design/development of solutions: Design solutions for complex engineering PO3problems and design system components or processes that meet the specifiedneeds with appropriate consideration for the public health and safety, and thecultural, societal, and environmental considerations.

Course delivery methods Assessment methods1. Chalk and talk 1. Quiz2. Power Point Presentations 2. Assignment3. Demonstrations / Animations 3. IA Test

4. Audio and Videos

Scheme of Continuous Internal Evaluation (CIE)Average of Average of

Quiz/ ClassComponents best two tests two Total Marks

Seminar/Project Participationout of three assignments

Maximum25 10 10 5 50

Marks

Scheme of Semester End Examination (SEE) 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. Minimum marks required in SEE to pass is 40.

Question paper contains 08 questions each carrying 20 marks. Students have to answerFIVE full questions. SEE question paper will have two compulsory questions (any 2units) 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

Course learning objectives1. 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.

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

Pre-requisites: Computer organization

Unit – I 10 HoursIntroduction to System Software:Introduction to System Software, Machine Architecture of SIC and SIC/XE. Assemblers: BasicAssembler 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 HoursLoaders and LinkersBasic Loader Functions-Design of an Absolute Loader, A simple Bootstrap Loader, Machine-Dependent Loader Features-Relocation, Program Linking, Algorithm and Data structures for aLinking Loader; Machine Independent Loader Features-Automatic Library search, Loaderoptions, Loader Design Options-Linkage Editor, Dynamic Linkage.

Unit – III 6 HoursEditors and Debugging SystemsText Editors-Overview of Editing Process, Editor structure, User Interface, Interactive Debugging Systems-Debugging Functions and Capabilities.

Unit – IV 8 HoursMacro ProcessorBasic Macro Processor Functions-Macro Definitions and Expansion, Macro processor

Algorithm and Data structures, Machine Independent Macro processor features-Concatenation ofMacro parameters, Generation of Unique Labels, Conditional Macro expansion, keyword MacroParameters.

Unit – V 8 Hours

CompilerBasic 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 Books1. 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 Book10. D.M.Dhamdhere, “System Programming and Operating Systems”, 2nd revised edition, Tata

McGraw - Hill, 2009 reprintCourse Outcome (COs)

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

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

compilers, loaders, linkers.3. Apply the concepts for the design of editors and macro processor. L34. Build an intermediate code for any high level construct and generate L6

optimized target code.

Program Outcome of this course (POs) PO No.1. Problem analysis: Identify, formulate, review research literature, and analyze

complex engineering problems reaching substantiated conclusions using firstPO2principles of mathematics, natural sciences, and engineering sciences.

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

1. Life-long learning: Recognize the need for, and have the preparation andability to engage in independent and life-long learning in the broadest context PO12of technological change

Course delivery methods(planned) Assessment methods(planned)1. Chalk and board 1. Internal assessment2. PPT 2. Assignment3. Video lectures 3. Quiz

4. Seminar / project


Average of best two Average ofQuiz Class TotalComponents assignmentsIA tests out of three participation Marks(Two) / activity

Maximum Marks: 50 25 10 5 10 50

# Writing two IA test is compulsory.

#Minimum marks required to qualify for SEE : 20

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.

OBJECT ORIENTED MODELING AND DESIGN (Theory)


Course type PC4 CIE Marks 50 marks


Total Hours: 39 SEE Duration3 Hours for100 marks

Course Learning Objectives1. To Bring out the importance of object oriented software development.2. To study and understand the UML notations as applicable to different stages of software

development3. To model given real world problem using object oriented concepts and notations.

Pre-requisites: Basics of object oriented programming and Software Engineering

Unit – I 8 HoursIntroduction, Modeling Concepts, Class Modeling: Introduction to Object Orientated (OO)development. OO themes; OO modeling history Modeling as Design Technique: Modeling; abstraction;The three models. Class Modeling: Object and class concepts; Link and associations concepts; Generalization andInheritance; Advanced object and class concepts; Association ends; N-ary associations; Aggregation;Abstract classes; Metadata; Reification; Constraints; Derived data; Packages;

Unit – II 8 HoursState Modeling, Advanced State Modeling: State Modeling: Events, States, Transitions andConditions; State diagrams; State diagram behavior; Advanced State Modeling: Nested state diagrams;Nested states; Signal generalization; Concurrency; A sample state model;

Unit – III 7 HoursInteraction Modeling, Advanced interaction Modeling: Interaction Modeling: Use case models;Sequence models; Activity models. Use case relationships; Procedural sequence models; Specialconstructs for activity models

Unit – IV 8 HoursDomain Analysis: Overview of domain analysis; Domain class model; Domain state model; Domaininteraction model; Iterating the analysis.

Unit – V 8 Hours Application Analysis: Application interaction model; Application class model; Application statemodel; Adding operations. .

Text Books1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML, Pearson

Education, 2nd Edition and onwards. 2. Grady Booch, James Rumbaugh, Ivar Jacobson, “Unified Modeling Language User Guide”,

Publisher: Addison Wesley.Reference Books

1 Grady Booch et al: Object-Oriented Analysis and Design with Applications, 3rd Edition, Pearson Education, 2007 and onwards.

2 Brahma Dathan, SarnathRamnath: Object-Oriented Analysis, Design, and Implementation, Universities Press, 2009 and onwards.

3 Grady Booch, James Rumbaugh, Ivar Jacobson, “Unified Modeling Language Reference Manual”, Publisher: Addison Wesley.


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

Level1. Identify and explain different UML notations for a given problem statement L2

2.Apply UML notations to model real world problems at different stages of software development.

L3

3. Perform domain and application Analysis for a given real world problems L4

Program Outcome of this course (POs) 1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems.

PO No.1

2. Problem analysis: Identify, formulate, review research literature, and analyzecomplex engineering problems reaching substantiated conclusions using firstprinciples of mathematics, natural sciences, and engineering sciences.

2

3. Design/development of solutions: Design solutions for complex engineeringproblems and design system components or processes that meet the specified needswith appropriate consideration for the public health and safety, and the cultural,societal, and environmental considerations.

3

4. Modern tool usage: Create, select, and apply appropriate techniques, resources, andmodern engineering and IT tools including prediction and modeling to complexengineering activities with an understanding of the limitations.

5

11. Project management and finance: Demonstrate knowledge and understanding ofthe engineering and management principles and apply these to one’s own work, as amember and leader in a team, to manage projects and in multidisciplinaryenvironments.

11

Course delivery methods Assessment methods1. Chalk and board 1. Internal assessment2. PPT 2. Assignment3. Video lectures 3. Quiz

4. Seminar / projectScheme of Continuous Internal Evaluation (CIE):

ComponentsAverage of best two IA

tests out of three

Average of twoassignments /

activity

Quiz Classparticipation

TotalMarks

Maximum Marks: 50 25 10 5 10 50

Writing two IA test is compulsory. Minimum qualifying Marks :20 Marks Minimum marks required to qualify for SEE :20

Self Study topics shall be evaluated during CIE (Assignments and IA tests) and 10% weightageshall 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 begiven in the remaining three units.

FILE STRUCTURES LAB

Course Code 16ISL67 Credits 4

Course type L1 CIE Marks 50 marks




1. To elucidate the methods of data storage and retrieve huge amount of data in minimal access2. To provide a basic understanding of "low level" aspects of file manipulation such as basic file

operations3. 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, AShortHistory 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 – IIFundamental File Structure Concepts, Managing Files Of Records: Field

5 HoursAnd 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, RecordAccess, More About Record Structures, Encapsulating Record Operations In A Single Class, File Access And File Organization

Unit – III 6 HoursOrganization Of Files For Performance, Indexing: Reclaiming Space in Files, Key sorting; WhatIs 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 HoursMulti - Level Indexing And B – Tree : Avl Trees, Multi-Level Indexing, B -Trees, Example OfCreating 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, CollisionResolution 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 usingConsequential 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 withk = 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 collisionresolution 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:2 File Structures Using C++ - K.R. Venugopal, K.G. Srinivas, P.M.Krishnaraj, Tata

McGraw- Hill,2008

Course Outcome (COs)At the end of the course, the student will be able to Bloom’s Level

1. Explain and demonstrate C++ File I/O and String handling functions. L 22.Designand Implement different field and record structures L 33. Create and design classes and methods for buffer manipulation to handle L 3

fixed and variable length records4. Design and Implement primary index structures and demonstrate its working L35. Design and Implement B-Tree index structures and demonstrate its working L36. Design and Implement Simple hashing algorithm, collision resolution L3

technique and demonstrate its working7. Construct K-way merge algorithm and explain its working L2,3

Program Outcome of this course (POs) PO No.

1. Graduates will demonstrate the knowledge of mathematics, basic sciences, PO1logical reasoning and engineering.

2. Graduates will demonstrate the ability to identify, formulate and solve PO2computer systems engineering problems.

3. Graduates will demonstrate the ability to design and experiment both in PO3hardware and software, analyze and interpret data.

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

Assessment methods

Regular Journal Evaluation & Attendance Monitoring.

Lab Internal Assessment


Components Conduct of the lab Journal submission Lab test TotalMarks

Maximum Marks: 25 10 10 5 25

Submission and certification of lab journal is compulsory to qualify forSEE. Minimum marks required to qualify for SEE : 13

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.

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

Initial write up 10 marksConduct of experiments 20 marks 50

Viva- voce 20 marksmarks

SOFTWARE DESIGN LAB

Course Code 16ISL58 Credits 2

Course type PE CIE Marks 25 marks



Course learning objectives1. To Understand and Implement various phases of SDLC2. To Apply concepts learnt in Databases, Software Engineering and programming subjects3.4.

5.6.

To create new software based on user requirementsTo impart state-of-the-art knowledge on Software Engineering and UML in an interactive manner through the WebPresent case studies to demonstrate the practical applications of different conceptsProvide opportunities to the students where they can solve small, real life problems

Pre-requisites : Databases Management Systems, Software Engineering, Web Programming

2. Analyze and translate a requirements specification into a design. L4

3.Construct the software from the design, using appropriate software engineering methodology

L5

4Utilize modern engineering tools for specification, design, implementation and testing

L3

Program Outcome of this course (POs) PO No.1. 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

2. Use of engineering tools: 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

6

3. Life-long learning: 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.

12

Assessment methods1. Periodic journal evaluation2. Execution of lab experiments.


ComponentsImplementation of the

mini projectSubmission of project

artifactsTotal

Marks

Maximum Marks: 25 0916 (2 marks for each

artifact)25

Minimum marks for eligibility is 13 marks out of 25.

Scheme of Semester End Examination (SEE):

1. It will be conducted for 50 marks of 3 hours duration. It will be reduced to 25 marks for the calculation of SGPA and CGPA.

2. Minimum marks required in SEE to pass:20 out of 50

3.

Modification of artifacts based on the changed problem statement

20 marks

50 marksImplementation of changes 20 marks

Viva- voce 10 marks

Department of Information Science & Engineering Scheme …PPT 3. Assignment/case study presentation...

Documents

Transcript of Department of Information Science & Engineering Scheme …PPT 3. Assignment/case study presentation...