Faculty of Engineering Specialization: Civil Engineering - Symbiosis ...

Faculty of Engineering Specialization: Civil Engineering

CourseName : Environmental and Civil Engineering

(UG/PG) :UG

Number of credits 03

Level 01

Learning objectives(s) The student will be able to: 1. Describes in brief about each branch of civil engineering and recognize practical applications of each

branch of civil engineering.2. Define and identify methods of surveying and modern surveying methods and prepare maps.3. Define different types of materials their use in construction with properties.4. List and describe principles of residential building planning, reproduce plan for residential building.5. Define and describe ecology and types of ecosystems, types of energies their advantages, disadvantages

and uses.6. State different types of pollutions with their effects and remedial measures.7. Outline what is civil engineering.

Pedagogy 1. Interactive classroom teaching and discussions on different areas of civil engineering2. Demonstration ofdifferentsurveying instrumentssuchasDumpy Level, Prismatic compass and The

odolite Group discussions on different materials used for construction and ecofriendly materials, smartmaterials, principles of building planning and about different plans for residentialbuildings

3. Group discussions on different materials used for construction and ecofriendly materials, smartmaterials, principles of building planning and about different plans for residential buildings

4. Presentation on different types of ecosystems, ecology, natural cycles types of pollutions and case studyon types of energies and energy crises

1

Course outline Sr. No.

Topic Hours

1

Introduction to Civil Engineering Significance and nature of civil engineering, introduction to the main areas of civil engineering surveying, quantity Surveying, structural engineering, geotechnical and foundation engineering, construction technology and construction management ,water resources engineering , transportation engineering earthquake engineering and disaster management role of civil in engineer in adverse site conditions to work etc, infrastructure development and use of modern equipment techniques like EDM, digital theodolite,GPS, GIS, introduction and applications of software for designing/ drafting.

8

2

Surveying and Map Making Linear and Angular measurements, introduction to traditional methods like chaining and offsetting for linear measurements, compass & theodolite for angular measurements, concepts for preparing the maps and introduction to cartography, area measurement by planimeter, introduction to leveling and contouring.

8

3

Materials and construction Various materials of construction and their uses for specific purposes depending on their properties, introduction to concrete and concreting, introduction and applications of smart and composite materials, types of structures and suitability, introduction to foundations and machine foundations components ofsuperstructurewithreferencetosuitabilityofmaterials, requirements of good masonry, automation in construction.

8

4 Building Planning and Legal Aspects Introduction of Building planning principles and building bylaws, interpreting an architectural/civil building plan, introduction to landAcquisitionAct1894,DCrules,EnvironmentProtectionAct and other legal provisions for control of Air, Water andLand Pollution and vehicles maintenance and catalytic converter.

7

5

Environmental Science Basic concepts, ecosystems and ecology, biodiversity and extinction threats, Human centered and Life centered world views, development and sustainabilityinter-relationship between population and resources, human impact on ecosystems, awareness and social responsibility.

7

6

Environmental Pollution and Conversation of Natural Resources Industrialization and urbanizations- global and Indian scenario, types of pollution with focus on air, water and land pollution causes/sources, ill effects and remedial control measures, introduction to the measurements of pollutants, need for energy and utilization/extraction of energy sources, social responsibility, energy crisis, conversation of natural resources, applying general simple principles/techniques such as recycling, vermin culture, forestation, rain water harvesting, promoting efficient, mass transportation, inter linking of water resources, solid wastemanagement.

7

2

Books recommended 1. Dr.S.N.Londhe , Mr.S.S.Shastri , Mr. N.D. Choudhary, Basic civil and Environmental Engineering ,

Tech -Max PublicationsPune. 2. Dr. R.K. Lad, Dr. A.H .Biradar, Basic civil and EnvironmentalEngineering, Nirali

PublicationsPune. 3. K.G. Hirasakar , Basic civil Engineering,G.K.Publications. 4. T.P. Kanetkar ,S.V.Kulkarni,Surveying and Levelling Part I , PVGPrakashan.

Research Paper/Articles recommended for reading

1. Rogers, P. (2008). ”Coping with Global Warming and Climate Change.” J.Water Resour. Plann. Manage., 134(3), 203–204. (ASCE JOURNAL VOL 134 , Issue 3,May2008)

2. Kwok, K., Statz, C., Wade, B., and Chong ,Carbon Emissions Modeling for Green Buildings: A Comprehensive Study of Calculations, ICSDEC 2012:pp. 118-126.

Suggested Evaluation Methods A. ContinuousAssessment

1. Essential a. Unittest b. Assignments c. Presentation d. Quiz

2. Optional a. Surprise test

B. End Semester Examination 1. Written Exam 2. Viva-voce

Course Outcomes: The student will be able to

CO1 "Estimate the future population and calculate water demand, various types of demands and fluctuations in water demand. Sources ofwater"

CO2 "Explain various physical, chemical and bacteriological qualities of water - Indian standards andWHO"

CO3 "Principles of water treatment processes. List various flow diagram, understand various principles and design of aeration, sedimentation,clari-flocculator"

CO4 "Principal and Design of rapid sand filter and operations troubles in working of rapid sandfilter"

CO5 Principle of Disinfection, Various disinfectants used and details of chlorinedisinfection

CO6 Different types of water distribution system and its components

3

Course Articulation Matrix: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)

PO1 PO2 PO3 PO4 PO5 P06 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 1 - - 1 1 1 1 1 - 1 1 1

CO2 3 3 1 - - 1 1 1 1 1 - 1 1 1

CO3 3 1 1 3 - 1 1 1 1 1 - 1 1 1

CO4 3 1 1 - - 1 1 1 1 1 - 1 1 1

CO5 3 1 2 3 - 1 1 1 1 1 - 1 1 1

CO6 3 3 1 - - 1 1 1 1 1 - 1 1 1

Parallel/Similar courses in existing curriculum:

S.No .

Name Of course Institute where it is offered

1 ENVIRONMENTAL SCIENCE IIT Kharagpur 2 Introduction to Environmental Studies IIT Roorkee

Sub Specialization Committee: Name of Member

Mr.Sagar Kolekar Mrs. Vaishnavi Dabir

Designation Assistant Prof Assistant Prof

Institute SIT, Pune SIT, Pune

Signature

Signature of Dean:

Date:

4

Faculty of Engineering

Specialization: Civil Engineering

CourseName : Environmental and Civil Engineering Lab

(UG/PG) :UG

Number ofcredits 01

Level 01

Learning objectives(s) The student will be able to:

1. Define Angular and linear measurements in surveying, Labelthe stations. 2. Describes in brief about different surveying instruments and theiruses. 3. Identify and recognize methods of surveying and reproduce themaps. 4. Outline the modern surveying methods. 5. List and describe principles of residential building planning, reproduce plan for

residentialbuilding. Pedagogy

1. Hands on training on ranging, offsetting, and taking linearand angular measurements

2. Hand on training on Global positioning system, Electronic distance meter, Digital planimeter , Auto level, Dumpy level, Prismaticcompass

3. Study of different types of maps , Plotting such as contourmaps 4. Drawing and detailing of residentialbuilding 5. Poster Presentation on different Ecological factors and environment orissues related with

environment /Any of the air or water quality parameterofindustrial waste/Study of environmental impact assessment (report)/ Field visit andreport writing

Course Outline Sr.No. Topic Hours

1 Linear Measurements- offsetting. 2 2 Use of Digital Planimeter. 2 3 Study of Maps. 2 4 Study of Modern equipment in Civil Engineering

Global positioning system/Electronic distance meter/Digital Theodolite etc

2

5 Simple profile leveling Exercise 4 5

6 Differential Levelling Exercise 4 7 Study and use of prismatic compass 2 8 Compass survey 4 9 Study of Building Drawings and Building Planning 2 10 Building Planning and Drawing 2 11 Poster making on Ecology and Environmental factors or Environmental

issues/Study of air or water pollution parameter /Study of EIA report 2

12 Field visit and report writing 2

Books recommended: 1. Surveying and Levelling (Vol. I), T.P. Kanetkar, S.V. Kulkarni, PVG Prakashan,Pune. 2. Building construction, Bindra S. P., AroraS. P., Dhanpat Rai Publication, New Delhi. 3. Environmental science, working with earth, G. TylerMiller. 4. Elements of cartography, Arthur Rokinson, Joel Morrison, Phillips Muehrcke WileyInc.

Research Paper/Articles recommended for reading 1. Rogers, P. (2008). ”Coping with Global Warming and Climate Change.” J.Water Resour. Plann.

Manage., 134(3), 203–204. (ASCE JOURNAL VOL 134 , Issue 3, May2008) 2. Kwok, K., Statz, C., Wade, B., and Chong, Carbon Emissions Modeling for Green Buildings: A Comprehensive Study

of Calculations,ICSDEC 2012:pp. 118-126. 3. Environmental science, working with earth, G. TylerMiller. 4. Elements of cartography, Arthur Rokinson, Joel Morrison, Phillips Muehrcke WileyInc.

Research Paper/Articles recommended for reading 1. Rogers, P. (2008). ”Coping with Global Warming and Climate Change.” J.Water Resour. Plann.

Manage, 134(3), 203–204. (ASCE JOURNAL VOL 134 , Issue 3,May2008) 2. Kwok, K., Statz, C., Wade, B., and Chong, Carbon Emissions Modeling for Green Buildings: A Comprehensive Study

of Calculations, ICSDEC 2012:pp. 118-126. Suggested Evaluation Methods

A. Continuous Assessment 1. Essential

a. Termwork b. Assignment c. Presentation d. Quiz


B. End Semester Exam 1. Practical Examination 2. Vivavoce

6


CO1 Understand the physical characteristics of water. Perform common environmental experiments relating to waterquality,

CO2 Suggest and perform appropriate experiments for given water sample statistically analyze and interpret laboratorial results

CO3 Apply the laboratorial results to problem identification, quantification, and basic environmental design and technical solutions. Understand and use the water sampling procedures and samplepreservations

CO4 Obtain the necessary background for subsequent courses in environmental engineering. Demonstrate the ability to work in groups

CO5 Understand the impact of water treatment on people and the environment. Define water quality standards I.S. and WHO.

CO6 Outline the program for analysis of water distribution system. State and identify Most Probable Number (MPN) for defining bacteriological properties.

Course Articulation Matrix:

1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)


CO1 3 1 - - - 1 1 1 2 2 - 1 1 -

CO2 3 3 2 2 - 1 1 1 2 2 - 1 1 -

CO3 3 3 2 2 - 1 1 1 2 2 - 1 1 -

CO4 3 1 - - - 1 1 1 2 2 - 1 1 -

CO5 3 2 - - - 1 1 1 2 2 - 1 1 -

CO6 3 - - - - 1 2 1 2 2 - 1 1 -

Parallel/Similar courses the existing curriculum

Sub Specialization Committee:

Name of Member

Mr.Sagar Kolekar

Mrs. Vaishnavi Dabir

Designatio n Assistant Prof Assistant

Prof

S.No. Name of the course Institute where it is offered 1 Environmental and Civil Engineering

Lab Pune University

2 Environmental and Civil Engineering Lab

Mumbai University

7

Institute SIT SIT

Signature

Signature of Dean:

Date:

8



Course Name: Integrated Water Resources Development and Management (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objective(s) The studentwill be able to:

1. Summarize the basic concept and terminologies associated with water resources engineering. 2. Identify the role of disciplines of ecology and socioeconomics play in management of water resources.

3. Define the concept ofIntegrated Water Resources Managementwithin the broader context of development. 4. Describe the private sector involvement in water resources management. 5. Recognize and explain the links between water and human health. 6. Distinguish blue and green water and its role in food production. 7. Illustrate the principles of international and national law in thearea of water management.

Pedagogy

1. PowerPoint presentation on the global food security and public-private participation issues and legal and regulatory settings, in the context of IWRM

2. Interactive classroom teaching on different topics like ‘blue’ versus ‘green’ water debate 3. On site study visit for better understanding of different irrigation methods 4. Case study of different innovative methods employed to manage water resources efficiently

Course Outline

9

Sr.No. Topic Hours

1

Context for IWRM Water as a global issue: key challenges and needs, definition of IWRM within thebroader context of development, complexity of the IWRM process, examining the key elements of IWRM process.

9

2

Water economics Economic view of water issues: economic characteristics of water good and services, non-market monetary valuation methods, water economic instruments, policy optionsfor water conservation and sustainable use, pricing: distinction between values and charges, private sector involvement in water resources management: PPPobjectives, PPP options, PPP processes, PPP experiences through case studies, linksbetween PPP and IWRM.

11

3

Water supply and health within the IWRMconsideration Links between water and human health: options to include watermanagement interventions for health, health protection and promotion in the context of IWRM, health impact assessment of water resources development.

9

4

Agriculture in the concept of IWRM Water for food production: ‘blue’ versus ‘green’ water debate, virtual water trade forachieving global water security, irrigation efficiencies, irrigation methods and currentwater pricing.

7

5

Water legal and regulatory settings Basic notion of law and governance: principles of international and national law in the area of water management, understanding UN law on non-navigable uses ofinternational water courses, development of IWRM in line with legal and regulatoryframework.

9

10

Books Recommended

1. S.S. Negi, Integrated Watershed Management, Oriental Enterprises. 2. Cech Thomas V., Principles of Water Resources: History, Development, Management andPolicy, John Wiley

and Sons Inc., New York.

Research Papers/Articles recommended for reading 1. Jackson, R.B. et al. 2001. Water in a changing world. Ecological Applications 11(4):1027-1045. 2. Technical Advisory Committee, Integrated Water Resources management, Technical Advisory Committee

Background Paper No: 4. Global water partnership, Stockholm, Sweden. 2002.

Suggested Evaluation Methods A. Continuous Assessment

1. Essential a. Unit test b. Assignments c. Presentation d. Quiz



Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1. Integrated Water Resources

Development and Management

Mumbai University

2 Integrated Water Resources Development and Management

Pune University

Sub Specialization Committee

11

Name of Member

Mr. SagarKolekar

Designation Assistant Professor

Org. / Inst. SIT, Pune

Signature

Name of the Expert: Signature:

Date:

12


Specialization: Mechanical Engineering

Course Name : Basic Mechanical Engineering

(UG/PG) : UG

Number of Credits : 3

Level : 1

Learning Objectives

The student will be able to: a) Explain basic concepts of thermodynamics and energy conversion. b) Explain working of power producing devices and power consuming devices and their applications. c) State basics of conventional and non-conventional power producing processes d) Discuss basic concepts of heat transfer modes, laws and applications. e) Discuss basic procedure of mechanical design and State properties of engineering materials. f) Discuss basics of mechanical drive & element and their applications. g) Show the ability to extend the knowledge by self learning.

Pedagogy

1. Classroom teaching. 2. Power point presentation with animation. 3. Course Seminar.

Pre-requisites None 13

Course Outline

Sr.No. Topic Hours

1

Fundamental Concept and Definitions: Thermodynamic system, surroundings and boundary, thermodynamic properties, thermodynamic processes, Reversible and Irreversible Processes. Temperature and temperature scale. Macro and microscopic approach. Pressure measurement.

4

2

First Law of Thermodynamics: Principle of conservation of mass and energy, Continuity equation, First law of thermodynamics, Joules experiment, Application of first law to flow and non-flow processes and cycles. Concept of internal energy, flow energy and enthalpy. Application of steady flow energy equation to nozzles, turbines, pumps, compressors, Heatexchangers. Limitations of first law, statements of second and third law.

6

3

Power Producing Devices:Boiler and Steam turbines, Reciprocating I.C.Engines (Representation of Otto and Dieselcycles on P-V diagram), Gas turbines, Hydraulic turbines, Compressed air motor. (Theoretical study, using schematic diagrams, No numerical)

5

4

Power Absorbing Devices: Reciprocating pumps and compressors, centrifugal pumps, Rotary compressors, blowers. Study of household refrigerators (representation of vapour compression cycle on P-hdiagram) and window air conditioner using schematic diagrams (elementary treatment only, No numerical)

5

5 Conventional and non-conventional energy sources: Thermal, Hydraulic, Wind, Solar, Plants (schematic of plant layout)

5

6

Heat transfer:Basic modes of heat transfer: conduction, convection & radiation, Statement and explanation of: Fourier’s law of heat conduction, Newton’s low of cooling, and Stefan Boltzmann’s law of radiation. (Numerical Treatment) Emissivity and its value for practical interpretation. Conducting and insulating materials and their properties, Use and types of extended surfaces like fins. (Descriptive treatment only) Description and types of heat exchanger.

6

7

Introduction to Engineering Design - Design considerations: Need of design, Stress, Strain, Modes of failure, Factor of safety, Tolerance, limits, fits, Aesthetic& Ergonomics Considerations Properties of Materials, Ferrous Metals & alloys, Non-Ferrous metals, Selection of Material

5

8

Mechanical Drives and Elements Individual and group drives: belt drive, Rope drive, chain drive, gear drive and friction clutches & brakes (types and application only) Machine elements: Power transmission shafts, axles, key, couplings, bush and ball bearings (types and application only)

5

9

Self Study Topic: Automobiles:mIntroduction, classification, Basic parts (Motor Cycle & Car), Specifications, performance parameters (Descriptive treatment only),Engine Emission & Control: Air pollution, Euro & Bharat Norms, Hydro carbon, Carbon monoxide, NO2, particulates, catalytic converter

4

Books Recommended 1. Design of Machine Elements, V.B.Bhandari, Tata McGraw-Hill, Second, 2008. 2. Internal Combustion Engines,V.Ganeshan, Tata McGraw-Hill, Third Edition,2007 3. Automobile Engineering, R.K.Rajput, Laxmi Publications

14

Research Papers/Articles recommended for reading: NA Suggested Evaluation Methods


1. Unit Tests 2. Optional

a. Assignments b. Surprise Tests c. Pre-announced Class Test

B. End Semester Examination 1. Written Exam

Parallel/Similar coursesin the existing curriculum S.No. Name of the course Institute where it was offered 1. INTRODUCTION TO

MECHANICAL ENGINEERING SCIENCES

KERALA TECHNOLOGICAL UNIVERSITY

Subspecialisation Committee

Name of Member Laxman S. Bhargava A. Ubale

Designation Professor Asst Prof

Org. / Inst. SIT SIT

Signature


Date:

15


Specialization: Computer Science and Information Technology Course Name: Computer Programming (UG/PG): UG Number of Credits: 2 Level: 1 Learning Objectives The students will be able to:

1. Gain knowledge to individually think of the logic to solve and write programs in C, optimize their solutions. 2. Describe a computer-based system, process, component or program. 3. Identify a problem and define the computing requirements for its solution. 4. Express the code as modular functions comprehend type systems, data structures, data abstraction, and

storage management. 5. Recognize the use of some powerful programming tools like pointers.

Pedagogy

1. Classroom teaching 2. Brainstorming session

Pre-requisites

None Course Outline S.No. Topic Hours

1

Programming Concepts History of C, character set, constants, variables and data types, operators and expressions, input / output operations, decision making, branching and looping statements.

6

2

Arrays and Strings Arrays: introduction, one dimensional array and two dimensional arrays: declaration, initialization, programs using arrays. Strings: introduction, declaration, initialization and read/ write operations of strings, string operations.

6

3

Functions Introduction, function definition and declaration, arguments and parameters, local variables and global variables, parameter passing mechanisms: call by value and call by reference, recursion and storage classes.

6

4

Structures and Unions Introduction, structure definition, declaration and initialization, operations on structure variables, arrays of structures, nested structures, unions, enumeration, bit fields.

6

5 Pointers 6 16

Introduction, declaration and initialization of pointer variables, pointer operations, pointers and arrays, pointers and strings, array of pointers, dynamic memory allocation.

Books Recommended 1. “Let Us C”, Yashvant Kanetkar, 12th Edition, 2012, BPB Publications. 2. “The C Programming Language”, Kernighan, Ritchie, Prentice Hall of India. 3. “Computer Science: A Structured Programming Approach Using C”, Behrouz A. Forouzan and Richard F. Gilberg,

third edition, 2006, Thompson. 4. “Programming in ANSI C”, E. Balagurusamy, Sixth Edition, 2013, McGraw-Hill Education.

“Programming Language Concepts”, Mehdi Jazayeri, John Wiley and Sons. 5. An H. and Wei H., “C Language Theory and Practice Teaching Effect Research and Exploration”, ICISE 2009. Research Papers/Articles recommended for reading 1. Chii2x Computer Programming Research Paper, March 2013. 2. Bergstra J.A., “Science of Computer Programming”, journals-elsevier.

Suggested Evaluation Methods

A) Continuous Assessment 1. Essential

a) Unit Test b) Seminars c) Assignments

2. Optional a) Quizzes b) Mini Project

B) End Semester Examination

a) Written Exam Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Computer Programming Pune University 2 Computer Programming Mumbai University Sub-specialization committee

Name of Member Kiwi Mahajan Swati Ahirrao Meeta Kumar Shilpa Pawar

Designation Assistant Professor (CS & IT)

Assistant Professor (CS & IT)



Org. / Inst. SIT SIT SIT SIT

Signature Name of the Expert: Signature:

Date:

17


Specialization: Mechanical Engineering

Course Name :Basic Mechanical Engineering Lab

(UG/PG) : UG


Level : 1

Learning Objectives

The student will be able to: 1. Demonstrate the working of water turbines 2. Explain the working of internal combustion engines 3. Demonstrate the working of various types of boilers. 4. Explain the working of refrigerator, air-conditioners and pumps. 5. Demonstrate the working of power transmitting elements such as coupling, gears, and clutches,

brakes, keys 6. Discuss working of power transmitting elements such as bearings, chain drives, belt drives.

Pedagogy A) Experiments B) Quizzes C) Journal writing Pre-requisites None Course Outline

Sr.No. Topic Hours

1 Study of Pelton and Francis turbine 2

2 Study of fire tube boiler 2

3 Study of water tube boiler 4

4 I. C. engine 4

5 Study of households refrigerator and window air conditioner 4

6 Study of centrifugal pump 4

7 Study of solar water heating system 4

8 Study of heat exchangers 2

9 Study of power transmitting elements coupling, gears, and clutches, brakes, keys 2

10 Study of power transmitting elements bearings, chain drives, belt drives. 2 18

Books Recommended

1. Design of Machine Elements, V.B.Bhandari, Tata McGraw-Hill, Second, 2008. 2. Internal Combustion Engines,V.Ganeshan, Tata McGraw-Hill, Third Edition,2007 3. Automobile Engineering, R.K.Rajput, Laxmi Publications

Research Papers/Articles recommended for reading: NA Suggested Evaluation Methods

1. Continuous Assessment 1. Essential

1. Lab Work 1. Optional 1. Quiz

2. End Semester Examination 1. Viva

Parallel/Similar coursesin the existing curriculum S.No. Name of the course Institute where it was offered Basic Mechanical

Engineering Lab Pune University

Basic Mechanical Engineering Lab

Mumbai University


Name of Member Laxman S. Bhargava A. Ubale

Designation Professor Asst Prof


Signature


Date:

19

Faculty of Engineering Specialization: Computer Science and Information Technology

Course Name: Computer Programming Lab (UG/PG): UG Number of Credits: 1 Level: 1 Learning Objectives The students will be able to:

1. Recognize C programming techniques. 2. Think of the logic to solve and write programs in C, optimize their solutions. 3. Design, implement, test, debug, and document programs in C. 4. Understand and use the common data structures typically found in C programs namely arrays, strings, lists,

trees, and hash tables. 5. Program low-level input and output routines in C. 6. Understand how to write and use functions, how the stack is used to implement function calls, and parameter

passing options. 7. Recognize the use of some powerful programming tools like pointers.

Pedagogy

1. Classroom teaching 2. Practical using tools like Dev C++, Turbo C

Pre-requisites


1 Write a C program to reverse a given integer. 2 2 Write a C program to generate the Fibonacci Series for a given number ‘n’. 2 3 Write a C program to find whether

(a) A given number is prime or composite. (b) A given number is even or odd.

2

4 Write a C program to compute the factorial of a given number: ‘n’. 2 5 Write a C program to find the roots of a quadratic equation. 2 6 Write a C program to search for a user-given element in a set of ‘n’ numbers. 2 7 Write a program to perform various operations such as union and

intersection on the given sets. 2

8 Write a C program to perform matrix operations like addition, subtraction and transpose.

2 20

9 Write a C program to accept a string from console and to display the following on console (without using built-in functions): (a) Length of the string (b) Total number of characters in the string (c) Total number of vowels in the string (d) Reverse of the string. (e) Whether the string is a palindrome.

3

10 Write a C program using functions to accept two strings from the console and perform the following operations (without using built-in functions):

(a) Compare the strings: equal/not equal (b) Find the longer string. (c) Concatenate the two strings. (d) Copy one string into the other. (e) Find occurrence of substring in the main string

3

11 Write a C program using functions to accept a one-dimensional array of integers and sort them in ascending order.

2

12 Write a C program to find the factorial of a number using recursion. 2 13 Write a C program using structures to print the pay slip of an employee after

accepting details like id. no, name, designation, department and basic salary. 2

14 Write a C program using pointers to accept two one-dimensional arrays, find the sum of the corresponding elements, store the sum in a third array and finally print the resultant array. Use Dynamic Memory Allocation.

2

Books Recommended 6. “Let Us C”, Yashvant Kanetkar, 12th Edition, 2012, BPB Publications. 7. “The C Programming Language”, Kernighan, Ritchie, Prentice Hall of India. 8. “Computer Science: A Structured Programming Approach Using C”, Behrouz A. Forouzan and Richard F. Gilberg,

third edition, 2006, Thompson. 9. “Programming in ANSI C”, E. Balagurusamy, Sixth Edition, 2013, McGraw-Hill Education. 10. “Programming Language Concepts”, Mehdi Jazayeri, John Wiley and Sons.

Research Papers/Articles recommended for reading 3. Chii2x Computer Programming Research Paper, March 2013. 4. Bergstra J.A., “Science of Computer Programming”, journals-elsevier.


A) Continuous Assessment 1. Essential a) Lab Assignments 2. Optional

a) Quizzes b) Mini Project

B) End Semester Examination A. Viva-Voce B. Lab Exam

21

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Computer Programming Lab Nirma University 2 Computer Programming Lab Pune University Sub-specialization committee

Name of Member Kiwi Mahajan Swati Ahirrao Meeta Kumar Shilpa Pawar







Date:

22

Faculty of Engineering Specialization: MechanicalEngineering

CourseName : Workshop Practice (UG/PG) : UG

Number ofCredits :2

Level :1

Learning Objectives

The student will be able to: 1. Discuss different manual work trades such as carpentry, fitting, welding, sheet metal working, injection

moulding, press workingetc. 2. Develop their confidence by reading drawing and making jobs according to thedrawing. 3. Explain basis manufacturing processes and theircapabilities. 4. Solve manufacturing processes relatedproblems 5. Discuss different techniques of joining processes for metals andnon-metals.

6. Perform different operations and machining methods on various machine tools such as hack saw, drilling, wood lathe, welding, CNC machineetc.

7. Discuss basic manufacturing processes and advance tools eg, power tools, CNCetc. 8. Develop quality and safetyconsciousness.

Pedagogy a. Lab practical on fitting, carpentry, welding and sheet metaljobs b. Assignments: Process sheet with figure and description on fitting, carpentry, welding, sheet metaljobs. c. Demonstration of CNC lathe, power press, smithy, injection moulding etc. with the help of jobs and

audio/videofacilities

Pre-requisites: None

23


1

Fitting Introduction, use of marking tools and measuring instruments such as scribers, punch, try square, vernier caliper, vernier height gauge, micrometer, dial test indicator, bevel protractor, surface plate etc. Use of hand tools such as hacksaw, chisel, files, hammers, drills, taps etc. location layout, marking, cutting, shearing, chipping, sizing of metals, drillingandtapping.Safetyprecautionstobetakeninthefittingshop. Job:- One male female fitting job involving different operations such as sawing, filing, drilling, tappingetc.

12

2

Sheet Metal Working Use of marking , measuring and cutting tools such as scribers, steel rules standard wire gauge, scissors hammers, mallets etc. types of metallic sheets, use of power tools, introduction of soldering, types of solders, use of flux, soldering iron. Development of joints .Safety precautions to be taken in the sheet metalshop. Job:- One utility job involving different operations such as cutting, marking, notching, folding, bending, Spot welding and soldering or riveting and soldering etc.

16

3

Carpentry Introduction to carpentry tools such as saws, jackplane, chisels, marking gauge, try square, steel rules etc. Use of power tools, types of woods and carpentry joints.safety precautions to be taken in the carpentry shop. Job:- One job involving different operations such as sawing, planning, chiseling,wood turning

8

4

Welding Introduction, principal of manual metal arc welding, equipment and it’s operation, welding electrodes, welding joints, welding symbols. Demonstration: Gas cutting , spot welding , TIG and MIG welding. Safety precautions to be taken in welding shop. Job:- One job using arc welding operation containing simple joint.

9

Books Recommended a) Manufacturing Technology Vol. I & II, P. N. Rao, Tata McGrawHill b) Workshop Technology, Vol.-I, R. B. Gupta, S. ChandCo.Ltd c) Elements of Workshop Technology, Vol-I&II, S.K.H. Choudhary, Media Promoters & Publishers Pvt.

Ltd.Mumbai. d) A Text Book of production Engineering, P. C. Sharma, S. Chand Co.Ltd

Research Papers/Articles recommended for reading: Nil Suggested Evaluation Methods

a. ContinuousAssessment i. Essential

1. Preparation ofJournal 2. Assignments

ii. Optional 1. Seminar

b. End SemesterExamination a. Viva

24

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered

1 Mechanical Workshop Nirma University 2 Workshop Practice Pune University

Subspecialisation Committee Nameof Member

B.S.Rathod

Designation

Head, Workshop Department

Org. / Inst. SIT

Signature


Date:

25


Specialization: Electronics and Telecommunication

Course Title : Basic Electrical and Electronics Engineering Number of Credits : 3 Level : 1 Learning Outcomes 1. Use Kirchhoff's laws to analyze DC circuits. 2. Explain the working of electrical measuring instruments. 3. Describe the working principle of DC Generator and Motor. 4. Illustrate the basic principles of Electromagnetic Induction and its applications such as

Transformer and Induction Motors. 5. Demonstrate the working of different semiconductor devices and their applications. 6. Discuss different transistor configurations and compare them on the basis of current gain,

voltage gain, input/output impedance. 7. Represent numerical values in various number systems and perform number conversions

between different number systems. 8. Demonstrate the operation of logic gates. 9. Implement Boolean expressions using logic gates. 10. Implement half adder, full adder using logic gates.

Pre-learning: None

Course Outline

Unit No. Topic

Hours

1

Basic Electrical Circuits and its Applications Ohm's law, Kirchhoff’s laws, Steady state solution of DC circuits, Introduction to AC circuits, waveforms and RMS value, power and power factor, energy meters.

15

2 Electrical Machines Construction, Principle of operation, basic equations of DC generators, DC motors, single phase transformer.

8

3

Semiconductor Devices and Applications Characteristics of PN junction diode, Zener effect, Zener diode and its characteristics, Half wave and full wave rectifiers, Voltage regulation. Bipolar junction transistor, CB, CE, CC configurations and characteristics.

14

26

4 Digital Electronics Binary and Hexadecimal number system, logic gates, Boolean algebra, Half and full adders.

8

Pedagogy: 1. Classroom lectures 2. NPTEL Video: http://nptel.ac.in/courses Books Recommended:

1. “A Textbook of Electrical Technology” – Volume – I, B. L. Theraja, S. Chand & Company Ltd., New Delhi.

2. “Theory & Problems of Basic Electrical Engineering” – I. J. Nagrath & Kothari, Prentice-Hall of India Pvt. Ltd.

3. “Basic Electrical Engineering” – V. K. Mehta, S. Chand & Company Ltd., New Delhi. 4. “Electronic Principles” Malvino; PHI. 5. “Electronic Devices & Circuits”, Allen Mottershed PHI. 6. “Electronic devices and Circuits Theory”, Robert L. Boylestead, Louis Nashelsky. PHI 7. “Digital Fundamentals”, Thomas L. Floyd, UBS Publishers.

8. “Fundamentals of Logic Design”, Charles H. Roth, JAICO Publishing House.

Suggested Assessment/ Evaluation Methods A.Continuous Assessment

a. Unit Tests b. Class Tests c. Assignments

B. End Semester Examination

a. Written examination

Course Outcomes: The Student will be able to

CO1: Apply the knowledge of relevant laws and different theorems for analyzing a given electric circuit.

CO2: Develop a clear understanding and acquire the knowledge of basic principles, working and applications of DC machines and single phase transformer.

CO3: Understand the basics of semiconductor physics, diode, Zener Diode and BJTs, their different configurations and applications.

CO4: Understand the input and output characteristics of different configurations of BJT. CO5: Develop a clear understanding of digital circuits like half adder, full adder and logic gates.


CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 -- -- -- -- -- -- -- -- -- -- -- 3

CO2 3 3 -- -- -- -- -- -- -- -- -- -- -- 3

27

CO3 3 3 -- -- -- -- -- -- -- -- -- -- -- 3

CO4 3 3 -- -- -- -- -- -- -- -- -- -- -- 3

CO5 3 3 -- -- -- -- -- -- -- -- -- -- -- 3

Benchmarked against similar courses in other national/ international universities /organizations

S. No.

Name of the Course Name of University where it is offered

1 Basic Electrical and Electronics Engineering

COEP

Name of Members Dr. Jayant Jagtap Ms. Sushma Parihar

Designation Asst. Professor Asst. Professor


Signature

Name of Experts Dr. Neela Rayavarapu

Designation Professor Head E&TC

Org. / Inst. SIT

Signature

Signature of Dean:

Date:

28


Specialization: Mechanical Engineering CourseName : Engineering Mechanics

(UG/PG) :UG

Number ofCredits 3

Level 1

Learning Objective(s) The student will be able to:

1. Define terms statics and dynamics and theirprinciples. 2. Outline free body diagram and describe the same for equilibriumcondition. 3. Recall types of beams and supports and methods of analyzingbeams. 4. Recall and select appropriate method of analysis oftrusses. 5. Recall method of analyzing cables. 6. Recognize frictional forces acting on a body and state the quantum offorces. 7. Relate Newton’s laws of motion to particlemotion. 8. State work energy principle for Rectilinear and curvilinearmotion. 9. Identify and describe rectilinear motion, curvilinear motion and circular motion.

Pedagogy 1. Interactive classroom teaching & discussions about principles of statics and dynamics,

understanding to draw free body diagram, application of equilibrium conditions, principle of dynamics, work energy principle and related laws

2. Practical examples to explain forces acting on bodies such as trusses, cables, beams, bodies subjected to friction, motion of particles under gravity, kinetics and kinematics ofbodies

29

Sr.No. Topic Hours 1 Resultant of coplanar force system

Principle of statics, force systems, resolution and composition or forces, resultant or concurrent forces, moment of a force, couple, Varignon’s theorem, equivalent force couple system, resultant of parallel and general force system, distributed forces, centroid of plane lamina and wire bends.

8

2 Equilibrium of Force system Free Body Diagram (FBD), equilibrium of concurrent, parallel and general forces in a plane, equilibrium of three forces in a plane, types of beams, simple and compound beams, type of supports and reaction, resultant and equilibrium of concurrent forces.

8

3 Analysis of structures and friction Analysis of plane trusses by method of joint and method of section, cables subjected to point loads, friction: application of friction to inclined plane, wedges, ladders, flat belt.

8

4 Rectilinear motion of particle Kinematics: Introduction to dynamics and basic concepts, braches of mechanics, types of motion of particle and rigid body with examples (translation, rotation), comparative study of terms used in rectilinear and circular motion, kinematical equations for rectilinear and circular motion for constant velocity, constant acceleration, equations of motion under gravity, variable acceleration, motion curves, relative motion kinetics: Newton's second law of motion, dynamicequilibrium, and concept of FBD, application to problems on horizontal plane, inclined plane, lift dependent motion and others.

8

5 Kinetics of particle and Rigid body Energy and momentum methods for particle: work, energy, power, conservation of energy, work energy principle for rectilinear and curvilinear motion, concepts of impulse, linear momentum etc. conservation of momentum, impulse momentum principle, direct central impact, coefficient of restitution.

8

6 Curvilinear motion of particles Kinematics-basic concepts, equation of motion in cartesian, path and polar coordinate, motion of projectile, kinetics- Newton's second law of motion, motion in cartesian and path coordinate of a particle.

8

Course Overview Books Recommended

1. F. P. Beer and E. R. Johnson Mechanics for Engineers - Statics Fourth Edition, McGraw-HillPublication.

30

2. F. P. Beer and E. R. Johnson, Mechanics for Engineers - Dynamics Fourth Edition, McGraw-HillPublication.

3. J. L. Meriam and Craige , Engineering Mechanics statics and dynamics, John Willey and Son’spublication.

4. S. P. Timoshenko and D. H. Young Engineering Mechanics, McGraw-Hill publication

Research Papers/Articles recommended for reading Yuanshan Lin, Di Wu, Xin Wang, Xiukun Wang, and Shunde Gao(2012), Statics- Based Simulation Approach for Two-Crane Lift, Journal of Construction Engineeringand ManagementOct 2012, Vol. 138, No. 10, pp. 1139-1149.

Suggested Evaluation Methods A. ContinuousAssessment

1. Essential a. Unittest b. Assignments c. Presentation d. Quiz


B. End SemesterExamination 1. Written Exam 2.Viva-voce

Course Outcomes:

The student will be able to

CO1 Determine the components of a force in rectangular or non- rectangular co-ordinates, resultants and apply conditions of static equilibrium to plane force systems.

CO2 Draw complete and correct free-body diagrams and write the appropriate equilibrium equations.

31

CO3 Determine the support reactions of structures and analyse trusses. Recognize

frictional forces acting on a body and analyse.

CO4 Relate Newton’s laws of motion to particlemotion.

CO5 Identify and distinguish between rectilinear motion, curvilinear motion and circularmotion.

CO6 Describe and apply basic dynamics concepts - the Work-Energy principle and Impulse-Momentum principle.



PO1

PO2

PO3

PO4

PO5

P06

PO7

PO8

PO9

PO10

PO11

PO12

PSO1

PSO2

CO1

3

2

1

-

-

1

-

1

1

1

-

1

-

-

CO2

2

2

1

-

-

1

-

1

1

1

-

1

-

-

32

CO3

3

2

1

-

-

1

-

1

1

1

-

1

-

-

CO4

3

2

1

-

-

1

-

1

1

1

-

1

-

-

CO5

3

2

1

-

-

1

-

1

1

1

-

1

-

-

CO6

3

2

1

-

-

1

-

1

1

1

-

1

-

-

Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it was offered

1 Mechanics IIT Kharagpur 2 Engineering Mechanics Pune University

Sub specialization Committee Nameof Member

Deepti Ramesh Prasanna Pentlavalli

Designation Assistant Professor Assistant Professor

Org. / Inst. SIT, Pune SIT, Pune

Signature

Signature of Dean:

Date:

33


Specialization: Mechanical Engineering Course Title : Engineering Graphics Number of Credits : 4 Level : 1 Learning Objectives/Outcomes:

a) Discuss concept of graphic communication, their type, and role in industries. b) Compare different types of lines, dimensioning methods, scales, lettering and its

application. c) State basic concepts of drawing in 1st and 3rd angle projections. d) Understand the purpose and function of sectional views. e) Discuss how ribs, holes and lugs are represented in section views. f) Interpret engineering drawings that comply with drawing standards g) Convert pictorial (3-D) drawings to orthographic (2-D) drawings and vice versa. h) Understand projections of points, lines and regular solids

Pre-learning: Geometry and use of geometrical instruments Course Outline: Unit No. Topic Hours

1 Lines, Lettering, Dimensioning and Scales: Introduction of drawing instruments and its uses, sizes of drawing sheets and layout, different types of lines used in drawing practice, methods of dimensioning–aligned and unidirectional system, general rules for dimensioning.

02

2 Orthographic Projections: Principal planes of projection - Horizontal plane or horizontal reference plane, vertical plane or frontal reference plane, profile planes of projection, first and third angle methods of projection. Orthographic projections, sectional views: - full, half, partial (broken or local), offset, revolved, removed sections.

16

3 Projection of Points and Lines: Projection of points, projections of lines, inclined to both the principle planes, (lines fully lying in the first quadrant only), traces of lines(to locate only HT,VT). No application oriented questions

14

4 Projection of Planes: Projections of planes such as triangle, quadrilateral, regular polygon, 14 34

circle.etc, oblique planes.

5 Projection of solids: Projection of solids such as tetrahedron, cube, right regular prism and pyramid, cylinder, cone, axis of the solid inclined to HP and VP

14

Pedagogy: 1. Classroom teaching 2. Tutorials 3. Experiential Learning

Books Recommended: 1. Elementary Drawing, N. D. Bhatt, Charotar Publishing house, Anand, India 2. Fundamentals of Engineering Drawing, W. Luzzader, Prentice Hall of India, Delhi 3.Engineering Drawing, Basant Agarwal, Mc Graw Hill Publications Suggested Assessment/ Evaluation Methods:

1. Continuous Assessment 1. Unit tests 2. Quiz 3. Assignment based on experiential learning 4. Viva

a) End Semester Examination

1. Drawing examination Course Outcomes:

The student will be able to CO1 Visualize and communicate 3D regular/irregular shapes as 2D engineering drawings and vice versa using orthographic and sectional orthographic principles CO2 Understand and draw projections of points (0D) located in four quadrants CO3 Visualize, plan and draw projections of lines (1D) and planes (2D) (inclined to both planes of projection) CO4 Visualize and draw projections of regular solids (3D) (inclined to both planes of projection)



CO1 3

CO2 3 1

CO3 3 2

CO4 3 1

35

Parallel/Similar courses the existing curriculum

S.No. Name of the course Institute where it was offered 1 Engineering Graphics Mumbai University 2 Engineering Graphics Pune University

Designation Head,Workshop

Department

Org. / Inst. SIT

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date: 36

Faculty of Engineering Specialization: Applied Science

Course Name: Communication Skills

(UG/PG): UG

Numberof Credits: 03

Level: 1

Learning Outcomes

The students will be able to: 1. Define the concept and understand the meaning ofcommunication. 2. Describe types and stages of communication facilitating their effective application in actual situation. 3. Dramatize and sketch their creative side in formal as well as informalcommunication. 4. Employ and manipulate etiquettes in oral and writtencommunication. 5. Recognizethebarrierstoeffectivecommunicationinaccordancewiththedesignforall types ofcommunication. 6. Assess and evaluate their communication with respect to their personality and discover a new side in

developing themselves through the model of Johariwindow. 7. Enhance their listening skills, speech decoding and discourseanalysis. 8. Interpret and illustrate body language along with spoken English in group discussion, presentations and

jobinterviews. 9. Recognize and reproduce the basics of writing skills and demonstrating their use in formal and

informalcorrespondence. 10. Express ideas and concepts well through vocabulary building, aptitude test and mind mapping.

Pedagogy

1. Lectures 2. Language-Lab 3. Activity- basedLearning 4. Presentations / seminars /extempore 5. GroupDiscussions 6. IndividualTasks 7. Assignments

Course Outline

37

Pre-requisites

None

Books Recommended 1. “Effective Technical Communication” by M Ashraf Rizvi, Tata McGraw Hill Publishing Company Ltd.

2. “Basic Managerial Skills for all” E. H. McGrath, Eastern Economy Edition, Prentice HallIndia.

3. “Developing Communication Skills” Krishna Mohan, MeeraBanerji, McMillan IndiaLtd.

4. “Principles and practice of Management” Dr. P.C. Shejwalkar, Dr. Ghanekar and Dr. Bhivapathaki, Everest PublishingHouse.


A. ContinuousAssessment 1. Essential

a) Unittests b) Assignments

B. Optional a) Quizzes b) Classtest c) Seminars


1. Oralexamination

Course Outcomes (CO):

Sr. No. Topic Hours

1. Fundamentals of Communication Concept and meaning of communication, objectives of communication, methods of communication, types of communication, process of communication. Importance of effective communication, manners and etiquettes in communication, barriers to effective communication, interpersonal communication- the Johari window.

9

2 Listening skills Listening process, hearing and listening, types of listening, barriers to listening, effective listening strategies, listening in conversational interaction, listening to structured talks, pre-listening analysis, team listening.

7

3 Speaking Skills Conversation and oral skills, self-expression, spoken English, body language, speaking techniques, styles of communication, job interview, negotiation skills, group discussion, presentation skills, customer relationship skills.

7

4 Writing and Reading Skills The basics of writing, the process of writing, resume writing, job applications, SOP, business letters, email writing, article writing, report writing, vocabulary building, grammar aptitude tests, creativity and mind-mapping, the SQ3R method, speed reading.

7

38

CO1. Identify/ Recognize the barriers to effective communication in accordance with all types of communication; avoid or overcome them.

CO2. Constructing sentences effectively using grammar and vocab

CO3 Communicate/ express effectively in a range of settings.

CO4 Employ etiquettes in oral and written communication.

CO5 Demonstrate the basics of writing skills and use in business and technical correspondence.

2. Course ArticulationMatrix: Enter correlation levels 1, 2 or 3 as defined below:

1:Slight(Low) 2:Moderate (Medium) 3: Substantial(High)

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PS01 PS02

1 - - - - - - - - 1 1 1 2 - 1 2 - - - - - - - - 2 3 1 2 2 1 3 - - - - - - - - 2 3 2 2 2 2 4 - - - - - - - - 2 2 1 2 2 - 5 - - - - - - - - 1 3 - 2 2 1

Parallel/Similar courses in the existing curriculum

Sub specialization committee

Name of Member

Dr. Arundhati Warke Dr. Neha Divekar

Designation

Associate Professor Assistant Professor

Org. / Inst. Symbiosis Institute of Technology

SIT

Signature

Name of the Expert:

Signature: Date:

S.No. Name of the course Institute where it was offered 1 Communication Skills (Basic / Advanced) IIT Roorkee 2 English Communication2 Nirma University

39



Course Title : Basic Electrical and Electronics Engineering Lab


Level : 1

Learning Outcomes:

1. Explain the need of various safety precautions to be undertaken while working with an

electrical equipment.

2. Discuss different wiring components and different wiring schemes.

3. Verify Ohm’s law.

4. Verify Kirchhoff’s voltage and current laws.

5. Study truth table of various logic gates.

6. Plot forward and reverse bias characteristics of Silicon diode, LED and Zener diode.

7. Plot input and output characteristics of different BJT configurations.

8. Operate and understand various controls in CRO and DMM.

9. Compare the performance of various rectifier circuits.

Pre-learning: None Course Outline:

Exp. No.

Name of Experiment Hrs

1

Wiring Exercises a)Safety Precautions b)Study of various Electrical components (wires, switch, fuse, socket, plug, lamp, lamp holders etc and their uses and ratings) c)Study of Resistor color code

4

2 Study of CRO. 2

3 Study of DMM. 2

4 To verify Ohm’s Law the relationship between current, voltage and resistor. 2

40

5 To verify Kirchhoff’s voltage and current law in dc circuits. 2

6

a) To obtain the V-I characteristics of PN junction b) To obtain the V-I characteristics of PN junction and Zener diode c) To obtain the V-I characteristics of PN junction and LED

2

7 To verify truth table of basic logic gates. 2

8 Study of Half Wave Rectifier Circuit 2

9 a) Study of Full center tap b) Bridge rectifiers. 2

10 To design Half Adder circuit and verify its truth table 2

11 To study the input and output characteristics of BJT in CE configuration. 2

Pedagogy Laboratory experiments

Books Recommended 1. “Basic Electrical Engineering”, Nagrath and Kothari, TMH,3rd Edition.

2. “Basic Electrical Engineering”, Fitzgerald and Higinbotham, McGraw Hill, 5th Edition

3. “Electronics Devices & Circuits” Millman & Halkias, McGraw Hill.

4. “Integrated Electronics” Millman & Halkias, McGraw Hill.

5. “Electronics Fundamentals and Applications”, D. Chattopadhay & P. C.

Rakshit, New Age.


A. Continuous Assessment a. Journal Evaluation b. Viva

B. End Semester Examination 1. Practical examination 2. Viva

Course Outcomes

CO1: Understand the need of various safety precautions to be undertaken while working with electrical equipment and learn different wiring components and wiring schemes.

CO2: Apply the knowledge of relevant laws and principles and familiarize with different theorems and analytical approaches for solving a given electric circuit.

CO3: Develop a clear understanding of the characteristics of basic semiconductor devices like, pn junction diode, Zener Diode and BJTs, their different configurations and applications.

41

CO4: Use and understand different controls of equipment like CRO and DMM.

Course Articulation Matrix: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)CO4:

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO13 PSO1 PSO2

CO1 2 1 - - 3 - - - 3 1 - - 1 - 3 CO2 3 3 - - 3 - - - 3 1 - - 1 - 3 CO3 3 3 - - 3 - - - 3 1 - - 1 - 3

CO4 2 2 - - 3 - - - 3 1 - - 1 - 3


S. No.


1 Basic Electrical and Electronics Engineering Lab

VIT Vellore

Name of Members Dr. Jayant Jagtap Ms. Sushma Parihar



Signature

Name of Experts Dr. Neela Rayavarapu

Designation Professor Head E&TC

Org. / Inst. SIT

Signature

Signature of Dean:

Date:

42


Specialization: Mechanical Engineering CourseName : Engineering mechanics Lab

(UG/PG) :UG

Number ofCredits 01

Level 01

Learning Objective(s) The students will be able to:

1. Verify Law of polygon offorces. 2. Calculate beam reaction. 3. Study and compute coefficient offriction. 4. Calculate forces in the members of jibcrane. 5. Calculate forces in the members of rooftruss. 6. Calculate forces in the members of shearleg. 7. Study forces inspace. 8. Study and compute gradually varied flowprofiles. 9. Understand phenomenon of hydraulic jump. 10. Study calibration of Standing Wave Flume / Venturi / Parshalflume.

Pedagogy 1. Interactive laboratory sessions and practical’s on Law of polygone of forces, law of triangle, law

ofmoments 2. Mini project based on forces inspace 3. Presentation based forces in the members of roof truss, shear leg and jibcrane 4. Field visit to study screw jacks and liftingmachines 5. Case study on wedge friction

Course Outline

Sr. No. Topic Hours

1. Verification of law of parallelogram of forces/ polygon of forces. 04 43

2. Support reaction of simple beam 04

3. Determination of coefficient friction of belt/inclined plane 02

4. Determine forces in Space Force System. 04

5. Verification law of moment using Bell crank lever 02

6 To find forces in the members of Jib crane, Roof truss, Shear leg Apparatus. 06

7. To find efficiency of screw jack 02

8. To study curvilinear motion 02

9. Study of compound pendulum 02

10. Study of flywheel. 02

Books Recommended 1. F. P. Beer and E. R. Johnson Mechanics for Engineers - Statics Fourth Edition, McGraw-

HillPublication. 2. F. P. Beer and E. R. Johnson, Mechanics for Engineers - Dynamics Fourth Edition, McGraw-

HillPublication. 3. J. L. Meriam and Craige , Engineering Mechanics statics and dynamics, John Willey and

Son’spublication. 4. S. P. Timoshenko and D. H. Young Engineering Mechanics, McGraw-Hill publication.

Research Papers/Articles recommended for reading 1.Yuanshan Lin,Di Wu,Xin Wang,Xiukun Wang, andShunde Gao(2012), Statics-Based Simulation

Approach for Two-Crane Lift,Journal of Construction Engineering and ManagementOct 2012, Vol. 138, No. 10, pp. 1139-1149.

Suggested EvaluationMethods A. ContinuousAssessment:

1. Essential a. Term work, journal, presentation,assignment b. Assignments based on labsessions, c. Mini Project and Projectreport.

2. Optional a. Presentation based on casestudies b. Quizzes

44

Course Catalog FOE UG Academic Year 2015-16 of 3

B. End SemesterExamination 1. Practical examination 2. viva-voce

Course Outcomes:

The student will be able to

CO1 Illustrate law of parallelogram of forces/ polygon offorces.

CO2 Support reaction of simple beam and compound beam

CO3 Determine coefficient friction of belt/inclinedplane

CO4 Illustrate law of moment using Bell

cranklever CO5 Demonstrate curvilinearmotion

CO6 Understand basics of compound pendulumn through experiment and basics of moment of Inertial withuse osflywheel




CO1 3

1

-

-

-

1

-

1

3

2

-

1

-

-

CO2 3

1

-

-

-

1

-

1

3

2

-

1

-

-

CO3 3

1

-

-

-

1

-

1

3

2

-

1

-

-

CO4 3

1

-

-

-

1

-

1

3

2

-

1

-

-

CO5 3

1

-

-

-

1

-

1

3

2

-

1

-

-

CO6 3

1

-

-

-

1

-

1

3

2

-

1

-

-

45


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered

1 Engineering mechanics Lab Pune University 2 Engineering mechanics Lab Mumbai University

Sub-Specialization Committee

Nameof Member

Prof. Deepthi Ramesh

Prof. Vinay Jatti



Signature

Signature of Dean: Date:

46



CourseName: Communication SkillsLab

(UG/PG): UG

Numberof Credits: 01

Level: 1

Learning Outcomes The students will be able to:

1. Cultivate the habit of reading passages from the computer monitor, thus providing them with the required facility to face computer-based competitive exams such GRE, TOEFL, GMATetc.

2. Maintain good linguistic competence- through accuracy in grammar, pronunciation and vocabulary.

3. Facilitate effective application of the various stages of communication in actual situations. 4. Dramatize and sketch their creative side in formal as well as informalcommunication. 5. Employ and manipulate etiquettes in oral and writtencommunication. 6. Recognize the barriers to effective communication in accordance with the design for all types

ofcommunication. 7. Assess and evaluate their communication with respect to their personality and discover a new

side in developing themselves through the model of Johariwindow. 8. Enhance their listening skills using speech decoding and discourseanalysis. 9. Interpret and illustrate body language along with spoken English in group discussion,

presentations and jobinterviews. 10. Recognize and reproduce the basics of writing skills and demonstrating their use in formal and

informalcorrespondence. 11. Express ideas and concepts well through vocabulary building, aptitude test and mind

mapping.

47


Pedagogy

1. Dogme languageteaching 2. Picture descriptiontechnique

3. Activity- basedlearning 4. Presentations / seminars /extempore 5. Groupdiscussions 6. Listening tasks 7. Individualtasks 8. Personalitytests 9. Learning through videos, movieclips

Pre-requisites

None

Course Outline

Sr. No. Topic Hours

1. Fundamentals of Communication a. manners and etiquettes incommunication b. interpersonalcommunication c. using audio-visual clips to enhance communicationskills d. personalitytests

4

2 Listening Skills a. listening to audio lectures and answeringquestionnaire b. listening to audio conversations and answeringquestions

3

3 Speaking Skills a. conducting mock jobinterview b. groupdiscussion c. presentationskills d. role-play e. brainstorming and speaking on the assignedtopic f. publicspeaking g. debate h. extempore i. negotiationskills

4

4 Writing and Reading Skills a. vocabulary building throughtests b. grammar aptitudetests c. using creativity and mind-mapping for picturedescription

4

48


Books Recommended

1. “Effective Technical Communication” by M Ashraf Rizvi, Tata McGraw Hill Publishing CompanyLtd. 2. “Basic Managerial Skills for all” E. H. McGrath, Eastern Economy Edition, Prentice HallIndia. 3. “Developing Communication Skills” Krishna Mohan, MeeraBanerji, McMillan IndiaLtd. 4. “PrinciplesandpracticeofManagement”Dr.P.C.Shejwalkar,Dr.GhanekarandDr.

Bhivapathaki, Everest Publishing House.

5. “Business Communication Today” by Courtland L. Bovee, John V. Thill, Barbara E. Schatzman, Hardcover:730 pages, Publisher: PrenticeHall.

6. “Excellence in Business Communication (6th Edition) by John Thill, Courtland L. Bovee, and Paperback: 656 pages, Publisher: PrenticeHall.

7. “Essentials of Business Communication with Student CD-ROM” by Mary Ellen Guffey, Paperback: 511 pages, Publisher: South-WesternEducational.

Suggested EvaluationMethods A. ContinuousAssessment

1. Essential a) Labwork b) Assignments

2. Optional a) Language aptitudetest b) Class test c) Presentations

B. End SemesterExamination Oralexamination

Course Outcomes (CO): CO1. Express ideas and concepts well through vocabulary building, aptitude tests, mind

mapping and brain storming.

CO2. Demonstrate linguistic competence- through accuracy in grammar, pronunciation and vocabulary.

CO3. Employ etiquettes in oral and written communication.

CO4. Modify their listening skills.

CO5. Sketch their articulation while participating in Group discussions, debate or job interviews.


49


Enter correlation levels 1, 2 or 3 as defined below:

1:Slight(Low) 2:Moderate (Medium) 3: Substantial(High)

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO 1

PSO 2

1 - - - - - - - - 2 2 1 1 2 1 2 - - - - - - - - 2 2 1 1 2 1 3 - - - - - - - - 3 3 1 1 2 - 4 - - - - - - - - 2 2 1 1 2 1 5 - - - - - - - - 2 2 1 1 1 2


Sr.No. Name of the course Institute where it was offered 1. Communication Skills (Basic /

Advanced) IIT Roorkee


Name of Member


Designation Associate Professor Assistant Professor


Signature

Name of the Expert:

Signature:

Date:

50



Specialization: Computer Science and Information Technology Course Name: Discrete Structures (UG/PG): UG Number of Credits: 4 Level: 2 Learning Objectives The students will be able to:

1. Describe the use of formal logic proofs and logical reasoning to solve problems. 2. Explain the concepts of permutation, combination and discrete probability. 3. Summarize the characteristics of functions and relations. 4. Generalize the ideas of mathematical induction to recursion and recursively defined structures. 5. Discuss graphs and trees related algorithms such as Prim’s and Kruskal’s. 6. Review the basics concepts of groups and rings

Pedagogy

1. Interactive sessions on the fundamentals of logic proofs and logical reasoning. 2. Class room teaching for the different concepts of functions, relations, graphs and trees 3. Tutorials on all the concepts involved in discrete structures

Pre-requisites None

51


Course Outline S.No. Topic Hours

1

Logic and proofs Propositions -conditional propositions, logical connectivity, prepositional calculus, universal and existential quantifiers, proofs and proof techniques. Set theory - set, combination of sets, finite and infinite sets, un-countably infinite sets, principle of inclusion and exclusion, mathematical induction.

12

2

Permutations, combinations and discrete probability Permutations and combinations: rule of sum and product, permutations, combinations, algorithms for generation of permutations and combinations. Discrete probability: conditional probability, information and mutual information, binomial coefficients and combinatorial identities.

12

3

Relations, functions and recurrence relations Relations:definitions, properties of binary relations, equivalence relations and partitions, partial ordering relations and lattices, chains and anti chains. Functions: definitions, domain, range, one-to-one and onto, inverse and composition, pigeonhole principle, discrete numeric functions and generating functions, job scheduling problem. Recurrence relations:recurrence relation, linear recurrence relations with constant coefficients, homogeneous solutions, total solutions, solutions by the method of generating functions

12

4

Graphs and trees Graphs: basic terminology, multi graphs and weighted graphs, paths and circuits, shortest path in weighted graph, Hamiltonian and Eulerian paths and circuits, factors of a graph, planer graph and Travelling Salesman Problem. Trees:trees, rooted trees, path length in rooted trees, prefix codes, binary search trees, spanning trees and cut set, minimal spanning trees, Kruskal’s and Prime’s algorithms for minimal spanning tree, the Max Flow –Min Cut Theorem (transport network).

12

5 Basics of groups and rings Algebraic systems, groups, semi groups, monoid, , isomorphism and automorphisms 12

Books Recommended 1. “Elements of Discrete Mathematics”, C. LIU, 2nd Edition, Tata McGraw-Hill, 2002, ISBN 0-07-043476-

X. 2. “Discrete Mathematics”,R. Johnsonbaugh, 5th Edition, Pearson Education, 2001 ISBN 81 – 7808 –

279 – 9. 3. “Discrete Mathematics”, N. Biggs, 2nd Edition, Oxford, 2002 ISBN 0 –19 – 850717 – 8. 4. “Graph theory with application to Engineering and Computer Science”, N. Deo, Prentice Hall of India,

1990, 0 – 87692 – 145 – 4. 5. “Discrete Mathematical Structures”,B. Kolman, R. Busby and S. Ross, 4th Edition, Pearson Education,

2002, ISBN 81-7808-556-9. 6. “Discrete Mathematical Structures with application to Computer Science”, J. Tremblay, R. Manohar,

Tata McGraw-Hill, 2002 ISBN 0-07-463113-6 (Recommended for prepositional Calculus) F. Harary, “Graph Theory”, Narosa Publishing House, 1988 ISBN 81 – 85015 – 55 – 4

52


Research Papers/Articles recommended for reading 1. RobertJ., “Johnson Universal cycles for permutations”,Volume 309, Issue 17, 6 September 2009, Pages

5264–5270. 2. Hausera H. and Koutschanc C., “Multivariate linear recurrences and power series division”Volume

312, Issue 24, 28 December 2012, Pages 3553–3560. 3. BoykettT., “Rectangular groupoids and related structures”,Volume 313, Issue 13, 6 July 2013, Pages

1409–1418. 4. Bua Y. and Zhua X., “ Backbone coloring for graphs with large girths”,Volume 313, Issue 18, 28

September 2013, Pages 1799–1804.

Suggested Evaluation Methods A) Continuous Assessment

1. Essential a) Unit Test b) Tutorials c) Assignments


B) End Semester Examination a) Written Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Discrete Structures and

Graph Theory COEP,Pune

Sub-specialization committee

Name of Member Shraddha Phansalkar

Manisha Tijare Rahul Joshi Poorva Agarwal






Signature Name of the Expert:

Signature: Date:

53



Course Name: Programming Paradigms (UG/PG): UG Number of Credits: 3 Level: 2 Learning Objectives The students will be able to:

1. Learn various types of programming languages. 2. Outline the objectives of procedural programming. 3. Familiarize with the C++ language by using object oriented programming concepts. 4. Understanding the concepts of logic programming. 5. Illustrate the concept of Polymorphism, Inheritance and virtual functions. 6. Learn basic concepts of functional programming.

Pedagogy

1. Classroom teaching 2. Brainstorming session 3. Interactive Sessions

Pre-requisites None Course Outline S.No. Topic Hours

1

Introduction Role of programming languages, need to study programming languages, characteristics of good programming languages, introduction to various programming paradigms: procedural, object-oriented, logic and functional programming, procedural vs. object oriented programming.

5

2

Procedural programming Data Types: properties of structured and non-structured data types and objects, variables, constants, derived and abstract data types, declaration, type checking, type conversion and storage representation of data types and control flow statement. Procedural programming: design principles, control flow: statement-oriented and block-oriented structure programming, execution steps, desirable and undesirable characteristics of procedural programming.

8

3 Object Oriented Programming with C++ Object oriented programming concepts: class, object, data abstraction, encapsulation, inheritance, polymorphism, dynamic binding, and message

10

54


passing, object oriented languages, benefits and applications of OOP, design principles: objects, classes, creation, accessing class members, access specifies: private vspublic, methoddefinition, inline implementation, constant member functions, static member functions, friend functions, static data members, constructor and their types, destructor. Introduction to C++: difference between C and C++, structure of C++ program, tokens, manipulator, expressions, explicit and implicit conversion of data type.

4

Polymorphism, Inheritance and Virtual Functions Polymorphism : definition of polymorphism, rules for overloading, overloading member functions, need of operator overloading, prefix and postfix, overloading binary operators, operator overloading, , in stream/out stream operator overloading. Virtual functions : importance of virtual function, function call binding, virtual functions, implementing late binding, need for virtual functions, abstract base classes and pure virtual functions, virtual destructors. Inheritance : definition of inheritance, protected data, private data, public data, inheriting constructors and destructors, virtual base classes, constructors and destructors of derived classes, order of invocation, types of inheritance : single inheritance, hierarchical inheritance, multiple inheritance, multilevel inheritance, hybrid inheritance.

12

5

Logic Programming with Prolog Logic programming language model, logical statements, resolution, unification, search structures: backward and forward, applications of logic programming, program structure, logical variable, syntax structure, control structure, depth-first search, backtracking, prolog facilities and deficiencies.

6

6 Functional Programming with LISP Elements of functional programming, function declaration, expression evaluation, type checking.

4

Books Recommended 1. “Object oriented programming with C++”,E Balagurusamy., McGraw Hill, 1994. 2. “Foundations of Programming Languages”,Roosta S., Thomson Brookes/Cole, 1993. 3. “Programming Languages concepts & constructs”, Sethi R., Pearson Education, 1995. 4. “Concepts of Programming Languages “, Scbesta R., Pearson Education, 1993.

Research Papers/Articles recommended for reading 1. Ghezzi C. , Milano P., Jazayeri M., “Programming Languages Concepts,” 3rd Edition, John Wiley and

Sons Pvt. Ltd (WSE), ISBN – 019511306 2. Winston P., Klaus B. and Horn P., "LISP", 3rd Edition, Pearson Education, 81 - 7808 -155-5. 3. Nørmark, Kurt,“Overview of the four main programming paradigms”, Aalborg University, 9 May

2011. Retrieved 22 September 2012,http://people.cs.aau.dk/~normark/prog3-03/html/notes/paradigms_themes-paradigm-overview-section.html

4. Paul W. Oman, Curtis R. Cook, “A paradigm for programming style research”,(Citations: 8), Journal: Sigplan Notices - SIGPLAN , vol. 23, no. 12, pp. 69-78, 1988, DOI: 10.1145/57669.57675



55



2. Optional a) Quizzes

b) Mini Project B) End Semester Examination

a) Written Exam Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Paradigms of Programming IIT Madras 2 Programming Paradigms Pune University Sub-specialization committee

Name of Member Shilpa Pawar Meeta Kumar Swati Ahirrao Kalyani Kadam







Date:

56



Course Name: Fundamentals of Data Structures (UG/PG): UG Number of Credits: 4 Level: 2 Learning Objectives The students will be able to:

1. Review the C language concepts such as loops, functions, macros and array. 2. Explain the basics of data structure such as sorting and searching. 3. Discuss the implementation of linear and circular queue and priority queue. 4. Discuss the static implementation of stack, queue using an array. 5. Summarize hashing functions such as collision resolution, linear probing and quadratic probing.

Pedagogy

1. Classroom teaching 2. Demonstrations to justify the application of a data structure

Pre-requisites None

57



1

C Language Concepts Constants, variables and keywords in C, operators and control structure in C(decision, loop and case), functions, macros, arrays and string manipulation, structure, union, enumeration, bitwise operations, pointers. Functions: parameter passing call by value and call by reference, scope rules, functions and pointers, function returning pointer and pointer to function, passing and returning structure as parameter for function ,structure and pointer. Recursion: definition, writing recursive functions & how recursion works.

15

2

Data Structures Basics Introduction to algorithms and pseudo code in C, introduction to searching and sorting techniques, searching methods: linear and binary search. Sorting methods: bubble, insertion, selection, merge, quick. Introduction to data structures: concept of data, data object, data structure, Abstract Data Type (ADT), classification of data structures.

15

3

Queue Concept of queue, queue as an ADT, implementation of linear and circular queue using an array, concept of multiqueues, dequeue and priority queue, application of queues.

10

4

Stack Concept of stack, Stack as an ADT, implementation of stacks using an array, concept of multistacks, applications of stacks: expression conversion, expression evaluation, recursive functions.

10

5

Hashing Hash function, address calculation techniques, common hashing functions, collision resolution, linear probing,quadratic probing, double hashing, bucket hashing, deletion and rehashing.

10

Books Recommended 1. ““Data Structures: A pseudo code approach with C”, R. Gilberg,B. Forouzan, Cenage Learning, 2nd

Edition October 11, 2004, ISBN 9780534390808. 2. “Fundamentals of Data Structures in C”, E. Horowitz, S.Sahani and S.Anderson-Freed,

ISBN 10:8173716056, University Press, 2nd Edition 2007. 3. “Let us C & Pointer in C”, Yashwant Kanitkar, ISBN9788183331630,BPB,13thEdition 2013 . 4. “Data structures & Program Design in C”, Robert Kruse, C.L.Tondo, Bruce Leung

ISBN 9780132883665, Pearson, 4th Edition 2009. 5. “Data structure using C”, AM Tanenbaum, Y Langsam & MJ Augustein,ISBN 9788131702291 Pearson Prentice HallIndia,9th Edition 2009 6. “Data structure & Algorithm Analysis in C++”, Weiss, Mark Allen, ISBN-032144146X, Addison Wesley, 3rd Edition 2007.

Research Papers/Articles recommended for reading 1. Ge Y., Zhao J.,”A practical data structure and algorithm research on drawing and editing vector

graphics”,Information Computing and Telecommunications (YC-ICT), 2010 IEEE Youth Conference on ,28-30 Nov. 2010 Print ISBN:978-1-4244-8883-4 .

58


2. Dong C., “Research of shortest path algorithm based on the data structure”,Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on ,22-24 June 2012 Print ISBN:978-1-4673-2007-8.






Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 PROGRAMMING AND DATA

STRUCTURES IIT Kharagpur

2 PROGRAMMING AND DATA STRUCTURES

IIT Madras


Name of Member Suman Tanwar Kalyani Kadam

Meeta Kumar Ambika Pawar







Date:

59



Course Name: Computer Organization (UG/PG): UG Number of Credits: 4 Level: 2 Learning Objectives Students will be able to:

1. Classify computer components, interconnection structures, bus interconnection and apply various arithmetic algorithms on signed as well as unsigned numbers.

2. Identify machine instructions, organization of processor and register and pipelining techniques. 3. Recognize Control Unit operations and design methods. 4. Distinguish between Read Only Memory (ROM) and Random Access Memory (RAM), discuss

high-speed memories, virtual memory and demonstrate replacement algorithms. 5. Classify mapping techniques used by the processor. 6. Demonstrate the management of input/output systems and discuss about buses, standard

interfaces and peripherals. Pedagogy A) Interactive classroom teaching. B) Brainstorming sessions. C) Tutorials.

Pre-requisites

None Course Outline

60


Books Recommended 1. William Stallings, “Computer Organization and Architecture: Designing for performance”, 9th

Edition, March 11, 2012, Prentice Hall of India, ISBN-13: 978-0132936330. 2. C. Hamacher, V. Zvonko, S. Zaky, “Computer Organization and Embedded Systems”, 6th Edition,

January 27, 2011, Tata Mc Graw Hills, ISBN-13: 978-0073380650. 3. J. Hays, “Computer Architecture and Organization”, 3rd edition, September 3, 2002, Tata Mc Graw

Hill, ISBN-13: 978-0072861983. 4. William Stallings, “Computer Organization and Architecture: Principles of structure and

function”, 3rd Edition, September, 1992, Maxwell Macmillan Editions, ISBN-13: 978-0024154958 .

5. Andrew Tanenbaum, “Structured Computer Organization”, 6th Edition, August 4, 2012, Prentice Hall of India, ISBN-13: 978-0132916523.

6. G. George, “Computer Organization: Hardware and Software”, 2nd Edition, 1986,Prentice Hall of India, ISBN-13: 978-0131653252.

S.No. Topic Hours

1.

Computer Evolution & Arithmetic A brief history of computers, designing for performance, Von Neumann architecture, computer components, interconnection structures, bus interconnection, fixed and floating point numbers, signed numbers, integer arithmetic, 2’s complement method for multiplication, booths algorithm, hardware implementation, division, restoring and non restoring algorithms for division, floating point representations, IEEE standards, floating point arithmetic.

14

2.

The Central Processing Unit Machine instruction characteristics, types of operands, types of operations, addressing, instruction formats, processor organization, register organization, instruction cycles, instruction pipelining, ALU – Combinational ALUs and Sequential ALUs.

10

3.

The Control Unit Single bus organization, control unit operations: instruction sequencing, micro operations and register transfer. hardwired control: design methods – state table and classical method, design examples - multiplier CU. micro-programmed control: basic concepts, microinstructions and micro- program sequencing.

10

4.

Memory Organization Characteristics of memory systems, internal and external memory, types of memories: ROM: PROM, EPROM, EEPROM, RAM: SRAM, DRAM, SDRAM, RDRAM high-speed memories: cache memory, organization and mapping techniques, replacement algorithms, cache coherence, MESI protocol. virtual memory: main memory allocation, segmentation, paging, address translation. secondary storage: magnetic disk, tape, DAT, RAID, optical memory, CDROM, DVD.

14

5.

I/O Organization Input/output systems, programmed I/O, interrupt driven I/O, I/O channels, Direct Memory Access (DMA), buses and standard interfaces: synchronous, asynchronous, parallel, serial, PCI, SCSI, USB ports, working mechanisms of peripherals: keyboard, mouse, scanners, video displays, touch screen panel, dot matrix, desk-jet and laser printers. OS support: OS overview.

12

61


7. D. Paterson, J. Hennesy, “Computer Organization and Design: The Hardware Software Interface”, 4th Edition, November 9, 2011, Morgan Kauffman, ISBN-13: 978-0123747501.

Research Papers/Articles recommended for reading:

1. “Magnetic Memories: Memory Hierarchy and Processing Perspective”, Fontanna, R. E., vol 99(2006), pp: 08N902 - 08N902-6

2. “Types or RAM and ROM”, Jim Hurst, pp: 1-6. 3. “RAM, Virtual Memory, Pagefile and Memory Management in Windows”, Microsoft Team, 2010,

pp:1-1 Suggested Evaluation Methods


a) Unit Tests b) Seminars

c) Assignments 2. Optional


B) End Semester Examination. a) Written Exam

S.No. Name of the course Institute where it is offered 1 COMPUTER ORGANIZATION

AND ARCHITECTURE IIT Kharagpur

2 Computer Organization and Architecture

IIT Madras

SubSpecialization Committee Name of Member

Manisha Tijare Shraddha Phansalkar

Poorva Agarwal Rahul Joshi

Designation AP CS/IT AP CS/IT AP CS/IT AP CS/IT


Signature


Date:

62


Faculty of Engineering Specialization: Electronics and Telecommunication

Course Name: Digital Electronics and Logic Design (UG/PG): UG Number of Credits: 4 Level: 1 Learning Objectives The student will be able to:

1. Reduce Boolean expression to the minimum terms. 2. Perform arithmetic operations in various types of number system. 3. Convert a number from one number system to another such as Binary to decimal and vice versa. 4. Identify the importanceof various error correcting codes. 5. Analyze Karnaugh maps and formulate Sum ofProduct and Product of Sum. 6. Design and model combinational circuits such as Multiplexers and De-Multiplexers. 7. Explain the concept of synchronous and asynchronous sequential circuits like flip flops, registers

and counters. 8. Apply the concepts of flip flops to design a counter. 9. Simulate basic digital circuits using Hardware Description Language. 10. Relate the architectures of Programmable Logic Devices (PLD) and Programmable Logic Array

(PLA). 11. Compare different logic families in terms of power dissipation, noise margin, fan in and fan out.

Pedagogy

1. Design Examples 2. Classroom teaching 3. Use ISE design tools to design digital circuits in HDL

Pre-requisites None

63


Course Outline Books Recommended

1. “Digital design”, M.M. Mano, PHI, 4th edition.

S.No. Topic Hours

1

Number System & Logic Design Minimization Techniques Introduction: binary, hexadecimal numbers, octal numbers and number conversion, signed binary number representation: signed magnitude, 1’s complement and 2’s complement representation, binary, octal, hexadecimal arithmetic: 2’s complement arithmetic, algebra for logic circuits: logic variables, logic functions -NOT, AND, NOR, XOR, OR, XNOR, NAND, boolean algebra: truth tables and boolean algebra, idealized logic gates and symbols. DeMorgan's rules axiomatic definition of boolean algebra, basic theorems and properties of boolean algebra, logic minimization: representation of truth-table, SOP form, POS form, simplification of logical functions, minimization of SOP and POS forms, don’t care conditions, reduction techniques: k-maps up to 4 variables and Quine-McClusky technique.

10

2

Logic Families TTL: standard TTL characteristics- speed, power dissipation, fan-in, fan-out, current&voltage parameters, noise margin, operating temperature etc, operation of NAND gate. TTL configurations- active pull-up, wired AND, totem pole, open collector, CMOS: CMOS inverter, CMOS characteristics, CMOS configurations- wired logic, open drain outputs, interfacing: TTL to CMOS, CMOS to TTL

10

3

Combinational Logic Codes:- BCD, excess-3, Gray code , binary code & conversion arithmetic operations-binary addition, subtraction, multiplication, division, BCD addition, circuits: - halfadder, fulladder, half subtract, full sub tractor, BCD adder using &subtract using 7483, look ahead&carry, parity generator & checker using 74180, magnitude comparator using 7485, multiplexers (MUX), implementation of expression using MUX (IC 74153, 74151), demultiplexers (DEMUX):- implement expression using DEMUX, decoder. (IC 74138).

10

4

Sequential Logic Circuit Design Introduction: sequential circuits. difference between combinational circuits and sequential circuits, flip- flop: SR, JK, D, T; preset & clear, master and slave flip flops their truth tables and excitation tables, conversion from one type to another type of flip flop, application of flip-flops: bounce elimination switch, registers, counters, registers: buffer register; shift register, counters: asynchronous counter. synchronous counter, ring counters, BCD counter, johnson counter, modulus of the counter (IC 7490), pseudo random binary sequence generator, sequence generator and detector.

10

5

ASM & VHSIC Hardware Description Language Algorithmic state machines: ASM charts, notations, design of simple controller, multiplexer controller method examples: sequence generator, types of counter, VHDL: introduction to HDL, VHDL- library, entity, architecture, modeling styles, concurrent and sequential statements, data objects & data types, attributes, VHDL for sequential circuits-synchronous and asynchronous counter.

10

6

Programmable Logic Devices PLD: PLA- input, output buffers, AND, OR, invert/ non-invert matrix. design example: any 4 variables SOP function using PLDs, study of basic architecture of FPGA.

10

64


2. “Modern Digital Electronics”, R. P. Jain, Tata McGraw-Hill, 3rd Edition. 3. “Fundamentals of Digital Logic with VHDL Design”, Stephen Brown, Zvonko Vranesic

McGraw-Hill 2nd edition. Research Papers/Articles recommended for reading

1. Sekanina L., Starecek L., Kotasek Z. and Gajd Z., “Polymorphic Gates in Design and Test ofDigital Circuits”, Int. Journal of Unconventional Computing, Vol 4, No 2, 2008, p. 125 – 142.

2. Miller J. F., Job D. and Vassilev V. K.,”Principles in the Evolutionary Design of Digital Circuits - Part I”, Genetic Programmingand Evolvable Machines, 1(1/2), pp. 7-35, 2000.

3. TurtonB. C. H., ”Extending Quine-McCluskey for Exclusive-OR Logic Synthesis”, IEEE Transaction on Education,No. 1, pp. 81-85, 1996.





b) Mini Project B) End Semester Examination

a) Written Exam Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1 Digital Electronics and Logic Design Pune University 2 Digital Electronics and Logic Design Mumbai University Sub-specialization committee

Name of Member

Saurabh Gupta Shilpa Pawar Shraddha Phansalkar

Praveen Gubbala






Signature


Date:

65



Specialization: Computer Science and Information Technology Course Name: Programming Paradigms Lab (UG/PG): UG Number of Credits: 1 Level: 2 Learning Objectives The students will be able to:

1. Revise the various building blocks of programming paradigms 2. Understand the basic building blocks of programming languages such as constructor,

polymorphism and inheritance. 3. Summarize C++ programming concepts. 4. Extend the concepts of inheritance using C++ programs. 5. Extend the model of polymorphism using C++ programs. 6. Implement LISP and Prolog programs for finding even / odd and factorial of given number. 7. Outline the importance of factorial of given number computed using varied programming

methods. 8. Discuss paradigms using languages like ADA.

Pedagogy

1. Practical’s using Tools like Dev C++, Turbo C++, Visual Prolog, LISP 2. Mini Project 3. Seminars


1 Conversion of decimal to any base and vice versa using C++. 4 2 Implement the addition of complex numbers using constructor in C++. 4 3 Implement Polymorphism and virtual classes using C++. 4 4 Implement Inheritance using C++. 4 5 To develop the rules for Medical diagnosis in prolog. 4 6 To develop the rules for different family relations in prolog. 4 7 Find number is Even or Odd, Factorial of a number using LISP. 4 8 Find Fibonacci series of a number using LISP. 2

66


Books Recommended 1. “C++ Complete Reference” , Herbert Schildt, 3rd Edition 2. "LISP", Author: Winston P., Klaus B., Horn P., Publication: Pearson Education,3rd Edition,

81 - 7808 -155-5 3. “Prolog: Programming For Artificial Intelligence”, Author: Bratko.

Research Papers/Articles recommended for reading 1. Nørmark, Kurt, “Overview of the four main programming paradigms”, Aalborg University, 9 May

2011. Retrieved 22 September 2012, 2. Paul W. Oman, Curtis R. Cook, “A paradigm for programming style research”,(Citations: 8), Journal:

Sigplan Notices - SIGPLAN , vol. 23, no. 12, pp. 69-78, 1988, DOI: 10.1145/57669.57675.


1. Essential a) Lab Assignments


B) End Semester Examination a) Viva-Voce b) Lab Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Programming Paradigms Lab Pune University Sub-specialization committee

Name of Member Shilpa Pawar Meeta Kumar Kalyani Kadam Swati Ahirao







Date:

67



Course Name: Fundamentals of Data Structures Lab (UG/PG): UG Number of Credits: 2 Level: 2 Learning Objectives The students will be able to:

1. Review the C language concepts such as loops, functions, macros and array. 2. Explain the basic of data structure such as sorting and searching. 3. Discuss the implementation of linear and circular queue. 4. Discuss the implementation of stack using an array. 5. Summarize hashing functions such as collision resolution, linear probing and quadratic probing.

Pedagogy

1. Lab Assignments 2. Mini Project

Pre-requisites


1 Assignment on basic C. 4 2 Assignment on applying matrices. 4

3 Write a program to perform various string operations such as Copy, Length, Reversing, Palindrome, and Concatenation and to find occurrence substring etc (without using library functions)

4

4 Assignment on applyind a C structure. 4 5 Assignment on polynomial solving using data structures 4 6 Assignment on searching techniques. 4 7 Assignment on sorting techniques like bubble sort, insertion sort. 4 8 Assignment on creating a stack. 4 9 Assignment on stack application. 4

68


10 Assignment on creating a queue. 4 11 Assignment on hashing. 4

12 Implement Stack as an ADT using Array. Use this ADT to perform infix to postfix expression conversion. 4

13 Implement Stack as an ADT using Array. Use this ADT to perform infix to prefix expression conversion. 4

14 Write C program that implements Circular Queue using Arrays 4

15 Represent polynomial using structures and write a menu driven program to perform Addition, Multiplication and Evaluation (using user defined functions)

4

Books Recommended 1. “Data Structures: A pseudo code approach with C”, R. Gilberg,B. Forouzan,

ISBN 9780534390808, Cenage Learning, 2nd Edition October 11, 2004. 2. “Fundamentals of Data Structures in C”, E. Horowitz, S.Sahani and S.Anderson-Freed,

ISBN 10:8173716056, University Press, 2nd Edition 2007. 3. “Let us C & Pointer in C”, Yashwant Kanitkar, ISBN9788183331630,BPB,13thEdition 2013 . 4. “Data structures & Program Design in C”, Robert Kruse, C.L.Tondo, Bruce Leung

ISBN 9780132883665,Pearson, 4th Edition 2009. 5. “Data structure using C”, AM Tanenbaum, Y Langsam & MJ Augustein,ISBN 9788131702291 Pearson Prentice HallIndia,9th Edition 2009 6. “Data structure & Algorithm Analysis in C++”, Weiss, Mark Allen, ISBN-0-32144146X, Addison Wesley,3rd Edition 2007.

Research Papers/Articles recommended for reading

1. Tarjan R.,”Depth-First Search and Linear Graph Algorithms”,SIAM Journal on Computing 1, pp. 146-160.

2. Kumar, V., Schwabe, E.J. “Improved algorithms and data structures for solving graph problems in external memory” IEEE 1996

3. Hanan S. and Robert E. Webber ,“Hierarchical Data Structures and algorithms for Computer Graphics” IEEE 1998


A) Continuous Assessment 1. Essential a) Lab Assignments 2. Optional a) Quizzes

B) End Semester Examination a) Project b) Viva-Voce c) Lab Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 PROGRAMMING AND DATA

STRUCTURES LAB IIT Kharagpur

2 PROGRAMMING AND DATA STRUCTURES LAB

IIT Madras

69


Sub-specialization committee Name of Member Kalyani Kadam Suman Tanwar Meeta Kumar Ambika Pawar






Signature Name of the Expert: Signature:.

Date:

70



Course Name: Digital Electronics and Logic Design Lab (UG/PG): UG Number of Credits: 1 Level: 1 Learning Objectives The student will be able to:

1. Construct various gates using universal gates 2. Build a full adder using half adder 3. Design and implement a binary to Gray code converter and gray code to binary converter. 4. Implement Sum of Products/Product of Sum (SOP/POS) form optimally using 8:1 multiplexer. 5. Perform binary and hexadecimal calculations and conversions. 6. Design combinational circuits. 7. Design simple synchronous circuits including counters and state machines. 8. Convert Programmable Logic Device (PLDs) to digital designs using Very high Definition

language(VHDL). 9. Program and use PLDs to implement digital logic designs. 10. Discuss the awareness of various families of Medium Scale Integration (MSI) and Low Scale

Integration (LSI) Transistor Transistor Logic(TTL) chips. 11. Identify practical issues in the design of digital systems. 12. Recognize the basic concepts of microprocessor and microcontroller systems.

Pedagogy

1. Design examples 2. ISE design tools to design digital circuits in HDL

Pre-requisites None

71



1. “Digital design”, M.M. Mano, PHI, 4th edition. 2. “Modern Digital Electronics”, R. P. Jain, Tata McGraw-Hill, 3rd Edition. 3. “Fundamentals of Digital Logic with VHDL Design”, Stephen Brown, Zvonko Vranesic

McGraw-Hill 2nd edition. Research Papers/Articles recommended for reading

1. Sekanina L., Starecek L., Kotasek Z. and Gajd Z., “Polymorphic Gates in Design and Test ofDigital Circuits”, Int. Journal of Unconventional Computing, Vol 4, No 2, 2008, p. 125 – 142.

2. Miller J. F., Job D. and Vassilev V. K.,”Principles in the Evolutionary Design of Digital Circuits - Part I”, Genetic Programmingand Evolvable Machines, 1(1/2), pp. 7-35, 2000.

3. TurtonB. C. H., ”Extending Quine-McCluskey for Exclusive-OR Logic Synthesis”, IEEE Transaction on Education,No. 1, pp. 81-85, 1996.


1. Essential a) Lab Assignments 2. Optional a) Quizzes b) Mini Project


S.No. Assignments Hours

1 Construct various logic gates using universal gates like NAND and NOR. 3

2 Build a full adder using half adder. 2

3 Design and implement Binary to gray code converter and vice versa. 3

4 Convert SOP/POS form to a simplified form and implement optimally using 8:1 MUX. 3

5 Arrange the 4 bit magnitude comparators in cascade to perform 8 bit comparison. 3

6 Convert a binary adder circuit to aBinary Coded Decimal (BCD) adder. 2

7 Design a 4 bit asynchronous up-down counter using JK flip flops and plot the waveforms. 2

8 Design a 3 bit synchronous up down counter. 3

9 Design and implement sequence detector using JK Flip Flop. 3

10 Convert a decade counter to modulo n counter using IC 7490. 3

11

Simulation of following using VHDL: 1. 4:1 MUX 2. Full adder 3. Decoder 4. D Flip Flop

3

72


Parallel/Similar courses the existing curriculum S. No. Name of the course Institute where it is offered 1 Digital Electronics and Logic Design

Lab Pune University

2 Digital Electronics and Logic Design Lab

Mumbai University


Name of Member

Saurabh Gupta Shraddha Phansalkar

Praveen Gubbala Shilpa Pawar






Signature


Date :

73


Sub Committee for Curriculum Development _Foreign Language German

Name of Institute: SLS P/N, SSE

Course Name and Code: Foreign Language: -Basic German 1

(UG/PG): UG

Number of Credits: 2 Level: 1

Learning Objective(s):

1. Students can construct / use simple sentences or everyday expressions when dealing with various situations in daily life ( e.g. at the airport, in a supermarket, at the Hotel etc)

2. He/she can introduce him/herself and others and talk about others and themselves e.g. hobbies, and personal details where do they come from etc.

3. Can read and understand medium level difficulty level texts and solve questions based on the same. 4. Can communicate in a simple manner. Can respond to simple and uncomplicated speech. 5. To develop intercultural and communicative skills

Pedagogy:

We stress on direct teaching methodology. With minimum usage of English or any other Language the students are motivated to speak and understand the foreign language with the help of visual aids. The teacher enacts at times in the class or takes help of visual aids for the same. Role plays and games are conducted to evaluate and help the students apply the knowledge acquired. Cultural sensitization is done with the help of various activities such as discussions or audio video aids, songs, reading material etc. It is activity based task based and with little help from the first or second Language. Pre-requisites:

None.

74


Course Outline Sr. No.

Name of Unit

Objective of the unit

Material used Grammar Topic taught

Activities No. of hours required

1. Start auf Deutsch

To introduce German and Germany, International Words, enable participants to introduce themselves and others, spell names of people, places, etc.

Textbook, Sprach-training,

Constructing Sentences and questions

Alphabet song, games to reinforce the concept taught. Presentation and project on Germany Continuous assessment

15 including class tests and assignments

2. Café d To enable students to begin a conversation in a day-today situation, e.g. Café / Restaurant, understand and use numbers, place an order in a restaurant.

Textbook + Sprach-training,

Role plays and Games

Continuous assessment


3. Functional Grammar taught during all classes

Verbs: regular verbs, irregular verbs

Verb form: present tense , past tense (only of the following verbs- sein andhaben)

Personal pronouns only in nominative case: ich, du, er, es ,sie, wir ,ihr, Sie,sie

Why questions ,yes /no questions

Books Recommended : Studio D


75


Suggested Evaluation Methods: Continuous Evaluation. 40 %Internal 60% external. Parallel/Similar courses the existing curriculum:

S.No. Name of the course Institute where it was offered 1 Foreign Language Mumbai University

Name of Member

Dr Surekha Kher Madhura Kshirsagar

Medha Purkar Asavari Tamhane

Sujata Arya

Designation

Org. / Inst.

Signature


Date:

76


Sub Committee for Curriculum Development _Foreign Language German

Name of Institute: SLS P/N

Course Name and Code: Foreign Language: - Basic German 2

(UG/PG): UG Number of Credits: 2 credits Level: 1





Pedagogy:

We stress on direct teaching methodology. With minimum usage of English or any other Language the students are motivated to speak and understand the foreign language with the help of visual aids. The teacher enacts at times in the class or takes help of visual aids for the same. Role plays and games are conducted to evaluate and help the students apply the knowledge acquired. Cultural sensitization is done with the help of various activities such as discussions or audio video aids, songs, reading material etc. It is activity based task based and with little help from the first or second Language. Pre-requisites:

None. German syllabus

Basic German II (2 credits) Sr. No .

Name of the Unit


Material used Grammar Topic(s) taught


77


1. Im Sprachkurs

To enable students to know and use the vocabulary related to objects in a classroom. To enable students to ask questions and make enquiries.

Textbook + Sprach training,

Role plays Essay : My class room


2 Städte – Länder – Sprachen

To enable students to speak about cities and places to visit in their own country and Germany using directions and the geographical position. Map reading

Textbook + Sprach training,

Role-plays

Short essay My Family


3 Functional Grammar taught during all classes

Functional Grammar:- GERMAN Cases : Nominativ (Subject), Akkusativ (direct object),

Possessive pronouns in Nominativ and Akkusativ case

Introduction of Articles

definite articles :der(maskulin), die(feminine), das (neutrum), die (plural)

indefinite articles : ein, eine, ein

Nouns: Singular and Plural with articles

Negation with ‘nicht’ and ‘kein’

Books Recommended : Studio D


Suggested Evaluation Methods: Continuous Evaluation. 40 %Internal 60% external. Parallel/Similar courses the existing curriculum:

S.No. Name of the course Institute where it was offered

78


1 Foreign Language Mumbai University

Name of Member



Sujata Arya

Designation

Org. / Inst.

Signature


Date:

79


Sub Committee for Curriculum Development _Foreign Language French

Name of Institute: SLS P/N, SSE

Course Name and Code: Foreign Language: - Basic French 1

Course Code: T6186

(UG/PG): UG

Number of Credits: 2 credits Level: 1





Pedagogy:

We stress on direct teaching methodology. With minimum usage of English or any other Language the students are motivated to speak and understand the foreign language with the help of visual aids. The teacher enacts at times in the class or takes help of visual aids for the same. Role plays and games are conducted to evaluate and help the students apply the knowledge acquired. Cultural sensitization is done with the help of various activities such as discussions or audio video aids, songs, reading material etc. It is activity-based and task-based and with little help from the first or second Language.

Pre-requisites:

None.

80


French syllabus Basic French I (2 credits)

Sr. No

Name of the Unit

Objective of the unit Material used

Grammar Topic(s) taught


1 Fundamentals • Alphabet • Phonetic • Accent

AUDIO C.D Constructing Sentences and questions

Alphabet song, games to reinforce the concept taught.

5

2 Expression Formal & Informal

Meeting, greetings and farewell. Formal/ informal expressions

Role plays and Games

3

3. Introduction Self and third person introduction

Textbook + listening of audio c.d.

Role plays Short essay My Family

2

4. Time and scheduling

Telling and asking for time Telephonic conversation Fixing appointments, rescheduling or cancelling the same Describing one’s daily routine, Role plays etc. Understanding transport schedule

Textbook + extra Photocopies from other books

Various verbs , negation , interrogations adjectives

Roleplays 10

5. Functional Grammar: French • Articles : definite/ indefinite, article contracte, article partitif 10

Nouns: singular, plural. • Constructing Sentences and questions • Various verbs , negation , interrogations adjectives etre, avoir, er ending verbs etc

Books Recommended : Jumelage

Research Papers/Articles recommended for reading: Not mentioned.

Suggested Evaluation Methods : As per SIU rules on page 20, 5.1 e) III.

81


Parallel/Similar courses the existing curriculum:


Name of Member

Dr. Surekha Kher

Madhura Kshirsagar


Sujata Arya

Designation Visiting

Faculty Visiting Faculty

Chief Coordinator

Org. / Inst. SIFIL SIFIL SIFIL

Signature

Name of the Expert:

Signature:

Date:

82


Sub Committee for Curriculum Development

Foreign Language French Name of Institute: SLS P/N Course Name and Code: Foreign Language: - Basic French 2 (UG/PG): UG Number of Credits: 2 credits Level: 1 Learning Objective(s):




Pedagogy:

We stress on direct teaching methodology. With minimum usage of English or any other Language the students are motivated to speak and understand the foreign language with the help of visual aids. The teacher enacts at times in the class or takes help of visual aids for the same. Role plays and games are conducted to evaluate and help the students apply the knowledge acquired. Cultural sensitization is done with the help of various activities such as discussions or audio video aids, songs, reading material etc. It is activity-based and task-based and with little help from the first or second Language. Pre-requisites:

None.

83


French syllabus Basic French II (2 credits)

Sr. No

Name of the Unit

Objective of the unit Material used



1 Utilities • Numbers (telephone numbers, postal code etc)

• Ordinal and cardinal numbers (dates)

• Weekdays, months, birthdays birth year and seasons

• Countries , nationalities ,map reading and asking directions

• Immediate future plans

text books , listening , photocopies r books

Definit and indefinite articles Future proche

Role plays and games and activities

20

2 Writing skills

• Writing short emails, postcards, letters

• short essays • short messages

5

3. Functional Grammar 5

• Adjectives: possessive adjectives, demonstrative adjectives, interrogative, adjective,

qualitative • Verb form : present, Future proce and recent past ( immediate future). etc

Books Recommended : Jumelage

Research Papers/Articles recommended for reading: Not mentioned.

Suggested Evaluation Method : As per SIU rules on page 20, 5.1 e) III.

Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered 1 Foreign Language Mumbai University

Name of Member

Dr. Surekha Kher

Madhura Kshirsagar


Sujata Arya

Designation Visiting Faculty

Visiting Faculty

Chief Coordinator

84




Date:

85


Sub Committee for Curriculum Development _Foreign Language Spanish

Name of Institute: SLS P/N , SSE Course Name and Code: Foreign Language: - Basic Spanish 1

(UG/PG): UG






Pedagogy:


None. Spanish syllabus Basic

Spanish I (2 credits) Sr. No.

Name of the Unit


Material used



86


1. Unidad 0, Unidad 1

Introduction to Spanish language & Spanish speaking countries, To learn alphabet & pronunciation, Greetings and leave takings, enable participants to introduce themselves , spell names of people, places, etc., To learn & practice days, months, seasons and zodiac signs, To understand and use numbers till 31, Introduction to class room objects

Text book, Work book , SIFIL compiled book

Subject pronouns, Verbs: Ser, tener, cumplir, llamarse, Constructing Sentences and questions, Introduction to articles & singular, plural of nouns

Alphabet song, Number song, Games to reinforce the concept taught.

Presentation and project on Spain



2. Unidad 2 To introduce students to different colors, To practise class room instructions, To enable students to begin a simple conversation in a day-to-day situation, To know and use names of different fruits, vegetables etc.

Text book, Work book , SIFIL compiled book, few useful PDFs

Three groups of regular verbs, the concept of adjective and its agreement with the noun

Color song, Role plays and reading comprehension of unseen texts, crosswords, Games



87


3. Functional Grammar: Taught during all classes • Subject Pronouns

• Nouns (Singular and plural) , articles (definite and indefinite) , adjectives , adverbs

• Verbs: -ar, -er, -ir ending (Regular and irregular)

• Reflexive Verbs (Regular and irregular)

Books Recommended : Chicos Chicas


Suggested Evaluation Methods: As per SIU rules on page no. 20 -5.1 e) III. Parallel/Similar courses the existing curriculum:


Name of Member



Sujata Arya



Chief Coordinator


Signature


Date:

88


Sub Committee for Curriculum Development _Foreign Language Spanish

Name of Institute: SLS P/N

Course Name and Code: Foreign Language: - Basic Spanish 2

Course Code: T6189

(UG/PG): UG






Pedagogy:


None. Spanish syllabus Basic Spanish 2 (2 credits)

Sr. No.

Name of the Unit


Material used



89


1. Unidad 3 To enable students to know and use the concept of time, time expressions, To enable students to use the language at different places e.g. Café / Restaurant, Market, Supermarket etc., To place an order in a restaurant, To enable students to ask questions and make enquiries.

Text book, Work book , SIFIL compiled book, PDFs

Different groups of irregular verbs, Introduction to reflexive verbs

Dialogue completion, Role plays Translation practice


2. Unidad 3, Unidad 4

To enable students to talk about their daily routine, To introduce different family relations, To know and use how to describe a person, To learn more numbers till 100

Text book, Work book , SIFIL compiled book, PDFs

Reflexive verbs (Regular and irregular), Possessive adjectives

Role-plays Short essay My Family


3. Functional Grammar taught during all classes Functional Grammar: Spanish

• Interrogation

• Negation

• Possessive adjectives Books Recommended : Chicos Chicas


Suggested Evaluation Methods: As per SIU rules on page no. 20 -5.1 e) III. Parallel/Similar courses the existing curriculum:

90



Name of Member



Sujata Arya



Chief Coordinator


Signature


Date:

91



Economics Institute Name: SIMC

Course Name: Basics of Microeconomics

(UG/PG): UG

Number of Credits: 2

Level: 1

Learning Objective(s): Microeconomics addresses the economic decisions of individual firms and households and how these interact in markets. Economic issues are pervasive in contemporary society. Microeconomics introduces students to the language and analytical framework adopted in Economics for the examination of social phenomena and public policy issues while understanding economic ideas that are essential for understanding society, business and government. On the successful completion of the course, the student should be confident about the following.

Define the terms and understand the concepts of microeconomics Have the basic skills to recognize microeconomic problems.

Pedagogy: The teaching method in the classroom would comprise of lecturing, explaining, questioning as well as collaborating. The teacher will lecture in each preplanned session of an hour’s duration on the subtopic of the syllabus assigned for the day according to the teaching plan. He or She can demonstrate the phenomenon with real life examples. As supportive aids the teacher can use various audio visual tools like power point presentation, white board etc. As recapitulating exercises questioning can be a part of the session. The teacher will also play the role of the facilitator of learning by collaborating amongst the students in team work such as project assignments, group discussions etc.

Learning outcome: Through this module, students will specifically learn about: 1. microeconomic concepts and analysis, 2. supply and demand analysis, 3. theories of the firm and individual behavior 4. competition and monopoly 5. welfare economics

92


Pre-requisites: Course Outline:

S.No. Topic Hours

1. Economics and Microeconomics: 4

What is economics? Branches of economics, nature and scope of economics, positive and normative approach, what is microeconomics? Economic agents and their activities as consumer, producer, investor.

2. Theories of Consumer Behaviour: 14

a. Introduction; Assumptions of Utility Analysis; Total Utility vs. Marginal Utility; The Law of Diminishing Marginal Utility; The Law of Equi-Marginal Utility. b. Demand and Law of Demand: Meaning of Demand, factors InfluencingDemand; an Individual’s Demand Schedule and Curve; The Market Demand Curve and Schedule; The Law of Demand; c. The Indifference Curve Theory: Introduction; Indifference Curves;Assumptions of Indifference Curve Analysis; Properties of Indifference Curves; Marginal Rate of Substitution; Price-Income Line; Consumer’s Equilibrium; Income Effect; Substitution Effect; Price Effect; The Separation of Substitution and Income Effect, To Derive Demand Curve from Price Consumption Curve; Compensated Demand Curve; Superiority of Indifference Curve over Utility Analysis; d. Elasticity of demand: Introduction; Price Elasticity of Demand; CrossElasticity of Demand; Income Elasticity of Demand; Factors Affecting Price Elasticity of Demand; Importance of the Concept of Price Elasticity; Applications.

3. Producer’s Behaviour: 12

a. Technology, Production Functions and Isoquants, short run and long run,production with one and two variable inputs, total average and marginal products, law of diminishing return, marginal rate of technical substitution, elasticity of substitution, economics of scale. b. Cost structure - implicit cost, explicit cost, accounting cost, OpportunityCosts; Private and social Costs; sunk cost, economic cost, fixed cost, variable cost, total, average and marginal cost. Determinants of Short run cost, Cost Curves, cost minimization and expansion path, Short run versus long run cost curves, economies of scope. c. Revenue - Total Revenue, Average revenue, Marginal Revenue - Relationbetween Average Revenue, Marginal Revenue and Price Elasticity of Demand, Profit maximization.

Total 30

Books Recommended

1. Mankiw, G., Principles of Economics, South-Western, Cenage Learning, 7e 2. Lipsey and Chrystal. 2007. Economics. Oxford University Press.

93


3. Case, Fair, Oster, Principles of Economics, Pearson, 11e Suggested Evaluation Methods: 1. Continuous Evaluation 2. Case studies 3. Presentations 4. Exercises 5. Essays 6. Innovatives

Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered

1 Foreign Language Mumbai University

Name of the Expert:

Signature:

Date:

Name of Member

Ms. Pallavi Tak Rai

Ms. Ishita Ghosh

Designation Asst. Prof Asst. Prof

Org. / Inst. SSE SSE

Signature

94



Economics

Name of the Institute: SIMC

Course Name: Basics of Macroeconomics

(UG/PG): UG


Level: 1


On the successful completion of the course, the student should be confident about the following. Define the terms and understand the concepts of macroeconomics Have the basic skills to recognize macroeconomic problems.

Pedagogy:

Class room teaching, active discussions on recent macroeconomic topics, article review, etc.

Learning outcome: Define and identify economic terms and concepts, apply the tools of analysis to predict the economic consequences of various events, understanding the linkages among the macroeconomic factors.

Page 1 of 2

95


S.No. Topic Hours

3 of 2

1 Introduction to Macroeconomics Measuring National Income and National Output Introduction to Unemployment Inflation and Long Term Growth

3

2 Aggregate Expenditure and Equilibrium Output 4

3 The Government and Fiscal Policy 4

4 The Money Supply and the Central Banking System 4

5 Money Demand and the Equilibrium Interest Rate 4

6 The Determination of aggregate output, the Price Level, and the Interest Rate 4

7 Policy Effects and Cost Effects in the AS/AD Model 4

8 The Labor Market in the Macroeconomy 3

Total 30

96


Course outline:

Books Recommended

1. Case, Fair, Oster: Principles of Macroeconomics 2. Mankiw, N. Gregory : Principles of Macroeconomics 3. Froyen, Richard T. : Macroeconomics : Theories and Policies 4. Dornbusch and Fischer: Macroeconomics 5. Samuelson and Nordhaus: Economics

Suggested Evaluation Methods: 1. Continuous Evaluation 2. Case studies 3. Presentations 4. Exercises 5. Essays 6. Innovatives

Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered 1 Macroeconomics I & II SSE 2 Principles of Macroeconomics SSLA 3 Principles of Macroeconomics SCMS, Pune

97


Name of Member

Ms. Pallavi Tak Rai

Ms. Ishita Ghosh

Designation Asst. Prof Asst. Prof

Org. / Inst. SSE SSE

Signature

Name of the Expert:

Signature:

98


Sub Committee for Philosophy Faculty of Humanities and Social Science Curriculum Development

Name of Institute: Symbiosis Law School

Course Name: Philosophy - Foundations of Ethics

UG/PG: UG I Year BA / BBA LLB Semester II


Level: 2

Learning Objectives: 1. To impart the students with the tenets of ethics which are part of daily life. 2. To inculcate the ethical behaviour in the students. 3. To study what is right and wrong in human endeavors. 4. To gain knowledge about the method by which we categorise one’s values and pursue them. 5. To inculcate such ethics in the budding lawyers to face the challenges in their practical law careers,

more about journey than destination.

Pedagogy: 1. Lecture 2. Discussion 3. self study 4. projects

Pre-requisites: • XII Standard • To pursue 5 year UG Law programme in any recognized centre of SIU. • To have suggested reading as per session plan and other resources such as films, documentary, as

provided by the course instructor Course Content Sr. No. Topic Hours

1 Introduction 1.1. Meaning and Definition of Ethics

(05)

99


2 Theories of ethic 2.1. Consequentialism 2.2. Values Clarification 2.3. Philosophical Relativism 2.4. Utilitarianism 2.5. Legalistic Moralism Moral Absolutism 2.6. Ethical Realism 2.7. Ethical Hierarcicalism Graded Absolutism 2.8. Principle Ethics 2.9. Cognitive Moral Development as espoused by Lawrence Kohlberg

(05)

3 Deontology, Religion, Ethics and Rights 3.1. Indian concept of “Dharma” – Mahabharata and Vedas

(05)

4 Ethical Dilemmas 4.1. Case studies (05)

5 Group work 5.1. Projects 5.2. Debates

(10)

Total 30

Books Recommended: • Aristotle, Nichomachean Ethics, University Of Chicago Press (2011) • Boss, Judith A., Ethics for Life: A Text With Readings 4th Edition, Boston, M.A, Mcgraw Hill, (2008) • Goodchild, Lester F., Toward a Foundational Normative in Business Ethics. Journal of Business Ethics, 5,

485-499, (1986) • Johnson, W. Brad, & Ridley, Charles R., The Elements of Ethics for Professionals, New York, NY: Palgrave

Macmillan, (2008) • Lalrinawma V. S., Major Faith Traditions of India, I.S.P.C.K. Organization (2007) • Markkula Center for Applied Ethics, A Framework for Thinking Ethically. Santa Clara CA: Santa Clara

University, (2009) • Xiaorong Li, Ethics, Human Rights and Culture: Beyond Relativism and Culture: Universalism and Cultural

Relativism in Ethics, Palgrave Macmillan (2006)

Essential Readings: • Justice M. Rama Jois, Dharma, 2nd ed, Bharati Vidyapeet, Mumbai (1997) • Justice M. Rama Jois, Ancient Indian Law, Eternal Values in Manu Smriti, Universal Law Publishing (2004) • Patrick Curry, Ecological Ethics: An Introduction’, Polity Press, Cambridge (2006) • Paul Chippendale, On Values, ethics, Morals & principles, (2001) • Thomas Nagel, What Does It All Mean? A Very Short Introduction to Philosophy, Oxford University Press

(1987)

• William K. Frankena, Ethics, 2nd Ed. Pearson (2005) Research Papers/Articles recommended for

reading:

100


Suggested Evaluation Methods: Evaluation is fully internal. Internal evaluation shall consist of one project (20 marks) and minimum 2 of the following (10 marks each): Tutorial, essays, seminar presentations, viva-voce, quiz, learning logs/diaries, computer based assessment, simulated interviews, objective structured clinical examinations.

Internal examination

Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered 1 Foundation of Ethics SLS, NOIDA

Name of Member

Dr. Shashikala Gurpur

Prof. Vivek Nemane

Prof. Arun Krishnan

Dr. Aparajita Mohanty

Mr. Aditya Nain

Designation Director Academic Associate

Asst. Professor

Asso. Professor and In-charge - Humanities

Teaching Associate

Org. / Inst. SLS, Pune SLS, Pune SLS, Pune SLS, Pune SSLA

Signature

Name of the Expert: Mr. Ajit Abhyankar

Signature:

Date:

101




Course Name: Philosophy - Concept of Wealth and Prosperity

(UG/PG): UG II Year BA/ BBA LLB Semester III


Level: 2

Learning Objective(s): 1. To impart the students the basic understanding of the concept of Wealth and Prosperity, the

relationship between wealth and happiness, meaning of good life, ancient and modern views of wealth and prosperity and the rule of law.

2. To give the students an insight in order to help them lead a good life and function as a lawyer.

Pedagogy: 1. Lecture 2. Discussion 3. Self study 4. Project

Pre-requisites: • To pursue 5 year UG Law programme in any recognized centre of SIU. • To have suggested reading as per session plan and other resources such as films,

documentary, as provided by the course instructor Course Outline

Sr. No. Topic Hours

102


1 Introduction to Wealth 1.1 Meaning of Wealth 1.2 Concept of Wealth relate with the Constitution provision and

Jurisprudence (Natural Law Theory): • Inner wealth • Physical Wealth (Health) • Family wealth • Career wealth • Economic wealth • Adventure wealth • Impact wealth

1.3 Wealth and Good Life (Aristotle’s Theory)

05

103


Wealth and Freedom (Article 19 of Constitution of India and Hohfelds Model of Rights)

Page 2

2 Introduction to Prosperity 2.1 Meaning of Prosperity 2.2 Concept of Prosperity

• Happiness • Success • Love • Wealth • Health

2.3 Abundance and Prosperity (Read with Spirituality and Mythology)

05

3 Theory of Wealth and Prosperity 3.1 Ancient and Modern Views of Wealth and Prosperity (Dharma

and Chanakya) 3.2 Genuine Wealth, Human Capital, Values (Adam Smith and

Economics) 3.3 Relationship between wealth and happiness (Read with

Fundamental Rights and Directive principles of State Policies) 3.4 Difference between wealth and prosperity of an individual and

of a society (Roscoe Pound and Sociological School) 3.5 Comparison of Various ancient views: Bible, Quran and

Ramayana

10

4 Group work a. Projects b. Debates

10

Total 30

104


Books Recommended • Adam Smith, Theory of Moral Sentiments, Digireads.com (2010) • Adam Smith, Wealth of Nation, Simon & Brown (2012) • Audrey Craft Davis, ‘Prosperity Consciousness: A Metaphysical Guide to Your Natural Wealth’,

Blue Dolphin Publishing, Inc (2006) • Carlson Haanel Wattle Mentz, How to Master Abundance And Prosperity...the Ancient Spiritual

Keys to Success: The Master Key System Decoded & the Science of Getting Rich Unveiled, Xlibris Corp, USA (2006)

• David G. Myers, The Pursuit of Happiness: Discovering the Pathway to Fulfillment, Well-Being, and Enduring Personal Joy, William Morrow Paperbacks (1993)

• Ed Diener & Robert-Biswas Diener, Happiness: Unlocking the Mysteries of Psychological Wealth, Wiley-Blackwell; 1 edition (2008)

• Jean E. Hampton, The Authority of Reason, Cambridge University Press (1998) • Leo E. Forrest, Wealth Consciousness Guide: Wealth and Abundance Law of Attraction

Techniques, CreateSpace (2012) • Mark Anielski, The Economics of Happiness: Building Genuine Wealth, New Society Publishers

(2007) • Peter Cole and Daisy Reese,True Self, True Wealth: A Pathway to Prosperity, Atria

Books/Beyond Words; Original edition (2007) • Richard J. Principle of Sustainable Living, ESC (2011) • Russell Roberts, The Price of Everything: A Parable of Possibility and Prosperity, Princeton

University Press, (2009) • Shigehiro Oishi, The Psychological Wealth of Nations: Do Happy People Make a Happy Society

(Contemporary Social Issues), Wiley-Blackwell; 1 edition (2012) • Steve Sanduski & Ron Carson, Avalanche: The 9 Principles for Uncovering True Wealth

(Modern Parable), Kaplan Publishing (2007)

105


Sunday Adelaja, Money Won't Make You Rich: God's Principles for True Wealth, Prosperity, and Success, Charisma House (2009)



Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered 1 Concept of Wealth and Prosperity SLS, NOIDA Name of Member


Prof. Arun Krishnan


Mr. Aditya Nain

Designation Director Asst. Professor Asso. Professor and In-charge - Humanities

Teaching Associate

Org. / Inst. SLS, Pune SLS, Pune SSLA

Signature


Signature:

Date:

106


Date:

107



Course Name: Operating Systems (UG/PG): UG Number of Credits: 3 Level: 2 Learning Objectives Students will be able to:

1. Classify different Operating Systems and understand the structural details of Operating System. 2. Show how resources, programs, process are represented in Operating System and solve CPU

scheduling problems. 3. Summarize techniques for achieving synchronization between processes. 4. Apply algorithms for deadlock detection in system. 5. Distinguish between various memory allocation schemes and discuss memory page replacement

algorithms. 6. Relate to the concepts of how Files are managed by Operating System. 7. Demonstrate the management of I/O devices by Operating System.

Pedagogy

1. Classroom Teaching 2. Lab using Linux commands and C Programming 3. Case Studies

Pre-requisites None

108


Course Outline

S.No. Topic Hours

1.

Introduction to Operating System Introduction and need of operating system, evolution of operating system, layered architecture/logical structure of operating system, OS services, type of OS, introduction to UNIX OS.

8

2.

Processes and Process Management Process concept and process states, CPU and I/O bound, operating system services for process and thread management ,CPU scheduler- short, medium, long-term, dispatcher, scheduling:- preemptive and non-preemptive, scheduling algorithms- FCFS, SJFS, shortest remaining time, RR, priority scheduling, atomic transactions.

8

3.

Interprocess Communication and Synchronization, Deadlocks Introduction to message passing, race condition, critical section problem, mutual exclusion with busy waiting- disabling interrupts, lock variables, Peterson’s solution, TSL instructions, busy waiting, sleep and wakeup calls, semaphore, monitors, classical ipc problems. deadlock- system model, resource types, deadlock problem, deadlock characterization, methods for deadlock handling, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock.

8

4.

Memory Management Basic hardware and issues, logical and physical address space, address binding, types: contiguous and non-contiguous, paging -concept, TLB translation look aside buffer, inverted page table, segmentation, virtual memory, management of virtual memory: allocation, fetch, page replacement policies.

8

5.

File System Concepts, attributes, operations, types, structure, file organization &access(sequential, direct ,index sequential) methods, memory mapped files, directory structures one level, two level, hierarchical/tree, acyclic graph, general graph, file system mounting, file sharing, path name, directory operations.

7

6.

I/O Systems Concepts, functions, input/output devices- block and character, spooling, disk structure & operation, disk attachment, disk storage capacity, disk scheduling algorithm- FCFS, SSTF, scan scheduling, C-scan schedule.

6

109


Books Recommended

1. “Operating Systems Concepts”,A Silberschatz, P Galvin, G Gagne, 9th Edition, Jan 2013 by John Wiley & Sons. ISBN-13: 978-1118129388. 2. “Operating Systems: Internals and Design Principles”,William Stallings, 6th edition, Jan 2009 by Pearson Publication, ISBN-13: 9780136006329. 3. “Operating Systems”, A Godbole, 2nd Edition, October 2005 by Tata Mc Graw Hill, ISBN: 9780070591134. 4. “Operating Systems – concepts and design“,Milan Milenkovic, 2nd Edition, Tata Mc Graw Hill, ISBN13: 9780070419209. 5. “Operating Systems Design And Implementation ”, A Tanenbaum, A Woodhull ,3rd Edition, 2009 by Pearson Prentice Hall, ISBN 0136373313. 6. “The Design of the Unix Operating System”, Maurice J. Bach ,1st Edition, Prentice Hall ISBN: 0-13-201799-7.


1. Economides N. and Katsamakas E.,” Linux vs. Windows: A Comparison of Application and Platform Innovation Incentives for Open Source and Proprietary Software Platforms”, The Economics of Open Source Software Development, 2006, pp: 208-220.

2. Ramamritham K. and Stankovic J., “Scheduling Algorithms and Operating Systems Support for Real-Time Systems”, vol 82(1994,), pp: 55-68.

3. Mobile OS and efforts towards open standards, Dotcom Infoway,pp:1-11 4. Koopman P. and Sung J., “Ted Comparing Operating Systems using robustness benchmarks”,

Marz, 1997, pp: 1-9. Suggested Evaluation Methods







Sr. No. Name of the course Institute where it is offered 1 Operating Systems IIT Madras 2 Operating Systems IIT Roorkee


110


Name of Member Shruti patil Shraddha Phansalkar

Preeti Muley Shraddha Phansalkar






Signature


Date:

111



Course Name: Java and Web Technologies (UG/PG): UG Number of Credits: 4 Level: 3 Learning Objectives The students will be able to:

1. Discover truly object oriented features of Java. 2. Demonstrate the concept of interface, package in Java. 3. Demonstrate the concept of event handling in AWT and SWING in Java. 4. Illustrate the concept of exception handling in Java. 5. Interpret the difference between Applets and Application Program. 6. Practice the concept of database connectivity with JDBC in Java. 7. Illustrate the concept of Multithreading in Java. 8. Solve the server client connectivity issues with socket programming and Remote Method

Invocation (RMI) in Java. Pedagogy

1. Class room teaching 2. Demonstrations 3. Mini Project

Pre-requisites

None

Course Outline

112


Books Recommended

1. “Object-Oriented Programming Using C++”,2nd Edition, Ira Pohl,Addison-Wesley Professional. 2. “Java 2: The Complete Reference”, 3rd Edition, Patrick Naughton , Herbert Schildt Osborne

Publishing, 1999. 3. “Programming With Java : A Primer”, 3rd Edition, E. Balagurusamy, Tata McGraw - Hill Education

(2008) . 4. “Java How to Program”, 9th Edition, Deitel and Deitel,Prentice Hall.

Research papers 1. “Gaining Effective Productivity in Release Management”, sponsored by IBM, published on 17th

Oct 2013, Java Development Research Library Copyright © 1998-2010 Bitpipe, Inc. 2. “When Java EE Is Overkill: Lightweight Application Server Benefits”, Research Webinar

Published By: VMWare - vFabric, Published on 1st Oct 2013, 18 pages, white paper 3. “Java Vulnerabilities Report: Write Once, Own Anywhere”, sponsored by Bit9, Inc., May 10th,

2012, Java Development Research Library Copyright © 1998-2010 Bitpipe, Inc.

S.No. Topic Hours

1.

Introduction to Java Need of object oriented approach, comparison of C++ and java, object, classes, writing java classes, features of java, abstraction, inheritance, encapsulation, polymorphism , constructor, this keyword, method overloading, method overriding, inheritance, static variable, instance variable, static methods, instance methods, abstract class, language fundamentals : structure of memory, parameter passing in java, arrays, garbage collector, java miscellaneous: string class, wrapper classes, inner class.

15

2.

Interfaces, AWT, Exception Handling Interfaces, packages. need for AWT,AWT components, graphics class, AWT containers, event handling in AWT, adapter classes, introduction to swing, swing components, layout managers, exception handling, need for exception handling, try-catch, finally, throw, throws, user defined exceptions.

10

3.

Web Technologies Introduction to HTML, HTML tags: text formatting tags, lists, tables, images, forms, framesjavascript: introduction to java script, introduction to cascaded style sheet.

7

4. Applets andJDBC Identify need for Applet, Applet life cycle, difference between application program and AppletsJDBC: identify the need of JDBC types of driver.

8

5. Multithreading Definition, multiprocessing, multithreading, thread, process, life cycle of thread, methods of threads class, thread synchronization.

10

6. Socket Programming and RMI Introduction to socket, socket programming, introduction to RMI, stub, skeleton, client server communication using RMI.

10

113



1. Essential a) Unit Tests b) Seminars c) Assignments

2. Optional a) Quizzes b) Minor project


Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1 Java and Web Technologies

Pune University

2 Java and Web Technologies

Mumbai University

SubSpecialization Committee

Name of Member Kalyani Kadam Meeta Kumar

Swati Ahirrao

Preeti Mulay






Signature


Date:

114



Course Name: Software Engineering (UG/PG): UG Number of Credits: 4 Level: 3 Learning Objectives The students will be able to:

1. Analyze different software process models. 2. Differentiate the advantages and disadvantages of the different process models. 3. Outline software project planning, estimation and scheduling. 4. Identify software requirements and design analysis modeling. 5. Examine different software design concepts. 6. Compare different software architectural styles. 7. Examine different software testing strategies and techniques. 8. Design test cases for different applications. 9. Model software applications like banking, reservation system, etc.

Pedagogy

1. Classroom teaching 2. Brainstorming session 3. Seminars 4. Case Studies

Pre-requisites

None

115


S.No. Topic Hours

1

Introduction Software & Software Engineering:- What Is & Why Software Engineering? Product: Evolving Role Of Software, Software Characteristics, Components, Applications and Software Crisis & Myths, Software Engineering, Software Process, Software Process Models: SDLC, Prototyping & RAD Models, Waterfall Model, Incremental Model, Spiral Model.

12

2

Planning & Management of Software Projects Planning & Management Of Software Projects:- People ,Problem & Process, Measures ,Matrices & Indicators ,Matrices For Software Quality, Software Project Estimation, Make-Buy Decisions, Software Acquisition. Software Risks, Identification, Assessment, Monitoring, Project Scheduling & Tracking, Tasks/Work Breakdown Structures, Timeline Chart, Project Plan.

12

3

Requirements and Analysis Communication Techniques, Analysis Principles SRS & SRS Reviews, Analysis Models, Data Modeling, Functional Modeling, Control Modeling & Information Flow, Behavioral Models,Data Flow Diagrams, ER Diagrams, State transition Diagram and Data dictionary.

12

4

Design Fundamentals and Methods Software Design & Software Design Process , Principles & Concepts , Abstraction, Refinement & Modularity, Software Architecture, Control Hierarchy, Partitioning, Data Structure, Information Hiding, Effective Modular Design, Cohesion, Coupling, Design Module, Design Document. Design Methods:- Architectural Design & Design Process , Transform & Transaction Flow, Design Steps.

12

5

Software Testing & Quality Assurance Software Testing Fundamental, Test Case Design , White-Box, Black-Box Testing, Control Structure Testing, Testing Strategic Approach To Testing , Strategic Issues , Unit Testing, Integrated Testing , Validation Testing , System Testing , Software Quality Assurance:- Software Quality Concepts , Software Quality Assurance (SQA) & Approaches, Software Reliability , SQA Plan, ISO 9000 & SEI Standards For Software, Software Configuration Management (SCM) , Base Lines , Scan Process , Version Control , Change Control , SCM Audits.

12

116


Books Recommended 1. “ Software Engineering, a practitioners approach”, Roger Pressman, Sixth Edition, 2011. 2. UML Distilled”, Martin Fowler, Addision Wesley, Fifth Edition, 2010. 3. “Software Engineering “, Pankaj Jalote, Sixth Edition, 2011.


1. Abran, Alain; Moore, James W.; Bourque, Pierre; Dupuis, Robert; Tripp, Leonard L. (2004). Guide to the Software Engineering Body of Knowledge. IEEE. ISBN 0-7695-2330-7.

2. Sommerville, Ian (2008). Software Engineering (7 ed.). Pearson Education. ISBN 978-81-7758-530-8. Retrieved 10 January 2013.



a) Unit Tests b) Seminars c) Assignments



Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1 Software Engineering IIT Roorkee 2 Software Engineering Pune University Sub-specialization committee

Name of Member Manisha Tijare Suman Tanwar Poorva Agrawal Seema Patil






Signature

Name of the Expert:

Signature: Date:

117



Specialization: Computer Science and Information Technology Course Name: Data Structures (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Demonstrate the problem using dynamic data structures. 2. Demonstrate linked list concepts such as internal pointer & external pointer, head, tail of a list,

null list and length of a list. 3. Compute preorder, inorder traversals of threaded binary searchtree. 4. Illustrate the concepts of graph to implement Depth First Search and Breadth First Search. 5. Write an algorithms for minimal spanning tree (Prim’s and Kruskal’s )and shortest path-

Dijkstra’s algorithm. 6. Choose a heap data structure for Huffman's algorithm. 7. Employ the concepts of sequential, simple index file and direct access file for hashing.

Pedagogy

1. Classroom teaching 2. Brainstorming session

Pre-requisites None Course Outline Sr.No. Topic Hours

1

Linked lists Linear list concepts, list v/s array, internal pointer & external pointer, head, tail of a list, null list, length of a list. Linked lists :nodes, linked list data structure, linked lists algorithms : create list ,insert node (empty list, beginning, middle, end), delete node(first, general case), search list, retrieve node, add node, remove node, print list, append linked list, array of linked lists, complex linked list structures, header nodes, circularly-linked list, doubly linked list: insertion, deletion .

10

118


2

Tree Difference in linear and non-linear data structure, trees and binary trees-concept and terminology, binary tree as an ADT(Abstract Data Type), algorithm for tree traversals (recursive and non recursive), conversion of general tree to binary tree, binary search trees, concept of threaded binary tree, threaded binary tree as ADT, preorder, inorder traversals of threaded binary searchtree.

10

3

Graphs Graph as an ADT, representation of graphs using adjacency matrix, adjacency list, Depth First Search and Breadth First Search, algorithms for minimal spanning tree (Prim’s and Kruskal’s )and shortest path- Dijkstra’s algorithm , application of these algorithms.

10

4

Symbol tables and dynamic trees Notion of symbol table, AVL(Adelson-Velskii and Landis) Trees, OBST (Optimal Binary Search Tree), heap data structure its application in heap sort, Huffman's algorithm.

5

5

File organization C files and command line argument, primitive operations and implementation in C, concept of sequential, simple index file and direct access file , hashing, hashing function and it’s characteristics, concept of collision resolution, linear probing, chaining with & without replacement, rehashing, processing of sequential, index-sequential and direct files, sequential file organization, direct file organization, index sequential file organization and their implementation.

10

Books Recommended 1. “Data Structures: A pseudo code approach with C”, R. Gilberg,B. Forouzan,ISBN 9780534390808,

Cenage Learning, 2nd Edition October 11, 2004. 2. “Fundamentals of Data Structures in C”, E. Horowitz, S.Sahani and S.Anderson-Freed, ISBN

10:8173716056, University Press, 2nd Edition 2007. 3. “Let us C & Pointer in C”, Yashwant Kanitkar, ISBN9788183331630,BPB,13thEdition 2013 . 4. “Data structures & Program Design in C”, Robert Kruse, C.L.Tondo, Bruce Leung,ISBN

9780132883665,Pearson, 4th Edition 2009. 5. “Data structure using C”, AM Tanenbaum, Y Langsam & MJ Augustein,ISBN 9788131702291, Pearson Prentice HallIndia,9th Edition 2009 6. “Data structure & Algorithm Analysis in C++”, Weiss, Mark Allen, ISBN-032144146X, Addison Wesley,3rd Edition 2007.




119



1. Essential a) Unit Test b) Seminars c) Assignments

2. Optional c) Quizzes d) Mini Project

B) End Semester Examination a) Written Exam Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Data Structures VIT, Vellore 2 Data Structures Pune University Sub-specialization committee

Name of Member Suman Tanwar Kalyani Kadam

Meeta Kumar Ambika Pawar







Date:

120


Faculty of Engineering Specialization: Computer Science/Information Technology

Course Name:Microprocessor Techniques (UG/PG): UG Number of Credits: 3 Level: 2 Learning Objectives The student will be able to:

1. Differentiate between a microprocessor and microcontroller. 2. Know functionality of Buses and Microprocessor blocks. 3. Understand the various PINS and signals role. 4. Write assembly level program. 5. Understand Bus interfacing concepts. 6. Understand end-to-end processing of instructions in Microprocessor. 7. Know interrupt process in detail. 8. Know interfacing of matrix input keyboard and output display. 9. Program I/O port and Timer. 10. Use Direct Memory Access (DMA) techniques for efficient system design.

Pedagogy 1. Lectures 2. Computer simulations using Kit

Course Outline

121


Books Recommended

1. “Microprocessor, Architecture, Programming and Application with 8085”,Gaonkar,John Wiley Eastern, Ltd, Publication 5th edition. 2. “Microprocessors and interfacing”, Douglas V Hall, Tata Mc-Graw Hill publication 2nd edition.

Research Papers 1. RechP., GrossoM. and MelchioriF., “Analysis of Root Causes of Alpha Sensitivity Variations on

Microprocessors Manufactured using Different Cell Layouts”, IEEE International On-Line Testing Symposium (IOLTS), July 5-7, 2010, Corfu Island, Greece (accepted for publication).

Sr.No. Topic Hours

1

8085 Microprocessor Basic 8085 microprocessor architecture and its functional blocks, 8085 microprocessor IC pin outs and signals, address, data and control buses, clock signals, instruction cycles, machine cycles, and timing states, instruction timing diagrams.

10

2

Programming of 8085 microprocessor Basic instruction set, writing assembly language programs, looping, counting andindexing operations, stacks and subroutines, conditional call and return instructions,Debugging programs.

12

3

8085 Interfacing and Interrupts Bus interfacing concepts, timing for the execution of input and output(I/O) instructions, I/O address decoding, memory and I/O interfacing memory mapped I/O interfacing of matrix input keyboard and output display, Serial I/O lines of 8085 and the implementation asynchronous serial data communication using SOD and SID lines, interrupt structure of 8085, RST(restart) instructions, vectored interrupt, interrupt process and timing diagram of interrupt instruction execution, 8259A interrupt controller, principles block transfer( direct memory access) techniques.

13

4

Programmable Interface and peripheral devices Programming and applications of 8455/8156 programmable I/O ports and timer, 8255A programmable peripheral interface , 8253/8254 programmable interval timer, 8257 direct memory access controller, 8279 programmable keyboard/display interface.

10

122


2. RavottoD., SanchezE. and Sonza M., “A hardware accelerated framework for the generation of design validation programs for SMT processors”, IEEE Design and Diagnostic of Electronic Circuits and Systems, Vienna, April 2010, pp. 289-292.

3. SanchezE., SquilleroG. and SonzaM., “Efficient Techniques for Automatic Verification-Oriented Test Set Optimization”, International Journal of Parallel Programming, Vol. 34, Num. 1, March 2006, pp. 93 - 109, Ed. Springer Netherlands.



a) Unit Tests b) Class Tests

2. Optional a) Quizzes b) Assignments c) Seminars

B. End Semester Examination a) Written examination

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Computer Architecture &

Microprocessors IIT Roorkee

Microprocessor Techniques Nirma University Sub specialization committee

Name of Member Saurabh Gupta Shraddha Phansalkar Praveen Gubbala

Shilpa Pawar






Signature


Date:

123



Course Name: Operating Systems Lab (UG/PG): UG Number of Credits: 1 Level: 2 Learning Objectives Students will be able to:

1. Compute Waiting/Turnaround time of processes using various Scheduling Algorithms using C program.

2. Understand basic concepts of Linux and Fedora Operating System. 3. Practice different Linux shell commands and interpret their results. 4. Relate File Operations of Linux to basic structure of File Organization of Linux. 5. Produce results using shell commands using various arithmetic commands for the given

problem. 6. Illustrate how deadlocks can be detected using Bankers algorithm. 7. Show how various looping conditional statements can be implemented in Linux. 8. Demonstrate memory allocation for processes by Page Replacement Algorithm using C program.

Pedagogy

1. Lab using C programming 2. Lab using Fedora Operating System

Pre-requisites:

None

124


Course outline Books Recommended

1. Unix Shell Programming”, Y Kanetkar,” 1st Edition, 2008 by BPB Publications, ISBN: 978-81-7029-753-2.

2. ”Advanced UNIX Programming”, W. R. Stevens ,2nd Edition, 2005 byAddison-Wesley Professional, ISBN: 8131700054.

3. “Linux in a Nutshell”, 6th Edition, E Siever, S Figgins, R Love, A Robbins,2009 by O'Reilly Publication, ISBN: 9780596154486.

4. “Fedora Linux: A Complete Guide to Red Hat's Community Distribution”, Chris Tyler ,1st Edition,2007 by O'Reilly Publication, ISBN:9780596526825.

Research Papers/Articles recommended for reading 1. Economides N. and Katsamakas E.,” Linux vs. Windows: A Comparison of Application and

Platform Innovation Incentives for Open Source and Proprietary Software Platforms”, The Economics of Open Source Software Development, 2006, pp: 208-220.

2. Ramamritham K. and Stankovic J., “Scheduling Algorithms and Operating Systems Support for Real-Time Systems”, vol 82(1994,), pp: 55-68.

3. Mobile OS and efforts towards open standards, Dotcom Infoway,pp:1-11 4. Koopman P. and Sung J., “Ted Comparing Operating Systems using robustness benchmarks”,

Marz, 1997, pp: 1-9. Suggested Evaluation Methods

A) Continuous Assessment 1. Essential a) Lab Assignments 2. Optional a) Quizzes b) Mini Project

B) End Semester Examination a) Viva-Voce

b) Lab Exam

Sr. No. Topic Hours

1. Implementation of CPU Scheduling Algorithms in C. 6

2. Introduction to Unix and Linux Fedora Operating System. 2

3. Implementation of Fedora Shell Commands. 4

4. Shell Program for performing File Operations. 2

5. Shell Program for Arithmetic Operations. 4

6. Implementation of Bankers Algorithm for Deadlock Detection. 4

7. Shell Program for Control Loops(If, If else, Switch). 4

8. Implementation of Page Replacement Algorithm. 4

125



Sr. No. Name of the course Institute where it is offered 1 Operating Systems Lab Pune University 2 Operating Systems Lab Mumbai University


Name of Member Shruti Patil Shraddha Phansalkar

Kalyani Kadam Ambika Pawar






Signature


Date:

126



Course Name: Java and Web Technologies Lab (UG/PG): UG Number of Credits: 2 Level: 3 Learning Objectives The students will be able to:

1. Summarize different features of Java. 2. Demonstrate the concept of interface, package in java. 3. Demonstrate the concept of AWT and SWING in Java. 4. Illustrate the concept of exception handling in Java. 5. Interpret the difference between Applets and Application Program. 6. Demonstrate the concept of JDBC in Java. 7. Illustrate the concept of Multithreading in Java. 8. Interpret the limitations of Socket Programming and use concept of RMI in Java.

Pedagogy 1. Use of software such as Eclipse ,Edit plus and Net beans 2. Mini Project

Pre-requisites

None

127


Course Outline:

Books Recommended

1. “Object-Oriented Programming Using C++”,2nd Edition, Ira Pohl,Addison-Wesley Professional, 2000.

2. “Java 2: The Complete Reference”, 3rd Edition, Patrick Naughton , Herbert Schildt Osborne Publishing, 1999.

3. “Programming With Java: A Primer”, 3rd Edition,E. Balagurusamy,Tata McGraw - Hill Education, 2008.

4. “Java How to Program”, 9th Edition, Deitel and Deitel,Prentice Hall, 2010. Research papers

Sr No. Topic Hours

1. Programs using constructor and destructor. 3

2. Creationof classes and use of different types of functions 3

3 Count the number of objects created for a class using static member function. 3

4 Write programs on interfaces. 4

5 Write programs on packages. 4

6 Write programs using function overloading. 4

7 Programs using inheritance. 4

8 Write a program using exception handling mechanism. 4

9 Programs using AWT 4

10 Programs on Swing 4

11 Program using JDBC 4

12 Program on Applet 4

13 Program using Threads 4

14 Program using Socket Programming 4

15 Program using RMI 4

16 Program on HTML with Java Script and Cascaded Style Sheet 3

128


1. “Gaining Effective Productivity in Release Management”, sponsored by IBM, published on 17th Oct 2013, Java Development Research Library Copyright © 1998-2010 Bitpipe, Inc.

2. “When Java EE Is Overkill: Lightweight Application Server Benefits”, Research Webinar Published By: VMWare - vFabric, Published on 1st Oct 2013, 18 pages, white paper

3. “Java Vulnerabilities Report: Write Once, Own Anywhere”, sponsored by Bit9, Inc., May 10th, 2012, Java Development Research Library Copyright © 1998-2010 Bitpipe, Inc.


1) Essential Lab Assignments

2) Optional a) Quizzes b) Mini Project


Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1 Java and Web Technologies Lab Pune University 2 Java and Web Technologies Lab Mumbai University SubSpecialization Committee

Name of Member

Kalyani Kadam Meeta Kumar Swati Ahirrao Shraddha Phansalkar






Signature


Date:

129



Specialization: Computer Science and Information Technology Course Name: Data Structures Lab (UG/PG): UG Number of Credits: 1 Level: 3 Learning Objectives The students will be able to:

1. Demonstrate linked list concepts such as internal pointer & external pointer, head, tail of a list, null list and length of a list.

2. Demonstrate the operations of different types of linked lists, trees, graphs. 3. Compute preorder, inorder, postorder traversals of threaded binary searchtree. 4. Illustrate the concepts of graph to implement Depth First Search and Breadth First Search. 5. Write an algorithms for minimal spanning tree (Prim’s and Kruskal’s )and shortest path-

Dijkstra’s algorithm 6. Choose and apply a heap data structure for Huffman's algorithm. 7. Employ the concepts of sequential, simple index file and direct access file for hashing.

Pedagogy

1. Lab Assignments 2. Mini Project

Pre-requisites

None

130



1 Write a menu driven program that implements singly linked list for the following operations: create, display, concate, merge, union, intersection

2

2 Write a menu driven program that implements doubly linked list for the following operations: create, display, count, insert, delete, search, copy, reverse, sort

2

3 Write a menu driven program that implements doubly linked list for the following operations: create, display, concate, merge, union, intersection

2

4 Write a menu driven program that implements Singly circular linked list for the following operations: create, display, count, insert, delete, search, copy, reverse, sort

2

5

Write a menu driven program in C to a. Create a binary search tree b. Traverse the tree in inorder, preorder and postorder c. Search the tree for a given node and delete the node

4

6 Write a program in C to implement Dijkstra’s shortest path algorithm for a given directed Graph. 4

7 Write a program in C to insert and delete nodes in graph using adjacency matrix. 4

8 Write a program in C to implement Breadth First Search using linked representation of graph. 4

9 Write a program in C to implement Depth First Search using linked representation of graph. 4

10 Write a program in C to implement insertion and deletion in AVL tree 2 Books Recommended 1. “Data Structures: A pseudo code approach with C”, R. Gilberg,B. Forouzan,

ISBN 9780534390808, Cenage Learning, 2nd Edition October 11, 2004. 2. “Fundamentals of Data Structures in C”, E. Horowitz, S.Sahani and S.Anderson-Freed,

ISBN8173716056, University Press, 2nd Edition 2007. 3. “Let us C & Pointer in C”, Yashwant Kanitkar, ISBN9788183331630,BPB,13thEdition 2013 . 4. “Data structures & Program Design in C”, Robert Kruse, C.L.Tondo, Bruce Leung

ISBN 9780132883665,Pearson, 4th Edition 2009. 5. “Data structure using C”, AM Tanenbaum, Y Langsam & MJ Augustein,ISBN 9788131702291 Pearson Prentice HallIndia,9th Edition 2009 6. “Data structure & Algorithm Analysis in C++”, Weiss, Mark Allen, ISBN-032144146X, Addison Wesley,3rd Edition 2007.

131






A) Continuous Assessment 1. Essential Lab Assignments 2. Optional a) Quizzes b) Mini Project


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Data Strucctures Lab IIT Roorkee 2 Data Strucctures Lab Pune University Sub-specialization committee

Name of Member Kalyani Kadam Suman Tanwar Meeta Kumar Ambika Pawar







Date:

132



Course Name:Microprocessor Techniques Lab (UG/PG): UG Number of Credits: 1 Level: 1 Learning Objectives The student will be able to:

1. Identify the basic element and functions of microprocessor. 2. Describe the architecture of microprocessor and its peripheral devices. 3. Know various commands of Dyna-8085 and write and simulate assembly language programs for

microprocessor. 4. Perform data transfer from memory to Microprocessor and vice versa to perform arithmetic

operations in microprocessor. 5. Interface display device and keyboard to facilitate communication between them. 6. Interface memory and peripheral devices to make microprocessor more efficient in different

operations. 7. Demonstrate fundamental understanding on the operation between the microprocessor and its

interfacing devices.

133


Pedagogy

1. Lectures 2. Computer simulations using DYNA-85 KIT

Pre-requisites

None

Course Outline

Books Recommended 1. Microprocessor, Architecture, Programming and Application with 8085-Gaonkar, John Wiley

Eastern, Ltd, Publication 5th edition. 2. Microprocessors and interfacing-Douglas V Hall, Tata Mc-Graw Hill publication 2nd edition.

Research Papers 1. RechP., GrossoM. and MelchioriF., “Analysis of Root Causes of Alpha Sensitivity Variations on

Microprocessors Manufactured using Different Cell Layouts”, IEEE International On-Line Testing Symposium (IOLTS), July 5-7, 2010, Corfu Island, Greece (accepted for publication).

2. RavottoD., SanchezE. and Sonza M., “A hardware accelerated framework for the generation of design validation programs for SMT processors”, IEEE Design and Diagnostic of Electronic Circuits and Systems, Vienna, April 2010, pp. 289-292.

3. SanchezE., SquilleroG. and SonzaM., “Efficient Techniques for Automatic Verification-Oriented Test Set Optimization”, International Journal of Parallel Programming, Vol. 34, Num. 1, March 2006, pp. 93 - 109, Ed. Springer Netherlands.




Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Microprocessor Theory +

Lab

IIT Madras


134


Name of Member Saurabh Gupta Shraddha Phansalkar Praveen Gubbala

Shilpa Pawar






Signature


Date:

135



Specialization: Computer Science and Information Technology

Course Title: Cyber Security Course Code: Number of Credits: 2 Level : Course Outcome (s): The students will be able to:

a) Analyze and illustrate threat models b) Examine the different cyber laws and their importance c) Compare and contrast the implemented management practices in the cyber world

Pre-learning: none Course Outline Sr.No. Topics Hours 1 Introduction:

Common Security Goals, Threat Modeling, Security Analysis; Cyber Attack Trends, Threats, and Homeland Security: Cyber Crime and Botnets, DoS, DDoS Attacks, Estonia, and Hacktivism, Cyber Espionage and the Athens Affair, Critical Infrastructure and Cyber Security

10

2 Cyber Laws: Introduction about the cyber space, Regulation of cyber space, Scope of Cyber Laws- ecommerce, online contract; IPRs (copyright, trademarks and software patenting); e-taxation; e-governance and cyber crimes, cyber law in India with special reference to information technology Act, 2000.

10

3 Management and Protection: Management of malicious intent, threat scenarios, critical infrastructures, security targets and policies, security mechanisms, examples of applications and their different security requirements, multi-lateral security, privacy and data protection, computer misuse legislation, Operating system and network security.

10

Pedagogy

1. Classroom teaching 2. Seminars 3. Case studies

Books Recommended Text Books:

a. Godbole, “Cyber Security: Understanding Cyber Crimes, Computer Forensics And Legal Perspectives”, First Edition, Wiley India Pvt Ltd.

Reference Books:

136


1. Stinson D., “Cryptography - Theory and Practice”, CRC Press, Boca Raton, FA, 1995 2. Stein L., “Web Security: A Step-by-Step Reference Guide”, Addison Wesley Longman, 3. Inc., 1998 4. Gollmann, D., “Computer Security”, Wiley, 1999 5. Anderson R., “Security Engineering: A Guide to Building Dependable Distributed Systems”, Wiley 6. Cheswick W., Bellovin S., ”Firewalls and Internet Security: Repelling the Wily Hacker”, 2nd ed., Addison-

Wesley 7. Garfinkel S., Spafford G., “Practical Unix and Internet Security”, O'Reilly 8. Amoroso E., “Fundamentals of Computer Security Technology”, Prentice-Hall

Suggested Assessment/ Evaluation Methods Continuous Assessment

a) Unit Tests b) Assignment c) quiz


S. No.


1. Cyber Security Ryal Holloway University of London

2. Cyber Law (M.tech M.Tech. Full Time Information security & cyber forensics)

SRM University

Name of Members

Designation

Org. / Inst.

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

137



Course Name: Data Base Management Systems (UG/PG): UG Number of Credits: 4 Level: 2 Learning Objectives The students will be able to:

1. Describe database system and its components. 2. Identify various database architectures and applications. 3. Recognize the advantages and disadvantages of the different data models. 4. Distinguish relational model with the Structured Query Language(SQL). 5. Discuss the constraints and controversies associated with relationaldatabase model. 6. Identify database analysis and design techniques. 7. Describe transaction processing, concurrency control and recovery. 8. Explain some of the basic issues of object-oriented databases.

Pedagogy

1. Classroom teaching 2. Brainstorming session 3. Seminars

Pre-requisites


1.

Introduction to DBMS DBMS basic concepts, advantages of a DBMS over file-processing systems, data abstraction, database languages, data models and data independence, components of a DBMS and overall structure of a DBMS, multi-user DBMS architecture, data modeling: basic concepts, entity, attributes, relationships, constraints, keys, E-R and EER diagrams: components of E-R model, conventions, converting E-R diagram into tables, EER model components, converting EER diagram into tables, relational model: basic concepts, attributes and domains, Codd's rules, relational integrity: nulls, entity, referential integrities, enterprise constraints, views, schema diagram.

10

138


2.

Relational query languages Relational algebra and relational calculus: tuple relational and domain relational calculus, introduction to SQL: characteristics and advantages, SQL data types, SQL languages: DDL, DML, DQL, DCL, SQL DDL queries: creating, modifying, dropping tables, SQL DML queries: inserting, updating and deleting data, SQL DQL query: SELECT query and clauses, SQL operators, predicates and joins, SQL functions: aggregate functions, date function, nested queries, concept of functions, stored procedures and triggers, introduction to QBE and QUEL, views: creating, dropping, updating, indexes, programmatic SQL: embedded SQL, dynamic SQL, ODBC.

10

3.

Database analysis and design techniques Information systems lifecycle, application lifecycle, planning, system definition, requirement analysis, design, DBMS selection and application design: transaction and user-interface design, prototyping, implementation, data conversion and loading, testing, data and database administration, relational database design: purpose of normalization, data redundancy and update anomalies, functional dependencies, the process of normalization: 1NF, 2NF, 3NF, 4NF, 5NF and BCNF.

10

4.

Storage and file systems Secondary storage, RAID, file organization, indices, static and dynamic hashing, B-trees and B+ Trees, introduction to query processing: overview, measures of query cost, selection and join operations, evaluation of expressions, introduction to query optimization, estimation, transformation of relational expressions.

10

5.

Transaction management Basic concept of a transaction, properties of transactions, database architecture, concept of schedule, serial schedule, serializability: conflict and view, cascaded aborts, recoverable and non-recoverable schedules, concurrency control: need, locking methods, deadlocks, times stamping methods, optimistic techniques, multi-version concurrency control, different crash recovery methods such as shadow-paging and log-based recovery: deferred and immediate, checkpoints.

11

6.

Object-oriented databases Need of OODBMS, storing objects in relational database, introduction to object oriented data models, persistent programming languages, persistence, object management group, object database standard ODMG ,database architectures: centralized and client – server architectures, introduction to distributed database.

9

Books Recommended 1. "Database System Concepts", Silberschatz A., Korth H., Sudarshan S., 6th Edition, 2010, McGraw Hill. 2. "Database Systems", Connally T., Begg C., 3rd Edition, 2004, Pearson Education. 3. "Database Systems Design, Implementation and Management", Rab P. Coronel C., 5th Edition,

Thomson. 4. "Fundamentals of Database Systems", Elmasri R., Navathe S., 6th Edition, 2010, Pearson Education. 5. "An Introduction to Database Systems", Date C., 7th Edition, 2000, Pearson Education. 6. “MySQL Administrator’s Bible”, Sheeri K. Cabral and Keith Murphy, O'Reilly Media.

Research Papers/Articles recommended for reading 1. Ma H., “An Approach on Grid Services Transaction Management for Grid Overflow”, ICIECS, 2009.

139


2. Ma H. and Z.M., “Object Comparison in Fuzzy object-oriented databases”, ICIS, 2009. 3. Gupta S., Saroha K. and Bhawna ,”Fundamental Research of Distributed Database”,IJCSMS

International Journal of Computer Science and Management Studies, Vol. 11, Issue 02, Aug 2011 ,ISSN (Online): 2231-5268.




B) End Semester Examination a) Written Exam Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Database Management Systems Nirma University 2 Database Management Systems Pune University Sub-specialization committee

Name of Member Swati Ahirao Maya Shelke Seema Patil Kiwi Mahajan







Date:

140



Course Name: Theory of Computation (UG/PG): UG Number of Credits: 4 Level: 3 Learning Objectives Students will be able to:

1. Illustrate Automata Theory, its types and inter conversions like Deterministic Finite Automata (DFA), Non-Deterministic Finite Automata (NFA) and e-NFA.

2. Write Regular Expressions (RE) using Regular Languages. 3. Produce Context Free Grammar (CFG), different derivations, conversions and properties. 4. Write the grammar of Push Down Automata (PDA) and Context Free Grammar. 5. Solve Turing Machine and calculate computability and complexity.

Pedagogy

1. Classroom Teaching and Discussions 2. Problem solving 3. Application study

Pre-requisites

None

Course Outline

141


Books Recommended

1. "Introduction to Automata Theory, Languages and Computations", Hopcroft J., Mptwani R., Ullman J., Second edition, by Pearson Education Asia, ISBN 81-7808-347-7, 2000.

2. "Introduction to Language and Theory of Computation",Martin J.,Third edition, Tata McGraw-Hill, ISBN 0-07-049939-X, 2003.

3. "Elements of Theory of Computation",Papadimitriou C.,Lewis H., Second edition, Pearson

S.No. Topic Hours

1

Automata Theory Introduction to finite automata, automata and complexity, central concepts to automata theory, deterministic finite automaton (DFA): extending the transition function to strings, the language of DFA, Non-deterministic Finite Automaton (NFA): Extended transition function, the language of an NFA, Equivalence of NFA and DFA, FA with e-transitions: Use of e-transitions, NFA with e, e-closures, Extended transitions and languages for e-NFA, Eliminating €-transitions-Con version of NFA with e to NFA without e, Conversion of NFA without e to DFA, FA with output: Moore and Mealy machines -Definition, models, inter-conversion.

12

2

Regular Expressions (RE) and Languages Regular Expressions - Operators of RE, Building RE, Precedence of operators, Algebraic laws for RE, Arden's Theorem, FA and RE: DFA to RE, RE to DFA (RE to s-NFA & e-NFA to DFA and RE to DFA-direct method), FA limitations, Properties of Regular Languages: pumping lemma for Regular Languages, closure and decision properties of Regular Languages, Equivalence and minimization of automata.

12

3

Context Free Grammars (CFG) and Languages Context Free Grammar- Definition, derivations, languages of a grammar, sentential form, Parse Tree- inference, derivation and parse tree, from inference to tree, Ambiguity in grammars and languages: removal of ambiguity, inherent ambiguity, Properties of CFL- Normal forms- Chomsky Normal Form (CNF) and Greibach Normal Form (GNF), Eliminating unit productions, useless production, useless symbols, and e-productions, Regular Grammar - definition, left linear and right linear Regular grammar, Regular grammar and Finite Automata, FA to RG and RG to FA, Inter-conversion between left linear and right linear regular grammar, Closure properties of CFL, Chomsky Hierarchy.

12

4

Push Down Automata (PDA) Definition, The Language of PDA, Equivalence of PDA's and CFG- CFG to PDA, PDA to CFG, Deterministic Push Down Automata (DPDA)- Regular language and DPDA, DPDA and CFL, DPDA and ambiguous grammar, Non-deterministic Push Down Automata (NPDA).

12

5

Turing Machine and decidability Problems that computers cannot solve, The Turing Machine(TM)-Notation, the language of TM, TM and Halting, Programming techniques to TM, Extensions to basic TM, TM and Computers, Introduction to Post Machines, Comparison between FA, PDA, Post Machine and TM.

12

142


education Asia, ISBN 81-7808-487-2, 2004. 4. "Introduction to Computer Theory", Cohen D., Wiley Publications, Second edition, ISBN-9971-51-

220-3, 2000. 5. "The Theory of Computation", Moret B., Pearson Education Asia, Third Edition, 2000. 6. 'Theory of Computer Science (Automata, Languages and Computation)", Mishra K.,

Chandrasekaran N., Second Edition, Prentice Hall of India, ISBN-81-2030-1271-6, 2000.


1. “Research paper on Computing Theory”, StudyMode.com, 09,2011, Accessed 09,2011. http://www.studymode.com/essays/Research-Paper-On-Computing-Theory-775133.html.

2. “General Systems Theory and Modern Systems Theory” (2012, Aug 20) Retrieved Oct 25, 2013, from http://www.paperdue.com/essay/General-Systems-Theory-75241.


1. Essential a) Unit Tests

b)Tutorials c) Assignments

2. Optional c) Quizzes


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Theory of Computation Pune University 2 Theory of Computation Mumbai University Sub specialization committee Name of Member Manisha Tijare Prerna Arote Poorva Agrawal Rahul Joshi






Signature


Date:

143



Course Name: Computer Networks (UG/PG): UG Number of Credits: 4 Level: 2 Learning Objectives The students will be able to:

1. Explain fundamentals of data communication such as various components required and different switching techniques available.

2. Discuss reference models such as Open Systems Interconnection (OSI) and TCP/IP (Transport Control Protocol/Internet Protocol) reference models.

3. Describe various techniques used for error detection and error correction such as Parity check, Hamming Code, Cyclic Redundancy Code(CRC).

4. Recognize how to prevent data loss when two machines are different in their configuration. 5. Classify local area network (LAN) into different topologies based on their physical and logical

structure. 6. Select algorithm to be used for collision detection and multiple access (CDMA). 7. Summarize various routing algorithms used to find out route from source to destination. 8. Discuss difference between flow control and congestion control and different techniques used for

congestion control. 9. Summarize functions of transport layer such as to carry segments reliably from source machine to

destination machine. 10. Implement socket programming using TCP (Transport Control Protocol) and UDP (User Datagram

Protocol) protocols. 11. Discuss various services provided by application layer such as Domain Name Service, Email, File

Transfer Protocol (FTP) and TELNET. Pedagogy

1. Interactive sessions 2. Class room teaching 3. Industry visit 4. Design a small computer network in lab 5. Implementing various programs

Pre-requisites

None

144


Books Recommended 1. "Computer Networks", Tanenbaum A ,4th Edition, PHI ISBP 81 - 203 - 2175 – 8. 2. "Data Communications and Networking",Fourauzan B., 3rd edition, Tata McGtaw Hill

Publications, 2004, ISBN 0 - 07 - 058408 – 7. 3. "Computer Networks and Internet", Comer D., 2nd Edition, Pearson Education, ISBN 81 -7808-

086-9. 4. "Computer Communications and networking Technologies", Gallo M., Hancock W., Thomson

Brooks/Cole, ISBN 8811 - 240 - 354 – X.


1.

Fundamentals of Data Communication Components, types of data communication , transmission media such as guided and unguided media, switching techniques as circuit-switching, packet switching and message switching, types of computer networks , networking components,topologies ,reference models: International Standards Organization/Open Systems Interconnection ( ISO/OSI ) model and Transport Control Protocol/Internet Protocol (TCP/IP))

10

2.

Data Link Layer Introduction, frame formation methods, error control :error detection and correction-parity ,LRC ,CRC ,hamming code, flow control: stop-and-wait protocol, sliding window protocol, Go-Back-N ARQ, selective repeat ARQ,HDLC : high level data link control protocol, Point-to-Point-Access(PPP): frame format, transition states, PPP Stack: LCP, NCP ,authentication protocol.

10

3.

Medium Access Control sub-layer Channel allocation: static and dynamic allocation, collision detection and multiple access protocols: ALOHA, CSMA,CDMA, collusion-free and limited-contention protocols, WDMA, Wireless LAN Protocols, Ethernet: Cabling, encoding, MAC sub-layer protocol, Switched, fast and Gigabit Ethernet, Logical link control, Wireless LANs and Digital Cellular Radio, Broadband Wireless, Virtual LANs, bluetooth, virtual circuit switching: frame relay and ATM.

10

4.

Network Layer Design Issues, Packet switching, Connectionless and Connection-oriented Services, Virtual Circuit and Datagram Subnets, Routing Algorithms, Internetworking, Firewalls, Congestion Control and QOS: General Principals, Congestion prevention policies, Load shading, Jitter Control, Quality of Service, InternetworkingNetwork layer Protocols: ARP, IP protocol, IP Addresses, IPV6, ICMP, Unicast Routing Algorithms: RIP, OSPF, BGP, Multicast Routing: IGMP, Mobile IP.

10

5.

Transport Layer Transport Layer: transport services, connection management, User Datagram Protocol (UDP), Transport Control Protocol (TCP), socket programming, TCP flow control, TCP congestion control.

10

6.

Application Layer Application Layer: Domain Name Systems (DNS), Electronic Mail, File Transfer Protocol, Trivial File Transfer Protocol (TFTP),World Wide Web, TELNET.

10

145


1. Tripati T. and Shivarajan K., “Computing approximate blocking probabilities in wavelength routed all-optical networks with limited-range wavelength conversion”, IEEE Journal, Volume 18,Oct 2000.

2. Harai H., Masayuki M. and Miyahara H., “Performance of alternate routing methods in all-optical switching networks", Proc. IEEE INFOCOM, 1997.

3. Ramaswami R. and Sivarajan K. , "Routing and wavelength assignment in all-optical networks", IEEE/ACM Trans. Networking, vol. 3, pp.489 -500 1995.

Suggested Evaluation Methods 1. Continuous Assessment

A) Essential a) Unit Tests b) Seminar c) Assignments

B) Optional a) Quizzes b) Mini Project

2. End Semester Examination a) Written Exam

Parallel/Similar courses in the existing curriculum Sr. No. Name of the course Institute where it is offered 1 Computer Networks IIT Roorkee 2 Computer Networks Mumbai University

Sub-specialization committee Name of Member

Prof. Maya Shelke

Prof. Praveen Gubbala

Dr.Himanshu Agrawal

Prof. Shilpa Gite



Associate Professor (CS & IT)



Signature


Date:

146



Specialization: Computer Science and Information Technology Course Name: Internet Technologies (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives The students will be able to:

1. Compare the structure and function of markup languages including Hypertext Markup Language (HTML), Dynamic HTML (DHTML).

2. Describe client-side programming technologies such as JavaScript and compare Common Gateway Interface (CGI) Scripting / Practical Extraction Reporting Language (PERL).

3. Develop server side programming using PHP Hypertext Preprocessor an open-source, interpretive, HTML- centric.

4. CreateXtensible Markup Language (XML) documents, its functionality such as create, manipulate, parse, and use style sheets to format XML documents and validate using Document Type Definition (DTDs).

5. Analyze the integration of server and client side script with Java script for construction of web applications.

6. Design real time projects using Java Server Pages (JSP) and Java Script.

Pedagogy 1. Interactive classroom teaching and discussions 2. Brainstorming Sessions 3. Seminars 4. Projects


1

Introduction to Web, HTML and CGI scripting with PERL HTML (Hypertext Markup Language) tags: text formatting tags, lists, tables, images, forms, Frames, cascading style sheets. Java Script: introduction and basic elements of Java Script, Objects in Java Script, DHTML (Dynamic HTML) with Java Script. CGI (Common Gateway Interface)Scripting. PERL(Practical Extraction Reporting Language): basic elements .

10

2 PHP (PHP Hypertext Preprocessor) and XML(Xtensible Markup Language) PHP (PHP Hypertext Preprocessor) web environment, basic elements, GET

10

147


and POST input methods, input validation, string manipulation and regular expression, File management: file system function, file input and output: error handling, HTTP(Hyper Text Transfer Protocol) headers and output control functions, HTTP cookies, HTTP sessions. Communication with MySQL (My Structured Query Language) via PHPMySQL API (Application Programming Interface). XML (Xtensible Markup Language) basics, XML schema and DTD(Document Type Definition), XSLT(eXtensible Stylesheet Language Transformations)and Programming, XML processors: DOM(Document Object Model) and SAX(Simple API for XML).

3

Servlets Lifecycle of a Servlet, Servlet API. Reading Servlet parameters and initialization parameters. Http Request & Responses, cookies-session tracking.

10

4

Java Server Pages The Anatomy of a JSP (Java Server Pages), JSP Processing. JSP Application Design with MVC (Model View Controller). JSP Application Development: generating dynamic content, using scripting elements. Implicit JSP objects, conditional processing – displaying values using an expression to set an attribute, declaring variables and methods error handling and debugging. Sharing data between JSP pages, requests, and users passing control and date between pages – sharing session and application data – memory usage considerations.

5

5

Protocols and Services in Internet Application and Protocols in internet: Remote login: TELNET (Telecommunication Network/Terminal Emulation Link Network). File transfer: Ftp (File Transfer Protocol). Electronic mail: SMTP (Simple Mail Transfer Protocol), POP (Post Office Protocol), IMAP (Internet Message Access Protocol). Support service: DNS (Domain Name System), SNMP (Simple Network Management Protocol).Network configuration protocols: DHCP (Dynamic Host Configuration Protocol), web proxies.

5

6

Directory services and Security in Web applications: Directory services: X500 Directory Services, LDAP (Lightweight Directory Access Protocol). Internet and application Security: Secure Electronic Transactions over web, Secure Email, HTTPS(Hyper Text Transfer Protocol Secure), SSL(Secure Socket Layer) and TLS(Transport Layer Security) implementation in web applications, firewalls, Kerberos.

5

Books Recommended

1. “HTML Black Book: The Programmer's Complete HTML Reference Book “, Holzner, Steve ISBN 1932111301, Coriolis Group Books ,2nd Edition May 23rd 2000 2. “Web Enabled Commercial Application Development using HTML, DHTML, JavaScript, Perl, CGI” ,

Ivan Bayross,ISBN-9788176562744,BPB Publication,3rd revised Edition 2004-11-15 3. “Web Enabled Commercial Application Development Using HTML, JavaScript, DHTML and PHP” ,

Ivan Bayross,ISBN-9788183330084,BPB Publication,4th revised edition, 2010 4. “JavaServer Pages™”,Hans Bergsten,ISBN 9780596003173,O'Reilly Media,2nd Edition, August

2002 .

148


5. “Head First Servlets and JSP: Passing the Sun Certified Web Component “,Bryan Basham, Kathy Sierra, Bert Bates ,ISBN-9780596516680,O’Reily Media, 2nd Edition March 2008 .

6. “XML :The Complete Reference”, Heather Williamson,ISBN 9780070447257, Tata McGraw Hill Publication,1st Edition 2001.

7. “Frontiers of Electronic commerce”, Ravi Kalakota and Andrew B Whinston,ISBN-9780201845204 , Addison Wesley 1st Edition Jan 1996


1. Walczowski, L.T. ,Waller, W.A.J. “Java Servlet technology for analogue module generation” , IEEE 1999

2. Min-Juan Z., Xuan W. and Liu De-Xi , Jiao Xian-Pei,”Research on XML Element Search Results Clustering”,IEEE 2012.

3. Lu K., Tu X. and Jun Zou , “Design and implementation of DHCP & LDAP directory service integrated management system”, IEEE 2002





a) Quizzes B) End Semester Examination

a) Written Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Internet Technologies Mumbai University Sub-specialization committee

Name of Member Kalyani Kadam Meeta Kumar Ambika Pawar Suman Tanwar







Date:

149



Specialization: Computer Science and Information Technology Course Name: Data Base Management Systems Lab (UG/PG): UG Number of Credits: 2 Level: 2 Learning Objectives The students will be able to:

1. Discuss the programming concepts in SQL. 2. Create and Modify Database Objects. 3. Manipulate Data and Retrieve Data from the Database server. 4. Perform database operations in a procedural manner using PL/SQL. 5. Design and develop database applications like banking, reservation system, etc.

Pedagogy

1. Classroom teaching 2. Practical using tools like MySql 5.1, Oracle

Pre-requisites

None

150



1 Draw an ER diagram and EER diagram and convert it into relational database and draw schema diagram.

5

2 Write and execute basic SQL query- create, alter, insert, update and delete. (instructor should frame appropriate problem definition).

10

3 Write and execute SQL functions- aggregate, numeric, date, string, and conversion.

10

4 Write and execute SQL queries- Operators (and, or, not, like, between, in), 5 5 Write and execute SQL queries- subqueries, joins. 5 6 Write and execute basic Pl/SQL programs - simple program, condition

statements and loops. 5

7 Write and execute Pl/SQL function to print /return binary equivalent of decimal number.

5

8 Write and execute PL/SQL procedure to transfer fund from one account to another.

5

9 Write and execute triggers using PL/SQL. 5 10 Create and perform database operations using ODBC. 5

Books Recommended 1. "Database System Concepts", Silberschatz A., Korth H., Sudarshan S., 6th Edition, 2010, McGraw Hill. 2. "Database Systems", Connally T., Begg C., 3rd Edition, 2004, Pearson Education. 3. "Database Systems Design, Implementation and Management", Rab P. Coronel C., 5th Edition,

Thomson. 4. "Fundamentals of Database Systems", Elmasri R., Navathe S., 6th Edition, 2010, Pearson Education. 5. "An Introduction to Database Systems", Date C., 7th Edition, 2000, Pearson Education. 6. “MySQL Administrator’s Bible”, Sheeri K. Cabral and Keith Murphy, O'Reilly Media. Research Papers/Articles recommended for reading 1. Ma H., “An Approach on Grid Services Transaction Management for Grid Overflow”, ICIECS, 2009. 2. Ma H. and Z.M., “Object Comparison in Fuzzy object-oriented databases”, ICIS, 2009. 3. Gupta S., Saroha K. and Bhawna ,”Fundamental Research of Distributed Database”,IJCSMS







151


S.No. Name of the course Institute where it is offered 1 Database Management

Systems Lab COEP









Date:

152



Course Name: Computer Networks Lab (UG/PG): UG Number of Credits: 1 Level: 2 Learning Objectives The students will be able to:

1. Explain how to design Local Area Network (LAN) using various networking components and share resources.

2. Recognize packets according to protocols and understand performance of LAN. 3. Discuss use of various Linux commands. 4. Explain concept of flow control and select appropriate flow control algorithm. 5. Describe how to configure web applications using Apache Tomcat Server. 6. Explain working of dynamic routing algorithms in Internet. 7. Classify routing algorithms into topology based algorithm and flow based algorithm based on

working of routing algorithm. 8. Summarize all connection oriented services using TCP and connectionless services using UDP.

Pedagogy 1. Practical on set up of Computer Network in a lab 2. Practicals using softwares such as Tomcat Apache Server and Linux Operating system.

Pre-requisites None

153


Books recommended 1. "Computer Networks", Tanenbaum A ,4th Edition, PHI ISBP 81 - 203 - 2175 – 8. 2. "Data Communications and Networking", Fourauzan B., 3rd edition, Tata McGtaw Hill Publications,

2004, ISBN 0 - 07 - 058408 – 7. 3. "Computer Networks and Internet", Comer D., 2nd Edition, Fieatson Education, ISBN 81 -7808-086-

9. 4. "Computer Communications and networking Technologies", Gallo M., Hancock W., Thomson

Brooks/Cole, ISBN 8811 - 240 - 354 – X. 5. “Telecommunication Network Design Algorithms”, Kershenbaum A., Tata McGraw Hill. 6. “An Engineering Approach to Computer Networking”, Keshav S., Addison-Wesley, 1997. 7. “Data Networks”, Bertsekas D. and Gallager R., Englewood Cliffs, 2nd Ed., Prentice-Hall. 8. “Design and Analysis of Computer Communication Networks”, Vijay Ahuja, McGraw Hill. 9. “Networking – The Complete Reference”, Zacker, Tata McGraw Hill.

Sr. No. Topic Hours

1.

Study of existing LAN and understand the design and various components. Perform following tasks

a) Set up a small network of 3 to 4 computers and Hub/Switch as directed by the instructor.

b) Use LAN Card, UTP Cables and Connectors. Install LAN Cards and Crimp the connectors.

c) Assign unique IP addresses and share C drive on each machine. d) Test the network by using PING command. e) Use protocol analyzer Software. f) Repeat the assignment by installing two LAN Cards in one of the

machines. g) Repeat the same assignment by adding a router. h) Configure the router and use RIP.

4

2. Study any protocol analyzer software (e.g. LAN Explorer) and network monitoring software like Ethereal to learn and use its important features.

4

3. Assignment to learn and understand Linux and/or Novel Netware Network configurations and commands.

4

4. Implement a program to simulate stop and wait protocol and sliding window protocol.

4

5. Installation and configuration of Tomcat Apache server. Study and use various facilities/commands and features.

4

6. To implement Distance Vector Routing Algorithm 4

7. To Implement Dijkstra’s routing algorithm.

4

8. Write a program in C/C++ to implement an ECHO server, using Socket programming with both TCP/UDP protocols.

2

154


Research Papers/Articles recommended for reading 1. Shin S., Choi S., Park H., and Kwon W., "Packet error rate analysis of ieee 802.15.4 under IEEE

802.11b interference," LNCS: Wired/Wireless Internet Communications, vol. 3510, no. 2005, pp. 279- 288, 2005.

2. IEEE Standard for Information Technology - Telecommunications and Information Exchange between Systems - Local and Metropolitan Area Networks - Common Specifications - Part 3: Media Access Control (MAC) Bridges. ANSI/IEEE Std 802.1D, 1998 Edition, 1998.

3. Allman M., Ostermann S. and Metz C., FTP Extensions for IPv6 and NATs. RFC 2428. Sep. 1998 4. Tripati T. and Shivarajan K., “Computing approximate blocking probabilities in wavelength routed

all-optical networks with limited-range wavelength conversion”, IEEE Journal, Volume 18,Oct 2000. 5. Birman A., "Computing approximate blocking probabilities for a class of all-optical networks", IEEE

J. Select. Areas Commun./J. Lightwave Technol., Special Issue Optical Networks, vol. 14, pp.852 -857 1996.

6. Harai H., Masayuki M. and Miyahara H.,”Performance of alternate routing methods in all-optical switching networks", Proc. IEEE INFOCOM, 1997.

7. Ramaswami R. and Sivarajan K. , "Routing and wavelength assignment in all-optical networks", IEEE/ACM Trans. Networking, vol. 3, pp.489 -500 1995.



a) Lab Assignments 2. Optional


B) End Semester Examination. a) Viva-Voce b) Lab Exam


Sr. No. Name of the course Institute where it is offered 1 Computer Networks Lab IIT Madras 2 Computer Networks Lab VIT Vellore


Name of Member

Prof. Maya Shelke

Prof. Praveen Gubbala

Dr.Himanshu Agrawal

Prof. Shilpa Gite







155


Date:


Course Name: Internet Technologies Lab (UG/PG): UG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Develop fundamental knowledge of application development for the internet using HTML (Hyper Text Markup Language).

2. Create web applications using various tools and techniques 3. Develop the XML(eXtensible Markup Language) document and its strengths and weaknesses as a

tool for structuring data and information; 4. Design server side scripting application using PHP (PHP Hypertext Preprocessor). 5. Identify different Servlet containers and understand their architecture and method of work. 6. Construct real time projects with the help of JSP (Java Server Pages) using Java Beans. 7. Compare difference between Servlets and JSP.

Pedagogy

1. Lab Assignments 2. Projects on building “online web application”


1 Assignment on HTML with tables and lists 4 2 Assignment on HTML with JavaScript and Cascaded Style Sheet(CSS). 4 3 Assignment on XML(Xtensible Markup Language). 4 4 Assignment on XML. 3

156


5 Assignment on PHP(PHP Hypertext Preprocessor). 2 6 Assignment on PHP(PHP Hypertext Preprocessor). 2 7 Assignment using Servlet. 3 8 Assignment using Servlet. 3 9 Assignment on JSP(Java Server Pages). 2

10 Assignment on JSP(Java Server Pages). 3 Books Recommended 1. “HTML Black Book: The Programmer's Complete HTML Reference Book “, Holzner, Steve

ISBN 1932111301, Coriolis Group Books 2nd Edition May 23rd,2000. 2. “Web Enabled Commercial Application Development using HTML, DHTML, JavaScript, Perl, CGI” ,

Ivan Bayross,ISBN- 9788176562744, BPB Publication 3rd revised Edition 2004-11-15. 3. “Web Enabled Commercial Application Development Using HTML, JavaScript, DHTML and PHP” ,

Ivan Bayross,ISBN-9788183330084, BPB Publication 4th revised edition, 2010. 4. “JavaServer Pages™”, Hans Bergsten,ISBN 978-0-596-00317-3,O'Reilly Media ,2nd Edition, August

2002. 5. “Head First Servlets and JSP: Passing the Sun Certified Web Component “,Bryan Basham, Kathy

Sierra, Bert Bates ,ISBN-9780596516680,O’Reily Media, 2nd Edition March 2008. 6. “XML :The Complete Reference”, Heather Williamson,ISBN 9780070447257, Tata McGraw Hill

Publication 1st Edition 2001. 7. “Frontiers of Electronic commerce”, Ravi Kalakota and Andrew B Whinston,ISBN-9780201845204 ,

Addison Wesley 1st Edition Jan 1996.

Research Papers/Articles recommended for reading 1. Walczowski, WallerL.T., “Java Servlet technology for analogue module generation” , IEEE 1999 2. Min-J. Z., Xuan W. and Liu De-Xi ,”Research on XML Element Search Results Clustering” ,IEEE

2012. 3. Lu K., Yun X. Tu and Jun Zou , “Design and implementation of DHCP & LDAP directory service

integrated management system”, IEEE 2002. Suggested Evaluation Methods

A) Continuous Assessment 1. Essential a) Lab Assignments 2. Optional a) Quizzes

B) End Semester Examination a) Project b) Viva-Voce c) Lab Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Internet Technologies Lab

Mumbai University


Name of Member Kalyani Kadam Meeta Kumar Ambika Pawar Suman Tanwar

Designation Assistant Assistant Assistant Assistant Professor

157


Professor (CS & IT)

Professor (CS & IT)

Professor (CS & IT)

(CS & IT)



Date:

158


Faculty of Engineering Specialisation: Mechanical Engineering

Course Name :Operations Research

(UG/PG) : UG

Number of Credits :3

Level : 2

Learning Objectives:

The student will be able to: 2. Discuss the basic concepts of quantitative techniques. 3. Explain the concepts of linear programming and simplex methods. 4. Describe the assignment model which is also used in Industrial Engineering. 5. Explain the dynamic programming structure and applications of dynamic programming. 6. Describe the concept of project management tools and. 7. Explain the concepts of critical path method (CPM) and project evaluation and review

techniques (PERT) in project management. 8. Describe the different concepts of inventory control methods which are useful in inventory

management. 9. Explain the different concepts of Queuing Theory. 10. Describe the use of simulation tools and techniques relevant to Operations Research.

Pedagogy

4. Classroom lectures 5. Assignments

Pre-requisites None

159


Course Outline

Books Recommended

1. Operations Research Techniques for Management, B. Banerjee, Business book publishing house 2. Operations Research, An Introduction, H. A. Taha, Macmillan 3. Operations Research,P. K. Gupta and D. S. Hira, S. Chand & Co. 4. Quantitative Techniques in Management, N. D. Vora, Tata McGraw Hill, New Delhi

Research Papers/Articles recommended for reading: Nil


C. Continuous Assessment 3. Essential

2. Unit Tests 3. Assignments

4. Optional d. Quizzes e. Seminars f. Mini project

D. End Semester Examination 2. Written Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered 1 Operations Research COEP

Sl. No. Topic Hours

1

Linear Programming (LP) Models Introduction to operation research. Definition, characteristics and limitations of linear programming. Solutions of LP problems (LPP) by graphical methods and simplex method. Sensitivity analysis and formulation of the dual of the LPP.

8

2 Model of Operation Research Assignment model, travelling salesman problem by branch and bound method, transshipment model, transportation model.

9

3

Dynamic Programming Dynamic programming structure and characteristics of dynamic programming, application of dynamic programming to resource allocation, inventory control and linear programming

8

4

Project Management Project Management: Drawing of network, critical path method (CPM)andproject evaluation and review techniques (PERT), probability of completion of project, cost analysis, allocation and updating of networks.

6

5

Replacement Models Concept of equivalence, interest rate, present worth, economic evaluation of alternatives, group replacement models. Inventory control models. Analysis of single product deterministic models.

8

6 Queuing Theory Waiting line situations, queuing theory and models. 6

160


Subspecialization Committee Name of Member A. Ubale Vijay K. Jatti



Signature


Date:

161


Faculty of Engineering Specialization: Electronics and Telecommunication Engineering

Course Name: Digital Signal Processing (UG/PG): UG Number of Credits: 4 Level: 3 Learning Objectives The student will be able to:

1. Classify systems as linear and nonlinear, causal and non-causal, time variant and time invariant 2. Model linear time invariant systems in the time domain using difference equations and be able

to determine response to inputs by solving these difference equations. 3. Apply the one sided –z transform to model and analyse LTI systems. 4. Calculate the response of the discrete time system to an input using convolution. 5. Choose an appropriate sampling rate for the signal and understand the effects of aliasing 6. Decompose a higher order system into a realisation composed on lower order blocks and realise

the block diagram representation.. 7. Demonstrate an understanding of the Discrete Fourier transform and the concept of digital

frequency. 8. Illustrate how the FFT can be used to compute the DFT of a signal in an computationally

efficient manner and how it is used in fast convolution. 9. Design FIR and IIR filters. 10. Choose an appropriate method of filter design. 11. Justify the choice of filter for a given application. 12. Explain how digital signal processing is used in various applications. such as image processing

and speech processing.

Pedagogy 1. Lectures 2. Problem solving using MATLAB DSP Toolbox 3. Real time signal processing on DSP Processor

Pre-requisites None.

162


Course Outline

Books Recommend

ed

1. “Digital Signal Processing”, Vallavaraj, Salivahanan, Gnanapriya, , TMH, 2nd edition. 2. “Digital Signal Processing”, Proakis, Manolakis, PHI, 3rd edition.

S.No. Topic Hours

1

Characterization of LTIDT System Basic elements of DSP system, advantages of DSP over analog processing, Sampling theorem, practical sampling, aliasing. Time domain Analysis of DT System: Difference equations, Recursive solution of difference equation, zero input response, unit impulse response, system response to external input, convolution sum, total response of DT system, causal LTIDT system stability. Systems with finite duration and infinite duration impulse response, structures for the realization of LTIDT systems, Direct form I & II.

12

2

Fourier Analysis of DT System DTFS & DTFT, power & energy density of periodic and aperiodic signals, computation of DTFT, DFT, properties of DFT, FFT, DIT, DIF..

10

3

DT System Analysis Using Z- Transform Need of Z – transform, Definition, Inverse, properties, Z-Transform solution of difference equations, Connection between DTFT and Z-transform, system stability and Z-Transform, classification of system using pole zero plot.

10

4

Digital Filters Realization of digital filter, causality & its implications, time domain equivalence criterion, IIR design by impulse invariance method, bilinear transformation, FIR design Linear phase conditions, time domain equivalence method, frequency sampling method.

12

5

Multirate Sampling Introduction, decimation, interpolation, sampling rate conversion, polyphase implementation of filter. Applications: DAC in compact Hi-Fi Systems, acquisition of high quality data, multirate narrowband digital filtering, Hi resolution narrow band spectral analysis.

8

6

DSP Hardware Platform Introduction, difference between microprocessor and DSPs, general architecture of DSPs. Case Study of TMS320C67XX, speech processing, interpolation and decimation implementation , convolution sum.

8

163


3. “Discrete Time Signal Processing”, Oppenheim, Schafer & Buck, PHI, 2nd edition. Research Papers/Articles recommended for reading

1. Sonika Gupta, Aman Panghal “Performance Analysis of FIR Filter Design by Using Rectangular, Hanning and Hamming Windows Methods”. International Journal of Advanced Research in Computer Science and Software Engineering, Volume 2, Issue 6, June 2012.


A. Continuous Assessment 1.Essential

a. Unit Tests b. Assignments

2.Optional a. Quizzes b. Class Tests c. Seminars

B. End Semester Examination a. Written examination

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered 1 Digital Signal Processing

Pune University

2 Digital Signal Processing

Mumbai University


Name of Member

Parul Garg Dr. Neela R.

Designation Asst. Professor Professor


Signature


Date:

164



Course Name: Business Informatics (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Illustrate foundations of information systems and management like their levels, information exchange between them.

2. Apply MIS in different sectors such as manufacturing, banking sector etc. 3. Relate Enterprise Management System (EMS) with Management Information System (MIS) and can

use Business Informatics tools. 4. Illustrate Customer Relationship Management (CRM) in terms of its phases, trends,

E-Commerce processes types and functioning of a Business Process Outsourcing (BPO). 5. Apply concepts and philosophy in Decision Support System (DSS) on the basis of problem analysis

type.

Pedagogy 1. Class room teaching 2. Group discussion 3. Seminars

Pre-requisites

None


1. ''Management Information Systems", 2nd Edition, Jawadekar W., Tata McGraw-Hill Publishing Company Limited, 2002, ISBN 0 -07 - 044575 - 3.

2. "Information Technology for Management", Lucas Henry C., Tata McGraw-Hill Publishing Company Limited, 2004, ISBN 0 - 07- 047242- 4

165


3. "Management Information Systems' 3rd Edition, Anderson D., Tata McGraw-Hill Publishing Company Limited, ISBN 0 - 07 - 049940 -3.

4. "Management Information Systems: A Managerial Perspective", Gupta L., Galgotia, ISBN 81 -7515-085-8.


1. Qunli W., “Analysis on the Integration of ERP with E-business”, Third International Symposium on Intelligent Information Technology and Security Informatics (IITSI), 2010.

2. Al-Mashari M., “Enterprise resource planning (ERP) systems”, Department of Information Systems, Saudi Arabia.







Sr. No. Name of the course Institute where it is offered 1 Business Informatics Mumbai University


Name of Member

Rahul Joshi Maya Shelke Swati Ahirrao Ambika Pawar






Signature


Date:

166


Faculty of Engineering Specialization: Civil Engineering

Course Name: Project Management (UG/PG): UG Number of Credits: 4 Level: 4 Learning Objective(s) The student will be able to:

1. Discuss various facets of construction project and its management. 2. Explain principles of management and discuss types of organizations. 3. Select appropriate technique like CPM & PERT for project management. 4. Explain resources planning, allocation to optimize resources, crashing and updating. 5. Select method for effective material management. 6. Indicate optimum site layout for the construction work. 7. Identify zones of danger and select appropriate methods of safety. 8. Describe laws of economics applicable to project. 9. Discuss factors related to budget, actual expenditures and profits. 10. Express ethical practices in project management. 11. Restate general and special conditions of contract document.

167


Pedagogy

Sr.No. Topic Hours 1 Overview of Project Management

Introduction to project management & organization: Importance, objectives & functions of management, categories of project, project life cycle, importance of organization, principles of organization, Fayol’s principles of management, types of project organization- line, functional, line & staff, matrix structure, project structure.

9

2 Project Management concepts and techniques Project planning & scheduling, Gantt chart & its limitations, network planning, network analysis- CPM and PERT, Activity on Arrow (AOA), Activity on Nodes (AON) precedence networkanalysis, project time control, project cost control, crashing, resource allocation & leveling, updating, monitoring & control.

8

3 Materials Management Objectives of Materials management, inventory control, economic order quantity, ABC analysis.

8

4 Site layout and Safety Engineering Site layout-factors for site layout selection, site layout for various civil engineering projects, safety engineering causes of accidents on various sites, safety measures and safety policies to be adopted, determination of safety parameters, Personal protective equipment.

8

5 Project Economics Introduction to project economics, definition, principles, importance in construction industry, difference between cost, value, price and its relevance to marketing utility, law of diminishing marginal utility, demand, demand schedule, law of demand, demand curve, elasticity of demand, supply, supply schedule, supply curve, elasticity of supply, law of substitution, equilibrium, equilibrium price, equilibrium amount, factors affecting price determination.

9

6 Project Appraisal Financial appraisal: Definition of money, rent, simple and compound interest, profit, annuities, capital, types of capital, working and fixed capital, cost composition, benefits, interest rates, discount rate, time value of money, parameters and criteria for project selection, benefit - cost analysis-b/c ratio, NPV, IRR, pay-back period.

9

7 Contract management and Professional practices Project procurement management; post project analysis, concept of ethics, professional ethics, provisions of professional code, role of professional bodies, construction procedures: different methods of construction, types of contract, tenders, prequalification procedure, earnest money deposit, contract document, general and important conditions of contract, legal aspect of project management

9

1. Interactive classroom teaching & discussions about project as a concept, principles of management

2. Seminars for understanding CPM, PERT, resources planning, allocation and equipment management

3. Use of software’s for project planning 4. Case studies to explain management principles, economics of project and contract

administration Course Outline

168


Books Recommended 1. Jebsen, J., ‘Cost and Optimization Engineering’, McGraw Hill, New York. 2. Moder, J.J. & Phillips, C.R., ‘Project Management with CPM and PERT’. 3. Sengupta, B. and Guha, H., ‘Construction Management and Planning’, Tata McGraw Hill, New

Delhi. 4. B.C.Punmia, “Project Planning and Control with PERT and CPM”, Laxmi Publications (P) Ltd.


1. Denise M. Guérin, (2012), Project Management in theConstruction Industry, March 2012(Retrived from:http://projectmgmt.brandeis.edu/downloads/BRU_MSMPP_WP_Mar2012_Construction_Industry.pdf)

2. Lee, D. , Lim, T. , and Arditi, D. (2011). "An Expert System for Auditing Quality Management Systems in Construction." Computer-Aided Civil and Infrastructure Engineering, 26(8), 612-631.



e. Unit test f. Assignments g. Presentation h. Quiz

4. Optional b. Surprise test

D. End Semester Examination 3. Written Exam 4. Viva-voce

Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it was offered 1 Project Management Parul University Sub specialization Committee

Name of Member

Sayali Sandbhor Anuradha Salunkhe


Assistant Professor


Signature


169


Date:


Course Name: Digital Signal Processing Lab (UG/PG): UG Number of Credits: 1 Level: 3 Learning Objectives The student will be able to:

1. Plot analog and discrete time signals for different sampling frequency and compare. 2. Perform convolution operation on given discrete time signals. 3. Compute auto - correlation and cross correlation of two signals. 4. Perform circular convolution of discrete time signals in the time domain. 5. Determine the discrete Fourier transform of a given sequence and plot the frequency

response. 6. Perform circular convolution of discrete time signals in the frequency domain using FFT. 7. Design FIR filters using window method. 8. Design IIR filters as Butterworth and Chebyshev filters using impulse invariance and

bilinear transform methods Pedagogy

1. Perform DSP using Matlab 2. Perform DSP using TMS320C6713 Processor

170


Pre-requisites None Course Outline

Books Recommended

1. “Digital Signal Processing”, Vallavaraj, Salivahanan, Gnanapriya, , TMH, 2nd edition. 2. “Digital Signal Processing”, Proakis, Manolakis, PHI, 3rd edition. 3. “Discrete Time Signal Processing”, Oppenheim, Schafer & Buck, PHI, 2nd edition. 4. “Digital Signal Processing Lab Manual” McGraw Hill.


1. Sonika Gupta, Aman Panghal “Performance Analysis of FIR Filter Design by Using Rectangular, Hanning and Hamming Windows Methods”. International Journal of Advanced Research in Computer Science and Software Engineering, Volume 2, Issue 6, June 2012.


A. Continuous Assessment

S.No. Topic Hours

1 Verification of Sampling theorem. 2

2 Determination of Impulse response of a given system 2

3 Linear convolution of two given sequences. 2

4 Circular convolution of two given sequences 2

5 Autocorrelation of a given sequence and verification of its properties. 2

6 Cross correlation of given sequences and verification of its properties. 2

7 Solving a given difference equation. 2

8 Computation of N point DFT of a given sequence and to plot magnitude and phase spectrum. 2

9 Linear convolution of two sequences using DFT and IDFT. 4

10 Circular convolution of two given sequences using DFT and IDFT 2

11 Design and implementation of FIR filter to meet given specifications. 4

12 Design and implementation of IIR filter to meet given specifications. 4

171


1.Essential a. Experiment performance b. Journal

2.Optional a. Quizzes b. Viva

B. End Semester Examination 1. Practical examination

2. Viva Voce

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered 1 Digital Signal Prosessing Lab Pune University 2 Digital Signal Prosessing Lab Mumbai University Sub specialization committee

Name of Member

Parul Garg Dr. Neela P.

Designation Asst. Professor Professor


Signature


Date:

172



Course Name: Distributed Systems (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Apply design issues for designing distributed systems. 2. Use communication primitives for communication in distributed systems. 3. Apply different techniques and algorithms for synchronization. 4. Demonstrate various mutual exclusion algorithm. 5. Use various strategies for deadlock handling. 6. Demonstrate various deadlock detection algorithm. 7. Use various techniques for fault tolerance and recovery in distributed system. 8. Demonstrate various algorithms for fault tolerance and recovery.

Pedagogy

1. Classroom teaching 2. Seminars 3. Labs 4. Group discussions

Pre-requisites

None

173



1 Introduction Introduction to distributed systems, distributed computing system models, design issues, communication primitives.

10

2 Synchronization Time and global states: clock synchronization, logical clocks, global state, co-ordination, election algorithms, mutual exclusion algorithms.

10

3 Distributed deadloack Detection Deadlock handling strategies in distributed system, issues in deadlock detection and resolution, centralized deadlock detection algorithm, Ho ramamoorthy algorithm, distributed deadlock detection algorithms, hierarchical deadlock detection algorithm

10

4 Recovery and fault tolerance Failures and their classification, check points, recovery in distributed databases, process resilience, reliable client server communication, reliable group communication, distributed commit and recovery.

5

5 Distributed shared memory Architecture, design issues, algorithms for implementing dsm, coherence protocol, case studies IVY.

5

6 Distributed File Systems Distributed file systems, SUN NFS, CODA, other DS, and comparisons, name services: name entities, locating mobile entities, removing unreferenced entities, case studies: DNS directory, global name service, X 500 DS.

5

Books Recommended 1. “Advanced Concepts in Operating System”, Mukesh Singhal, Shivratri, Tata McGRW Hill. 2. “Distributed Operating Systems Concepts and Design” Pradeep K. Sinha, PHI. 3. " Distributed Systems: Principles and Paradigms", Andrew S. Tanenbaum & Maarten van Steen, PHI.

Research Papers/Articles recommended for reading 1. Lelann G., Lampson et al. “Motivation, Objective, and Characteristics of Distributed Systems”,

Distributed Systems-Architecture and Implementation, Springer-Verlag, New York 1981 pp. 1-9 2. NelsonB. J., “Remote Procedure Call” PhD thesis, Computer Science, Carnegie Mellon University,

1981. Available as Technical Report CMU-CS-81-119 3. TenenbaumA. S. and Van Renesse R., “Distributed Operating System” Computing Surveys ACM,

vol.17, no. 4, Dec 1985, pp. 419-470. 4. LamportL., “Time, Clocks and Ordering of Events in Distributed Systems”, Communication of ACM,

July 1978. 5. SuzukiI. and KasamiT., “A Distributed Mutual Exclusion Algorithm”, ACM Trans. On Computer

Systems, Nov 1985. 6. ChandyK. M. and LamportL., “Distributed Snapshots: Determining Global States of Distributed

Systems” ACM Trans. On Computer Systems, Feb 1985 7. ObermarkR., “Distributed Deadlock Detection Algorithm”, ACM trans. On Database Systems, June

1982. 8. SinghalM., “Deadlock Detection in Distributed Systems”, IEEE Computer, Nov 1989. 9. CristianF., “Understanding Fault Tolerent Distributed Systems”, Communications of the ACM, Vol 34,

no.2, Feb. 1991, pp. 56-78.

174


10. McDermidJ., “Checkpointing and Error Recovery in Distributed Systems”, Proceedings of the 2nd International Conference on Distributed Computing Systems, Apr. 1982, pp. 271-282.

11. Howard J. H. “Scale and Performance in a Distributed File System”, ACM Transaction on Computer Systems 1988, Vol. 6, No. 1, Pp. 51-81.

12. ChenK. “Write Caching in Distributed File Systems”, Proceedings of 15th IEEE International Comnference on Distributed Computing Systems, IEEE 1995.



d) Unit Tests e) Seminars f) Assignments



Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Distributed Systems Pune University Distributed Systems Mumbai University Sub-specialization committee

Name of Member Nisha Auti Shraddha Phansalkar

Preeti Mulay Chahita Vadher






Signature Name of the Expert:

Signature: Date:

175



Course Name: System Programming (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Illustrate activities, specification and fundamentals of a language processor. 2. Outline passes of an assembler with its design procedure and functioning. 3. Outline passes of a macro processor with its design procedure and functioning. 4. Illustrate process of compilation and interpretation in software. 5. Illustrate the concept of linker and different types of loaders like compile and go loader,

absolute loader and sub routine linkages. 6. Illustrate software tools like FLEX, BISON for intermediate languages, different statement types

and procedure calls. Pedagogy

1. Class room teaching 2. Seminars

Pre-requisites None

176


Course Outline

S.No. Topic Hours

1 Language processors Introduction, language processing activities, fundamentals of a language processing, fundamentals of language, specification, language processor development tools.

7

2

Assemblers Elements of assembly language programming, a simple assembly scheme, pass structure of assemblers, design of a two pass assembler, a single pass assembler for IBM PC.

7

3

Macros and macro processor Macro definition and call, macro expansion, nested macro calls, advanced macro facilities, design of macro preprocessor.

10

4

Compilers and interpreters Aspects of compilation, memory allocation, compilation of expressions, compilation of control structures, Interpreters.

8

5

Linkers and Loaders Relocation and linking concepts, design of a linker, self-relocating programs, linking for overlays, loaders, types of loaders: compile and go loader, absolute loader, sub routine linkages, relocating loader, direct linking loader.

7

6

Software tools Intermediate languages, declarations, assignment statements and Boolean expressions, case statements, back patching, procedure calls, introduction to LEX, YACC with FLEX, BISON

6

Books Recommended 1. “System Programming and Operating Systems – 2nd Edition”, D.M. Dhamdhere, TMGH. 2. “LINUX System Programming”, Robert Love, O’Reilly. 3. “System Programming”, J. J. Donovan, Mc-Graw Hill.

Research Papers/Articles recommended for reading 1. Batson and Alan, “The Organization of Symbol Tables”, CACM, vol. 8, No. 2, pp. 111-112. 2. Mcllro and Douglas W., “The Compiled Macro Assembler”, Proceedings, AFIPS, SJSS, pp. 89-93. 3. Lowry, Edward S. and C.W. Medlock, “Object Code Optimization”, CACM, vol.12, no. 1, pp. 13-22. 4. Strachey C., “A General Purpose Macrogenerator”, Computer Journal, vol. 8, no. 3, pp. 255-241. Suggested Evaluation Methods

C) Continuous Assessment 1. Essential



D) End Semester Examination a) Written Exam

177


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 System Software IIT Roorkee 2 System Programming Pune University Sub-specialization committee

Name of Member Rahul Joshi Shraddha Phansalkar

Poorva Agrawal Prerna Arote







Date:

178



Course Name: Object Oriented Analysis and Design (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Analyze Unified Modeling Language 2.0 and overview of its diagrams as a modeling tool for large and complex systems.

2. Illustrate different diagrams used in Object Oriented Analysis like Use Case Diagram. 3. Identify dynamic behavior of the system using Interaction Diagrams. 4. Model State Diagrams which gives abstract description and behavior of a system. 5. Illustrate UML design for the creation of an application system using forward and Reverse

engineering methods.

Pedagogy 1. Interactive classroom teaching and discussions 2. Brainstorming sessions 3. Projects 4. Seminars

Pre-requisites None

Course Outline

179


Books Recommended

1. "Unified Modeling Language User Guide", Grady Booch, James Rumbaugh, Ivar Jacobson, the 1stEdition, and (Addison-Wesley Object Technology Series),First Edition, ISBN: 0-201-57168-4, 1998.

2. "UML Distilled: A Brief Guide to the Standard Object Modeling Language", Martin Fowler, , Third Edition,Addision Wesley, 2004.


1. Monarchi, D.E., and Puhr, G.I. (1992). A Research Typology for Object-Oriented Analysis and Design. Communications of the ACM, Vol. 35, No. 9, pp. 35-47.

2. Cackowski, David. Object analysis in organizational design: A solution for matrix organizations; Project Management Journal, Sylva; Sep 2000; Vol. 31, Iss. 3; pg. 44, 8 pgs

3. Apicella, Mario. UML simplifies project notation. InfoWorld, Framingham; Mar 27, 2000; Vol. 22, Iss. 13; pg. 69, 2 pgs



a) Unit Tests b) Assignment c) Case Study

2. Optional

a) Quizzes b) Seminars

S.No. Topic Hours

1

Introduction to Object Management Group (OMG) Standards and Unified Modeling Language (UML) OO Concepts Review, Rational Unified Process emphasizing Inception, Elaboration, Construction, Transition Phase's. Use Case View architecture, Architectural approaches: Use case Centric, Architecture driven, Iterative approach, UML 2.0. UML History, UML 2.0, New Features, UML Meta Model, Advanced relationships generalization, association, aggregation, dependencies, Extensibility mechanisms like stereotypes, tagged values, constraints and profiles, Overview of all diagrams in UML 2.0.

09

2 Object Diagrams Use case diagrams, Analysis Class Diagram, CRC method, Class diagrams, Classes and Relationships, Interfaces and ports, Active Objects.

10

3 Interaction diagrams Interaction Overview diagrams, Interactions, signals, exceptions, regions, partitions, Sequence diagrams, Collaboration diagrams.

09

4

State Machine diagrams State Machine diagrams, States, encapsulation of states, transitions, submachine, state generalization, Timing diagrams, Activity diagrams, Activities, sub activities, signals, exceptions, partitions, and regions.

09

5

Support for Modeling Architecture in UML Deployment diagrams, Applications of UML commercial applications, All diagrams are to be assumed for UML 2.0 for each diagram the need, purpose, Concepts, Notation, Forward Engineering, Reverse Engineering &Application must be considered.

08

180



Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1 Object Oriented Analysis and Design IIT Madras 2 Object Oriented Analysis and Design VTU Sub specialization committee Name of Member Manisha Tijare Suman Tanwar Poorva Agrawal Seema Patil






Signature


Date:

181



Specialization: Electronics and Telecommunication Engineering Course Name: Mobile Computing (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Identify wireless communication channels, multipath fading, path loss models, frequency reuse, handover, power control and efficient modulation techniques.

2. Distinguish Cellular networks and cell design, channel allocations and interference. 3. Illustrate the issues in Mobile TCP/IP, mobility and mobility management, ad-hoc networks. 4. Identify security issues in mobile communication network. 5. Model a project based understanding on handoff, power control and improving spectrum

efficiency.

Pedagogy 1. Interactive classroom teaching 2. Discussion on Research paper on MIMO, Power management, spectral efficiency, mobility

management 3. Case studies


182


Books Recommended

1. “Wireless Communications Principals and Practice”, Theodore S. Rappaport, Second Edition, Pearson Education.

2. “Mobile Communication”, Jochen Schiller, Pearson Education. 3. “Wireless and Cellular Telecommunications”, William C.Y. Lee, Third Edition, Mc Graw Hill

Publication. 4. “Mobile Computing Principles”, Reza B’Far (Ed), Cambridge University Presss.


1. Zhu H. and Kwak K. S., “An Adaptive Hard Handoff Algorithm for Mobile Cellular Communication Systems”, ETRI Journal, Volume 28, Number 5, October 2006.

2. Rahul H., Kumar S. and Katabi D., “Scaling Wireless Capacity with User Demands”, SIGCOMM 2012.

3. Jain R., “Channel models:” A Tutorial, Feb 2007. 4. Chandrasekhar V. and Jeffrey G. A., “Femtocell networks : A survey, IEEE Communications

Magazine” , September 2008.

S.No. Topic Hours

1.

Basics of wireless and mobile communication Overview of wireless and mobile communication, concept of radio signal propagation small scale fading, multipath fading, modulation techniques for mobile radio, basics of high data rates, OFDM modulation, path loss model, voice/data/video integration wireless IEEE standards, UWB. Medium access control-TDMA, FDMA, CDMA, SDMA.OFDMA.

15

2.

Cellular networks Cellular concepts, frequency reuse, handoff, handoff algorithms, interference, cell coverage, cell splitting, Channel allocation mechanisms, channel interference. Concept of intelligent cells. Cellular network architecture, radio interface, handover and security: GSM, GPRS, CDMA, WCDMA, UMTS, HSDPA, EV-DO, Wi-Max, 4G LTE.

15

3.

Mobile IP Routing in adhoc networks, routing algorithms, IPv6, micro-mobility support, DHCP, Mobile TCP. Issues with Mobile IP and TCP. Mobile Ad-hoc networks (MANETs), Vehicular Ad-hoc networks (VANETs).

5

4. Mobility management Mobility management, Mobility management protocols and security. Mobile OS, low power computing, Mobile agents.

5

5.

Advanced topics Recent development in the area of handoff, power control, MIMO, advanced cell designs, System evaluation, Future mobile networks. Case study on wireless network.

5

183







Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1. Wireless Communication IIT Delhi 2. Mobile Computing IIT Gawahati Sub-specialization committee

Name of Member Dr. Himanshu Agrawal

Shraddha Phansalkar

Shilpa Gite Ambika Pawar

Designation Associate Professor (CS & IT)





Signature


Date:

184



Course Name: Distributed Systems Lab (UG/PG): UG Number of Credits: 1 Level: 3 Learning Objectives The students will be able to:

1. Apply various design issues in the design of distributed system. 2. Simulate logical clocks and ordering in distributed system. 3. Simulate synchronization issues of processes in distributed system. 4. Simulate distributed deadlock detection algorithm. 5. Apply RMI for implementing RPC in operating system.

Pedagogy

1. Classroom teaching 2. Seminars 3. Labs 4. Group discussions

Pre-requisites

None

185



1 Discuss various distributed system design issues its advantages and limitations.

4

2 Write a program to simulate the functionality of Lamport's Logical clock in C.

2

Write a program to implement Vector clock in C. 2 3 Simulation of Lamport’s Mutual Exclusion algorithm. 2 4 Write a program to simulate Chandy’s Distributed Deadlock Detection

algorithm. 4

5 Discuss Checkpoint algorithm in DDBMS 2 6 Implement a distributed chat server using TCP sockets in java. 4 7 Implement‘Java RMI’mechanism for accessing methods of remote

systems. 4

8 Discuss DSM and Case Study of IVY 2 9 Discuss DFS and Case Study of NFS 2

10 Discuss various Load Balancing Algorithm 2 Books Recommended 1. “Advanced Concepts in Operating System”, Mukesh Singhal, Shivratri, Tata McGRW Hill. 2. “Distributed Operating Systems Concepts and Design” Pradeep K. Sinha, PHI 3. "Distributed Systems: Principles and Paradigms", Andrew S. Tanenbaum & Maarten van Steen, PHI

Research Papers/Articles recommended for reading 1. Lelann G. and Lampson et al. “Motivation, Objective, and Characteristics of Distributed Systems”,

Distributed Systems-Architecture and Implementation, Springer-Verlag, New York 1981 pp. 1-9. 2. Chandy K. and Lamport L., “Distributed Snapshots: Determining Global States of Distributed

Systems” ACM Trans. On Computer Systems, Feb 1985.





186


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Distributed Systems Lab Pune University 2 Distributed Systems Lab Mumbai University Sub-specialization committee

Name of Member Nisha Auti Shraddha Phansalkar

Preeti Mulay Chahita Vadher







Date:

187



Specialization: Computer Science and Information Technology Course Name: Computer Graphics and Multimedia (UG/PG): UG Number of Credits: 3 Level: 2 Learning Objectives The students will be able to:

1. Describe concepts of computer graphics with emphasis on line and circle drawing using Digital Differential Analyzer (DDA) and Bresenham's algorithm. 2. Express 2D and 3D transformations on objects. 3. Explainwindowing and clipping techniques on line and polygon. 4. Describe hidden surfaces and line removal techniques like Back-face removal algorithm, hidden

line methods, Z buffer, Warnock and Painters algorithm. 5. Express different curves and fractal generation methods. 6. Describe different text compression methods using Huffman coding. 7. Describe different animation techniques like onion skinning, motion cycling, masking, flip book

animation etc. Pedagogy


Pre-requisites None

188


Course Outline

S. No. Topic Hours

1

Introduction to Line and Circle Drawing Basic concepts: introduction to computer graphics, line and circle. generation using line generation - Digital differential analyzer (DDA) and Bresenham's algorithm, thick line segments, antialising of lines, circle generation using DDA and Bresenham's algorithm, polygons types, their representations, entering polygons, polygon filling usingseed fill, edge fill, scan conversion algorithm. Scan conversion in real time, solid area scan conversion, run length encoding, and cell encoding.

8

2

2D & 3D Transformation 2D transformations primitives and its concepts like translation, rotation, rotation about an arbitrary points, scaling and shearing, 3D transformations, rotation about an arbitrary axis, 3D viewing transformations, concept of parallel and perspective projections, viewing parameters, 3D clipping, mid-point subdivision algorithm.

8

3

Windowing and clipping Windowing and clipping using viewing transformation, 2D clipping, Sutherland-Cohen, subdivision line clipping algorithm, midpoint subdivision algorithm, generalized clipping, Cyrus-Beck algorithm, interior and exterior clipping, polygon clipping, Sutherland-Hodgman algorithm.

8

4

Hidden surfaces and lines, curves and fractals Hidden surfaces and lines study using Back-face removal algorithm, hidden line methods, Z buffer, Warnock and Painters algorithm, floating horizon, light, color and shading: diffused illumination, point source illumination, shading algorithm, curves and fractals study curve generation, interpolation, interpolating algorithms, interpolating polygons, B-Splins and corners, Bezier curves, fractals, fractal surfaces and lines.

8

5

Introduction to multimedia, audio and video formats What is multimedia, goals and objectives, characteristics of multimedia presentation, multimedia applications, multimedia building blocks, multimedia and internet, nature of sound waves, characteristics of sound waves, psycho-acoustic, and elements of audio systems likemicrophone, amplifiers, speakers, synthesizer, MIDI, digital audio, CD formats, audio file formats like WAV, AIFF, VOC, AVI, AVO, MPEG-I, MPEG-II, MPEG-HI, MPEG-IV, RMF, WMA, MFC. Video file formats: Video signal formats, Video transmission standards; EDTV, CCER, CIF, SIF, HDTV.

5

6

Text compression Types of text, text compression usinghuffman coding, LZ & LZW, text file formats like TXT, DOC, RTF, PDF, PS.

4

7

Animation Uses of animation, types of animation, principles of animation, techniques of animation such asonion skinning, motion cycling, masking, flip book animation, rotoscoping & blue-screening, color cycling, morphing, animation on the web, 3D animation, creating animation.

4

189


Books Recommended 1. "Fundamentals of Multimedia", Li Ze-Nian, Drew Mark S., Pearson Education, First Edition, ISBN

978-0130618726, November 1, 2003. 2. "Computer graphics: A Programming approach", Harrington Steven, Tata McGraw Hill, ISBN 0-07-

026753-7, 1987. 3. "Computer Graphics", M Pauline Baker and Donald Hearn, PHI, Fourth Edition, 2010, ISBN

0136053580. 4. "Multimedia: Computing, Communication and Applications", Steinmetz Ralf, Nahrstedt, Pearson

Education, ISBN 9788177584417, 2009. 5. "Computer Graphics Principles and Practice", Foley, Vandam, Feiner, Hughes, Addison Wesley.

Research Papers/Articles recommended for reading 1. Patel N. and Zaveri M., “3D Facial Model Construction and Expressions Synthesis using aSingle

Frontal Face Image”, International Journal of Graphics, Vol. 1, No. 1. Suggested Evaluation Methods




D) End Semester Examination a) Written Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Computer Graphics and

Multimedia KTU

Computer Graphics and Multimedia

Pune University



Maya Shelke Prerna Arote







190


Date:


Course Name: Object Oriented Analysis and Design Lab (UG/PG): UG Number of Credits: 1 Level: 3 Learning Objectives Students will be able to:

1. Selectand analyze case study to prepare software based analysis and design level diagrams to understand the business processes.

2. Analyze different type of users along with their interaction with the system. 3. Illustrate software systems using Analysis Class Diagram. 4. Infer CRC cards to understand procedural mode of thought and fully appreciate object

technology. 5. Identify the structure of a system using system's classes, their attributes, operations, and the

relationships among objects. 6. Identify different processes that operate with one another and their order using Sequence

Diagram and Collaboration Diagram. 7. Illustrate the business processes using Activity Diagrams. 8. Infer the hardware components where software components are deployed by Deployment

Diagram. Pedagogy

1. Interactive classroom teaching and discussions 2. Brainstorming sessions 3. Case studies 4. Use of software such as IBM Rational Rose

191



Books Recommended

1. Grady Booch, James Rumbaugh, Ivar Jacobson "Unified Modeling Language User Guide", The 1st Edition, (Addison-Wesley Object Technology Series),First Edition, ISBN: 0-201-57168-4, 1998.

2. Martin Fowler, "UML Distilled: A Brief Guide to the Standard Object Modeling Language", Third Edition,Addision Wesley, 2004.

Research Papers/Articles recommended for reading 1. Monarchi, D.E., and Puhr, G.I. (1992). A Research Typology for Object-Oriented Analysis and

Design. Communications of the ACM, Vol. 35, No. 9, pp. 35-47. 2. Cackowski, David. Object analysis in organizational design: A solution for matrix organizations;

Project Management Journal, Sylva; Sep 2000; Vol. 31, Iss. 3; pg. 44, 8 pgs 3. Apicella, Mario. UML simplifies project notation. InfoWorld, Framingham; Mar 27, 2000; Vol. 22,

Iss. 13; pg. 69, 2 pgs Suggested Evaluation Methods


Lab Assignments Case Study


B. End Semester Examination 1. Viva-Voce 2. Lab Exam

S.No. Topic Hours

1 Introduction to case study. 2

2 Describe and prepare Context Level Use Case Diagram and Detailed level use case diagram. 4

3 Prepare Analysis Class Diagram 4

4 Prepare CRC Cards for each class 4

5 Prepare Class Diagram 4

6 Describe and prepare Sequence and Collaboration Diagram 4

7 Describe and model Activity Diagram for each scenario. 4

8 Describe and prepare Deployment Diagram 4

192


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Object Oriented Analysis and

Design Lab Pune University




Assistant Professor

Assistant Professor


Signature


Date:

193



Specialization: Computer Science and Information Technology Course Name: Computer Graphics and Multimedia Lab (UG/PG): UG Number of Credits: 1 Level: 1 Learning Objectives The students will be able to:

1. Define 2D line drawing as a raster graphics display. 2. Define circle drawing as a raster graphics display. 3. Define polygon filling as a raster graphics display. 4. Describe line clipping by using its different techniques. 5. Describe polygon clipping by using its different techniques. 6. Define 3D objects as 2D. 7. Describe rotation of a 3D object about arbitrary axis. 8. Define hidden surface removal of a 3D object. 9. Describe algorithm based compression of text data. 10. Define animation of objects. 11. Recognize different sound file format usage.

Pedagogy

1. Labs on computer graphics using C language and multimedia techniques using flash 2. Oral examination

Pre-requisites None

194


Course Outline S. No. Topic Hours

1 Write a program for 2D line drawing as raster graphics display. 2 2 Write a program for circle drawing as raster graphics display. 4 3 Write a program for polygon filling as raster graphics display. 2 4 Write a program for line clipping. 2 5 Write a program for polygon clipping. 2 6 Write a program for displaying 3D objects as 2D display using perspective

transformation. 2

7 Write a program for rotation of a 3D object about arbitrary axis. 2 8 Write a program for hidden surface removal from a 3D objects. 2 9 Implement text compression algorithm. 4

10 Perform animation using animation software. 4 11 Write a program to play “wave” or “midi” format sound files. 4

Books Recommended 1. "Fundamentals of Multimedia", Li Ze-Nian, Drew Mark S., Pearson Education, First Edition, ISBN

978-0130618726, November 1, 2003. 2. "Procedural Elements for Computer Graphics", Rogers David F., Tata McGraw Hill, 1998, ISBN 978-

0070535343, December 1984. 3. "Computer graphics: A Programming approach", Harrington Steven, Tata McGraw Hill, ISBN 0-07-

026753-7, 1987. 4. "Computer Graphics", M Pauline Baker and Donald Hearn, PHI, Fourth Edition, 2010, ISBN

0136053580. 5. "Multimedia: Computing, Communication and Applications", Steinmetz Ralf, Nahrstedt, Pearson

Education, ISBN 9788177584417, 2009. 6. "Computer Graphics Principles and Practice", Foley, Vandam, Feiner, Hughes, Addison Wesley.

Research Papers/Articles recommended for reading 1. Patel N. and Zaveri M., “3D Facial Model Construction and Expressions Synthesis using aSingle

Frontal Face Image”, International Journal of Graphics, Vol. 1, No. 1. Suggested Evaluation Methods

A) Continuous Assessment 1. Essential Lab Assignments 2. Optional Quizzes


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Computer Graphics and

Multimedia Lab COEP

2 Computer Graphics and Multimedia Lab

Pune University

195




Maya Shelke Prerna Arote







Date:

196



Course Name: Mobile Computing Lab (UG/PG): UG Number of Credits: 1 Level: 3 Learning Objectives The students will be able to:

1. Identify wireless communication channels, multipath fading, path loss models, frequency reuse, handover, power control and efficient modulation techniques.

2. Distinguish Cellular networks and cell design, channel allocations and interference. 3. Illustrate the issues in Mobile TCP/IP, mobility and mobility management, ad-hoc networks. 4. Identify security issues in mobile communication network. 5. Model a project based understanding on handoff, power control and improving spectrum

efficiency.

Pedagogy 1. Interactive classroom teaching 2. Discussion on research paper on MIMO, power management, spectral efficiency, mobility

management 3. Case studies

Pre-requisites None

197


Course Outline S.No. Topics Hour

1 Study the radio propagation path loss model and develop your understanding in lab on fading.

3

2 Study spread spectrum in Code Division Multi Access (CDMA). 3

3 For wireless communication system, develop a scenario in OPNET to implement the quality of service for the wireless network traffic.

5

4 Study the handover for the GSM/CDMA systems. 3

5 Study the power control mechanism in Universal Mobile Telecommunication Systems (UMTS).

3

6 Understanding on Mobile operating system. Study architecture of android and learn how to develop application programming interface in android platform.

5

7 Study on the mobile device programming using J2ME. 3

8 Study Bluetooth protocol stack. 5

Books Recommended

1. “Wireless Communications Principals and Practice”, Theodore S. Rappaport, Second Edition, Pearson Education.

2. “Mobile Communication”, Jochen Schiller, Pearson Education. 3. “Wireless and Cellular Telecommunications”, William C.Y. Lee, Third Edition, Mc Graw Hill

Publication. 4. “Mobile Computing Principles”,Reza B’Far, Cambridge University Press.


1. Zhu H. and Kwak K. S., “An Adaptive Hard Handoff Algorithm for Mobile Cellular Communication Systems”, ETRI Journal, Volume 28, Number 5, October 2006.

2. Rahul H., Kumar S. and Katabi D., “Scaling Wireless Capacity with User Demands”, SIGCOMM 2012.

3. Jain R., “Channel models:” A Tutorial, Feb 2007. 4. Chandrasekhar V. and Jeffrey G. A., “Femtocell networks : A survey, IEEE Communications

Magazine” , September 2008. Suggested Evaluation Methods


B) End Semester Examination d) Viva-Voce

b) Lab Exam Parallel/Similar courses the existing curriculum

198


S.No. Name of the course Institute where it is offered 1. Wireless Communication IIT Delhi 2. Mobile Computing IIT Gawahati Sub-specialization committee

Name of Member Dr. Himanshu Agrawal

Shraddha Phansalkar

Shilpa Gite Ambika Pawar






Signature


Date:

199


Faculty of Engineering Specialization:

Civil Engineering

Course Name: Town and country planning

(UG/PG): UG


Level: 03

Learning Objective(s) The student will be able to:

1. State the objectives and principles of town planning. 2. List the different stages in town planning with their settlement patterns and physical forms. 3. Explain the physical planning process with surveys and plan, land-use planning. 4. Discuss different planning standards for the physical planning of a town. 5. Describe the spatial aspects of planning for rural and urban settlements. 6. Describe the physical growth characteristics and the relative socio-economic consequences. 7. Discuss the different levels in planning like development plan, regional plan with their characteristics. 8. Discuss the role different organizations involved in planning. 9. Discuss the role of acts regulation in the field of planning. 10. State the objectives of landscaping. 11. Explain different types of landscaping with application in modern and historical eras. 12. Locate and prepare the layout plans, neighborhood plans, town planning schemes for the different

case studies. 13. Discuss the conservation-preservation of old core area of a city.

Pedagogy 1. Multimedia technique presentations on growth of towns settlements in prehistoric, Vedic,

Harappan, settlements and their physical forms 2. Interactive sessions on physical planning stages of a city 3. Seminar on spatial aspects of Indian cities like Chandigarh, Gandhinagar , Jaipur, New Delhi 4. Brainstorming sessions on conservation-preservation of old core area of a city 5. Case studies on planning of existing cities with different planning concepts and forms

Course Outline

200


Sr .No. Topic Hours

1

Introduction to Town Planning Brief history of human settlements, from stone age and milestones, objective of town planning, principles, stages in town development, growth of towns settlements in prehistoric, Vedic, Harappan, settlements and their physical forms during various dynasties upto 18th century and during colonization (case studies - Jaipur, New Delhi etc.), town planning after independence (case studies - Chandigarh, Gandhinagar etc.)

5

2

Theory of Urban Planning The physical planning process and the relation between surveys and plan, land-use planning, determinants of land use and of spatial patterns of urban land uses, concentric zone model, sector model, multiple nuclei model etc, economic base of the city, sectors of the urban economy and base identification etc. various surveys for physical planning and techniques of analysis realization of the plan, the parts of the town and their relationship, planning standards, site layout and development, zoning and density control.

8

3

Spatial Aspects Settlements–rural and urban settlements in their regional setting hinterlands, towns and cities their geographical characteristics, urban concentrations and growth characteristics factors, historical, administrative, location, economic, socio-economic consequences, the essential characteristics of city/town, importance of morphological aspects in town planning, geological factors affecting urban development, urban geological factors governing the growth of ancient cities.

8

4

Levels In planning- regional/city/neighborhood City development plan: scope & purpose , surveys- demographic, housing, land use, etc, traffic; transport- urban road objectives, classification, traffic management, legislative mechanism for development plan (DP), MRTP, planning agencies for various levels of planning, their organization and purpose (CIDCO-MHADA-MIDC), introduction to land acquisition, UDPFI (for land use, infrastructure etc), SEZ.

8

5

Landscaping Environmental art and design for urban landscape, objectives, principles, elements, material, soft landscaping, hard landscaping, and garden styles, modern and historical, water body conservation and creation.

8

6

Planning Studio Planning insight and acquaintance with various planning related exercises such as, layout planning, neighborhood planning, town planning scheme for planned urban extension, conservation-preservation of old core area of a city.

8

Books Recommended 1. Methushoba Mohan, Principles of architechture, Oxford University Pres. 2. G.K .Hiraskar, Town planning, Dhanpat Rai Publications.

201


3. S. Rangwala, Town planning, Charotar Publishing House, Anand. 4. Emerald Architecture: case studies in green buildings: - ISBN 978-0-07-154411-5.

Research Papers/Articles recommended for reading 1. MRTP act 1966. 2. UDPFI guidelines, ministry of urban affairs and employment, Govt. & India.

Suggested Evaluation Methods A. Continuous Assessment

1. Essential a. Unit test b. Assignments c. Presentation d. Quiz



Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it was offered 1 Town and Country Planning COEP

Sub specialization committee Name

Member of Dr. Kanchan

Khare Mrs. Rupali Zope

Designation Professor Assistant Professor


Signature


Date:

202




Course Title: JAVA

Course Code: T7499


Level: 3

Learning Outcome (s):

The students are able to:

1. Demonstrate object oriented concepts such as inheritance, polymorphism, encapsulation and different programming features of Java.

2. Demonstrates how to achieve reusability using inheritance, interfaces and packages and describes faster application development can be achieved.

3. Demonstrate understanding and use of different exception handling mechanisms in Java.

4. Practice the concept of event handling in AWT and SWING in Java. 5. Sketch the lifecycle of an applet in Java. 6. Demonstrate the usage of basic Java language syntax and semantics by writing

java programs Pre-learning:

Knowledge of programming languages C and C++ is desirable

Course Outline

S.No. Topic Hours

1.

Introduction to Java:

Need of object oriented approach, object, classes, writing java classes, JDK environment and tools, JVM , JRE . Features of java: abstraction, encapsulation, polymorphism and inheritance. Constructor (parameterized and default). Parameter passing in java, arrays, java miscellaneous: String, String Tokenize.

12

2. Inheritance , Abstract class, Interfaces and Packages: 15

203


Inheritance, types: single, multi-level, hierarchical inheritance, use of this and super keyword, super constructor, final variables, final methods and classes, Abstract keyword, abstract methods and classes, method overloading, method overriding. Interfaces, implementing and extending and accessing interface variables. Java packages, importing packages, access control and modifiers.

3.

Exception Handling

Need for exception handling try- catch, finally, throw, throws, user defined exceptions.

5

4.

Introduction to AWT

Need for AWT, AWT components, graphics class, AWT containers, event handling in AWT, adapter classes, introduction to swing, swing components, layout managers.

8

5.

Applets

Introduction to HTML, identify need for applet, applet life cycle, difference between application program and applets.

5

Pedagogy

1. Interactive classroom teaching and discussions 2. Practical’s using software tools like JDK, NetBeans , EditPlus etc 3. Mini Project

Books Recommended

1. “Java 2: The Complete Reference”, 3rd Edition, Patrick Naughton , Herbert Schildt Osborne Publishing, (1999)

2. “Programming With Java: A Primer”, 3rd Edition, E. Balagurusamy, Tata McGraw - Hill Education (2008)

3. “Java How to Program”, 9th Edition, Deitel and Deitel, Prentice Hall 4. “Core Java: An Integrated Approach”, 1st Edition, R. Nageswara Rao ,

DreamTech Publication(2008) Suggested Assessment/ Evaluation Methods

A) Continuous Assessment a) Unit Tests b) Assignments c) Quizzes d) Minor project e) Class tests


204


a) Written Exam Benchmarked against similar courses in other national/ international universities /organizations

S. No.


1 Advanced Java University of Pune

2. Programming Methodology Stanford Engineering


Name of Member Aniket Jagtap Meeta Kumar KAlyani Kadam

Designation Teaching Associate (CS & IT)



Org. / Inst. SIT SIT SIT

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature:

Date:

205




Course Title: Open Source Technologies Course Code: T7509 Number of Credits:3 Level : 3 Learning Outcome (s): The students are able to

1. Relate to the idea of adoption of Open Source Software (OSS) and Public Domain Software (PDS) in software development process.

2. Identify and outline the need for licenses and patents. 3. Analyze the basic idea of open source technology, their software development

process. 4. Examine and analyze various open source software and tools. 5. Outline and distinguish between open source and closed source technologies.

Pre-learning: Knowledge of Computer Programming desirable S.No. Topic Hours

1.

Open Source Technologies (OST) overview Introduction: open source, free software, free software vs. open source software, public domain software, free and open-source software (FOSS), Open-source software licensing Open source history, initiatives, principle and methodologies, Philosophy: software freedom, open source development, Development tools, Closed source / proprietary software

6

2. Challenges of open source technologiesOpen source vs. closed source, open source government, open source ethics, social and financial impacts of open source technology, shared software and shared source.

6

3.

Open Source Operating System Linux operating system, Bash commands, Kernel level services, System Level services, User management, File system Management, Ubuntu OS, Installing Ubuntu, Ubuntu's graphical user interface

8

4.

Open Source Software Database Working with MYSQL, Data Type, DDL commands DML commands, sub-queries.

15

206


Scripting language Introduction to PhP, syntax and constructs in PhP, decisions and loops, strings, arrays in PhP Statistical software R, syntax, vectors, data frames, matrices, vectors Open source web application development tools :Joomla/Wordpress, Android using PhoneGap

5.

Open source project Starting and maintaining an open source project, open source hardware, open source design, and open source teaching and open source media.

10

Pedagogy 1. Interactive classroom teaching and discussions 2. Practical’s using Open Source Tools like Apache, Linux, Mozilla (Firefox), Joomla,

GCC 3. Group Discussions 4. Seminars 5. Projects

Course outline Books Recommended

1. “Open Source Technology”, First Edition, 2009, Kailash Vadera, Bhavyesh Gandhi, Laxmi Publications Ltd.

2. “Open Source: Technology and Policy”, 2008, Fadi P. Deek, James A. M. McHugh, Cambridge University Press


a) Assignments b) Tests c) Seminars d) Quizzes e) Viva f) Mini Project



S. No.


1 Open Source Software Carnegie Mellon University Name of the sub-committee members:

Name of Members

Dr. Shraddha Phansalkar

Dr. Swati Ahirrao

Designation Asso Prof Asso Prof

207



Signature

Name of the expert Name of Experts

Dr. Sandeep Deshmukh

Designation Proprietor

Org. / Inst. Freelancer

Signature

Signature:

Date:

208




Course Title: Basics of Databases Course Code: T7474 Number of Credits: 3 Level: 2 Learning Outcomes: The students will be able to:

1. Describe database system, its components and Identify various database architectures and applications. Also illustrate database design using E-R data model by identifying entities, attributes, relationships, generalization and specialization along with relational algebra.

2. Distinguish relational model with the Structured Query Language (SQL). 3. Illustrate Normalization process with its types. 4. Explain structure of file, types of Indexing and Hashing.

Pre-learning: None Course Outline S.No. Topic Hours

1 Introduction to DBMS DBMS basic concepts, components of a DBMS and overall structure of a DBMS, DBMS architecture, data modeling: basic concepts, entity, attributes, relationships, constraints, keys, E-R : components of E-R model, conventions, converting E-R diagram into tables, relational model: basic concepts, attributes and domains, Codd's rules, relational integrity: nulls, entity, referential integrities, enterprise constraints, views, schema diagram.

10

2 Relational query languages Relational algebra and relational calculus: tuple relational and domain relational calculus, introduction to SQL: characteristics and advantages, SQL data types, SQL languages: DDL, DML, DQL, DCL, SQL DDL queries: creating, modifying, dropping tables, SQL DML queries: inserting, updating and deleting data, SQL DQL query: SELECT query and clauses, SQL operators, predicates and joins, SQL functions: aggregate functions, date function, nested queries, concept of functions, stored procedures and triggers, views: creating, dropping, updating, indexes

15

3 Database analysis and design techniques Information systems lifecycle, application lifecycle, planning, system definition, requirement analysis, design, DBMS selection

10

209


and application design: transaction and user-interface design, prototyping, implementation, data conversion and loading, testing, data and database administration, relational database design: purpose of normalization, data redundancy and update anomalies, functional dependencies, the process of normalization: INF, 2NF, 3NF, BCNF.

4 Mini project 10 Pedagogy

1. Classroom teaching with hands-on 2. Mini Project

Books Recommended 1. "Database System Concepts", Silberschatz A., Korth H., Sudarshan S., 6th Edition,

2010, McGraw Hill. 2. "Database Systems", Connally T., Begg C., 3rd Edition, 2004, Pearson Education. 3. "Database Systems Design, Implementation and Management", Rab P. Coronel C.,

5th Edition, Thomson. 4. "Fundamentals of Database Systems", Elmasri R., Navathe S., 6th Edition, 2010,

Pearson Education. 5. "An Introduction to Database Systems", Date C., 7th Edition, 2000, Pearson

Education. 6. “MySQL Administrator’s Bible”, Sheeri K. Cabral and Keith Murphy, O'Reilly

Media.

Suggested Assessment/ Evaluation Methods A) Continuous Assessment

a) Unit Test 1 b) Unit Test 2 c) Mini project d) Quizzes e) Assignments

B) End Semester Examination Written Exam


S. No.


1 Database Management System IIT, Bombay 2. Database Systems Carnegie Mellon

University(CMU) 3. Database Management System Thapar University, Patiala


Name of Member

Shruti Patil Seema Patil

Designation Assistant Professor (CS )

Assistant Professor ( IT)

210



Signature

Name of Experts Dr. Parag Kulkarni

Designation Professor, Founder, Chief Scientist and CEO

Org. / Inst. iknowlation Research Labs Pvt Ltd

Signature

Signature of Dean:

Date:

211



Course Name: MATLAB (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The student will be able to:

1. Illustrate the basic features of MATLAB software. 2. Perform basic operations on matrices in MATLAB. 3. Create a user defined function. 4. Plot different types of graphs like bar, polar, area, stem etc. and three dimension graphs and

annotate the graphs. 5. Export plots to different applications like word, PDF, EPS etc. 6. Sketch multiple plots in a single window using subplot function. 7. Write a script file as per requirement in MATLAB editor. 8. Solve ordinary differential equations using numerical methods. 9. Use Simulink to create block diagrams. 10. Solve differential equations using Simulink.

Pedagogy

1. Lab sessions 2. Demos of real time applications 3. Short videos 4. Problem based learning


212


Course Outline

Books Recommended

1. “MATLAB and Its Applications in Engineering (Paperback),”Raj Kumar Bansal Publisher Pearson. 2. “Introduction To MATLAB 7 ,” Etter Dolores, Pearson. 3. “Getting Started with MATLAB,” Rudra Pratap, Oxford. 4. “MATLAB and Simulink for Engineers,”Agamkumar Tyagi, Oxford. 5. “MATLAB Programming,” Y. Kirani Singh, PHI.


1. Ayasun, S., Nwonpa ,C.O., “Induction Motor Tests Using MATLAB/Simulink and Their Integration Into Undergraduate Electric Machinery Courses” IEEE Transactions on Education, Vol. 48, Feb. 2005



a. Lab Tests b. Assignments

2. Optional a.Mini Project b. Seminars

B. End Semester Examination 1. Practical examination 2. Viva Voce

Sr. No. Topic Hours

1

MATLAB Basics Including different types of windows in MATLAB, Help and documentation in MATLAB, array, vectors, matrixes, polynomials, input and output , solving linear algebra equations, Beta, curve fitting basic, gamma functions etc

09

2

MATLAB Graphics Drawing different types of plot like bar, stem, polar, semilog, loglog etc. , plotting multiple plots using plot, hold and line commands, subplot, export and import graphs in different applications

09

3 Programming with MATLAB Different types of control structure like for, while, if elseif else etc. , creating scripts and own functions, nested loop, solving ODE equations.

09

4

Simulink Commonly used blocks library,creating simulink models,handling complex models, using simulink from MATLAB command window, solving differential equations using simulink, different engineering applications in simulink

09

5

Application of MATLAB and Simulink Discussion of different engineering applications in MATLAB and Simulink with small project

09

213


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered 1 MATLAB for Engineers Nirma University Sub specialization committee

Name of Member

Prof. Pritesh Shah

Prof. Avadhut Chaudhari

Prof. Abhaya Pal Singh


Assistant Professor

Assistant Professor


Signature


Date:

214



Course Name: Printed Circuit Board Design (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objective(s):

1. Define Printed Circuit Board. 2. Identify materials for PCB fabrication. 3. Classify different types of PCB. 4. Describe different processes in PCB design. 5. Discuss current trends in PCB design. 6. Explain surface mount Technology. 7. Practice CAD tools for PCB Design. 8. State the limitations of manual design of PCBs.

Pedagogy:

1. Classroom teaching 2. Videos relating the process of fabrication of PCBs 3. Hands on mini Project.

Pre-requisites: None Course Outline

215


Books Recommended:

1. Walter C Bosshart, “Printed Circuit Boards- Design and Technology”, Tata McGraw Hill. Research Papers/Articles recommended for reading:

1. Isaac, J., Weins D.,“Future of PCB Design”, Mentor Graphics Ltd. Suggested Evaluation Methods


a. Lab performance b. Lab Report

2. Optional a. Projects b. Seminars

B. End Semester Examination a.Practical examination b. Viva – voce.

Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered 1 Printed Circuit Board Design Pune University 2 Printed Circuit Board Design Mumbai University Sub Specialization Committee

Name of Member

Mrs. Smita B Khole Parul Garg


S. No. Topic Hours

1 Introduction General Considerations, PCB Sizes, materials used, documentation 8

2

Layout and General Rules Resistance, capacitance, inductance of PCB Conductors, Conductor spacing, realizing supply and ground conductors, component placing and mounting, cooling requirements and package density

10

3

Technology of PCBs Film master production, cleaning, photo printing, plating, etching, mechanical machining operations, soldering techniques, component assembly

10

4 Trends in PCB Design Multilayer boards, multiwire boards, Flexible PCBs, metal core circuits, design and test considerations, surface mount technology

10

5 Automation and Computers in PCB design Limitations of manual design, automated artwork, Computer Aided Design, design automation

7

216



Signature


Date:

217


Faculty of Engineering Specialization: Mechanical Engineering

Course Name : Fundamentals of Automotive Technology

(UG/PG) : UG


Level : 1

Learning Objectives The student will be able to: 1. Discuss the need and importance of study of Automobile engineering for mechanical engineers 2. Identify and compare the relative merits, demerits and applications of different systems and

components in an Automobile 3. Discuss the working and applications of basic mechanical components such as gears ,shaft,

coupling, pin ,nut bolts in an automobile 4. Explain the advanced automotive systems such as antilock braking system, CVT, power steering,

direct injection system etc. 5. Discuss the construction and working of different types clutch including their limitations. 6. Discuss the construction and working of different transmission layout. 7. State the need of cooling and lubrication system in the automobile, different types of cooling

and lubrication system and how they work. 8. Discuss the construction and working of different suspension systems. 9. Explain the concept of dependent and independent suspension systems. 10. Exhibit and understanding of the construction and working of different types braking system,

which is breaking system need to be used in specific condition including their limitations. 11. Describe the need of steering system and the concept of power steering. 12. Appreciate and discuss the need of cooling and lubrication system in the automobile.

Pedagogy

1. Class room lectures 2. Assignments on Engine ,Clutch, gear box, final drive and suspension system,

Pre-requisites None

218


Course Outline

Sl. No. Topic Hours

1

Introduction to Automotive Brief history of automobile, classification automobile, requirements of automobile body; vehicle frame, separate body & frame, introduction to car body e.g. sedan, hatchback car, coupe car, station wagon, convertible, van, special purpose vehicle, e.g. ambulance, milk van, etc. Automotive Specifications: front engine rear drive & front engine front drive vehicles, four wheel drive vehicles. introduction and component of two wheeler, light motor vehicle (LMV), light transport vehicle (LTV), heavy transport vehicle (HTV) ,

13

2

Introduction to Automotive Engines and Fuel Introduction to engine, two stroke engine, four stroke engine, compression ignition engine, spark ignition engine, advantages and disadvantages of engine, electric vehicle , diesel vehicle, steam vehicle, gas vehicle, e.g. LPG and CNG vehicles,

08

3

Element of Automotive System Layout of automobile, power transmission from engine to wheel, function and working of power transmission parts like clutch, gear box, transaxle, differential, type of axles, wheels, braking system, suspension system

08

4

Advancement in Automotive Technology Hybrid vehicles, multipoint fuel injection system, cam less engine, advance systems in two wheelers, common rail direct injection (CRDI) engines, continuously variable transmission (CVT), electric power steering units, gasoline direct injection(GDI),multi valve engine, antilock braking system(ABS)

08

5

Safety of Automotive Technology Emission control techniques, EURO standards. Emission standards: India, EURO NCAP - for safer cars crash test safety rating, federal motor vehicle safety standards (FMVSS), introduction and function of airbags and seat belt.

08

Books Recommended

1. Fundamentals of Automobile Engineering, K.K.Ramalingam, Scitech Publications (India) Pvt. Ltd.

2. Automobile Engineering, Vol I and II, K. Singh , Standard publishing house 3. Automotive Mechanics, S. Srinivasan, Tata McGraw Hill 4. Automotive Mechanics, Crouse and Anglin, Tata McGraw Hill 5. I C Engines and Air Pollution B.P. Obert , Harper & Row Publications 6. Internal Combustion Engines, H. Heistler , SAE Publications


1. Petersen A., Barrett R., Morrison S., Driver-training and emergency brake performance in cars with antilock braking systems, Safety Science, Volume 44(10), 2006, pp905 to 917

2. Walker P. D., Zhang N.,Engagement and control of synchronizer mechanisms in dual clutch transmissions, Mechanical Systems and Signal Processing, Volume 26, 2012, pp 320 to 332

3. Zhao F., Lai M. C., Harrington D. L.,Automotive spark-ignited direct-injection gasoline engines, Progress in Energy and Combustion Science, Volume 25 (5), 1999, pp 437 to 562

219


Suggested Evaluation Methods 1. Continuous Assessment

1. Essential a) Unit Tests

2. Optional 1. Assignments

2. Seminars 2. End Semester Examination

a. Written Exam Parallel/Similar coursesin the existing curriculum S.No. Name of the course Institute where it was offered 1 Automobile engineering SIT 2 Subspecialization Committee

Name of Member

Sarfaraj Shaikh Amol Ubale



Signature


Date:

220


Faculty of Engineering Specialization: Mechanical Engineering

Course Name : Six Sigma

(UG/PG) : UG

Number of Credits :3

Level : 1

Learning Objectives

The student will be able to: 1. Discuss the importance of quality in manufacturing. 2. Explain fundamentals of quality in service sector. 3. Illustrate fundamentals of six sigma. 4. Explain the different tools and techniques of six sigma. 5. Illustrate the understanding six sigma organization. 6. Explain about DMAIC process. 7. Describe the models of implementation of six sigma. 8. Describe the process mapping, measurement system analysis. 9. Explain the communication plan, company culture.

Pedagogy

1. Classroom lectures using markers and white board. 2. Slides projection 3. Quiz in the class room 4. Assignments

Pre-requisites None

221


Course Outline Unit Topic Hours

1. Introduction Quality perception, quality in manufacturing, quality in service sector, differences between conventional and six sigma concept of quality, six sigma success stories, statistical foundation and methods of quality improvement. Descriptive statistics: Data type, mean, median, mode, range, variation, standard deviation, skewness, Kurtosis. Probability distribution: Normal, binomial, Poisson distribution

9

2. Basics of Six Sigma Concept of six sigma, defects, DPMO, DPU, attacks on x’s, customer focus, six sigma for manufacturing, six sigma for service. z score, understanding six sigma organization, leadership council, project sponsors and champions, master black belt, black belt, green belts.

9

3. Methodology of Six Sigma DMAIC, DFSS, models of implementation of six sigma, selection of six sigma projects.

9

4. Six Sigma Tools Project charter, process mapping, measurement system analysis, hypothesis testing, quality function deployment, failure mode effect analysis, design of experiments.

9

5. Sustenance of Six Sigma communication plan, company culture, reinforcement and control, introduction to softwares for six sigma, understanding MINITAB, graphical analysis of MINITAB plots

9

Books Recommended 1. Six Sigma: SPC and TQM in Manufacturing and Service, G. Tennant, Gower Publishing Co. 2. Six Sigma for Managers, G. Brue, TMH 3. What is Six Sigma, P. Pande, TMH Research Papers/Articles recommended for reading

1. Benedetto A.R., Adapting manufacturing-based six sigma methodology to the service environment of a radiology film library, Journal of Healthcare Management, Volume 48 (4), 2003,pp 263 to 280.

2. De Feo J., Bar-El Z., 2002. Creating strategic change more efficiently with a new design for six sigma process, Journal of Change Management Volume 3 (1), 2002, pp 60 to 80.



1. Unit Tests 2. Assignments

2. Optional a. Seminars b. Mini project

B. End Semester Examination a. Written Exam

222


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered 1 Six Sigma Technical University of Munich


Name of Member

Ashish Shrivastava

A Ubale

Designation Asst. Prof. Asst Prof


Signature


Date:

223



Course Name: Nanotechnology (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The student will be able to:

1. Illustrate the effect of miniaturization on the basis of surface to volume ratio. 2. Categorize nanomaterials and their synthesis route. 3. Demonstratephysics at nanoscale and its application in current technology development. 4. Describe top-down and bottom-up approach to synthesize materials. 5. Manipulate the properties of nanomaterials by changing the synthesis route for different

application such as drug delivery. Pedagogy

1. Classroom teaching 2. Assignments 3. Project 4. Seminar/presentation


224


Books Recommended

1. “Nanotechnology Principals and Practices” Sulabha Kulkarni, Capital Publishing Comp. 2009 2. “Characterization of Materials”, J. B. Wachtman and Z. H. Kalman, Butterworth-Heinmann, USA,

1993. Research Papers/Articles recommended for reading:

1. Regan, B. C.; Aloni, S.; Jensen, K.; Zettl, A, "Surface-tension-driven nanoelectromechanical relaxation oscillator". Applied Physics Letters 86 (12), (2005), 123119.

2. Goodman, R.P.; Schaap, I.A.T.; Tardin, C.F.; Erben, C.M.; Berry, R.M.; Schmidt, C.F.; Turberfield, A.J. "Rapid chiral assembly of rigid DNA building blocks for molecular nanofabrication". Science 310 (5754) (9 December 2005), 1661–1665



a) Unit tests b) Assignments

2. Optional a) Quizzes b) Seminars c) Project report d) Presentation

B. End Semester Examination Written Exam

S.No. Topic Hours

1

Introduction to Nanotechnology Introduction to quantum Mechanics with respect to nanotechnology, potential well, spherically symmetric potential, Coulomb potential and periodic potential. Tunneling through a potential barrier. Density of states. Introduction to nano materials, clusters, fullerens, semiconductor and metal clusters, cluster stability, nanotubes, electron states in nanoparticles, effective mass approximation, weak confinement, strong confinement, size dependent oscillator strength

15

2

Vacuum systems and synthesis Introduction to vacuum techniques such as rotary pumps, diffusion pump, high vacuum and ultra high vacuum pumps and gauges. Physical methods, chemical methods and biological methods of synthesis.

10

3

Properties and analysis of Nanomaterials Some Physical, chemical, mechanical and optical properties of nano materials. Optical Microscopy and electron microscopy, X-ray diffraction, UV-VIS-IR spectroscopy, luminescence techniques, auger electron spectroscopy, some advanced topics in nanomaterials.

20

225


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it was offered 1 Nanotechnology Mumbai University Sub specialization committee

Name of Member

Dr. Brajesh Pandey

Dr. Arundhati Warke

Dr. Meena Laad

Dr. Neeru Bhagat

Dr Rupali Nagar

Designation Associate Professor

Associate Professor

Associate Professor

Associate Professor

Assistant Professor

Org. / Inst. SIT SIT SIT SIT SIT

Signature


Date:

226



Course Name: Smart Materials (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The student should be able to:

1. Demonstrate knowledge and understanding of the physical principles underlying the behaviour ofsmart materials.

2. Describe the basic principles and mechanisms of the stimuli-response for the most important smart materials.

3. Demonstrate knowledge and understanding of the engineering principles in smart sensors, actuators and transducer technology.

4. Propose improvement on the design, analysis, manufacturing and application issues involved in integrating smart materials and devices with signal processing and control capabilities to engineering smart structures and products

Pedagogy:

1. The students are encouraged to learn via questioning and understanding the theory taught and discussed.

2. To integrate prior knowledge and new knowledge through discussions and presentations and assignments.

3. To develop an ability to understand and use the knowledge in research. 4. To develop skills incrementally and to culminate in final papers and exams.

Pre-requisites:

None Course Outline

227


Books Recommended 1. “Magnetic Materials: Fundamentals and Device Applications” by Nicola A. Spaldin(Publication Date:

April 21, 2003 | ISBN-10: 0521016584 | ISBN-13: 978-0521016582 ) 2. “Principles and Applications of Ferroelectrics and Related Materials” by M.E. Lines and A.M. Glass,

(Oxford Classic Text in the Physical Sciences) 3. “Smart Materials and Structures”, Gandhi, Thompson and Gandhi 4. “Smart Electronic Materials: Fundamentals and Applications” by Jasprit Singh, Cambridge

University Press, 2005 Research Papers/Articles recommended for reading: 1. DuerigT.W, Melton K.N, Stoeckel D., Wayman C.M., “Engineering aspects of shape memory

alloys”, Butterwort Heinemann Ltd:London,1990. 2. MauroDolce,D.Cardone and R.Marnetto, “Implementation and Testing of Passive control Devices

based on Shape Memory Alloys”, Earthquake Engg. And Structural Dynamics,2000;Vol-29, pp945-96

3. N. Krstulovic-Opara and A.E. Naaman, ACI Structural Journal, March-April 2000, pp335-344 4. Mazumder, J.; L. Song. "Advances in Direct Metal Deposition". In Hinduja, Srichand; Li, Lin.

Proceedings of the 36th International MATADOR Conference. pp. 447–450 (2010)

S.No. Topic Hours

1 Introduction and classification of Smart Materials: Artificial intelligence and embedded intelligence, smart materials, structures and product technology, crystal structure and microstructure

5

2 Ferromagnetism in Smart Materials: Domain walls, technical magnetization curve, ferromagnetic materials, ferromagnetic films, Antiferromagnetism.

8

3 Ferroelectricity in Smart Materials: Ferroelectricity, domain walls, technical polarization curve, ferroelectric materials, ferroelectric films, Antiferroelectricity.

8

4

Shape Memory Alloys: Elastostatics, irreversible martensites, shape memory alloys, domain walls, nature of shape memory, shape memory alloy materials, ferromagnetic shape memory alloys, relation to shape memory alloys.

8

5

Piezoelectric Materials – constitutive relationship, electromechanical coupling coefficients, piezoelectric constants, piezoceramic materials, variation of coupling coefficients in hard and soft piezoceramics, polycrystalline vs single crystal piezoelectric materials, polyvinyldene fluoride, piezoelectric composites Magnetostrictive Materials – constitutive relationship, magnetomechanical coupling coefficients, Joule Effect, Villari Effect, Matteuci Effect, Wiedemann effect, Giant magnetostriction and Giant magnetoresistance, composite materials.

12

6. Applications of Engineering Smart Structures and Products,

Sensor, Actuator and Transducer Technologies 4

228


Suggested Evaluation Methods: A. Continuous Assessment

1. Essential a) Unit Tests b) Assignments

2. Optional a) Quizzes b) Class Tests c) Seminars


1. Written examination Parallel/Similar coursesin the existing curriculum S.No. Name of the course Institute where it was offered 1 Smart Materials VTU

Name of Member

Dr. Arundhati Warke

Dr Brajesh Pandey

Dr Neeru Bhagat


Associate Professor

Associate Professor


Signature


Date:

229



Course Name: Computer based Statistical Packages (UG/PG): UG Number of Credits: 03 Level: 03 Learning Objectives The student will be able to:

1. Explore to SPSS with various options such as data, input, output, labels, charts, script etc. 2. Transform and interpret data through SPSS. 3. Calculate various measures of central tendencies such as mean, mode, median etc. 4. Calculate measures of dispersions; mean deviation, standard deviation, quartile deviation and

coefficient of variation. 5. Plot graphs of different types such as pie chart, line graph, scatter plot, cluster plots, frequency

polygons, histogram, population pyramid, box plots etc. 6. Predict correlation between two or more variables. 7. Derive the equations of lines of regressions. 8. Analyze data using one way ANOVA. 9. Test hypothesis using one sample, paired sample, independent sample test. 10. Write and execute program using SPSS.

Pedagogy

1. Classroom teaching 2. Assignment 3. Seminars 4. presentations

Pre-requisites

None Course Outline

230


Books Recommended 1. “Discovering Statistics using SPSS”, Andy Field, Companion Website, third edition. 2. “SPSS for Dummies”, Arthur Griffith, Wiley Publishing Inc. 3. “How to use SPSS, a step by step guide to analysis and Interpretation”, Brian C. Cronk. 4. “The SPSS book”, Matthew J. Zagumny, Writers club press. 5. "Modern Elementary Statistics", Freund, J. F., Credo Reference. 6. “Statistics” by S. P. Gupta, S. Chand Publication.


S. No. Topic Hours

1

Introduction to SPSS Fundamental mechanics of SPSS, History of SPSS, How SPSS works, SPSS installation sequence, exploring to SPSS with various options like - general, viewer, data options, currency, output label, chart, file location, script, multiple input, syntax editor.

5

2

Data Entering the data- entering the data definition, entering actual data, transforming data. Entering variables- name, type, width, decimals, label, value, missing, measure, and role. Reading and writing the files. Formulating text file for input to SPSS, reading simple data from text file. Transferring data from another program, reading Excel file and saving data and images. Creating multiple response sets, copying data properties. Recoding variables, exporting to a Database, creating excel, text, word, power point, PDF and graphics files.

8

3

Graphing data Building graphs –gallery tab, basic element tab, group/ point tab, title and footnote tab, element properties dialog box. Building graphs in old ways, fast ways and editing graphs. Types of graphs- line chart, multiple line chart, scatter plots, scatter plots with multiple variables, three dimensional scatter plots, summery point plots, dot plots, scatter plots matrices. Bar graphs- simple, clustered, stacked graph, three dimensional, clustered three dimensional, stacked three dimensional. Simple error bars, clustered error bars. Histograms, stacked histogram. Frequency polygons, population pyramids, area graphs, pie chart, high and low graphs, box plots, dual axis plots.

8

4

Analysis Generating reports, case summaries, row and column summaries, OLAP cubes, modifying pivote tables. Simple mean analysis, comparison of mean analysis, one sample test, independent sample test, paired sample test. One way ANOVA. Linear model analysis, correlation analysis, regression analysis, log linear analysis.

8

5

Programming in SPSS Commands, syntax, keywords, data declaration, comments, execution commands, flow control and conditional execution. Command syntax language execution- writing syntax command program, restoring program, adding syntax program to menu, finding syntax commands, graphing Q-Q and P-P plots. Examining data. Programming with SPSS with Python and scripts.

8

6 Tutorials for SPSS and statistics. 8

231


1. Müller U., Anton S. and Wefelmeyer W., “Variance bounds for estimators in autoregressive models with constraints”, A Journal of Theoretical and Applied Statistics, 47(3), 201, pp 477-193.



a) Unit tests b) Assignments c) Tutorials

4. Optional a) Presentations b) Quizzes c) Seminars


Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it was offered 1 Computer based Statistical

Packages Pune University


Name of Member

Dr. Arundhati Warke


Org. / Inst. SIT

Signature

Name of the Expert:

Signature: Date:

232



Course Name: Web Technologies and SOA (UG/PG): UG Number of Credits: 4 Level: 4 Learning Objectives The students will be able to:

1. Model web services using the W3C standards like XML, WSDL, UDDI and SOAP. 2. Develop WS-Security Mechanisms using methods like encryption and digital signatures. 3. Illustrate the role of Service Oriented Architecture (SOA) in building a real world software

application. 4. Outline the different stages of planning and analyzing SOA application with emphasis on

artifacts like Enterprise Solution Assets (ESA). 5. Choose a design model for SOA application using service environment like On Demand

Operation Environment (ODOE). 6. Manage a SOA environment meeting its operational challenges like Service Level Agreements

(SLA) and SOA Governance.

Pedagogy 1. Interactive sessions on revisited areas of software engineering 2. Class room teaching on concepts of Web services and SOA 3. Hands on experiments in XML, WSDL 4. Research seminars

Pre-requisites None

233


Course Outline

S.No. Topic Hours

1

Web services Technologies What is web services, evolution and differences with distributed computing , web services platforms ,business process execution language for web services, WS-Security and the web services security specifications, WS-reliable messaging, WS-policy, WS-attachments Introduction to a web service interface, the basic structure of WSDL, WSDL declarations: the definitions, types, and import elements, the WSDLabstract interface: the message, port type, and operation elements, WSDLmessaging exchange patterns.

14

2

SOA Fundamentals Defining SOA, business value of SOA, evolution of SOA,SOA characteristics, concept of a service in SOA, misperceptions about SOA, basic SOA architecture, infrastructure services, enterprise service bus (ESB), SOA enterprise software models.

12

3

SOA Planning and Analysis Stages of the SOA lifecycle, SOA delivery strategies, service-oriented analysis, capture and assess business and IT issues and drivers, determining non-functional requirements (e.g., technical constraints, business constraints, runtime qualities, non runtime qualities), business centric SOA and its benefits, service modeling, basic modeling building block, service models for legacy application integration and enterprise integration, Enterprise solution assets(ESA).

12

4

SOA Design and implementation Service-oriented design process, design activities, determine services and tasks based on business process model, choosing appropriate standards, articulate architecture, mapping business processes to technology, designing service integration environment (e.g., ESB, registry), tools available for appropriate designing, implementing SOA security implementation, implementation of integration patterns, services enablement, quality assurance.

12

5

Managing SOA Environment Distributing service management and monitoring concepts, operational management challenges, service-level agreement considerations, SOA governance (SLA, roles and responsibilities, policies, critical success factors, and metrics), QoS compliance in SOA governance, role of ESB in SOA governance, impact of changes to services in the SOA lifecycle.

10

234


Books Recommended 1. “Service-Oriented Architecture: A Field Guide to Integrating XML and Web Services”, Thomas Erl,

Prentice Hall Publication, 2004 2. “Service-Oriented Architecture: Concepts, Technology, and Design”, Thomas Erl, Prentice Hall

Publication, 2005. 3. “Service-Oriented Architecture Compass: Business Value, Planning, and Enterprise Roadmap”,

Norbert Bieberstein, Sanjay Bose, Marc Fiammante, Keith Jones, Rawn Shah, IBM Press Publication, 2005.

4. “Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WSAddressing,WS-BPEL, WS-Reliable Messaging, and More”, Sanjiva Weerawarana, Francisco Curbera, Frank Leymann, Tony Storey, Donald F.Ferguson,Prentice Hall Publication, 2005 Addison Wesley Publication, 2004

Research Papers/Articles recommended for reading 1. Doddavula S. and Karamongikar S., “Designing an Enterprise Application Framework for Service-

Oriented Architecture” published at www.OnJava.net article, Aug 2005. 2. L. ZhangL., Univ T., LiJ. and YuM. ,” An Integration Research on Service-oriented Architecture (SOA)

for Logistics Information System “Published in:Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference.

3. Shamsoddin E.and Motlagh,”A Survey of ServiceOrientedArchitectureSystemsTesting”, International Journal of Software Engineering & Applications (IJSEA), Vol.3, No.6, November 2012.

4. Kundu P.,Das D. and Ratha B.,” WSDL Specification of Services for Service OrientedArchitecture (SOA) Based Implementation of a CRM Process International Journal of Scientific and Engineering Research, Volume 3, Issue 10, October 2012.

5. Vaughan J., “The state of service-oriented architecture: SOA trends in 2012”, SearchSOA 2011-12 Survey.







Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Web Technologies Gujrat University Subcommittee Specialization

235


Name of Member

Suman Tanwar Manisha Tijare Poova Agarval Shraddha Phansalkar






Signature


Date:

236



Course Name: Advance Database Management System (UG/PG): UG Number of Credits: 4 Level: 3 Learning Objectives The students will be able to:

1. Use knowledge of parallelism to increase scale up and speed up of a computer system. 2. Apply knowledge of partitioning techniques to distribute database efficiently to increase

throughput and response time. 3. Illustrate client server architecture and business logic of SOAP. 4. Demonstrate ETL process in Data Warehousing and use different schemas such as star schema

and snowflake schema. 5. Apply data mining algorithms like Apriori algorithm and decision tree algorithm. 6. Use web search engine and different techniques like ranking of terms, hyperlink to retrieve

structured data and information. Pedagogy

1. Interactive class room teaching. 2. Industry visits. 3. Design of a small computer network in lab.

Pre-requisites None

Course Outline

237


Books Recommended

1. "Database system concepts ", Abraham Silberschatz, Henry Korth, S, Sudarshan ,6th Edition, McGraw Hill International Edition ,2010,ISBN-13: 978-0073523323.

2. "Data Mining”: Concepts and systems “,Jiawei han, Micheline Kamber, 3rd Edition , Morgan Kaufmann publishers , 2011 , ISBN-13: 978-0123814791.

3. “Database systems :Design implementation and management", Rob Coronel, 10th Edition, Thomson Learning Press , 2013,ISBN-13 9781111969608.

4. "Database Management Systems", Raghu Ramkrishnan, Johannes Gehrke,2nd Edition, McGraw Hill International Edition,2008,ISBN-13: 9780072465631.

Research Papers/Articles recommended for reading 1. Zaki J., “Recent developments in parallel and distributed data mining”, Cluwer academic

publishers , 2002 2. Hawang K., H. Liu. Discovering Typical Structures of Documents: A Road Map Approach,

ACM SIGR, August 1998. 3. Hawang K. and H. Liu, Schema Discovery for Semistructured Data. In Proceedings of

International Conference on Knowledge Discovery and Data Mining, Newport Beach, AAAI, Aug. 1997.

4. Nestorov S., AbiteboulS. and Motwani R, “ Inferring Structure in Semistructured Data”, In Proceedings ofInternational Workshop on Management of Semistructured Data, 1997

S.No. Topic Hours

1

Parallel databases Introduction, parallel database architecture, i/o parallelism, inter-query and intra-query parallelism, inter-operational and intra-operational parallelism, design of parallel systems.

10

2

Distributed Databases Introduction, DDBMS architectures, homogeneous and heterogeneous databases, distributed data storage, distributed transactions, commit protocols, concurrency control in distributed databases, availability, distributed query processing, directory systems.

10

3

Web based systems Overview of client server architecture, databases and web architecture, N-tier architecture,business logic – SOAP,XML - introduction, XML DTD's, domain specific DTD's , querying XML data.

10

4

Data Warehousing Introduction to data warehousing, architecture, dimensional data modeling- star, snowflake schemas, fact constellation, OLAP and data cubes, operations on cubes, data preprocessing -need for preprocessing, data cleaning, data integration and transformation, data reduction.

10

5

Data Mining Introduction to data mining, introduction to machine learning, descriptive and predictive data mining, outlier analysis, clustering - k means algorithm, classification - decision tree, association rules - apriori algorithm, introduction to text rnh.mg, Bayesian classifiers.

10

6

Information Retrieval Information retrieval - overview, relevance ranking using terms and hyperlinks, synonyms, homonyms, anthologies, indexing of documents, measuring retrieval effectiveness, web search engines, information retrieval and structured data.

10

238


5. Adya et al. “Efficient optimistic concurrency control usingloosely synchronized clocks”. Proc. of SIGMOD. 1995, pp. 23–34.

6. Cowling J. and Liskov B. ,“Granola: Low-Overhead Distributed Transaction Coordination”. Proc. of USENIX ATC.2012, pp. 223–236.

7. Barclay, T., R. Barnes, J. Gray, P. Sundaresan, “Loading Databases using Dataflow Parallelism.” SIGMOD Record, Vol.23, No. 4, Dec.1994.





Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered 1 Advance Database Management

System Pune University

2 Advance Database Management System

COEP


Name of Member Rahul Joshi Maya Shelke Swati Ahirrao Ambika Pawar






Signature


Date:

239



Course Name: Software Testing and Quality Assurance (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives The students will be able to:

1. Discussing different software testing approaches and their significance. 2. Experiment different test case deigns strategies such as white box testing and black box testing. 3. Discussing different software metrics and their importance. 4. Experiment software quality assurance tools like Ishikawa’s tools. 5. Discussing differentquality standardslike ISO, CMM and their implementation in different

business domains such as IT, education industry. 6. Test different types of computer applications using different automation tools like QTP, Selenium.

Pedagogy

1. Interactive sessions on the revisited areas of software testing 2. Class room teaching for the novel software testing concepts like test case design 3. Testing online applications 4. Use of software such as QTP,SOAP UI, Selenium, Test Complete and Bugzilla 5. Expert lectures


240


Books Recommended 1. “Practical Software Testing”, Iien Burnstein, Springer Publication. 2. “Effective Methods for Software Testing”, William E Perry, Wiley Publication, Second Edition. 3. “Software Metrics A Rigorous and Practical Approach”, Norman E. Fenton, Thomson Publication, Second Edition. 4. “Testing and Quality Assurance for Component-based Software”, Gao, Tsao and Wu, Artech House Publishers. 5. “Software Testing Techniques”, Bories Beizer, Dreamtech Press, Second Edition. 6. “Managing the Testing Process”, Rex Black, Wiley. 7. “Handbook of Software Quality Assurance”, G. Gordon Schulmeyer, James I.McManus, Second Edition, International Thomson Computer Press. 8. “Software Testing and continuous Quality Improvement”, William E.Lewis, Gunasekaran Veerapillai, Second Edition, Auerbach Publications 9. “Metrics and Models for Software Quality Engineering”, Stephen H. Kan, by Pearson Education Publication. 10. “Software Testing Tools”, K.V.K.K. Prasad, Dream tech press, 2008. 11. “Practical Software Testing”, Ilene Burnstein, Springer, 2003. 12. “Software Testing”, Srinivasan Desikan and Gopalaswamy Ramesh, Pearson Education, 2006. 13. “Software testing techniques”, Scott Loveland and Geoffrey Miller, Shroff Publishers, 2005. 14. “Software Quality”, Martin Wieczorek and Dirk Meyerhoff, Springer, 2001.

S. No. Topic Hours

1

Introduction to Software Testing Need of testing, basic concepts: errors, faults, defects, failures, test bed. type of testing : unit testing, integration testing system, system testing, regression testing, alpha, beta and acceptance testing , functional testing, performance testing, recovery testing, white box testing, black box testing, verification and validation model, test case design, review of specification, static and dynamic black box testing.

8

2

Software Testing Life Cycle and Test Management Testing Life Cycle: roles and activities, test planning: forming a test team, develop test plan review, test cases design strategies: black box approach: random testing, equivalence class partitioning and boundary value analysis.white box approach: test adequacy criteria, coverage and control flow graphs, paths, loop testing, mutation tests. test execution: build test data, life cycle of defect, defect tracking.

8

3

Software Metrics Need for software metrics, software metrics, classifying software measures, measurement basics, product, process and project metrics, GOM technique.

8

4

Quality Assurance Quality concepts: quality, quality control, quality assurance, cost of quality, software quality assurance: introduction and SQA activities, quality attributes: correctness, reliability, usability, integrity, portability, maintainability, interoperability, Ishikawa’s seven basic tools: checklist (check sheet), Pareto diagram, Histogram, Scatter diagram, Run chart, Control chart, Cause-and-effect diagram.

8

5 Quality Standards Basic concept of – ISO 9000 & 9001, CMM, Six Sigma. 6

6 Automation Testing Tools QTP, SOAP UI, Selenium, Test Complete, Bugzilla. 7

241


Research Papers/Articles recommended for reading 1. “A Complexity Measure”, McCabe's original paper in IEEE Transactions on Software Engineering Vol. 2, pp. 308, No. 4, 1976. 2. “Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric”, NIST Special Publication 500-235. 3. “Software Engineering—Product Quality—Part 1: Quality Model”, International Organization for Standardization, ISO, Geneva, Switzerland, 2001. ISO/IEC 9126-1:2001(E). 4. Spinellis D., “Code Quality: The Open Source Perspective”, Addison Wesley, Boston, MA, 2006. 5. Kan S., “Metrics and Models in Software Quality Engineering”, Addison-Wesley, Boston, MA, second edition, 2002. 6. Alshathry O. and Janicke H., "Optimizing Software Quality Assurance," compsacw, pp. 87–92, 2010, IEEE 34th Annual Computer Software and Applications Conference Workshops, 2010. 7. Glass R., “Building Quality Software”, Prentice Hall, Upper Saddle River, NJ, 1992. 8. Petrasch R., "The Definition of‚ Software Quality’: A Practical Approach", ISSRE, 1999. 9. Jung H., Kim S. and Chung C., “Measuring software product quality: A survey of ISO/IEC 9126”, IEEE Software, 21(5): 10–13, September/October 2004. Suggested Evaluation Methods

A. Continuous Assessment 1. Essential a) Unit Tests b) Seminars c) Assignments 2. Optional a) Quizzes b) Mini Project


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Software Testing and Quality

Assurance COEP

2 Software Testing and Quality Assurance

Pune University


Name of Member Ambika Pawar Maya Shelke Rahul Joshi Poorva Agarwal

Designation Assistant Prof. (CS & IT )

Assistant Prof. (CS & IT )




Signature


242


Date:


Course Name: Advanced Database Management System Lab (UG/PG): UG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Apply Abstract Data Type (ADT) to create nested tables. 2. Illustrate different types of attributes such as composite attributes and multi valued attributes. 3. Apply knowledge of ASP and JAVA to create a web application. 4. Demonstrate various OLAP operations on data cubes. 5. Illustrate Data Mining algorithms such as Apriori algorithm and decision tree algorithm. 6. Illustrate all commands in MY-SQL. 7. Apply knowledge in all above assignments to develop a mini project.

Pedagogy

1. Practical based on Oracle10g. 2. Practicals using softwares BI tools. 3. Practicals using ASP and JAVA


243


Books Recommended

1. “Database Systems: Design implementation and management", Rob Coronel, 10th Edition, Thomson Learning Press, 2013,ISBN-13 9781111969608.

2. "Database Management Systems", Raghu Ramkrishnan, Johannes Gehrke,2nd Edition, McGraw Hill International Edition,2008,ISBN-13: 9780072465631.


1. Zaki J., “Recent developments in parallel and distributed data mining”, Cluwer academic publishers , 2002.

2. Hawang K., H. Liu. Discovering Typical Structures of Documents: A Road Map Approach, ACM SIGR, August 1998.

3. Hawang K. and H. Liu, Schema Discovery for Semistructured Data. In Proceedings of International Conference on Knowledge Discovery and Data Mining, Newport Beach, AAAI, Aug. 1997.

4. Nestorov S., AbiteboulS. and Motwani R, “ Inferring Structure in Semistructured Data”, In Proceedings ofInternational Workshop on Management of Semistructured Data, 1997.

5. Adya et al. “Efficient optimistic concurrency control usingloosely synchronized clocks”. Proc. of SIGMOD. 1995, pp. 23–34.

6. Cowling J. and Liskov B., “Granola: Low-Overhead Distributed Transaction Coordination”. Proc. of USENIX ATC.2012, pp. 223–236.

7. Barclay, T., R. Barnes, J. Gray, P. Sundaresan, “Loading Databases using Dataflow Parallelism.” SIGMOD Record, Vol.23, No. 4, Dec.1994.


1. Essential Lab Assignments 2. Optional

c) Quizzes d) Mini Project


S. No. Topic Hours

1 Implement Abstract data type, arrays and object tables. 4

2 ORDBMS— Implement system using composite, multi valued attributes, inheritance.

4

3 Implement Web based system using ASP / JSP. 4 4 Building cubes and OLAP analysis. 4

5 Implementing Data mining algorithms. 4

6 Case Study a) any one from open source (for e.g. Postgres SQL »My SQL) b) Any one from Oracle, SQL Server, DB2.

4

7 Mini Project. 6

244


Parallel/Similar courses in the existing curriculum Sr. No. Name of the course Institute where it is offered 1 Advanced Database

Management System Lab

COEP


Name of Member







Signature


Date:

245



Specialization: Computer Science and Information Technology Course Name: Software Testing and Quality Assurance Lab (UG/PG): UG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Illustrate the importance of software testing strategy in Software Requirement Specification (SRS) and its documentation.

2. Design test cases using different test strategies like white box and black box testing. 3. Explain and evaluate cyclomatic complexity in white box testing using a case study. 4. Explain the process of software test planning and prepare a sample test plan. 5. Explain and apply Ishikawa’s Tools of software testing. 6. Choose an automated testing tool to minimize manual efforts in software testing. 7. Model and analyze a scenario of “Test complete” and “Test anywhere”.

Pedagogy

1. Theory concepts in software testing process 2. Class room teaching on Testing Practices and Quality Standards 3. Industry visit to understand software testing practices followed in industry 4. Practical on automation tools


246


Books Recommended 1. “Practical Software Testing”, Iien Burnstein, Springer Publication. 2. “Effective Methods for Software Testing”, William E Perry, Wiley Publication, Second Edition. 3. “Software Metrics A Rigorous and Practical Approach”, Norman E. Fenton, Thomson Publication, Second Edition. 4. “Testing and Quality Assurance for Component-based Software”, Gao, Tsao and Wu, Artech House Publishers. 5. “Software Testing Techniques”, Bories Beizer, Dreamtech Press, Second Edition. 6. “Managing the Testing Process”, Rex Black, Wiley. 7. “Handbook of Software Quality Assurance”, G. Gordon Schulmeyer, James I.McManus, Second Edition, International Thomson Computer Press. 8. “Software Testing and continuous Quality Improvement”, William E.Lewis, Gunasekaran Veerapillai, Second Edition, Auerbach Publications 9. “Metrics and Models for Software Quality Engineering”, Stephen H. Kan, by Pearson Education Publication. 10. “Software Testing Tools”, K.V.K.K. Prasad, Dream tech press, 2008. 11. “Practical Software Testing”, Ilene Burnstein, Springer, 2003. 12. “Software Testing”, Srinivasan Desikan and Gopalaswamy Ramesh, Pearson Education, 2006. 13. “Software testing techniques”, Scott Loveland and Geoffrey Miller, Shroff Publishers, 2005. 14. “Software Quality”, Martin Wieczorek and Dirk Meyerhoff, Springer, 2001.

Research Papers/Articles recommended for reading 1. “A Complexity Measure”, McCabe's original paper in IEEE Transactions on Software Engineering Vol. 2, pp. 308, No. 4, 1976. 2. “Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric”, NIST Special Publication 500-235.

S. No. Topic Hours

1 Review of SRS for a case study. 2

2 Designing test cases for a case study. 2

3 Control flow graphs and cyclomatic complexity. 2

4 Test planning for a case study. 2

5 Application of Ishikawa’s tools for a case study. 2

6 Application of QTP. 4

7 Application of Selenium. 4

8 Application of SOAP UI. 2

9 Scenario of Test complete. 2

10 Application of Bugzilla. 4

11 Scenario of Test Anywhere. 4

247


3. “Software Engineering—Product Quality—Part 1: Quality Model”, International Organization for Standardization, ISO, Geneva, Switzerland, 2001. ISO/IEC 9126-1:2001(E). 4. Spinellis D., “Code Quality: The Open Source Perspective”, Addison Wesley, Boston, MA, 2006. 5. Kan S., “Metrics and Models in Software Quality Engineering”, Addison-Wesley, Boston, MA, second edition, 2002. 6. Alshathry O. and Janicke H., "Optimizing Software Quality Assurance," compsacw, pp. 87–92, 2010, IEEE 34th Annual Computer Software and Applications Conference Workshops, 2010. 7. Glass R., “Building Quality Software”, Prentice Hall, Upper Saddle River, NJ, 1992. 8. Petrasch R., "The Definition of‚ Software Quality’: A Practical Approach", ISSRE, 1999. 9. Jung H., Kim S. and Chung C., “Measuring software product quality: A survey of ISO/IEC 9126”, IEEE Software, 21(5): 10–13, September/October 2004.



Lab Assignments 2. Optional



Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Software Testing and

Quality Assurance Lab COEP

2 Software Testing and Quality Assurance Lab

Pune University


Name of Member

Ambika Pawar Maya Shelke Rahul Joshi Poorva Agarwal






Signature


Date:

248



Course Name: SAP (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives The students will be able to:

1. Illustrate multi tier architecture and configuration of Enterprise Resource Planning (ERP) system.

2. Experiment installation of Systems Applications and Products (SAP) on Windows, UNIX. 3. Analyze administration of GUI, modes of operation. 4. Test client and user administration. 5. Analyze transport management system.

Pedagogy

1. Class room teaching 2. Group discussion 3. Seminars

Pre-requisites

None Course Outline

249


Books Recommended

1. “SAP BW Certification” by Catherine M. Roze, John Wiley Publication(2003). 2. “SAP Black book” by Dreamtech software teams, Dreamtech press (2008) 3. “Writing SAP ABAP/4 programs” 1st edition by Theodore Hoffman, Tata Mcgraw Hill education

(1996).

Research Papers/Articles recommended for reading 1. Lamey A., Mousa M. and Keshk A., “Improve Performance of Enterprise Information Sap

Portal”,International Journal of Computer Applications,37(1):1-5, 2012. 2. Bai S., Karthikeyan P. and Murugesan S., “Business Application with SAP BI”,IJCA Proceedings on

National Conference on Advances in Computer Science and Applications (NCACSA 2012) NCACSA(2):12-16, May 2012.

S. No. Topic Hours

1

Introduction to Enterprise Resource Planning (ERP) Introduction to SAP R/3, SAP R/3 architecture details like central system, distributed presentation, 2-tier and 3-tier configuration. System landscape and flow details like single system, two systems, three system and multi system landscape.

9

2

Installation of SAP Installation concept on Windows, UNIX and Quick Sizing, Naming convention, software kit, SAP licensing, installation procedure for Windows application server for UNIX SAP system, R/3 dictionary structure and kernel.

9

3

GUI administrator, Operation modes and Profile maintenance Optimization and security in GUI administrator, manual switching of operation modes, exceptional mode and monitoring. System profile, transport profile, client profile and authorization profile.

9

4

Client and user administration Client maintenance, copying client within R/3 system (local), copying client between R/3 systems (remote), export and import, protecting client, monitoring and verifying a client copy, deleting client and trouble shooting, creating and maintaining master records, architecture, logon and password security, protecting special users, creating and maintaining single and mass users and user groups, copying, deleting, locking/unlocking users, explanation of terms object class, authorization object, authorization, profile, create/maintaining authorization/profile manually, create/maintaining roles/generating profiles by using PFCG.

9

5

Transport Management System TMS Terminology and Concepts, Configuring TMS and Checking Transport Directory, Configuring Transport Domain, Domain Controller and Group Configuring Virtual SAP System and Displaying Configuration, Including SAP systems in the Transport Domain, Creating Consolidation and Delivery Routes, Maintaining SAP Systems without Common Transport Directory, Configuring External Systems, Locking and Unlocking TMS for a SAP System, Deleting SAP System from the Transport Domain Deleting TMS Configuration.

9

250






D) End Semester Examination 1. Written Exam


Sr. No. Name of the course Institute where it is offered 1 SAP Pune University


Name of Member







Signature


Date:

251



Specialization: Computer Science and Information Technology Course Name: Search Engine Optimization (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives The Students will be able to:

1. Demonstrate various types of digital marketing with emphasis on internet marketing. 2. Apply the process of Search Engine Optimization (SEO) to basics of web designing, domain and

web hosting, and SERP (Search Engine Result Page). 3. Modify a search engine optimized website by implementing the concepts of on-site optimization

and off-site optimization. 4. Prepare the advancements in SEO practices that attract relevant and quality visitors to the

websites. 5. Demonstrate the exploitation of social networking sites for the promotion of brand building.

Pedagogy 1. Interactive class room sessions 2. Projects based on off site and on site optimizations 3. Research and analysis of Search Engine Optimization existing methods to improve their

effectiveness


252


Books Recommended

1. “Search Engine Optimization for Dummies”, Peter Kent, 4th edition Wiley Publication. 2. “Search Engine Optimization All-in-One For Dummies”, Bruce Clay, John Wiley & Sons. 3. “Search Engine Optimization (SEO): An Hour a Day”, Jennifer Grappone, sybew, edition 3. 4. “Google+ for Business: How Google's Social Network Changes Everything”, Chris Brogan, 2010),

Que Publishing, 2012. 5. “Search Engine Optimization (SEO) Secrets”, Danny Dover, Wiley, John & Sns.


1. Tian L.,YanB. and Liyuan W., “Study on SEO monitoring system based on keywords & links”, 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT), 2010.

2. Shi J., Cao Y. and Zhao X.,” Research on SEO strategies of university journal websites”, 2nd International Conference on Information Science and Engineering (ICISE), 2010.

Sr. No. Topic Hours

1

Introduction to Digital Marketing and internet Marketing Types of digital marketing, internet marketing, introduction to e-

commerce, marketing planning and the role of the internet, customer relationship management and the role of the internet, internet marketing strategies in communication and distribution, non technical issues surrounding creating and building an internet website, public policy questions.

09

2

Search Engine Optimization (SEO) Introduction to SEO, types of search engine, basics of web designing, domain and web hosting, page rank (PR), SERP (Search Engine Result Page), search engine crawler, spider view.

09

3

On Site Optimization Importance of domain age, selection of keyword or keyword analysis, title optimization, meta tag optimization, SEO friendly design, content optimization, image optimization, anchor text, PDF optimization, SEO friendly URL, creating site map and its submission, installation of robt.txt, W3C validation, implementation of canonical, installation of Google analytics code, submission of site into Google webmaster.

09

4

Off Site Optimization Online branding, search engine submission, back links, blogs, article submission, directory, do follow comments, free classifieds, forums, press release, social bookmarking, social media optimization (SMO), video marketing, fetching back links from government and education sites, white/gray/black SEO methods.

09

5

Social Media Optimization How to optimize social media, how to use it in favor of your brand building, social networks and communities, how to do promotions on social networking sites like: Facebook, Linkedln, Twitter.

09

253


Suggested Evaluation Methods C) Continuous Assessment


2. Optional A. Quizzes B. Mini Project

D) End Semester Examination 1. Written Exam

Parallel/Similar course in the existing curriculum

Sr. No. Name of the course Institute where it is offered 1 Search Engine

Optimization Mumbai University


Name of Member

Rahul Joshi Maya Shelke Ambika Pawar Shilpa Pawar






Signature


Date:

254




Course Name: Software Product Line Management (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives The students will be able to:

1. Illustrate the process of product line development with emphasis on software production. 2. Outline the phases of software product line like business, architecture, process and organization

(BAPO). 3. Analyze the principles of product line variabilitywith emphasis onvariability analysis, modeling

and documentation usingFeature Tree and Variability diagram. 4. Design the process of domain engineering like requirements engineering, design, realization,

testing and asset scoping. 5. Design the process of application engineering like requirements engineering, design, realization,

testing and asset scoping. 6. Analyze various types of product line frameworks like Product Family Evaluation Framework

(FEF), SEI.

Pedagogy

1. Interactive sessions on the general concepts of the product line 2. Class room teaching for the novel concepts of product line development 3. Assignments on domain requirement engineering and testing 4. Research seminars


255


Books Recommended 1. “Software Product Line Engineering: Foundations, Principles, and Techniques”, Klaus Pohl, Günter

Böckle, Frank Vander Linden, Springer (2005). 2. “Designing Software Product Lines with UML: From Use Cases to Pattern-Based Software

Architectures “, Hassan Gomma, Addison-Wesley Professional (2004). 3. “Software Product Lines: Practices and Patterns”, Paul Clements and Linda Northrop, Addison-

Wesley, 2001. 4. “Software Product Lines in Action: The Best Industrial Practices in Product Line Engineering”, Frank

J. Vander Linden,Klaus Schmidt, Eelco Rommes, Springer (2007). Research Papers/Articles recommended for reading 1. Schmid K. and Rummler A., “Cloud-based Software Product Lines”, 16th International Software

Product Line Conference (SPLC ’12). Vol. 2. ACM, 2012, pp. 164–170. 2. Kolesnyk A. and Slabospitskaya O., “Tested Approach for Variability Management Enhancing in

Software Product Line”.

S.No. Topic Hours

1

Software product lines - An overview Historical evolution of software product lines, principles of product line engineering, mass production and mass customization, binding time and multiple binding time, platforms, flexibility, motivation for product line development.

9

2

Economics of Software Product Lines BAPO (Business, Architecture, Process and Organization), model for managing product lines, product line markets, economics, management and scoping, transition to product lines, effects of transition on structure and business processes.

9

3

Variability Management Principles of product line variability, variability analysis and modeling, documentation of variability in development artifacts, feature tree and variability diagram, variant selection, traceability in variability models.

9

4

Domain Engineering Product and portfolio management, domain requirements engineering, design, realization, testing, asset scoping, selection of cots and other components.

8

5

Application Engineering Application and relationship with product, management and domain engineering, application specific requirements analysis, design, realization and testing.

7

6 Product line Frameworks Product family evaluation framework (FEF), SEI, framework for software product line practice.

3

256



1. Essential a) Tests b) Seminars c) Assignments

2. Optional a) Quizzes b) Group Discussions c) Mini Project


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1 Software Product Line

Management Pune University

Sub-committee Specialization

Name of Member

Manisha Tijare Suman Tanwar Poorva Agrawal Seema Patil






Signature


Date:

257



Course Name: Usability (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives The students will be able to:

1. Analyze various aspects of usability along with its types. 2. Revise the rudimentary aspects of how human beings take in and process information. 3. Examine different models in development of an interface like Cognitive model, Linguistic model

etc. 4. Explain in detail the usability engineering methods used in the pursuit of UCD 5. Outline the phases of designing user friendly interface using LUCID development methodology. 6. Categorize various methods of usability testingto test user interface design. 7. Summarize the justification for the application of usability in real-life systems like E-Commerce,

ATM interface etc. Pedagogy

1. Interactive sessions and Brain storming 2. Class room teaching 3. Seminars

Pre-requisites

None Course Outline

258


Books Recommended 1. “The usability engineering lifecycle”,Mayhew, D. J., Morgan Kaufmann Publication,1999, San

Francisco. 2. “The design of everyday things”, Norman, Donald A. ,Doubleday Publication,1990 New York. 3. "Human Computer Interaction", Alan J, Dix. Janet Finlay, Rusell Beale, Pearson Education, 3rd

Edition, 2004, ISBN 81-297-0409-9. 4. "Designing the User Interface", Ben Shneiderman, Pearson Education, 2001, ISBN 81-7808-262- 4. 5. "The essentials of Interaction Design", Alan Cooper, John Wiley, 2002, ISBN 81-265-0213-4.

Research Papers/Articles recommended for reading 1. Hornbæk K. “Current practice in measuring usability: Challenges to usability studies and

research”Department of Computer Science, University of Copenhagen, Denmark, Elsevier,Volume 64,Issue 2,February 2006, Pages 79–102.

2. Insfran E. andFernandez A. ,”A Systematic Review of Usability Evaluation in Web Development”,Springer, Volume 5176, 2008, pp 81-91.

Sr. No. Topic Hours

1.

Introduction Usability, usability engineering of user documentation, usability and training, usability and internationalization, accessibility, organizational challenges for usability, wireless usability, PDA usability, cost-justifying usability: measuring return-on-investment for your usability, scientific comparisons of the effectiveness of various usability engineering methods, usability v/s learnability v/s discoverability, what’s new on the usability horizon, usability and kids, special concerns for e-commerce.

10

2.

Principles of models & guidelines Principle 1: recognize diversity, principle 2: 8 golden rules of user interface design ,principle 3: prevent errors, guidelines for data display, guidelines for data entry, study of HCI patterns and models, types of models, cognitive models, GOMS &keystroke-level model, stages of action models, linguistic models, BNF & task action grammar, object action interface model.

10

3.

Design Process User Centered Design (UCD), UCD life cycle, advantages & disadvantages, case studies in UCD, cooperative, participative, contextual, understanding users and user experience levels, trans design process: what is a design? the process of design, user focus, aims of user centered design process, three pillars of design, participatory design, scenarios, navigation design, screen design, development methodology (LUCID),S/w tools: design tools.

10

4.

Evaluation criteria for UI testing Usability testing, suitability testing, accessibility testing, remote usability testing, automated usability evaluation tools, testing methods - think aloud , videotaping , customer satisfaction,questionnaires, user research-qualitative & quantitative, various qualitative research techniques.

7

5.

Case Study Web interfaces, gaming interfaces, embedded system interfaces, kiosks, mobile interfaces, e-commerce, ATM interface etc.

8

259


3. Castro D.,”Reference Model for Development of Human-Computer Interfaces”, L. ; EGC, Fed. Univ. of Santa Catarina, Florianopolis, Computational Science and Engineering Workshops, 2008. CSEWORKSHOPS '08. 11th IEEE International Conference on July 2008.

4. Karray A., Alemzadeh M., Saleh J. and Arab M., “Human-Computer Interaction: Overview on State of the Art”, F, international journal on smart sensing and intelligent systems, vol. 1, no. 1, march 2008.


1. Continuous Assessment 1. Essential d) Unit Tests e) Seminars f) Assignments 2. Optional a) Quizzes b) Presentations

2. End Semester Examination a) Written Exam


Sr. No. Name of the course Institute where it is offered 1 Usability COEP


Name of Member Prof. Shilpa Gite Prof. Shraddha Phansalkar

Swati Ahirrao Meeta Kumar







Date:

260



Course Name: Cloud Computing (UG/PG): UG Number of Credits: 3 Level: 4 Learning Objectives Students will be able to:

1. Categorize different Cloud Service Models and summarize concepts related to Cloud Storage. 2. Analyze the importance of IAAS versus owning an infrastructure and integrate training from

several Virtualizations online resources. 3. Explain the architectural details of PaaS and summarize various Distributed File Systems. 4. Categorize the security and risk issues of Cloud Computing Softwares. 5. Illustrate various No-SQL Cloud Databases such as HDFS, BigTable etc. 6. Test Microsoft Windows Azure, Hadoop, Google App Engine and application development on the

same..

Pedagogy 1. Classroom Teaching 2. Seminar 3. Brainstorming Session 4. Demonstration Lab using Cloud Computing tools for SAAS like Salesforce.com 5. Demonstration Lab using Eucalyptus, AWS ,Cloud Datastores like Hbase, SimpleDB.

Pre-requisites

None Course Outline

261


Books Recommended 1. “Cloud Computing Principles and Paradigms”, R Buyya,1st Edition, 2011 by Wiley Publication,

ISBN: 9780470887998. 2. “Cloud Computing for Dummies”, J Hurwitz’s, 1st Edition, 2009 by Wiley Publication, ISBN: 978-

0470484708. 3. “Cloud Security :A comprehensive Guide to Security Cloud Computing”,Ronald L. Krutz ,1st

Edition, 2010 by Wiley Publication, ISBN: 0470589876 4. “Cloud Computing”,A.T. Velte, T. J. Velte, R Elsenpeter, A Practical Approach”, Tata Mcgraw-Hill

Edition. 5. ”Cloud Computing Explained”, John Rhoton, 2nd Edition, 2009 by Recursive Limited, ISBN:

0956355609. 6. “Guide to Cloud Computing: Principles and Practice”,Laurie Hirsch, Peter Lake,2012 by Springer,

ISBN: 1447146034.


1. Weinhardt C., Blau B. and Stößer J. , “Cloud Computing – A Classification, Business Models”, and Research Directions, , Business & Information Systems Engineering ,vol 1(2009),pp 391-399 .

2. Armbrust M., Fox A., Griffith R., Katz R. and Lee G., “A view of cloud computing “, Communications of the ACM, vol 53(2010),pp:50-58 .

3. Tsai W., Sun X. and Balasooriya, J,”Service-Oriented Cloud Computing Architecture”,Information Technology: New Generations (ITNG), 2010 Seventh International Conference,pp: 684 - 689.

4. Zhang Q., Cheng L. and Boutaba R.,”Cloud computing: state-of-the-art and research challenges”,Journal of Internet Services and Applications,vol 1(2010),pp:7-18.

5. Buyya R., Yeo S. and Venugopal S., “Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities “, High Performance Computing and Communications, 2008. HPCC '08. 10th IEEE International Conference, pp: 5-13.

S.No. Topic Hours

1.

Introduction to Cloud Computing What is cloud computing? different perspectives, properties and characteristics, benefits, service models: infrastructure as a service, platform as a service, software as a service, deployment models: public cloud, private cloud, community cloud, hybrid cloud, understanding cloud storage.

8

2. Cloud: IAAS Infrastructure as a service Overview: why do we need IaaS? How IaaS meets cloud properties? Enabling techniques: virtualization overview, terminology & taxonomy.

8

3. Cloud: PAAS Platform as a Service Introduction: from IaaS to PaaS, what is PaaS? PaaS properties and characteristics, overview – Hadoop & Google, file system - GFS, HDFS.

8

4.

Cloud Computing Software Security Fundamentals & Risk Issues CC security fundamentals: objectives, cloud security services, security design principles, CC risk issues: CIA traid, privacy and compliance risks, and threats to infrastructure, data and access control.

8

5. Cloud Databases: Case Studies HDFS, big table, HBase, map reduce framework, Amazon SimpleDB, DynamoDB.

8

6. Cloud Platforms: Case Studies Cloud platform: PaaS venders- Microsoft Windows Azure, Hadoop, Google App Engine.

5

262


6. Berl A.,Gelenbe E., Girolamo M. ,Giuliani G. andMeer H., “Energy-Efficient Cloud Computing “, Oxford Computer Journals,vol 53(2009),pp:1045-1051.


A) Continuous Assessment A) Essential


c) Assignments B) Optional

1. Quizzes 2. Mini Project


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1. Cloud Computing

Pune University

2 Cloud Computing

Mumbai University


Name of Member Shruti patil Shraddha Phansalkar

Preeti Mulay Ambika Pawar






Signature


Date:

263



Specialization: Computer Science and Information Technology Course Name: Intelligent Systems (UG/PG): PG Number of Credits: 3 Level: 5 Learning Objectives The students will be able to:

1. Explain characteristics and challenges of Intelligent Systems (IS) with examples. 2. Illustrate various knowledge representations like declarative, procedural representation used in

IS. 3. Design an expert system and implement it with knowledge engineering process. 4. Evaluate computational complexity, search complexity of a problem in IS. 5. Apply natural language processing (NLP), neural network agents in various IS applications.

Pedagogy

1. Class room teaching 2. Hands on programming languages like LISP and Prolog 3. Case studies 4. Mini projects

Pre-requisites None

Course Outline

264


Books Recommended a. “Intelligent Systems: Principles, Paradigms and Pragmatics [Hardcover]”, Robert J. Schalko, Jones

and Barleftt Publishers, LLC, 2011 edition. b. “Intelligent Systems and Technologies, Methods and Applications Series: Studies in Computational

Intelligence”, Vol. 217, Springer, Watada, Junzo, 2009 edition. c. “Artificial Intelligence – Modern Approach”, Russell S., Norving P. d. “Lisp programming language”, Patric H., Winstone. e. “Research and Development in Intelligent Systems XXVI: Incorporating Applications and Innovations

in Intelligent Systems XVII [Paperback]” Richard Ellis , Miltos Petridis, Springer 2010 edition,ISBN-10: 1848829825, ISBN-13: 978-1848829824.

f. “Computational Intelligent Systems For Applied Research”, Proceedings of the 5th International FLINS Conference, Gent, Belgium, 16 – 18 September 2002, edited by: Da Ruan (Belgian Nuclear Research Centre, Belgium) edited by: Pierre D'hondt (Belgian Nuclear Research Centre, Belgium) edited by: Etienne E Kerre (Ghent University, Belgium) 2007.

g. “Intelligent Systems Reference Library Series Editors”, Kacprzyk, Janusz, Jain, Lakhmi C. h. “Robotics and Intelligent Systems A Virtual Reference Book”, Robert F. Stengel.

Research Papers 1. Shen W., Hao Q., Yoon H. and Norrie D.,“Applications of agent-based systems in intelligent

manufacturing: An updated review”, Integrated Manufacturing Technologies Institute, National Research Council Canada.

2. Ipswich H. and Suffolk,“Software Agents: An Overview”, Knowledge Engineering Review, Vol. 11, No 3, pp.1-40, Sept 1996.

3. Irani Z. and Kamal U., “Intelligent Systems Research in the Construction Industry”, Expert Systems with Applications journal, 2013.

4. Olof G., Gillblad P. and Daniel, “Autonomous Accident Monitoring Using Cellular Network Data”, Swedish Institute of Computer Science (SICS), Sweden, 2007.

S. No. Topic Hours

1

Introduction to IS What is IS, key topics or themes, approaches to IS development history of IS, challenges of IS, IS and game theory, characteristic of IS, turing test, quantitative tools for IS development.

8

2

Representation in IS Knowledge representation and related definitions, human reasoning, classes, categories, concepts, declarative versus procedural representations, tools for representation.

8

3

Expert Systems What is an expert systems, rule based implementation, the appeal of expert system, the expert system knowledge engineering process production system for expert system implementation.

8

4

Search and Computational Complexity in IS IS problem computational complexity, concept of system state space, to search or not to search problem presentation, definition of n search problem, state space graphs, search costs and heuristics

8

5 Additional Topics of IS NLP, introduction of Prolog and LISP, basic agents structure and types of agents introduction to neural network and IS applications

8

6 Summarize the concept of natural language processing (NLP), neural network, agents and various IS applications.

5

265


5. Rothkrantz, Delft L.,“Crisis Management Using Multiple Camera Surveillance Systems” http://www.iscramlive.org/portal/iscram2013theme07.



a) Unit Tests b) Assignments

c) Seminars 2. Optional

1. Quizzes 2. Mini Projects

D. End Semester Examination Written Exam


Sr. No. Name of the course Institute where it is offered 1 Intelligent Systems VTU


Name of Member

Praveen Gubbala Nisha Auti Shraddha Phansalkar

Dr. Preeti Muley






Signature


Date:

266


(Established under section 3 of the UGC Act 1956, by notification No.F.9-12/2001-U3

Government of India) Accredited by NAAC with ‘A’ Grade

Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India)

__________________________________________________________________________ Sub Committee - Specialization for Curriculum Development

Post Graduate/ Under Graduate

Course Title: Environmental Studies Course Code: Number of Credits: 04 Level: 01 Learning Objective/Outcome (s): The students will be able to: 1. Undertand about sustainable technologies for resource conservatiuon. 2. Identify sources, effects and remedial measures for different pollutions. 3. xxx technics for Industrial water management and treatment processes 4. Catagorize various soild wastes and know about the latest management technics. 5. Global impacts of air pollution and its control strategies. 6. Know about existing environmental laws and legislations and cas studies of its application.

Pre-learning: Environmental Sciences Course Outline

Sr. No. Topic Hours

1.

Multidisciplinary Nature of Environmental Studies: Definition, scope, environment and its relation to the branch. Introduction to basic terminologies.Sustainable development, natural resources and associated problems- water, solar, mineral and energy, actual sustainability report study, Water conservation, rain water harvesting. Resettlement and rehabilitation of people; its problems, concerns and case studies.

10

2

Natural resources and environmental pollution: Definition, causes, effects, control measures and case studies of (a) Water pollution (b) Soil pollution (c) Marine pollution (d) Noise pollution (e) Thermal pollution (f) Nuclear pollution. Disaster management: floods,

10

267


earthquake, cyclone and landslides.

3

Industrial waste water treatment: Important terminologies related to waste water treatment process. Preliminary, primary, secondary and tertiary waste water treatment process. Waste water treatment process of (a) Paper and pulp (b) Oil refinery (c) Petrochemical (d) Sugar industries. Case studies.

10

4 Solid and E- waste management: Sources and types of solid wastes, introduction to solid waste management. Introduction to E- waste, generation and case studies.

10

5

Air pollution and control: Definition, sources, classification of air pollution. Air pollutants: CO, CO2, SO2, NOX, hydrocarbons and aerosols. Specific phenomena related with air pollution- Greenhouse effect, Acid rain, Ozone layer depletion and Smog. Effect of air pollution on – Human health, animals, plants, atmosphere and other effects. Management measures for preventing and controlling air pollution.

10

6

Environmental Legislations and case studies : Environmental ethics: Issues and possible solutions. Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case studies. Wasteland reclamation. Consumerism and waste products. National: Environment Protection Act, Air (Prevention and Control of Pollution) Act, Water (Prevention and Control of Pollution) Act, Wildlife Protection Act, Forest Conservation Act. International: Montreal protocol, Kyoto protocol, Rio summit and Paris agreement. Issues involved in enforcement of environmental legislation.

10

Pedagogy

1. Interactive classroom teaching 2. Assignments 3. Group discussions. 4. Movies and videos

Books Recommended

1. Chokkan, K.B., Pandya, H. &Raghunathan, H. (eds). 2004. Understanding Environment. Sagar Publication India Pvt. Ltd., New Delhi.

2. Elliot, D. 2003. Energy, Society and Environment, Technology for a Sustainable Future. Routledge Press.

3. Leopold, A. 1949. The Land Ethic. pp. 201-214. Chicago, USA. 4. National Research Council (NRC).1996. Linking Science and Technology to Society's

Environmental Goals. National Academy Press. 5. S. K. Garg. Sewage Disposal and Air pollution Engineering. Khanna Publishers. 6. M. N. Roa, H. V. N. Rao. Air Pollution. Mc.Graw Hill. 7. C. S. Rao. Environmental Pollution Control Engineering. New Age International publishers.

268


8. Iqbal H. Khan, Naved Ahsan. Textbook of Solid Wastes Management. CBS Publisher & Distributors P Ltd.

Suggested Assessment/ Evaluation Methods

a. Unit tests b. Duet Assignments c. Quiz d. GD

269





______________________________________________________________________ Sub Committee - Specialization for Curriculum Development

Under Graduate

Course Title: Engineering Graphics Lab Course Code: 070125109 Number of Credits: 2 Level: 1 Course Outcomes: The student will be able to

1. Understand and apply different types of lines, dimensioning methods, scales, lettering in engineering drawings

2. Visualize and communicate three dimensional shapes as two dimensional engineering drawings using proper dimensions and projection methods

3. Formulate and solve application oriented problems using projections of lines 4. Visualize and draw isometric projections of simple and composite solids 5. Visualize, plan and draw orthographic projections of points, lines, planes, solids

and sections in different positions 6. Understand and draw the development of solids and cut sections

Pre-learning:Geometrical constructions Course Outline Sr.No. Topics Hours

1.

Types of Lines, Dimensioning and Lettering:Types of the lines and application, Dimensioning methods- aligned, unidirectional, Lettering-Single stroke (to be drawn on sketch book)

02

2.

Projection of points ,Lines:Projections of points in all the four quadrants, Projections of straight lines (located in First quadrant/first angle only), True and apparent lengths, True and apparent inclinations to reference planes, application oriented

14

270


problems. Sheet no 1-six problems on projection of points. Sheet no 2-Three problems on projection of Lines.

3.

Projection of Planes: Introduction, Definitions–projections of plane surfaces–triangle, square, rectangle, rhombus, pentagon, hexagon and circle, planes in different positions by change of position method only. Sheet no 3-Four problems on projection of Planes.

12

4.

Projections of Solids: (First angle Projection only) Introduction, Definitions – Projections of right regular tetrahedron, hexahedron (cube), prisms, pyramids, cylinders and cones in different positions, section of solids. Sheet no 4-Four problems on projection of Solids. Sheet no 5-Two problems on Section of Solids.

16

5.

Development of Lateral Surfaces of Solids: Introduction, Section planes, Sectional views, Apparent shapes and True shapes of Sections of right regular prisms, pyramids, cylinders and cones resting with base on HP. Sheet no 6-Two problems on Development of Solids. Sheet no 7-Two problems on Development of section of Solids.

6

6.

Isometric Projection: (Using Isometric Scale Only) Introduction, Isometric scale, Isometric projection of simple plane figures, Isometric projection of tetrahedron, hexahedron (cube), right regular prisms, pyramids, cylinders, cones, spheres, cut spheres, solids). Sheet no 8-Two problems on Isometric Projection.

6

7.

Orthographic Projections: Problems on first and third angle methods of projection. Orthographic projections, sectional views: - full, half, partial ,offset, revolved, removed sections. Sheet no 9- one problem on orthographic Projection.

4

Pedagogy

1. Class room teaching 2. Drawing sheets 3. Tutorials 4. Project based learning


1. Drawing examination 2. Mini Projects 3. Quiz 4. Viva-voce

271


Name of Members

Prof. Ravi Sekhar


Org. / Inst. SIT

Signature

Name of Experts

Designation

Org. / Inst.

Signature


272


Faculty of Engineering Specialization: Applied Science (AS)

Course Code- 070122116 (Semester I); 070122216 (Semester II)

Course Name : Technical English and Communication Skills

(UG/PG) : UG Number of Credits : 3 (2+1 Lab) Level : 1 Subject Category: Applied Sciences

Pedagogy: 1. Class room teaching 2. Assignments 3. Tutorials 4. Project based learning 5. Presentations

Course outline:

Sr. No. Topic Hours

1

Fundamentals of Communication Concept and meaning of communication, role of communication in information age , objectives of communication, methods of communication, types of communication, process of communication, basics of technical communication, importance of effective communication, manners and etiquettes in communication, barriers to effective communication, interpersonal communication- the Johari window, inter-cultural communication, etiquette in communication, cultural factors that influence communication, mannerisms to be avoided in communication.

10

2

Listening Skills and Speaking Skills Listening process, hearing and listening, types of listening, barriers to listening, effective listening strategies, listening in conversational interaction, listening to structured talks, pre-listening analysis, team listening, conversation and oral skills, self-expression, spoken English, Kinesics, Proxemics, speaking techniques, styles of communication, interview skills, group discussion, presentation skills.

10

273


3 10 Writing and Reading Skills

The basics of writing, defining features of technical communication and effective writing , resume writing, formal letter writing, business letter writing, memo writing, agenda, minutes, business letters, email writing, article writing, report writing, creative writing , paragraph writing, précis writing, summary writing , vocabulary building, grammar, Intensive reading, predicting content, interpretation, inference from text, inferential information, implication, critical interpretation.

Books Recommended:

Sr No

Author Book Title Publisher Details

1 M Ashraf Rizvi Effective Technical Communication

Tata McGraw

CompanyLtd.

Hill Publishing

2 Krishna Mohan, Meera Banerji

Developing Communication Skills

McMillan India Ltd.

3 Farhathullah, T. M. Communication

Technical Students

skills for Orient BlackSwan

4 Lesikar and Petit Report writing for Business Irwin McGraw-Hill, Boston, MA, 1998 5 Lemay Presentation Success Thomson Learning 6 Malcolm Goodale Professional Presentations Cambridge University Press 7 Michael Muckian,

John Woods The Business letters Handbook

8 Herta A. Murphy Effective Business Communication

Tata McGraw-Hill Education Pvt. Ltd., 2008

9 Department of Humanities and Social Sciences,Anna University, Chennai

English for Engineers and Technologists Volumes 1 and 2

Orient Longmans Publication, 2008

10 Kiranmai Dutt A Course on Communication Skills

Edition Foundation Books, New Delhi, 2007

11 Sharma, R. and Mohan, K

Business Correspondence and Report Writing

TMH New Delhi 2002

12 David F. Beer and David Mc Murrey, John Willey

Guide to writing as an Engineer

New York, 2004

274


13 E. H. McGrath Basic Managerial Skills for all

Eastern Economy Edition, Prentice

Hall India.

14 Wallace and Masters Personal Development for Life and Work

South-Western Publishing Co.,2006

Recommended EvaluationMethods: Continuous Assessment End Semester Examination Sr No Components Nos. Components Nos. 1 Unit Tests - I 1 -

2 Assignments 2

3 Unit Tests - II 1

4 Project 1

Course Outcomes(CO):

1. Communicate/ express effectively in a range of settings. 2. Use etiquettes of communicating in intercultural environment and understand differences

in international communication. 3 Identify/ Recognize the barriers to effective communication in accordance with all types

of communication; avoid or overcome them. 4 Operate effectively on teams to accomplish goals by enhancing their professional and

inter-personal communication skills. 5 Employ etiquettes in oral and written communication.

Course ArticulationMatrix: Enter correlation levels 1, 2 or 3 as defined below: 1:Slight(Low) 2:Moderate (Medium) 3: Substantial(High)

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO 1

PSO 2

1 - - - - - - - - 3 3 1 2 2 1 2 - - - - - - - - 2 2 1 1 1 1 3 - - - - - - - - 3 3 2 1 - 1 4 - - - - - - - - 1 2 1 1 1 1

275

Course Catalog FOE UG Academic Year 2017-18 Page 1 of 3

5 - - - - - - - - 3 3 1 2 2 -

Parallel/Similar courses in the existingcurriculum: S.No. Name of the course Institute where it was offered

Sub SpecializationCommittee Name of Member




Signature

Name of the Expert:

Signature:

Date:

276


Faculty of Engineering Specialization: Applied Science (AS)

Course Code-070122120 (Semester I); 070122220 (Semester II) Course Name : Technical English and Communication

Skills (Lab) (UG/PG) : UG Number of Credits : 1 Level : 1 Subject Category: Applied Sciences

Pedagogy: 1. Dogme language teaching

2. All Language Skills Activity- based learning

3. Presentations

4. Reading Skills Tasks

5. Group Discussions

6 Language Aptitude Tests

7 Listening Skills Tasks

8 Personality Test

9 Speaking Skills Tasks

277


Course outline:

Sr. No. Topic Hours

1

Fundamentals of Communication

a. Manners and etiquettes incommunication b. Interpersonalcommunication c. Using audio-visual clips to enhance communicationskills d. Personalitytest

2

2

Listening Skills

a. Listening aptitudetests b. Listening basedactivities c. Listening to audio-visual clips and doing exercises based onit

2

3

Speaking Skills

a. conducting mock jobinterview b. Brain storming speaking on the assignedtopic c. Mind-mapping d. groupdiscussion e. presentationskills f. role-play g. publicspeaking h. debate i. extempore j. negotiationskills

5

4

Reading and Writing Skills

a. vocabulary building throughtests b. grammar aptitudetests c. Reading aptitude tests d. Reading based activities e. Summarywriting f. Precis writing g. Creative Writing and Critical Appreciation of any book as wellas

author’s writing style

6

Books Recommended:

Sr No

Author Book Title Publisher Details

1 M Ashraf Rizvi Effective Technical Tata McGraw Hill Publishing

278


Communication Company Ltd

2 E. H. McGrath Basic Managerial Skills for All

Eastern Economy Edition, Prentice Hall India

3 Krishna Mohan, Meera Banerji

Developing Communication Skills

McMillan India Ltd

4 Courtland L. Bovee, John V. Thill, Barbara E. Schatzman

Business Communication Today

Prentice Hall

5 Mary Ellen Guffey Essentials of Business Communication with Student CD-ROM

South-Western Educational

6 John Thill, Courtland L. Bovee

Excellence in Business Communication (6th

Edition)

Prentice Hall

Recommended EvaluationMethods:

Continuous Assessment End Semester Examination Sr No Components Nos. Components Nos. 1 Grammar Aptitude Tests 5 Viva Voce 1 2 Group Discussion 1

3 Debate 1

4 Listening Aptitude tests 2

5 Reading Aptitude tests 2

6 Vocabulary Building tests 2

7 Presentations 1

8 Vocabulary based activities 1

Course Outcomes(CO):

1. Express ideas and concepts well through vocabulary building, aptitude tests, mind mapping and brain storming.

2. Demonstrate linguistic competence- through accuracy in grammar, pronunciation and vocabulary.

3. Sketch their creative side in formal as well as informal communication 4. Employ etiquettes in oral and written communication.

279

Course Catalog-FOE-UG 2014-18 Page 5 of 3

5. Modify their listening skills.

6. Sketch their articulation while participating in Group discussions, debate or job interviews.

Course ArticulationMatrix: Enter correlation levels 1, 2 or 3 as defined below: 1:Slight(Low) 2:Moderate (Medium) 3: Substantial (High)

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO13 1 2 2 1 1

2 2 2 1 1 3 2 3 1 1

4 3 3 1 1

5 2 2 1 1

6 2 2 1 1

Parallel/Similar courses in the existingcurriculum: S.No. Name of the course Institute where it was offered

Sub SpecializationCommittee

Name of Member

Dr. Arundhati Warke Dr. Neha Divekar Dr. Dipika Jaspal

Dr. Meena Laad

Dr. Rupali Nagar

Designatio

n

Associate Professor Assistant Professor Associat e

Professo r

Associat e

Professo r

Assistant Professo

r

Org. / Inst. SIT SIT SIT SIT SIT

Signature

Name of the Expert:

Signature:

Date:

280



CourseName: AppliedBiology

(UG/PG): UG

Numberof Credits: 3

Level: 2

Learning Objectives

The students will be able to:

1. Discuss cell theory and outline structure ofcell. 2. Explain energy transduction incells. 3. Summarize applications of nanotechnology inbiology. 4. Discuss applications of biosensors andbiomaterials. 5. Explain medical applications of engineeringprinciples. 6. Outline common instruments used inbioengineering.

Pedagogy

1. Interactive classroomteaching 2. Demonstrations of medicalinstruments

Pre-requisites

None

Course outline

281


Sr. No. Topic Hours

1

Origin of life. Molecules of life- biomolecules. Cell as the unit of life. Development of cell theory. Cell types : prokaryotes and. eukaryotes; cell organelles, single cell to multi-cellular organism, tissue and organ level organization, organ systems .Structure of the cell membrane. Fluid mosaic model. Functions of plasma membrane; diffusion, osmosis, membrane transport through plasma membrane, ion channels and electrical properties

8

2

Energy Transduction and Bioenergetics. Mitochondria, ATP, Chemiosmosis, ATPase,Cell to cell junction-gap junctions. Ultra structure of Chloroplast, photosynthetic electron transport, Calvincycle Cell architecture, cyto-skeletal components, microtubules and microfilaments, motility and motor motions, actomyosin Genomics and proteomics

8

3

Evolution of biological machines- Optimization of biological machines at different levels molecular,cellular, organismal and populational; principles of generating diverse body plans and design in nature Biomaterials. Applications of nanotechnology in biology. Biosensors & their application

8

4

Bioengineering- genetic engineering, protein engineering, tissue engineering and biochemical engineering. Computational biology and bioinformatics

6

5

Biomechanics - fluid mechanics , examples in living world, aerodynamic, hydrodynamic and locomotion, mechanism of motion, friction and fracture. Application of biomechanics and biomaterials- Humanbody motion, use of prosthetics, rehabilitation application

8

6

Instrumentation in biology- spectroscopic methods, bioimaging using various techniques e.g. MRI, CT scan etc. Green environment- use of biotechnology in environmental engineering

7

Books Recommended 1. “Lehninger Principles of Biochemistry”, David L. Nelson, Michael M. Cox, 5th Edition,

PalgraveMacmillan 2. “Genes 8”,Benjamín Lewin, Pearson Prentice Hall,2004 3. “Molecular Biology of the Cell”, Bruce Alberts , Alexander Johnson , JulianLewis 4. “Textbook of Environmental Engineering”, P. VenugopalaRao 5. “Plant Physiology”, S. N. Pandey , BikasSinha

Research Papers/Articles recommended for reading Suggested Evaluation Methods

A) ContinuousAssessment 1. Essential

a) UnitTests b) Seminars c) Assignments


282


b) Miniproject B) End SemesterExamination

Written Exam Parallel/Similar courses in the existing curriculum

S.No. Name of the course Institute where it is offered


Nameof Member

Dr. Arundhati Warke

Designation HOD, Applied Sciences

Org. / Inst. SIT

Signature

Name of the Expert:

Signature:

Date:

283


Faculty of Engineering Specialization: Inter Institute Course (Law)

Course Name : Law for Engineers (UG/PG) : UG Number of Credits : 2 Level : 1 Subject Category : Inter Institute Course/ Mandatory Course

Learning Objective: 1. The objective of the course is to familiarize students (Prospective engineers) with

elementary knowledge of laws that would be of utility in their profession. 2. The syllabus covers Constitution of India and new areas of law like IPR, ADR, Human

Rights, Right to Information, Corporate law, Law relating Elections and Gender Studies. To be supplemented by the historical development of laws wherever required.

Pre-Requisites :None

Pedagogy:

1. Class room teaching 2. Assignments 3. Seminars / Presentations

Course outline:

Sr. No. Topic Hours

1

Module 1A: Constitutional Law covering the Preamble; Fundamental Rights, Judicial Activism including Equality and Social Justice, Life and Personal Liberty and Secularism and Religious freedoms; Directive principles of State policy; Fundamental Duties; Emergency provisions – kinds, legal requirements and legal effects;

Module 1B: Human Rights and Public International Law covering Human Rights in International Law-Theoretical foundation, human rights and international law; Historical development of human rights; Human Rights in Indian tradition and Western tradition; Covenant on Civil & Political Rights 1966 including Optional

6

284


Protocol – I (Individual Complaint Mechanism) & Optional Protocol – II (Abolition of Death Penalty); Covenant on Economic, Social and Cultural Rights 1966 including Optional Protocol – I (2002); UN Mechanism and specialized agencies, (UNICEF, UNESCO, WHO, ILO, FAO, etc.); International NGOs – Amnesty International, Human Rights Watch, Greenpeace Foundation; Enforcement of Human Rights in India including Supreme Court, High Courts, Statutory Commissions – NHRC, NCW, NCM, NC-SCST etc. Public International Law, covering Introduction, Customs, Treaties, State territories including Recognition of States and governments, Law & Practice of Treaties and Law of Sea;

2

Module 2A: General Principles of Contract under Indian Contract Act, 1872 covering General principles of contract – Sec. 1 to 75 of Indian Contract Act and including Government. As contracting party, Kinds of government contracts and dispute settlement, Standard form contracts; nature, advantages, unilateral character, principles of protection against possibility of exploitation, judicial approach to such contracts, exemption clauses, clash between two standard form contracts; Module 2B:Arbitration, Conciliation and ADR system covering Arbitration – meaning, scope and types – distinction between law of 1940 and 1996; UNCITRAL model law – Arbitration and expert determination; Extent of judicial intervention; International commercial arbitration; Arbitration agreements – essential and kinds, validity, reference and interim measures by court; Arbitration tribunal – appointment, challenge, jurisdiction of arbitral tribunal, powers, ground of challenge, procedure and court assistance; Award including Form and content, Grounds for setting aside an award, Enforcement, Appeal and Revision; Enforcement of foreign awards – New York Convention Awards and Geneva Convention Awards; Distinction between conciliation, negotiation, mediation and arbitration, confidentiality, resort to judicial proceedings, costs;

6

3

Module 3A: Law relating to Intellectual property covering Introduction – meaning of intellectual property, main forms of IP, Copyright, Trademarks, Patents and Designs, Secrets; Other new forms such as plant varieties and geographical indications; International instruments on IP – Berne convention, Rome convention, TRIPS, Paris convention and international organizations relating IPRs, WIPO, WTO etc; Law relating to Copyright in India including Historical evolution of Copy Rights Act, 1957, Meaning of copyright – literary, dramatics and musical works, sound records and cinematographic films, computer programs, Ownership of copyrights and assignment, Criteria of infringement, Piracy in Internet – Remedies and procedures in India; Law relating to Trademarks under Trademark Act, 1999 including Rationale of protection of trademarks as Commercial aspect and Consumer rights, Trademarks, registration, procedures, Distinction between trademark and property mark, Doctrine of deceptive similarity, Passing off an infringement and remedies; Law relating to Patents under Patents Act, 1970 including Concept and historical perspective of patents

6

285


Books Recommended: 1. M.P. Jain (2005), Indian Constitutional Law, Wadhwa &Co. 2. M.P. Singh (1998), Constitutional Law of India, Eastern BookCo.

law in India, Patentable inventions with special reference to biotechnology products, Patent protection for computer programs, Process of obtaining patent – application, examination, opposition and sealing of patents, Patent cooperation treaty and grounds for opposition, Rights and obligations of patentee, Duration of patents – law and policy considerations, Infringement and related remedies;

Module 3B: Right to Information Act, 2005 covering, Evolution and concept; Practice and procedures; Official Secret Act, 1923; Indian Evidence Act, 1872; Information Technology – legislation and procedures, Cyber crimes – issues and investigations;

4

Module 4A: Labour Laws, covering Industrial Disputes Act, 1947; Collective bargaining; Industrial Employment ( Standing Orders) Act, 1946; Workmen‟s Compensation Act, 1923;

Module 4B: Corporate Law, covering Meaning of corporation; Law relating to companies, public and private (Companies Act, 1956) general provisions; Law and multinational companies – International norms for control, FEMA 1999, collaboration agreements for technology transfer; Corporate liability, civil and criminal;

Module 4C: Election provisions under Indian Constitution (Art.324–329), covering Representation of Peoples Act and Prevention of Corruption Act, 1988; Superintendence, directions and control of elections to be vested in Election Commission; Prohibition as to ineligibility for inclusion in electoral roll on ground of religion, race, caste or sex; Election to the house of people and to the legislative assemblies of States to be on the basis of adult suffrage; Power of parliament to make provisions with respect to elections to legislatures; Power of legislature of State to make provisions with respect to elections to such legislature; Bar to interference by courts in electoral matters; Offences relating to elections under IPC 1860 (Sec.171-A to 171-I), Definition – candidate electoral rights, Bribery, undue influence and impersonation at elections and punishments, False statement in connection with election, Illegal payment in connection with election, Failure to keep election accounts;

8

5

Module 5: Gender Studies, covering Meaning of gender, international perspective and national perspective; Laws relating women in India; Judicial approach and responses- Vishaka V/s State of Rajasthan 1997 SC; Rights enforcement mechanism in India; Landmark judicial decisions of Supreme Court relating to women;

4

286


3. P.M. Bakshi (2003), Constitution of India, Universal Law PublishingCo.

Publications

1. H.M. Seervai (1993), Constitutional Law of India, Tripathi Publications Constituent Assembly Debates (1989), Vol.1 -12

2. Agarwal H.O.(2008), International Law and Human Rights, Central LawPublications 3. S.K. Awasthi & R.P. Kataria(2006), Law relating to Protection of Human Rights,

Orient Publishing 4. S.K. Kapur(2001), Human Rights under International Law and Indian Law,

CentralLaw Agency 5. Meena Rao (2006), Fundamental concepts in Law of Contract, 3rd

Edn.Professional Offset 6. Neelima Chandiramani (2000),The Law of Contract: An Outline, 2nd

Edn.Avinash PublicationsMum 7. Avtar singh(2002), Law of Contract, Eastern BookCo. 8. Dutt(1994), Indian Contract Act, Eastern LawHouse 9. Anson W.R.(1979), Law of Contract, Oxford University Press 10. Kwatra G.K.(2005), The Arbitration & Conciliation of Law in India with case

lawon UNCITRAL 11. Model Law on Arbitration, Indian Council ofArbitration 12. Avtarsingh (2005), Law of Arbitration and Conciliation, Eastern BookCo. 13. Cornish W. R. (2008), Intellectual Property Rights, Patents, Trademarks,

Copyrights & Allied Rights, Sweet &Maxwell 14. Wadhera (2004), Intellectual Property Rights, Universal Law PublishingCo. 15. P. S. Narayan (2000), Intellectual Property Rights, Gogia LawAgency 16. T. Ramappa (2010), Intellectual Property Rights Law in India, Asia LawHouse 17. Bare text (2005), Right to InformationAct 18. O.P. Malhotra, Law of Industrial Disputes, N.M. TripathiPublishers 19. K.M. Desai(1946), The Industrial Employment (Standing Orders) Act 20. Rustamji R.F.,Introduction to the Law of Industrial Disputes, Asia PublishingHouse 21. Avtarsingh (2007), Company Law, Eastern BookCo. 22. R.R. Pennington, Company Law, ButterworthPublications 23. Sethna, Indian Company Law 24. Ratanlal & Dhirajlal,(1994), Indian Penal Code, ButterworthPublications 25. B.M. Gandhi, (1990), Indian Penal Code, EasternPublishers 26. P.S. Achuthan Pillai(1995), Criminal Law, EasternPublishers 27. K.D. Gaur(2002),A Text book on IPC, Deep & DeepPublications 28. Agnes Flavia(1999), Law and Gender Inequality - The Politics of Women‟s Rights

in India, OUPress 29. Shobha Saxena, Crimes against Women and Protective Laws, Deep &

DeepPublications 30. Diwan Paras & Diwan Peeyashi(1994), Women and Legal Protection, Deep &Deep


287


Sr No

Author Paper/Article Title Publisher Details

1 - - -

Recommended Evaluation Methods: Suggested Evaluation Methods

A. ContinuousAssessment 1. Essential

a. Unit Tests(2) 2. Optional

a. Assignments(3) b. Seminars / Presentations(1) c. Mini Project(1)

B. End Semester Examination: NA

Parallel/Similar courses in the existing curriculum: S.No. Name of the course Institute where it was offered

Sub SpecializationCommittee Name of Member

Designation

Org. / Inst.

Signature

Name of the Expert:

288



Specialization: Inter Institute Course (Law)

Course Name : Economics for Engineers (UG/PG) : UG Number of Credits : 2 Level : 1 Subject Category : Inter Institute Course/ Mandatory Course

Learning Objective: 1. The objective of this course is to familiarize the prospective engineers with elementary

principles of economics 2. It also deals with acquainting the students with standard concepts and tools that they

are likely to find useful in their profession when employed in the irm/industry/corporation in public or private sector.

3. It also seeks to create and awareness about the status of the current economic parameters /indicators/ policy debates.

4. All of this is a part of the quest to help the students imbibe soft skills that will enhance their employability

Pre-Requisites : None

Pedagogy :

1. Class room teaching 2. Assignments 3. Seminars / Presentations

Course outline :

Sr. No. Topic Hours

1

Module 1: Basic Principles and Methodology of Economics. Demand/Supply – elasticity –Government Policies and Application. Theory of the Firm and Market Structure. Basic Macroeconomic Concepts (including GDP/GNP/NI/Disposable Income) and Identities for both closed and open economies. Aggregate demand and Supply (IS/LM). Price Indices (WPI/CPI), Interest rates, Direct and Indirect Taxes.

8

2 Module 2: Public Sector Economics –Welfare, Externalities, Labour Market.Components of Monetary and Financial System, Central Bank –Monetary

8

289


Aggregates; Commercial Banks & their functions; Capital and Debt Markets. Monetary and Fiscal Policy Tools & their impact on the economy – Inflation and Phillips Curve.

3

Module 3: Elements of Business/Managerial Economics and forms of organizations. Cost & Cost Control –Techniques, Types of Costs, Budgets, Break even Analysis, Capital Budgeting, Application of Linear Programming. Investment Analysis – NPV, ROI, IRR, Payback Period, Depreciation, Time value of money. Business Forecasting – Elementary techniques. Statements –Cash flow, Financial. Case Study Method.

8

4

Module 4: Indian economy Brief overview of post independence period – plans. Post reform Growth, Structure of productive activity. Issues of Inclusion – Sectors, States/Regions, Groups of people (M/F), Urbanization. Employment–Informal, Organized, Unorganized, Public, Private. Challenges and Policy Debates in Monetary, Fiscal, Social, External sectors.

6

Books Recommended : 1. Mankiw Gregory N.(2002), Principles of Economics, Thompson Asia 2. V. Mote, S. Paul, G. Gupta(2004), Managerial Economics, Tata McGraw Hill 3. Misra, S.K. and Puri (2009), Indian Economy, Himalaya 4. Pareek Saroj (2003), Textbook of Business Economics, Sunrise Publishers

Research Papers/Articles recommended for reading :

Sr No

Author Paper/Article Title Publisher Details

1 - - - Recommended Evaluation Methods:

Suggested Evaluation Methods E. Continuous Assessment

5. Essential 4. Unit Tests (2)

6. Optional g. Assignments(3) h. Seminars / Presentations (1) i. Mini Project (1)

F. End Semester Examination : NA Parallel/Similar courses in the existing curriculum:

S.No. Name of the course Institute where it was offered Sub Specialization Committee

Name of Member

290


Designation

Org. / Inst.

Signature

Name of the Expert: Date:

Signature:

291


SYMBIOSIS INTERNATIONAL (DEEMED UNIVERSITY)

(Established under section 3 of the UGC Act 1956) Re - accredited by NAAC with ‘A’ Grade

Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India) ___________________________________________________________________________

Sub Committee - Specialization for Curriculum Development Undergraduate

Course Name: My Nutrition Guide Course code: 070124114 (UG/PG): UG Number of Credits: 2 Level: 1

Learning Objective(s): The students will be able 1. Tocontribute towards nutritionliteracy among undergraduate students of Symbiosis International University 2. To imbibe essential tenets of basicnutrition relevant to student lifeto promote healthy living

Pedagogy: 1. Interactive Classroom sessions using PowerPoint presentations 2. Group Work and Discussions 3. Video Films related with diet 4. Webinars/ Recorded Video sessions by Nutrition experts 5. Role Plays 6. Case studies 7. Quiz ( Students prepare a topic from home) 8. Practical demonstration of food preparation

Pre-learning: Students from any disciplines may take up the course. Course Outline

292


S. No. Hours

UNIT 1

Essentials of Foods and Nutrition a. Overview on need of Nutrition Awareness and Education

b. Concept of Human Body and Functions of Food , Food groups , Food Guide Pyramid, Recommended Dietary Allowances

c. Meal management - Meal Pattern, Serving size and Portion Size, Concept of

Balanced Diet d. Basics of Food and Nutrients

- Macro (Carbohydrates, Proteins and Fats )and Micro Nutrients - (Vitamins and Minerals) present in Foods - Energy giving Food, Body Building Foods, Protective Foods - Antioxidants in Foods - Indian Traditional Foods vs Western Diet - Making Healthier Food Choices - Overview on Alternative Medicine (Ayurveda etc) and Nutrition

Science

10

UNIT 2

Nutrition and Modern Living - Overview of Lifestyle disorders associated with Nutrition - Obesity,Diabetes,Heart diseases, Metabolic Syndrome,PCOD

and related disorders - Common health issues of youngsters – Skin problems, PMS,

Hair Loss etc - Common Nutrition Deficiencies in Youngsters - Alcohol, Smoking, Drugs

10

UNIT 3

Lifestyle Modification Fundamentals - Sedentary Lifestyle and its consequences - Importance of Physical Activity, - Stress management and healthy living - Role of sleep, health consequences of sleep deficiency - Basic Behavior change strategies

6

UNIT 4

Food Fads and Fallacies - Food related Myths and Fads - Concept of Junk foods and its effect on body - Reading Nutrition Label

2

UNIT 5

Basic Food safety and Food Hygiene -World food problems - Food safety education

2

Books Recommended:

1. Srilakshmi B. (2003):Dietetics, New Age International Private Ltd., New Delhi. 2. Srilakshmi B. (2003):Food Science, New Age International Private Ltd., New Delhi. 3. Brown Judith, Nutrition through the Lifecycle. Cenage learning, USA 4. Shils, M.E.; Olson, J.; Shike, M. and Roos, C. (1998): Modern Nutrition in Health

andDisease. 9th edition, Williams and Williams, London. 5. Indian Council of Medical Research. Recommended Dietary Intakes for Indians – Latest

Recommendations

293


6. .Anjana Agarwal , S Udipi, Human Nutrition(2014)

Parallel/Similar courses offered with the existing curriculum: S.No. Name of the course Institute where it was offered 1. Introduction to Foods and

Nutrition : Healthy Living(For Non Nutrition Students)

University of Western Ontario, located in London, Ontario and Canada

2. Nutrition for Living(For Non Nutrition Students)

University of Prince Edward Island(UPEI), Canada

Suggested Assessment Plan S. No Evaluation

Component Weightage (%)

Learning Outcome (LO) Evaluated

1 Quiz Competition 10 To contribute towards nutrition literacy among undergraduate students of Symbiosis International University

2 Debate and Group discussion 20

To contribute towards nutrition literacy among undergraduate students of Symbiosis International University

3 Field Activity 40 To imbibe essential tenets of basic nutrition relevant to student life to promote healthy living

4 Presentation and assignment

30 To imbibe essential tenets of basic nutrition relevant to student life to promote healthy living

References:

1) "World leaders adopt Sustainable Development Goals". United Nations Development Programme. Retrieved 25 September 2015

2) Adolescents and youth in India highlights from census 2011 ppt http://www.censusindia.gov.in accessed on 23rd June 2015

3) Contento IR, Randell JS, Basch CE. Review and analysis of evaluation measures used in nutrition education intervention research. J Nutr Educ Behav. 2002;34(1):2–25

4) Campbell KL, Ash S, Bauer JD. The impact of nutrition intervention on quality of life in pre-dialysis chronic kidney disease patients. Clin Nutr. 2008;27(4):537

5) National Youth Policy 2014 www.odisha.gov.in/portal/LIWPL/event_archive/ Events_Archives/32National_Youth_Day.pdf accessed on 20th May 2016

6) White S, Park YS, Isreal T, Cordero ED. Longitudinal evaluation of peer health education on a college campus: Impact on health behaviors. J Am Coll Health. 2009;57(5):497–505.

7) You JS, Sung MJ, Chang KJ. Evaluation of 8-week body weight control program including sea tangle (Laminaria japonica) supplementation in Korean female college students. Nutr Res Prac. 2009;3(4):307–314. ( PMC article )

8) Schnoll R, Zimmerman BJ. Self-regulation training addresses dietary self efficacy and dietary fibre consumptionJ Am Diet Assoc. 2001;101:1006-1011

294


9) Ha EJ, Caine-Bish N, Holloman C, Lowry-Gordon K. Evaluation of effectiveness of class-based nutrition intervention on changes in soft drink and milk consumption among young adults. J Nutr.2009;8:50.

Parallel/Similar courses in the existing curriculum: S.No. Name of the course Institute where it was offered Course outcomes CO1: Describe essentials of food and nutrition CO2: Explain lifestyle disorder associated with Nutrition. CO3: Explain importance of physical activities and healthy living. CO4: Understand basic food safety and hygiene. Course Articulation Matrix: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High) PO1 PO2 PO3 PO4 PO5 P06 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 1 - - - - - 3 - - - - -

CO2 3 2 1 - - - - - 3 - - - - -

CO3 2 2 - --- - - - - 3 - - - - --

CO4 3 2 2 - - - - - 3 - - - - -

Sub Specialization Committee Name of Member Dr. Arundhati Warke

Designation Professor & Head, Applied Science Department

Org. / Inst. SIT

Signature

Name of the Dean:

295


(Established under section 3 of the UGC Act 1956, by notification

No.F.9-12/2001-U3 Government of India) Accredited by NAAC with ‘A’ Grade


_________________________________________________________ Sub Committee Engineering – Computer Science/Information Technology

for Curriculum Development

Course Title: C Programming Course Code: Number of Credits :2 Level :1 Learning Outcome (s): The students are able to: 1. Understand the basic concepts of C Programming for problem-solving. 2. Illustrate the C data types, syntax and constructs. 3. Illustrate C for decision making, branching and looping statements. 4. Understand the concept of Array and Strings to solve different problems. 5. Apply the concepts of Function modules, its usage and memory allocation using Pointers. 6. Understand the concepts of structures and unions: declaration, initialization and implementation. Course Outline S.No. Topic Hours

1 Programming Concepts History of C, Middle level language, compiler, interpreter, character set, pseudo code, Algorithms, constants, variables , keywords, data types, operators and expressions, input / output operations, C Pre-processor and Macros, decision making, branching and looping statements.

6

2 Arrays and Strings Arrays: introduction, one dimensional array and two dimensional arrays: declaration, initialization, programs using arrays. Strings: introduction, declaration, initialization and read/ write operations of strings, string operations.

6

3 Functions Introduction, function definition and declaration, arguments and parameters, local variables and global variables, parameter passing mechanisms: call by value and call by reference, recursion and storage classes.

6

296


4 Structures and Unions Introduction, structure definition, declaration and initialization, operations on structure variables, arrays of structures, nested structures, structure pointers

6

5 Pointers Introduction, declaration and initialization of pointer variables, dynamic memory allocation functions.

6

Pedagogy

1. Classroom teaching 2. Worksheets 3. Class tests/quiz

Books Recommended 1. “Let Us C”, Yashvant Kanetkar, 12th Edition, 2012, BPB Publications 2. “Programming in ANSI C”, E. Balagurusamy, Sixth Edition, 2013, McGraw-Hill

Education. 3. “The C Programming Language”, Kernighan, Ritchie, Prentice Hall of India.


a) Unit Tests b) Quizzes



S. No.


1 Computer Programming SPPU,Pune 2. Programming Principles Anna University, Chennai

Name of Member

Prof.Shilpa Gite Prof.Dipti Kapoor Sarmah

Designation Asst.Prof. Asst.Prof.


Signature

Name of Experts Dnaneshwar Suryavanshi

Designation Sr. Tech.Leader

Org. / Inst. Persistent Technologies

Signature


297







Course Title: C Programming Lab Course Code: Number of Credits : 2 Level : 1 Learning Outcome (s): The students are able to: 1 Understand the programming in IDE (Integrated Development Environment)

and write, execute and debug simple programs. 2 Interpret the programming tasks logically and understand making the pseudo-

code and flowchart. 3 Design and implement basic programming solutions including statements,

macros, control structures and methods. 4 Understand and apply the concept of Array and Strings to solve problem

statement. 5 Understand the concepts of Function modules, its usage and memory

allocation using Pointers 6 Understand and apply the concepts of structures and unions: declaration,

initialization and implementation. 7 Identify computational problems, classify tasks and execute it in a group as a

mini-project. Course Outline S.No. Topic Hours

1 Design and develop a flowchart or an algorithm that takes three coefficients a,b and c of a quadratic equation (ax2+bx+c=0) as input and compute all possible roots. Implement a C program for the developed flowchart/algorithm and execute the same to output the possible roots for a given set of coefficients with appropriate messages.

2

2 Write a C program to calculate an area of a circle using #define pre-processor (macro).

2

298


3 Write a C program to find the roots of a quadratic equation. 2 4 Write a C Program to relate two integers using =, > or < using

nested ifs & multiple ifs. 2

5 Write a C program to find whether (using switch case) (a) A given number is prime or composite. (b) A given number is even or odd.

6 Write a C program to generate the Fibonacci Series for a given number ‘n’.

2

7 Write a C program to compute the factorial of a given number: ‘n’.

2

8 Write a C program to reverse a given integer. 2 9 Write a C program of linear search for a user-given element in a

set of ‘n’ numbers. 2

10 Write a C program of binary search for a user-given element in a set of ‘n’ numbers.

2

11 Write a program to perform various operations such as union and intersection on the given sets.

2


2

13 Write a C program to accept a string from console and to display the following on console (without using built-in functions): (a) Length of the string (b) Total number of characters in the string (c) Total number of vowels in the string (d) Copy one string into the other.

2

14 Write a C program to accept a string from console and to display the following on console (without using built-in functions): (a) Reverse of the string. (b) Whether the string is a palindrome. (c) Compare the strings: equal/not equal (d) Find the longer string.

2

15 Write a C program using functions to accept two strings from the console and perform the following operations (without using built-in functions): (a) Compare the strings: equal/not equal (b) Find the longer string. (c) Concatenate the two strings. (d) Find occurrence of substring in the main string

2


2

17 Write a C program of bubble sorting using functions. 2 18 Write a C program of selection sorting using functions. 2 19 Write a C program to find the factorial of a number using

recursion. 2

20 Write a C program using structures to print the pay slip of an employee after accepting details like id. no, name, designation, department and basic salary.

2

299


21 Write a C program to implement nesting of structures, structure pointers.

2

22 Write a C program using pointers to accept two one-dimensional arrays, find the sum of the corresponding elements, store the sum in a third array and finally print the resultant array. Use Dynamic Memory Allocation.

2

23 Mini-Project 6 Pedagogy

1. Class room teaching 2. Practical using tools like Dev C++, Turbo C 3. Conceptual execution in Mini-Projects




d) Assignments e) Quizzes f) Mini Project g) Presentation

B) End Semester Examination a) Practical Exam


S. No.



Name of Member

Prof.Shilpa Gite Prof.Dipti Sarmah



Signature




Signature Signature of Dean: Date:

300



Specialization: Computer Science (CS)

Course Name : Computational Thinking and Problem Solving (070122208)

(UG/PG) : UG


Level : 2

Subject category Computer science(CS)

Learning Outcomes: The students are able to:

1. Understand and develop Computation Thinking concepts 2. Define a problem and devise technical solution(s) 3. Describe various computational techniques for problem solving 4. Understand basic Python Programming, functions, patterns, algorithmic constructs etc.

Pedagogy:

1. Class room teaching 2. Practical Assignments / Case Studies

Course outline :

Sr. No. Topic Hours

1

Introduction of Computation Thinking: Objectives and outcomes of Computational Thinking, How is Computational Thinking used, Concepts of logical Thinking and Algorithms, Objectives of Problem Solving, Defining a problem, devising solutions.

10

2

Computational Tools and Methods Introduction to Decomposition, patterns and generalization, abstraction and modelling, introduction to the terms testing and debugging, evaluation of solution.

10

3

Basic Programming Tools Introduction to Python, basic operations, functions, comments, basic algorithm constructs, programs, introduction to tkinter, modules, built-in types, abstraction, patterns / readymade patterns, introduction to entities, relationships and processes.

10

Books Recommended:

301


Karl Beecher,“Computational Thinking: The Beginners Guide To Problem solving & Programming”, Publisher: BCS, The Chartered Institute for IT (11 August 2017). Recommended Evaluation Methods: Suggested Evaluation Methods

G. Continuous Assessment 7. Essential

5. Unit Tests 6. Assignments / Case studies

H. End Semester Examination 3. Written Exam

Parallel/Similar courses in the existing curriculum: S.No. Name of the course Institute where it was offered 1 Introduction to Computational Thinking and Data Science MIT, USA

2 Computational Thinking University of Southampton, UK 3 Computational Thinking and Problem Solving Amrita School of Engineering,

Coimbatore Sub Specialization Committee

Name of Member

Dr. Shraddha Phansalkar Dr. Swati Ahirrao

Designation Associate Professor Associate Professor


Signature

Name of the Expert: Er. Vivek Gavane Signature: Date:

302





___________________________________________________________ Sub Committee - Specialization for Curriculum Development

Under Graduate

Course Title: Discrete Mathematics and Probability Theory Course Code: Number of Credits:4 Level: 3 Learning Outcome (s):

1. Apply the concept of Venn Diagram to solve problems. 2. Describe the use of formal logic proofs and logical reasoning to solve

problems. 3. Summarize the characteristics of relations. 4. Review the basics concepts of groups and rings. 5. Explain the concepts of permutation, combination and discrete probability. 6. Construct a probability distribution for a random variable and a continuous

variable. 7. Compute probabilities using probability distributions such as Binomial, Poisson

and Normal distributions.

Pre-learning: XII standard Mathematics Course Outline: S.No. Topic Hours

1 Set Theory: Sets, combination of sets, Venn Diagram, finite sets, infinite sets, cardinality, principle of inclusion and exclusion

10

2 Logic and Proofs : Prepositions, conditional propositions, logical connectivity, quantifiers, proof by contradiction and induction, the stable marriage problem

10

3 Modular Arithmetic: Relation, binary relation, equivalence relation, recurrence relation POSET, pigeonhole principle, congruence relation,

15

303


Euclid’s Algorithm, multiplicative inverse, Concept of group, ring and field

4 Basic of probability: Combinatorics and combinatorial proof, probability space and events, addition and multiplication theorem, conditional probability , Bayes ‘theorem

10

5 Probability distribution: Random variables, discrete probability distribution: binomial and Poisson distribution; continuous probability distribution: normal distribution, uniform and exponential distribution, joint probability distribution

15

Pedagogy

4. Interactive sessions 5. Class room teaching 6. Tutorials 7. Assignment

Books Recommended

1. “Elements of Discrete Mathematics”, C. LIU, 2nd Edition, Tata McGraw-Hill, 2002, ISBN 0-07-043476-X.

2. “Discrete Mathematics”, R. Johnsonbaugh, 5th Edition, Pearson Education, 2001 ISBN 81 – 7808 – 279 – 9.

3. “Graph theory with application to Engineering and Computer Science”, N. Deo, Prentice Hall of India, 1990, 0 – 87692 – 145 – 4.

4. “Discrete Mathematical Structures”, B. Kolman, R. Busby and S. Ross, 4th Edition, Pearson Education, 2002, ISBN 81-7808-556-9.

5. “Schaum’s Outline of Probability, Random Variables, and Random Processes”, Hwei Hsu, 3rd Edition, Tata McGraw-Hill, 2014, ISBN 978-0-07-182298-5.

6. “Probability and Statistics” by S. C.P. Gupta and Kapoor, S. Chand Publication

7. “Probability” by Lipschitz, Schaum outline series, Mc.Graw hill Publication.


A) Continuous Assessment 1) Unit Test 2) Tutorials 3) Assignments 4) Quizzes/ mcq


Written Exam Benchmarked against similar courses in other national/ international universities /organizations

S. No.


1 Discrete Mathematics and Probability Theory

University of California, Berkeley

2. Introduction to Discrete Mathematics University of California, San

304


for Computer Science Specialization Diego, Higher School of Economics

3. Discrete Mathematical Structures IIT, Madras

Name of Members

Dr. Arundhati Warke

Dr. Himanshu Agrawal


Designation Professor Associate Professor Associate Professor


Signature

Sub-specialization committee Name of Member

Designation

Org. / Inst.


305



Course Name: Data Base Management Systems (UG/PG): UG Number of Credits: 4 Level: 2 Learning Objectives The students will be able to:

1. Describe database system and its components. 2. Identify various database architectures and applications. 3. Recognize the advantages and disadvantages of the different data models. 4. Distinguish relational model with the Structured Query Language (SQL). 5. Discuss the constraints and controversies associated with relational database model. 6. Identify database analysis and design techniques. 7. Describe transaction processing, concurrency control and recovery. 8. Explain some of the basic issues of object-oriented databases.

Pedagogy

1. Classroom teaching 2. Brainstorming session 3. Seminars

Pre-requisites

None

306



1.

Introduction to DBMS DBMS basic concepts, advantages of a DBMS over file-processing systems, data abstraction, database languages, data models and data independence, components of a DBMS and overall structure of a DBMS, multi-user DBMS architecture, data modeling: basic concepts, entity, attributes, relationships, constraints, keys, E-R and EER diagrams: components of E-R model, conventions, converting E-R diagram into tables, EER model components, converting EER diagram into tables, relational model: basic concepts, attributes and domains, Codd's rules, relational integrity: nulls, entity, referential integrities, enterprise constraints, views, schema diagram.

10

2.

Relational query languages Relational algebra and relational calculus: tuple relational and domain relational calculus, introduction to SQL: characteristics and advantages, SQL data types, SQL languages: DDL, DML, DQL, DCL, SQL DDL queries: creating, modifying, dropping tables, SQL DML queries: inserting, updating and deleting data, SQL DQL query: SELECT query and clauses, SQL operators, predicates and joins, SQL functions: aggregate functions, date function, nested queries, concept of functions, stored procedures and triggers, introduction to QBE and QUEL, views: creating, dropping, updating, indexes, programmatic SQL: embedded SQL, dynamic SQL, ODBC.

10

3.

Database analysis and design techniques Information systems lifecycle, application lifecycle, planning, system definition, requirement analysis, design, DBMS selection and application design: transaction and user-interface design, prototyping, implementation, data conversion and loading, testing, data and database administration, relational database design: purpose of normalization, data redundancy and update anomalies, functional dependencies, the process of normalization: 1NF, 2NF, 3NF, 4NF, 5NF and BCNF.

10

4.

Storage and file systems Secondary storage, RAID, file organization, indices, static and dynamic hashing, B-trees and B+ Trees, introduction to query processing: overview, measures of query cost, selection and join operations, evaluation of expressions, introduction to query optimization, estimation, transformation of relational expressions.

10

5.

Transaction management Basic concept of a transaction, properties of transactions, database architecture, concept of schedule, serial schedule, serializability: conflict and view, cascaded aborts, recoverable and non-recoverable schedules, concurrency control: need, locking methods, deadlocks, times stamping methods, optimistic techniques, multi-version concurrency control, different crash recovery methods such as shadow-paging and log-based recovery: deferred and immediate, checkpoints.

11

6.

Object-oriented databases Need of OODBMS, storing objects in relational database, introduction to object oriented data models, persistent programming languages, persistence, object management group, object database standard ODMG ,database architectures: centralized and client – server architectures, introduction to distributed database.

9

307


Books Recommended 1. "Database System Concepts", Silberschatz A., Korth H., Sudarshan S., 6th Edition, 2010,

McGraw Hill. 2. "Database Systems", Connally T., Begg C., 3rd Edition, 2004, Pearson Education. 3. "Database Systems Design, Implementation and Management", Rab P. Coronel C., 5th Edition,

Thomson. 4. "Fundamentals of Database Systems", Elmasri R., Navathe S., 6th Edition, 2010, Pearson

Education. 5. "An Introduction to Database Systems", Date C., 7th Edition, 2000, Pearson Education. 6. “MySQL Administrator’s Bible”, Sheeri K. Cabral and Keith Murphy, O'Reilly Media.

Research Papers/Articles recommended for reading 1. Ma H., “An Approach on Grid Services Transaction Management for Grid Overflow”, ICIECS,

2009. 2. Ma H. and Z.M., “Object Comparison in Fuzzy object-oriented databases”, ICIS, 2009. 3. Gupta S., Saroha K. and Bhawna ,”Fundamental Research of Distributed Database”,IJCSMS




h) Unit Test i) Seminars j) Assignments

2. Optional c) Quizzes d) Mini Project

B) End Semester Examination a) Written Exam Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Sub-specialization committee







Signature Name of the Expert: Signature: Date:

308





_________________________________________________________ Faculty of Engineering–Computer Science and IT

Curriculum Development Under Graduate

Course Title: Distributed Systems and Resource Management Course Code: Number of Credits : 3 Level : 3 Learning Objective/Outcome (s): The students will be able to:

1. Sketch the architecture of the multicomputer models and solve different design issues.

2. Implement the clock synchronization algorithms in distributed system.

3. Execute the deadlock detection techniques for the different resource and communication model.

4. Use the recovery techniques of the single processor system, solve the recovery problems in distributed environment.

5. Execute the shared memory solutions to build a coherent system in distributed environment.

6. Demonstrate the working of distributed file system with HDFS. Pre-learning: Knowledge of Operating System and database fundamentals are desirable Course Outline S.No. Topic Hours

1 Introduction Introduction to distributed systems, distributed computing system models, design issues, communication primitives.

5

2 Synchronization Time and global states: clock synchronization, logical clocks,

10

309


global state, co-ordination, election algorithms, mutual exclusion algorithms

3 Distributed deadlock Detection Deadlock handling strategies in distributed system, issues in deadlock detection and resolution, centralized deadlock detection algorithm, Ho Ramamurthy algorithm, distributed deadlock detection algorithms, hierarchical deadlock detection algorithm

10

4 Recovery and fault tolerance Failures and their classification, check points, recovery in distributed databases, process resilience, reliable client server communication, reliable group communication, distributed commit and recovery.

10

5 Distributed shared memory Architecture, design issues, algorithms for implementing DSM, coherence protocol, case studies: IVY

5

6 Distributed File Systems Distributed file systems, Issues: name services: name entities, locating mobile entities, removing unreferenced entities, replication, update protocols, scalability, organization. Case studies: DNS directory, global name service, X 500 DS

5

Pedagogy 1. Classroom teaching 2. Seminars

Books Recommended 1. “Advanced Concepts in Operating System”, Mukesh Singhal, Shivratri, Tata

McGraw Hill. 2. “Distributed Operating Systems Concepts and Design” Pradeep K. Sinha, PHI. 3. 3. Distributed Systems: Principles and Paradigms", Andrew S. Tanenbaum &

Maarten van Steen, PHI


c) Unit Tests d) Seminars e) Quizzes



S. No.


1 Distributed Systems IIT, Kharagpur 2. Distributed Systems Carnegie Mellon

University(CMU) 3. Parallel and Distributed Computing Thapar University, Patiala


310


Name of Member


Dr. Preeti Mulay

Rutuja Kadam





Signature

Name of Experts Mr. Vivek Gavhane

Designation Scientist

Org. / Inst. CDAC, Pune

Signature


311



Course Name: Object Oriented Analysis and Design (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objectives The students will be able to:

1. Analyze Unified Modeling Language 2.0 and overview of its diagrams as a modeling tool for large and complex systems.

2. Illustrate different diagrams used in Object Oriented Analysis like Use Case Diagram. 3. Identify dynamic behavior of the system using Interaction Diagrams. 4. Model State Diagrams which gives abstract description and behavior of a system. 5. Illustrate UML design for the creation of an application system using forward and Reverse

engineering methods.

Pedagogy 1. Interactive classroom teaching and discussions 2. Brainstorming sessions 3. Projects 4. Seminars

Pre-requisites

None

312


Course Outline

Books Recommended 1. "Unified Modeling Language User Guide", Grady Booch, James Rumbaugh, Ivar Jacobson, the

1stEdition, and (Addison-Wesley Object Technology Series),First Edition, ISBN: 0-201-57168-4, 1998.

2. "UML Distilled: A Brief Guide to the Standard Object Modeling Language", Martin Fowler, , Third Edition,Addision Wesley, 2004.


1. Monarchi, D.E., and Puhr, G.I. (1992). A Research Typology for Object-Oriented Analysis and Design. Communications of the ACM, Vol. 35, No. 9, pp. 35-47.

2. Cackowski, David. Object analysis in organizational design: A solution for matrix organizations; Project Management Journal, Sylva; Sep 2000; Vol. 31, Iss. 3; pg. 44, 8 pgs

3. Apicella, Mario. UML simplifies project notation. InfoWorld, Framingham; Mar 27, 2000; Vol. 22, Iss. 13; pg. 69, 2 pgs

S.No. Topic Hours

1

Introduction to Object Management Group (OMG) Standards and Unified Modeling Language (UML) OO Concepts Review, Rational Unified Process emphasizing Inception, Elaboration, Construction, Transition Phase's. Use Case View architecture, Architectural approaches: Use case Centric, Architecture driven, Iterative approach, UML 2.0. UML History, UML 2.0, New Features, UML Meta Model, Advanced relationships generalization, association, aggregation, dependencies, Extensibility mechanisms like stereotypes, tagged values, constraints and profiles, Overview of all diagrams in UML 2.0.

09

2 Object Diagrams Use case diagrams, Analysis Class Diagram, CRC method, Class diagrams, Classes and Relationships, Interfaces and ports, Active Objects.

10

3 Interaction diagrams Interaction Overview diagrams, Interactions, signals, exceptions, regions, partitions, Sequence diagrams, Collaboration diagrams.

09

4

State Machine diagrams State Machine diagrams, States, encapsulation of states, transitions, submachine, state generalization, Timing diagrams, Activity diagrams, Activities, sub activities, signals, exceptions, partitions, and regions.

09

5

Support for Modeling Architecture in UML Deployment diagrams, Applications of UML commercial applications, All diagrams are to be assumed for UML 2.0 for each diagram the need, purpose, Concepts, Notation, Forward Engineering, Reverse Engineering &Application must be considered.

08

313


Suggested Evaluation Methods B) Continuous Assessment

3. Essential a) Unit Tests b) Assignment c) Case Study

4. Optional a) Quizzes b) Seminars


Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered Sub specialization committee Name of Member Manisha Tijare Suman Tanwar Poorva Agrawal Seema Patil






Signature

Name of the Expert: Signature: Date:

314





_________________________________________________________ Faculty of Engineering–Computer Science and IT

Curriculum Development Under Graduate

Course Title: Distributed Systems and Resource Management Lab Course Code: Number of Credits : 1 Level : 3 Learning Objective/Outcome (s): The students will be able to:

1. Implement vector clocks in distributed system. 2. Implement RPC using RMI in distributed system. 3. Simulate/Implement Lamports/Maekawa mutual exclusion algorithm in

distributed system. 4. Simulate/Implement Bully Election Algorithm 5. Demonstrate recent trend/ latest application in Distributed System

with a case study/seminar.

Pre-learning: Knowledge of Operating System and database fundamentals is desirable Course Outline S.No. Topic Hours

1 To implement vector clocks in distributed system. a) To implement vector clock ordering b) To find a consistent global snapshot

6

2 To implement RPC using RMI in distributed system. 4 3 To implement Lamports/Maekawa mutual exclusion

algorithm in distributed system. 4

4 To implement Bully Election Algorithm 4 5 To implement a deadlock detection Algorithm 4 5 Seminar on the recent trend/ latest application in 8

315


Distributed System


Books Recommended 1. “Advanced Concepts in Operating System”, Mukesh Singhal, Shivratri,

Tata McGraw Hill. 2. “Distributed Operating Systems Concepts and Design” Pradeep K. Sinha,

PHI. 3. Distributed Systems: Principles and Paradigms", Andrew S. Tanenbaum &

Maarten van Steen, PHI


a) Unit Tests b) Seminars c) Quizzes



S. No. Name of the Course Name of University where it is offered

1 Distributed Systems IIT, Kharagpur 2. Distributed Systems Carnegie Mellon

University(CMU) 3. Parallel and Distributed

Computing Thapar University, Patiala


Name of Member


Dr. Preeti Mulay

Rutuja Kadam





Signature

Name of Experts Mr. Vivek Gavhane Designation Scientist Org. / Inst. CDAC, Pune Signature


316



Course Name: Object Oriented Analysis and Design Patterns Lab (UG/PG): UG Number of Credits: 2 Level: 3 Learning Objectives Students will be able to:

1. Select and analyze case study to prepare software based analysis and design level diagrams to understand the business processes.

2. Analyze different type of users along with their interaction with the system. 3. Illustrate software systems using Analysis Class Diagram. 4. Infer CRC cards to understand procedural mode of thought and fully appreciate object

technology. 5. Identify the structure of a system using system's classes, their attributes, operations, and

the relationships among objects. 6. Identify different processes that operate with one another and their order using Sequence

Diagram and Collaboration Diagram. 7. Illustrate the business processes using Activity Diagrams. 8. Infer the hardware components where software components are deployed by Deployment

Diagram. Pedagogy

12. Interactive classroom teaching and discussions 13. Brainstorming sessions 14. Case studies 15. Use of software such as IBM Rational Rose

Pre-requisites None

317



1. Grady Booch, James Rumbaugh, Ivar Jacobson "Unified Modeling Language User Guide", The 1st Edition, (Addison-Wesley Object Technology Series),First Edition, ISBN: 0-201-57168-4, 1998.

2. Martin Fowler, "UML Distilled: A Brief Guide to the Standard Object Modeling Language", Third Edition,Addision Wesley, 2004.

Research Papers/Articles recommended for reading 1. Monarchi, D.E., and Puhr, G.I. (1992). A Research Typology for Object-Oriented Analysis and

Design. Communications of the ACM, Vol. 35, No. 9, pp. 35-47. 2. Cackowski, David. Object analysis in organizational design: A solution for matrix

organizations; Project Management Journal, Sylva; Sep 2000; Vol. 31, Iss. 3; pg. 44, 8 pgs 3. Apicella, Mario. UML simplifies project notation. InfoWorld, Framingham; Mar 27, 2000; Vol.

22, Iss. 13; pg. 69, 2 pgs Suggested Evaluation Methods


Lab Assignments Case Study

4. Optional b) Quizzes


S.No. Topic Hours

1 Study of Rational Unified Process. 4

2 Study of 4+1 View Model 4

3 Introduction to case study. 4

4 Describe and prepare Context Level Use Case Diagram and Detailed level use case diagram. 4

5 Prepare Analysis Class Diagram and Detailed level Class diagram 8

6 Prepare CRC Cards for each class 4

7 Describe and prepare Sequence and Collaboration Diagram 8

8 Describe and model Activity Diagram for each scenario. 8

9 Describe and model Component Diagram. 8

10 Describe and prepare Deployment Diagram 8

318


Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Sub-specialization committee



Assistant Professor

Assistant Professor


Signature


319


(Established under section 3 of the UGC Act 1956, by notification No.F.9-12/2001-U3 Government of India)

Accredited by NAAC with ‘A’ Grade Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by

President of India) ______________________________________________________________________

Sub Committee - Specialization for Curriculum Development

Under Graduate

Course Title: Java Programming

Course Code:


Level: 2



1. Understand the fundamentals of object-oriented programming in Java, including defining classes, objects, invoking methods etc

2. Demonstrate the concept and usage of inheritance, interface and packages in Java 3. Illustrate the concept of exception handling in Java with examples 4. Summarize the concept of event handling in AWT and Swings and develop GUI applications

in java 5. Explain the concept of Multithreading, Sockets and Remote Method Invocation (RMI) in Java 6. Demonstrate the usage of basic Java language syntax and semantics by writing real world

java programs Pre-learning:


Course Outline

S.No. Topic Hours

1.

Introduction to Java:

Need of object oriented approach, comparison of C++ and java, object, classes, writing java classes, JDK environment and tools, JVM , JRE . Features of java: abstraction, encapsulation,

12

320


polymorphism and inheritance. Constructor (parameterized and default), static variable, instance variable, static methods, instance methods, language fundamentals: structure of memory, parameter passing in java, wrapper classes, inner class.

2.

Inheritance , Abstract class, Interfaces and Packages:

Inheritance, types: single, multi-level, hierarchical inheritance, use of this and super keyword, super constructor, final variables, final methods and classes, Abstract keyword, abstract methods and classes, method overloading, method overriding. Dynamic Method Dispatch, Interfaces, implementing and extending and accessing interface variables. Java packages, importing packages, access control and modifiers. Arrays, Arraylist, vector, garbage collector, java miscellaneous: String, String Buffer class, String Tokenizer

15

3.

Exception Handling:

Exception handling, need for exception handling, exception types, using try-catch, multiple catch, nested try, finally, throw, throws, user defined exceptions

10

4.

Java Applications using AWT, Applets and JDBC:

Need for AWT, AWT components, graphics class, AWT containers, event handling in AWT, adapter classes, introduction to swing, swing components, layout managers. Identify need for Applet, Applet life cycle, difference between application program and Applets JDBC: identify the need of JDBC types of driver.

10

5.

Networking and Multithreading in Java:

Introduction to socket, socket programming, introduction to RMI, stub, skeleton, client server communication using RMI. Definition, multiprocessing, multithreading, thread, process, life cycle of thread, methods of threads class, thread synchronization

5

6.

Java Capstone project

In this project students demonstrate the range of skills and abilities they have acquired during the program. Students will use the knowledge acquired in the program of study to design and develop a desktop application.

8

Pedagogy

1. Interactive classroom teaching and discussions 2. Practical’s using software tools like JDK, NetBeans , EditPlus etc 3. Mini Project

321


Books Recommended



3. “Java How to Program”, 9th Edition, Deitel and Deitel, Prentice Hall 4. “Core Java: An Integrated Approach”, 1st Edition, R. Nageswara Rao , DreamTech

Publication(2008)


A) Continuous Assessment a) Unit Tests b) Assignments c) Quizzes d) Minor project



S. No.





Name of Member Meeta Kumar Kalyani Kadam




Signature

Signature of Dean:

Date:

322






Under Graduate

Course Title: Java Programming Lab

Course Code:


Level: 2



1. Understand and demonstrate the fundamentals of object-oriented programming in Java, like defining classes, objects, invoking methods etc.

2. Demonstrate the concept and usage of inheritance, interface and packages in Java. 3. Illustrate practically the concept of exception handling in Java. 4. Summarize the concept of event handling in AWT and Swings and develop GUI applications

in java. 5. Demonstrate the concept of Multithreading, Sockets and Remote Method Invocation (RMI)

in Java. 6. Demonstrate the usage of basic Java language syntax and semantics by writing java

programs Pre-learning:


Course Outline

S.No. Topic Hours

1. Part1: Implement a menu-driven Java program (like fib or factorial) to implement these input methods in java (command line args, Scanner, BufferedReader, DataInputStream, Console )

2

323


2.

Part2: Implement a simple menu driven calculator in java to implement add, sub, mul, div, sqrt, power, mean, variance. Implement a separate Calculator class to include all related function inside that class. (mean calculation : program reads numbers from the keyboard, summing them in the process until the user enters the string “end”. It then stops input & displays the avg. of numbers)

2

3.

Part1: W.a.p that declares & initializes 2 integer variables x and y to some values. Using the ternary operator, display the remainder of x/y if x>y, otherwise the remainder of y/x.

Part2: W.a.p that declares two arrays named ‘even’ and ‘odd’. Accept numbers from the user and move them to respective arrays depending on whether they are even or odd.

2

4.

Part3: W.a.p that has four integer variables. Find minimum value of these 4 variables (Using the ternary operator) and display it.

Part4: Implement a java function that finds 2 neighboring numbers in an array with the smallest distance to each. The function should return the index of the 1st number.

2

5.

Write a menu-driven Java Program to study the concepts of classes, array of objects, instance members, constructors in java. Assignment description: Create a Student class describing attributes of a student like prn, name, DoB, marks etc. Create an array of objects of Student class and perform operations like: Add students, Display, Search (by prn, by name, by position), Update/Edit and Delete.

2

6.

Write a menu-driven Java Program for the following: There are 52 cards in a deck, each of which belongs to one of four suits and one of 13 ranks. Represent a deck of cards as an array of Objects

2

7. Part1: Implement the generic Shapes class as an abstract class so that we can implement concrete classes like circle, triangle, rectangle class from it

2

8. Part2: Implement the generic Employee class and write code to inherit 2 concrete classes from it. 2

9. Write a Java application that will be able to add, subtract, multiply, divide, compare, convert to floating point, and find absolute value for rational numbers, with exception handling

2

10. Write a Java Program to find the factorial of ‘n’ integers (as 2

324


command line arguments CLA). Write your own exception “MyExcep” to validate integer values to be in certain range.

11.

Define an exception class called “NOMATCHEXCP” that is thrown when the string from keyboard is not equal to “India”. Write a Demo program using try-catch block that shows the use of this user-defined exception. class NOMATCHEXCP should have a parameterized constructor and the exception message generated should show the line number and the erroneous String that was inputted by the user.

2

12.

Create a Java Applet program to place a circle at random on our applet. Have four buttons on the applet “grow”, “shrink”, “move left “, “move right” to perform corresponding action on the circle when button pressed.

2

13. Write a Java Program to implement a GUI based Calculator with event and exception handling (for incorrect inputs). 2

14. Write a Java Program demonstrating the database connectivity in java 2

15. Write a Java Program to implement client server communication using RMI 2

Pedagogy

1. Interactive teaching and discussions in lab 2. Lab sessions using software tools like JDK, NetBeans , EditPlus etc 3. Mini Project

Books Recommended



3. “Java How to Program”, 9th Edition, Deitel and Deitel, Prentice Hall 4. “Core Java: An Integrated Approach”, 1st Edition, R. Nageswara Rao , DreamTech

Publication(2008)


A) Continuous Assessment a) Lab Test b) Lab Assignments c) Quizzes d) Minor project

325




S. No.





Name of Member Meeta Kumar Kalyani Kadam




Signature

Name of Expert:

Name of Member Mr. Vivek Gavane

Designation Principal Technical Officer

Org. / Inst. CDAC

Signature

Signature of Dean:

Date:

326



Course Name: Design and Analysis of Algorithms (UG/PG): UG Number of Credits: 4 Level: 4 Learning Objectives The students will be able to:

1. Explain how to analyze given computing algorithm using strategies like asymptotic and amortized analysis.

2. Tell how asymptotic notation is used to provide a rough classification of algorithms. 3. Explain algorithm analysis concepts to calculate the worst-case running time, amortized

running time etc. 4. Devise and validate algorithms using strategies like Divide and Conquer, Dynamic

Programming etc. 5. Synthesize efficient algorithms in common engineering problems. 6. Develop, design and analyze greedy algorithms, branch and bound algorithms etc. 7. Explain solvability of algorithms and categorize NP-Hard and NP-Complete Problems.

Pedagogy

1. Interactive classroom teaching and discussions 2. Practical’s using software tools like C++, Java etc 3. Brainstorming sessions 4. Seminars 5. Project based learning

Pre-requisites None

327


Course Outline

S.No. Topic Hours

1.

Introduction Analysis of algorithm efficiency: - analysis framework – asymptotic notations – analysis of non-recursive and recursive algorithms, amortized analysis, writing characteristic polynomial equations, solving recurrence equations, proof techniques: by contradiction, by mathematical induction, direct proofs, proof by counterexample, proof by contraposition.

10

2.

Divide and Conquer and Greedy Method Characteristics, analysis methodology, merge sort, quick sort, binary search,large integer multiplication. General characteristics of greedy algorithms, Prim’s algorithm, Kruskal’s algorithm, Dijkstra’s algorithm, Huffman trees, job sequencing with deadlines/activity selection problem, optimal merge patterns, Knapsack problem

10

3.

Dynamic Programming General strategy, principle of optimality, Warshall’s and Floyd’s algorithm, optimal binary search trees, Knapsack problem, traveling salesperson problem, flow shop scheduling

14

4.

Backtracking General method, recursive backtracking algorithm, iterative backtracking method, 8-queens problem, sum of subsets, graph coloring, Hamiltonian cycle, Knapsack Problem.

10

5.

Branch-Bound General method, least cost search, FIFO branch and bound, LC branch and bound.0/1 knapsack problem – LC branch and bound and FIFO branch bound solution, travelling salesman problem.

08

6.

NP-Hard And NP-Complete Problems Algorithms, Non-Deterministic Polynomial time (NP) decision problems, Cooks theorem, NP-complete problems- satisfiability problem,vertex cover problem.NP-Hard problems-graph, scheduling, code generation problems, simplified NP hard problems.

08

328


Books Recommended

1. "Introduction to Algorithms", T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, Prentice Hall of India Pvt. Ltd., Second Edition, 2003.

2. "The Design and Analysis of Computer Algorithms", Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Pearson Education, Fourth Edition, 1999.

3. ” Computer Algorithms/C++”, Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Universities Press, Second Edition, 2007.

4. “Object Oriented Data Structures using C++”, K.S. Easwarakumar, Vikas Publishing House pvt. Ltd., 2000.


1. Jadoon S. , Solehria S.F., Rehman S. and Jan H., “Design and Analysis of Optimized

SelectionSort Algorithm”,International Journal of Electric & Computer Sciences IJECS IJENS Vol: 11 No: 01 , 113201-5454IJECS-IJENS © February 2011 IJENS.

2. Li N., Jennifer C. , and Sha L. ,” Design and Analysis of an MST-BasedTopology Control Algorithm”,IEEE INFOCOM 2003.



a) Assignments b) Seminars c) Tests

2. Optional a) Quizzes b) Viva-voce c) Mini Project


329


Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered

Name of Member

Suman Tanwar Meeta Kumar Ambika Pawar Manisha Tijare






Signature


330



Course Name: Design and Analysis of Algorithms Lab (UG/PG): UG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Examine the working of various searching and sorting algorithms. 2. Formulate the upper and lower bounds on comparison-based search algorithms. 3. programs for solving algorithmic problems based on graph traversals. 4. Solve shortest-path problemusing greedy algorithm design strategy. 5. Formulate a combinatorial optimization problem using algorithm design methods such as

greedy method, dynamic programming. 6. Devise a graph analysis algorithm for solving the all-pairs shortest-path problem. 7. Devise algorithm to study the optimal way to merge n initially sorted files. 8. Develop, design and analyze backtracking, branch and bound algorithms.

Pedagogy

1. Practical using Dev C++, Borland C 2. Mini projects

Pre-requisites None

331


Course Outline

Books Recommended 1. "Introduction to Algorithms", T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, Prentice

Hall of India Pvt. Ltd., Second Edition, 2003. 2. "The Design and Analysis of Computer Algorithms", Alfred V. Aho, John E. Hopcroft and

Jeffrey D. Ullman, Pearson Education, Fourth Edition, 1999. 3. ” Computer Algorithms/C++”, Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran,

Universities Press, Second Edition, 2007. 4. “Object Oriented Data Structures using C++”, K.S. Easwarakumar, Vikas Publishing

House pvt. Ltd., 2000. Research Papers/Articles recommended for reading

1. Jadoon S. , Solehria S.F., Rehman S. and Jan H., “Design and Analysis of Optimized

SelectionSort Algorithm”,International Journal of Electric & Computer Sciences IJECS IJENS Vol: 11 No: 01 , 113201-5454IJECS-IJENS © February 2011 IJENS.

2. Li N., Jennifer C. , and Sha L. ,” Design and Analysis of an MST-BasedTopology Control Algorithm”,IEEE INFOCOM 2003.


1. Essential a) Projects b) Seminars

2. Optional a) Quizzes and Mini-project implementations


S.No.

Topic Hours

1 WAP to search an element using linear search and binary search (recursive). Analyze its complexity.

2

2 WAP to perform Quick sort, Merge sort. Display the partial pass-wise sorting done.

4

3 Create implementations for the Kruskal’s & Prim’s Algorithm for finding the Minimum Cost Spanning Tree for a given graph. You may input the graph from file and use adjacency matrix.

4

4 Implement Dijkstra’s Algorithm to find a path of minimum total weight (cost) from a starting node to all the other nodes in the weighted graph.

4

5 WAP to perform Knapsack problem using Greedy strategy and Dynamic Programming.

4

6 Implement Floyd’s Algorithm to find a shortest path between each pair of vertices in a weighted graph. Display the results as a distance matrix.

4

7 WAP to perform Optimal Merge Pattern. 4

8 WAP to implement n-queens problem. 4

332


a) Viva-Voce b) Lab Exam

Parallel/Similar courses the existing curriculum S.No. Name of the course Institute where it is offered Sub-specialization committee

Name of Member

Suman Tanwar Meeta Kumar Ambika Pawar Manisha Tijare






Signature


333






Under Graduate

Course Title: Open Source Technologies Lab Course Code: Number of Credits: 1 Level : 3 Learning Outcome (s): The students are able to

1. Relate to the idea of adoption of Open Source Software (OSS) and Public Domain Software (PDS) in software development process.

2. Identify and outline the need for licenses and patents. 3. Analyze the basic idea of open source technology, their software

development process. 4. Examine and analyze various open source software and tools. 5. Outline and distinguish between open source and closed source technologies.

Pre-learning: Knowledge of Computer Programming desirable Pedagogy Lab assignments on the use of open source tools Course outline S.No. Topic Hours

1.

Installation of Ubuntu OS 4

2.

Linux shell commands 4

3.

MySQL : DML and DDL queries 4

4. PHP : Working with arrays and strings. 4

5.

PHP : Web Application development 4

334


6.

Joomla/Wordpress: Web Application Development 4

7. Android application development using PhoneGap 4

8. Solve the following using R:

2

Books Recommended 1. https://www.w3resource.com/php-exercises/ 2. https://www.w3resource.com/mysql-exercises/. 3. https://tutorials.ubuntu.com/tutorial/tutorial-install-ubuntu-desktop 4. https://www.tutorialspoint.com/joomla/


A) Continuous Assessment a) Assignments b) Tests c) Mini Project


S. No.


1 Open Source Software Carnegie Mellon University Name of the sub-committee members:

Name of Members


Dr. Swati Ahirrao

Designation Asso Prof Asso Prof


Signature

Name of the expert Name of Experts Dr. Sandeep Deshmukh

Designation Proprietor Org. / Inst. Freelancer Signature


335





______________________________________________________________________________


Under Graduate

Course Title: Web Technologies Course Code: Number of Credits: 3 Level: 3 Learning Outcome (s): The students will be able to:

1. Develop client side programming through HTML, CSS and JavaScript. 2. Interpret AJAX with JQUERY 3. Use AJAX for internet application. 4. Develop dynamic web site using server side PHP Programming and Database

connectivity. 5. Explain and differentiate different Web Extensions and Web Services.

Pre-learning Fundamental knowledge OSI layers. Course Outline S.No. Topic Hours

1

Client Side Programming HTML, CSS and JavaScript: Basic of HTML: Web System architecture, URL, domain name system, overview of HTTP, Cross browser compatibility issues. Formatting and Fonts, Anchors, images, lists, tables, frames and forms. Introduction to CSS:, Syntax of CSS, Exploring CSS Selectors, Inserting CSS in an HTML Document, Working with the Box Model, CreatingLayouts, StylingText, Responsive web, media queries, keyframe animations .

8

2

Introduction to JavaScript: JavaScript language constructs, working with DOM and Window objects, event handling, form validation and cookies. jQuery : The Basics of jQuery Traversing the DOM DOM Manipulation with jQuery Events Animation Ajax with

10

336


jQuery JSON jQuery Plugin development

3

Rich Internet Application (RIA):Characteristics of RIA, Introduction to AJAX: AJAX design basics, AJAX vs Traditional Approach,Rich User Interface using Ajax. Working with JavaScript Object Notation(JSON): Create data in JSON format, JSON Parser .Web Mashup Eco Systems –Mashup Techniques: Mashing on the Web Server, Mashing with JSON

10

4

PHP (PHP Hypertext Preprocessor) : PHP (PHP Hypertext Pre-processor) web environment, basic elements, Functions,Arrays ,GET and POST input methods, input validation, string manipulation and regular expression, File management: file system function, file input and output: error handling, HTTP cookies, HTTP sessions. Communication with MySQL (My Structured Query Language) via PHPMySQL API (Application Programming Interface).

10

5

Web Extensions and Web Services Web Extensions : Introduction to XML, Introducing XSL.Web services: Evolution and differences with Distributed computing, WSDL, SOAP, UDDI. REST-ful web services, Resource Oriented Architecture

7

Pedagogy

1. Interactive classroom teaching 2. Seminar

Books Recommended 1. HTML 5 Black Book: Kogent Learning solutions 2. “Learning PHP 5”, David Sklar, O’Reilly Publication 3. Rich Internet Application AJAX and Beyond WROX press 4. Responsive Web Design with HTML5 and CSS3, Ben Frain, PACKT Publication


A) Continuous Assessment a) Unit Test b) Assignments c) Quizzes d) Seminar e) Class tests



S. No.


1 Internet Programming Mumbai University 2 Web Technologies University of Huddersfield

Name of Members

Dr.Swati Ahirrao Kalyani Kadam Aniket Jagtap

337




Teaching Associate (CS & IT)


Signature

Name of Experts

Praveen Gubbala

Designation Web Developer

Org. / Inst. Manumits

Signature


338





______________________________________________________________________________


Under Graduate

Course Title: Web Technologies Lab Course Code: Number of Credits: 1 Level: 3 Learning Outcome (s): The students will be able to:

1. Design a basic web site using HTML and CSS to demonstrate responsive web design.

2. Implement dynamic web pages with validation using JavaScript objects by applying different event handling mechanism.

3. Use AJAX programming technique for creation of internet application. 4. Develop simple web application using server side PHP programming

and Database connectivity using MySQL. 5. Implement simple program for AJAX with JQUERY. 6. Build well-formed XML Document and implement Web Service using Java.

Pre-learning Fundamental knowledge OSI layers. Course Outline S.No. Topic Hours

1 Design web site using HTML and CSS. 3

2 Use AJAX for creation of web application 3

3 Create a simple student /employee program by making use of PHP and mysql for storing, retrieving and modifying records. 3

4 Implement AJAX and JQUERY for creation of web application. 3

5 Build well-formed XML Document and implement Web Service using Java. 3

339


Pedagogy 1. Interactive classroom teaching 2. Mini Project

Books Recommended 1. HTML 5 Black Book: Kogent Learning solutions 2. “Learning PHP 5”, David Sklar, O’Reilly Publication 3. Rich Internet Application AJAX and Beyond WROX press 4. Responsive Web Design with HTML5 and CSS3, Ben Frain, PACKT Publication


A) Continuous Assessment a) Lab Assignments b) Quizzes

B) End Semester Examination a) Lab Exam b) Viva-Voce c) Mini Project


S. No.


1 Internet Programming Lab Mumbai University 2 Web Technologies University of Huddersfield

Name of Members

Dr.Swati Ahirrao Kalyani Kadam Aniket Jagtap





Signature

Name of Experts

Designation

Org. / Inst.

Signature


340





______________________________________________________________________


Under Graduate

Course Title: Data Warehousing and Mining Course Code: Number of Credits:3 Level:

Learning Outcomes:


1. Outline and organize architecture of data warehouse and its components.

2. Illustrate data mining concepts and algorithms. 3. Analyze multidimensional data using “Online Analytical Processing”

tool. 4. Experiment how to produce a quantitative analysis report/memo

with the necessary information to make decisions. 5. Demonstrate basic data mining algorithms, methods, and tool. 6. Test and compare different data mining algorithms such as A-priori,

Decision Tree Classifier, K-means clustering.

Pre-learning: Knowledge of database fundamentals is desirable Course Outline Sr. No. Topics Hours

1 Introduction to Data Warehousing: Concepts, benefits and problems, characteristics of DW, DW architecture – operational data, load manager, meta data, DW

8

341


data flows –inflow, upflow, meta flow, DW Implementation, back-end tools and utilities, DW tools and technologies – extraction, cleansing and transformation tools, admin and management tools, data marts – reasons and issues

2 Introduction to data mining: Kind of data, Knowledge discovery in database (KDD),data mining Models and Tasks, DM Functionalities, Architecture of data mining system, Classification of DM Systems,data miningtechniques, predictive modeling, DM tools,data mining primitives, data mining algorithms, major issues in data mining

8

3 On-line Analytical Processing OLTP benchmarks, applications, benefits, tools, categories,Multidimensional data model: Data cubes, defining schemas, concept hierarchies, OLAP operations, data modeling: Star and Snowflake schema,Issues in OLAP, denormalization,Types of OLAP servers, comparison between OLTP and OLAP.

8

4 Concept Description: What is concept description?, Data Generalization and summarization-based characterization, Attribute relevance, class comparisons Association Rule Mining: Market basket analysis, basic concepts, Finding frequent item sets: Apriori algorithm, generating rules, mining Multi-level Association rules from relational databases and Warehouses.

8

5 Classification and Prediction: What is classification and prediction? Issues, Classification using Decision trees, Classification by Bayesian and Backpropagation, K-Nearest Neighbor classifiers, casebased reasoning, genetic algorithms, Rough and Fuzzy set approaches, Linear and nonlinear regression, classifier comparison, Introduction of tools such as OLE DB/DBMiner/WEKA/iDA/ORACLE DM Tools, Combining Multiple Classification models: Bagging and Boosting

8

6 Clustering: Introduction to clustering, types of data, partitioning methods: k-Means, Hierarchical clustering: BIRCH, CURE and Chameleon Clustering, Density (DBSCAN, OPTICS, DENCLUE), Grid (CLIQUE) and Model based clustering: Statistical and Neural network approach, Outlier Analysis: Statistical, Distance and Deviation-based Outlier detection32

5

Pedagogy

1. Class room teaching on concepts of data warehouse and data mining 2. Research seminars

Books Recommended

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

2.Avi Silberschatz Henry F. Korth S. Sudarshan Database System ConceptsFifth Edition McGraw-Hill

342


3. M. Kantardzic, “Data mining: Concepts, models, methods and algorithms, JohnWiley & Sons Inc., 2003.


A) Continuous Assessment a) Unit Tests b) Assignments c) Quizzes


a) Written Exam Benchmarked against similar courses in other national/ international universities /organizations

S. No.


1. Data Mining Techniques and Applications

Savitribai Phule Pune University

2. Data Mining IIT, Bombay Sub-specialization committee

Name of Members

Prof. Swati Ahirrao Prof. Seema Patil



Signature

Name of Experts

Dr. Parag Kulkarni



Signature


343






Under Graduate Course Name: Artificial Intelligence Course Code: Number of Credits:3 Level: Course Outcome(s): The students are able to:

1. Explain definition, goals and applications of Artificial Intelligence (AI) with examples

2. Illustrate various properties of Internal Representation in AI 3. Evaluate solving problems in AI by various search techniques 4. Illustrate various knowledge representations using predicate and non-

monotonic logicofAI 5. Analyze and apply various AI techniques to real world applications 6. ApplyNatural Language Processing (NLP)techniques in various AI applications 7. Outline and organizearchitecture of Expert System and implementrelated

case studies 8. Illustrate various learning techniques including incremental learning, deep

learning and machine learning

Pre Learning: Discrete Mathematics, Programming skills using Prolog / LISP, Logic design


1 Introduction to Artificial Intelligence (AI) Definition, goals of AI, AI Applications, AIrepresentation, properties of internal representation.

6

2 Problem Solving Solving problems in AI by searching, study and analysis of various searching algorithms, heuristic search techniques, best first search, mean and ends analysis, A* and AO* Algorithm.

6

3 Knowledge Representation using Predicate, Non-monotonic Logic Predicate calculus, predicate and arguments, ISA hierarchy, frame notation, resolution, natural deduction.Truth maintenance

8

344


system (TMS), statistical and probabilistic reasoning, fuzzy-logic, structure knowledge representation, semantic-net, frames, script, conceptual dependency.

4 Planning techniques Action and plan representation, reactive systems, hierarchical and abstraction planning, case-based planning, machine learning in planning, multi-agent planning, interacting with the environment, planning under uncertainty, and recent applications

5

5 AI techniques Distance based NN, Multilayer NN, k-NN, Pattern recognition, Feature extraction/selection, Self-organizing neural network, learning strategy (Winner-take-all), Learning vector quantization, case study discussion

5

6 Natural Language Processing Natural language processing (NLP) and understanding and pragmatic, syntactic& semantic analysis, introduction to sentiment analysis, concepts, algorithms and opinion mining.

5

7 Expert system Utilization and functionality, architecture of expert system, knowledge -representation, case studies on expert systems, introduction to machine learning, deep learning, incremental learning.

10

Pedagogy 1. Class room teaching 2. Case studies 3. Mini projects

Books Recommended 1. “Artificial Intelligence application programming”, M.Tim Jones, Dreamtech Press 2. “Artificial intelligence: A modern approach”, Stuart J. Russell, Peter Norvig,

Printice Hall of India Private Ltd, 2008, Second edition, ISBN: 9788120323827 3. “Artificial intelligence”, Ravi Bhushan Mishra, PHI Learning Pvt Ltd

Suggested Evaluation Methods Unit Tests, Seminars, Assignments, Quizzes, Mini project, End Semester Examination Benchmarked against similar courses in other national/ international universities /organizations: S.No. Name of the course Institute where it is offered 1. Computer Science & Artificial

Intelligence VIT Vellore

2. Artificial Intelligence: Principles and Techniques

Stanford University, USA.

345


Sub-specialization committee:

Name of Member

Poorva Agrawal Dr. Shraddha Phansalkar Preeti Mulay




Org. / Inst. SIT SIT SIT Signature

Name of the Expert: Er. Vivek Gavane Signature of Dean: Date:

346






Under Graduate

Course Title: Network Analysis and Design Course Code: Number of Credits: 4 Level : 4 Learning Objective/Outcome (s): The students are able to:

1. Explain basics of computer networking. 2. Analyze queuing models for various applications. 3. Demonstrate shortest path using graph theory. 4. Evaluate Quality of service for different topologies of network. 5. Explore topics such as network flow problems and optimal routing.

Pre-learning: Computer Networks, graph theory and probability theory is essential. Course Outline

S.No. Topic Hours 1. Introduction :

Overview of networking, basics of networking such as IP addressing, forwarding, routing, network design issues and network performance measures: delay, throughput and packet loss

5

2. Queuing Theory : Delay Models in Data Networks, Queuing Models- Little’s Theorem, Application of Little’s Theorem, Performance evaluation of various Queuing Systems: M/M/1, M/M/m, M/M/∞, M/D/1 M/G/1 System, M/G/1 Queues with Vacations, Priority Queuing

15

347


3. Modeling N/W as Graph : Graph terminology, representation of networks, fundamental graph algorithms, shortest path, link prediction algorithms - Dijkstra’s Algorithm, Bellman’s Algorithm, Floyd’s algorithm, Incremental shortest path algorithm

15

4. Methods of Ensuring Quality of Service : Methods of ensuring quality of service – introduction, applications and QoS, QoS mechanisms, Queue management algorithms, dynamic queuing algorithms, resource reservation, traffic engineering, IP QoS

15

5. Advanced Topics: Next generation networks, cyber physical systems, network flow problems, optimal routing

10

Pedagogy

1. Lectures 2. Online resources: NPTEL and Coursera 3. Research paper discussions

Books Recommended

1. Bertsekas D. and Gallager R., “Data Networks,” 2nd Ed., Prentice-Hall, Englewood Cliffs, N.J. 1992.

2. Aaron Kershenbaum, “ Telecommunications Network Design Algorithms “,McGraw Hill education (India) Edition 2014, ISBN: 10: 0070342288

3. James McCabe, “N/W analysis, Architecture and Design”, Elsevier, 978-0-12-370480-1

4. Pablo Pavon Marino, “Optimization of Computer Networks: Modeling and algorithms – A hands on approach”, Wiley Publication, ISBN: 10. 1119013356.

5. Natalia Olifer, Victor Olifer, “Computer Networks, Principles, Technologies and Protocols for network design”, Wiley India, ISBN: 13, : 9788126509171


A. Continuous assessment: 1. Unit Test1 2. Unit Test2 3. Assignments 4. Presentation 5. MCQ 6. Quizzes

B. End Semester Exam (ESE) Written exam Benchmarked against similar courses in other national/ international universities /organizations

348


S. No.


1 Network Design and Analysis SPPU , Pune 2. Design and Analysis of Algorithms Gujarat University

Name of Members


Prachi Kadam


Assistant Professor


Signature

Name of expert : Dr. Parag Kulkarni Signature of Dean: Date:

349





______________________________________________________________________


Under Graduate

Course Title: Data Warehousing and Mining Lab Course Code: Number of Credits:1 Level:

Learning Outcomes:

The students are able to: 1. Analyze multidimensional data using “Online Analytical Processing”

tool 2. Apply different data pre-processing steps on a data set 3. Experiment how to produce a quantitative analysis report/memo

with the necessary information to make decisions 4. Demonstrate basic data mining algorithms, methods, and tool 5. Test and compare different data mining algorithms such as A-priori,

Decision Tree Classifier, K-means clustering

Pre-learning: Knowledge of database fundamentals is desirable Course Outline Sr. No. Topics Hours

1 Build data flow transformation operations: character map, 2

350


Multicast, Conditional split, Aggregation, Sort, Derived column. 2 Study Data mining tool e.g.RapidMiner (formerly known as

YALE), WEKA, R-Programming, Orange, KNIME, NLTK. 2

3 Create a simple multi-dimensional cube and perform OLAP operations.

2

4 Implement Apriori Algorithm to find frequent item set generated from a given data set using java.

3

5 Implement K-means clustering data mining algorithm. 3 6 Implement decision tree for a data set 3

Pedagogy

1. Class room teaching on concepts of data warehouse and data mining 2. Research seminars

Books Recommended

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

2.Avi Silberschatz Henry F. Korth S. Sudarshan Database System ConceptsFifth Edition McGraw-Hill

3. M. Kantardzic, “Data mining: Concepts, models, methods and algorithms, JohnWiley & Sons Inc., 2003.


A) Continuous Assessment a) Lab Assignments

b) Quizzes c) MCQ


a) Viva-Voce b) Lab Exam


S. No.


1. Data Mining Techniques and Applications

Savitribai Phule Pune University

2. Data Mining IIT, Bombay Sub-specialization committee

Name of Members

Prof. Swati Ahirrao Prof. Seema Patil



Signature

351


Name of Experts

Dr. Parag Kulkarni



Signature


352




Founder: Prof.Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India)

_________________________________________________________ Sub Committee - Specialization for Curriculum Development

Course Title: Artificial Intelligence Lab Course Code: Number of Credits: 1 Level: Learning Outcomes: The students are able to:

1. Evaluate various Artificial Intelligence (AI) techniques 2. Correlate and use perceptron models & networks 3. Experiment with different models of NLP 4. Plan and outline concepts of an Expert System using various case studies

Pre-learning: Statistics, probability, fundamentals of data analytics Course Outline S.No. Topics Hours

1 Write a program to implement BFS and DFS. 5

2 Write a program to develop robot traversal problem using Perceptron models, and multi-category models.

5

3 Write a program to Model problem solving with NLP, sentiment analysis from given English Text.

10

4 Write a program to implement following case studies: Case Study: A Course Advisor Expert System, Case Study in Performance Assessment : Evaluation of Medical Expert Systems

10

Pedagogy

1. Lab using programming languages like MATLAB and C

353


2. Case studies 3. Mini projects

Books Recommended 1. Artificial Intelligence application programming”, M.Tim Jones, Dreamtech Press 2. “Artificial intelligence: A modern approach”, Stuart J. Russell, Peter Norvig,

Printice Hall of India Private Ltd, 2008, Second edition, ISBN: 9788120323827 3. “Artificial intelligence”, Ravi Bhushan Mishra, PHI Learning Pvt Ltd Suggested Assessment/ Evaluation Methods

A) Continuous Assessment a) Lab Tests b) Lab Assignment

B) End Semester Examination a) ESE Lab Exam b) Viva-Voce


S. No.


1 Artificial Intelligence Lab BITS Pilani 2. Artificial Intelligence Lab Pune University


Name of Member

Dr.PreetiMulay Poorva Agrawal

Designation Associate Professor (CS & IT) Assistant Professor (CS & IT)

Org. / Inst. SIT SIT Signature

Name of Experts

Dr.Parag Kulkarni

Designation Professor,Founder, Chief Scientist and CEO


Signature


354






Under Graduate

Course Title: Network Analysis and Design Lab Course Code: Number of Credits: 1 Level: 4 Learning Objective/Outcome (s): The students are able to:

1. Explain basics of computer networking. 2. Analyze queuing models for various applications. 3. Demonstrate shortest path using graph theory. 4. Evaluate Quality of service for different topologies of network.

Pre-learning: Computer Networks, graph theory and probability theory is essential. Course Outline

S.No. Topic Hours 1. Assignment 1:

- Read the basics of routing and forwarding. - Get familiar with the network performance

parameters such as delay, through and packet loss.

2

355


3. Practical Assignment 2: (i) Consider a network topology provided by

your course instructor, there four traffic sessions sending Poisson Traffic at rates 100, 200, 500 and 600 packets/minutes, respectively. Packet lengths are exponentially distributed with mean 1000 bits. All transmissions lines have equal capacity 50Kbps, and there is a propagation delay of 2 msec on each line. Using Klienrock independence approximation, find the average delay per packet (regardless of sessions), and the average delay per packet of each session. (Reference: Problem 3.57, Data Networks, D. Bertsekas and R. Gallager)

(ii) Simulation of cumulative bandwidth at the base station of wireless Mobile Broadband network using queuing theory and Product Density Model. Use MATLAB to do the task. Simulation parameters are provided by the instructor.

4 6

4. Practical Assignment 3: - Revisit variousrouting algorithms: Dijkstra,

Bellman-Ford and Floyd. - Considering a suitable topology (provided by

lab instructor), Write your own program in C/ Java/Python to compute shortest path for all three algorithms and make a proper discussion on the basis of your results.

6

5. Practical Assignment 4: - Research on IP Quality of service. - Research on various network traffic queuing

algorithms. - Demonstrate your understanding on two

dynamic queue management algorithms: Random Early Detection (RED) and BLUE. Compare the performance of these algorithms. Students are advised to perform this task on network simulator (ns3).

8

6 Presentation and discussions on research papers

4

Pedagogy

1. Lectures 2. Discussions on research papers

356


Books Recommended

1. Bertsekas D. and Gallager R., “Data Networks,” 2nd Ed., Prentice-Hall, Englewood Cliffs, N.J. 1992.

2. Aaron Kershenbaum, “ Telecommunications Network Design Algorithms “,McGraw Hill education (India) Edition 2014, ISBN: 10: 0070342288

3. James McCabe, “N/W analysis, Architecture and Design”, Elsevier, 978-0-12-370480-1

4. Pablo Pavon Marino, “Optimization of Computer Networks: Modeling and algorithms – A hands on approach”, Wiley Publication, ISBN: 10. 1119013356.

5. Natalia Olifer, Victor Olifer, “Computer Networks, Principles, Technologies and Protocols for network design”, Wiley India, ISBN: 13, : 9788126509171


A. Continuous assessment: 1. Lab performance 2. Lab Journal 3. Viva 4. Demonstration 5. Presentation


S. No.


1 Network Design and Analysis SPPU , Pune 2.

Name of Members


Prachi Kadam


Assistant Professor


Signature

Name of expert : Dr Parag Kulkarni Signature of Dean: Date:

357





_________________________________________________________ Sub Committee Engineering – Computer Science/IT for Curriculum

Development

Course Title: Big Data Stores Course Code: Number of Credits:4 Level : 4 Learning Outcome (s): The students are able to:

1. Differentiate various No-SQL Data stores and their suitability for different applications. 2. Experiment the deployment of web application on Amazon SimpleDB and MongoDB. 3. Test the deployment of web application on Hadoop HBase. 4. Analyze the data and prediction with techniques such as regression, neural networks. 5. Relate how NoSQL data stores are useful for different web applications

Pre-learning: Knowledge of Big data, No-SQLis desirable Course Outline S.No. Topic Hours

1 Introduction to Big Data From SQL to NO SQL Data Store. What is Big Data? Characteristics of Big Data, When to consider a Big Data solution? Classification of NoSQL Data Stores. Brief Introduction to Graph based, Document Oriented and Key-value stores.

10

2 Key-Value Store : Amazon Dynamo, Yahoo PNUT, Hadoop HBase, Apache Cassendra : Detailed Architecture, Query Model,Table Splitting and Balancing,consistency model, Hadoop basics, HDFS, Mapreduce framework.

20

3 Document Database : Amazon SimpleDB,MongoDB, Detailed Architecture,Query Model,Table Splitting and Balancing,consistency model, Amazon SimpleDB API , MongoDB: Sharding, Replication, MongoDB query Language

15

4 Case StudiesBig Data in E-Commerce and IT 10

358


5 Graph Database(Neo4j) : Graph Database vs RDBMS Introduction, Data Model

5

Pedagogy

1. Classroom teaching 2. Demonstration in labs 3. Case Study

Books Recommended

1. Understanding Big Data: Analytics for Enterprise class Hadoop and Streaming Data, IBM 2. Cloud Computing For Dummies®, HP Special Edition. Published by. Wiley Publishing,

Inc. 111 River Street. 3. Cloud Computing – Based Projects Using Distributed Architecture, PHI,New Delhi


A. Continuous Assessment a) Unit test 1 b) Unit Test 2 c) Assignments d) Presentation e) Quizzes



S. No.


1 Big data Analytics SRM university, Karantaka 2. Hadoop Platform and Application

Framework University of California

Name of Member

Dr. Swati Ahirrao Dr. Shraddha Phansalkar




Signature

Name of Experts Dr. Sandeep deshmukh Designation Data Analyst Org. / Inst. freelancer Signature


359







Course Title: Neural Networks Course Code: Number of Credits : 4 Level : 3 Learning Outcomes: The students will be able to:

1. Illustrate the basics of Neural Networks and essentials of Artificial Neural Networks with Single Layer and Multilayer Feed Forward Networks.

2. Demonstrate applications of Neural Networks (NN) in different sectors such as manufacturing, finance, medical etc.

3. Apply NN in projects. 4. Outline fuzzy sets and Fuzzy Logic system components. 5. Practice concepts and practicality of Associate Memories. 6. The Neural Network and Fuzzy Logic application to Systems Engineering is also presented.

Pre-learning: Statistics, probability, fundamentals of data analytics Course Outline S.No. Topic Hours

1 Introduction to Neural Networks Introduction, humans and computers, organization of the brain, biological neuron, biological and artificial neuron models, characteristics of ANN, McCulloch-Pitts model, historical developments, potential applications of ANN. Artificial neuron model, operations of artificial neuron, types of Neuron Activation Function, ANN architectures, classification taxonomy of ANN – connectivity, learning strategy (Supervised, Unsupervised, Reinforcement), learning rules, Reinforcement Learning, Competitive Learning and Self organizing maps.

11

2 Single Layer and Multilayer Feed forward Neural Networks Introduction, perceptron models: discrete, continuous and multi-category, training algorithms: discrete and continuous perceptron networks, limitations of the perceptron model. Credit Assignment Problem, generalized delta rule, derivation of Back Propagation (BP) training, summary of Back Propagation Algorithm, Kolmogorov theorem, learning

11

360


difficulties and improvements. 3 Associative Memories

Paradigms of Associative Memory, Pattern Mathematics, Hebbian Learning, General Concepts of Associative Memory, Bidirectional Associative Memory (BAM) Architecture, BAM Training Algorithms: Storage and Recall Algorithm, BAM Energy Function. RBF neural networks, Adaptive Resonance Theory (ART-I and ART-II), Convolution Neural Networks.

Architecture of Hopfield Network: Discrete and Continuous versions, Storage and Recall Algorithm, Stability Analysis. Neural network applications: Process identification, control, fault diagnosis.

16

4 Classical & Fuzzy Sets Introduction to classical sets - properties, Operations and relations; Fuzzy sets, Membership, Uncertainty, Operations, properties, fuzzy relations, cardinalities, membership functions.

11

5 Fuzzy Logic System Components Fuzzification, Membership value assignment, development of rule base and decision making system, Defuzzification to crisp sets, Defuzzification methods. Fuzzy logic applications: Fuzzy logic control and Fuzzy classification.

11

Pedagogy


Books Recommended

1. S. Rajasekharan and G. A. Vijayalakshmi pai, “Neural Networks, Fuzzy logic, Genetic algorithms: synthesis and applications”, PHI Publication, 2004.

2. John Yen and Reza Langan, “Fuzzy Logic: Intelligence, Control and Information”, Pearson Education, 2004.

3. Simon Haykin, “Neural Networks- A comprehensive foundation”, Pearson Education, 2001.

4. S.N.Sivanandam, S.Sumathi,S. N. Deepa “Introduction to Neural Networks using MATLAB 6.0”, TMH, 2006.

5. James A Freeman and Davis Skapura, Neural Networks Pearson Education, 2002.


A) Continuous Assessment a) Unit Tests b) Assignment c) Seminars d) Quizzes

361


e) Class Tests



S. No.


1 Neural Networks and Fuzzy Logic BITS Pilani 2. Neural Networks in Communication Pune University


Name of Member Dr. Preeti Mulay Poorva Agrawal




Signature

Name of Experts

Mr. Vivek Gavane

Designation Senior Technical Officer

Org. / Inst.

Center for Development of Advanced Computing(C-DAC)

Signature


362






Under Graduate

Course Title: Network Security Course Code: Number of Credits: 4 Level: 4 Learning Outcome (s): Students are able to:

1. Define the basics of cryptography. 2. Demonstrate and explain understanding on secret key algorithms: DES, AES

and IDEA. 3. Investigate collisions in hashing algorithms. 4. Explore modern public key cryptography e.g. lattice cryptography and

explain classical public key algorithms such as RSA and El-Gamal. 5. Exposed to various security protocols. 6. Obtain deeper understanding on Intrusion Detection, malware analysis, IoT

security, Blockchains and Privacy.

Unit No. Topic Hours

1. Network security overview: Overview of network security and cryptography 4

2.

Secret Key Cryptography: Permutation and substitution, Data Encryption Standard and one round of DES, 3DES, IDEA algorithm, AES, Modes of operation: ECB, CBC, OFB, CFB and CTR

10

3.

Hashes and Message Digest: Hashing basics, collisions, birthday paradox problem, Message Digest: MD-2, MD-4 and MD-5. Secure Hashing Algorithm (SHA): SHA-1 and SHA-512

6

4. Public Key Cryptography: Diffie-Hellman, RSA, ECC and security analysis of Diffie-Hellman, RSA and ECC, Lattice-based cryptography

15

5. Authentication and mutual authentication: Key distribution, authenticated key distribution, authentication protocols, Key Distribution Centre, Kerberos,

10

363


Pre-learning: Knowledge of Computer networks and probability theory is required. Course Outline Pedagogy

1. Lectures 2. NPTEL 3. Discussion on research papers.

Books Recommended 1. Wade Trappe and Lawrence C. Washington, Introduction to Cryptography

with Coding Theory, Second Edition, Pearson. 2. William Stallings, Cryptography and Network Security: Principles and

Practices, Fourth edition, Prentice Hall. Suggested Assessment/ Evaluation Methods

A. Continuous Assessment 1. Unit test I 2. Unit test II 3. Assignments 4. Projects 5. Quiz 6. Presentation

B. End semester evaluation

Written exam Benchmarked against similar courses in other national/ international universities /organizations

S. No.


1. Network security North Carolina State University 2. Cryptography and network

security IIT Kharagpur


Name of Members


Vijayshri Khedkar Prachi Kadam


Assistant Professor Assistant Professor


Name of experts: Dr Parag Kulkarni Signature of Dean: Date:

PKI

6. Other security protocols: Pretty Good Privacy, Transport Layer Security, SLS, IPSec 5

7.

Project and research oriented topics: Intrusion detection System and Honeypots. Malware detection and static/dynamic behaviour analysis, IoT security, Wireless Security, Blockchains

10

364



Course Name: Printed Circuit Board Design (UG/PG): UG Number of Credits: 3 Level: 3 Learning Objective(s):

1. Define Printed Circuit Board. 2. Identify materials for PCB fabrication. 3. Classify different types of PCB. 4. Describe different processes in PCB design. 5. Discuss current trends in PCB design. 6. Explain surface mount Technology. 7. Practice CAD tools for PCB Design. 8. State the limitations of manual design of PCBs.

Pedagogy:

1. Classroom teaching 2. Videos relating the process of fabrication of PCBs 3. Hands on mini Project.


365


Course Outline

Books Recommended:

2. Walter C Bosshart, “Printed Circuit Boards- Design and Technology”, Tata McGraw Hill. Research Papers/Articles recommended for reading:

2. Isaac, J., Weins D.,“Future of PCB Design”, Mentor Graphics Ltd. Suggested Evaluation Methods

B. Continuous Assessment 1.Essential

a. Lab performance b. Lab Report

2.Optional a. Projects b. Seminars

B. End Semester Examination a.Practical examination b. Viva – voce.


S.No. Topic Hours

1 Introduction General Considerations, PCB Sizes, materials used, documentation 8

2

Layout and General Rules Resistance, capacitance, inductance of PCB Conductors, Conductor spacing, realizing supply and ground conductors, component placing and mounting, cooling requirements and package density

10

3

Technology of PCBs Film master production, cleaning, photo printing, plating, etching, mechanical machining operations, soldering techniques, component assembly

10

4 Trends in PCB Design Multilayer boards, multiwire boards, Flexible PCBs, metal core circuits, design and test considerations, surface mount technology

10

5 Automation and Computers in PCB design Limitations of manual design, automated artwork, Computer Aided Design, design automation

7

366


Sub Specialization Committee Name of Member

Mrs. Smita B Khole Parul Garg



Signature


367





______________________________________________________________________


Under Graduate

Course Title: Skill Development Lab Course Code: Number of Credits: 4 Level: 4

Learning Outcomes:

The students are able to: 1. Evaluate problems and analyze data using current technologies in a wide

variety of business and organizational contexts. 2. Create data-driven web applications 3. Incorporate best practices for building applications 4. Employ Integrated Development Environment(IDE) for implementing and

testing of software solution 5. Construct software solutions by evaluating alternate architectural patterns.

Pre-learning: Knowledge of C, C++ and Basic JAVA Course Outline Sr.No. Topics Hours

SD Module-I

Advanced JAVA and Mobile Application Development

ADVANCED JAVA:

1 Data Structures in Java: Enumeration, BitSet, Vector, 6

368


Stack, Dictionary, Hashtable, Properties.

2 Generics and Collection Framework: Generic Methods and Generic Classes. Interfaces (Set, List, Queue, and Dequeue) and classes (ArrayList, Vector, LinkedList, PriorityQueue, HashSet, LinkedHashSet, and TreeSet).

6

3 Serialization and Networking: Serializing an Object and Deserializing an Object, Socket Programming.

6

4 Database Connectivity and Multithreading: SQL, JDBC, Thread life cycle, Thread methods, Thread Pools, Executor Service.

6

5 GUI in JAVA: AWT, Applet, Swing. 6 MOBILE APPLICATION DEVELOPMENT:

1 Introduction to Android: Android Platform Architecture, Basic components of android, Features of ART and Delvik Virtual Machine, Activity Life Cycle, Intents and Intent Filters, Resources, System Permissions, Android Application Structure, Device screen size compatibility, Android Emulator

6

2 User Interface components: Layouts, Recycler View, List View, Grid View and Web view, Input Controls: Buttons, Checkboxes, Radio Buttons, Toggle Buttons, Spinners, Input Events, Menus, Toast, Dialogs, Styles and Themes

6

3 Multimedia, Animation and Graphics: Playing Audio, Playing Video, Rotate Animation, FadeIn/FadeOut Animation, Zoom Animation, Scale Animation, 2D and 3D Graphics.

6

4 Data Storage: Shared Preferences, Internal Storage, External Storage, SQLite Databases, Content provider. and Remote Databases

6

5 Advanced Components of Android: Web App, JSON Parsing, Google Map, GPS, Sensors, Bluetooth/Wi-Fi Connectivity

6

List of Laboratory Assignments for Advanced JAVA 1 Design a system with the help of advance data structures in Java and

enhance the system using collections and generics. 2 Enhance the above system with the help of socket programming use

client server architecture. 3 Enhance above system by using JDBC, Multithreading, concurrency,

synchronous and asynchronous callbacks, ThreadPools using ExecutorService.

4 Transform the above system from command line system to GUI based application

369


List of Laboratory Assignments for Mobile Application Development 1 Download Install and Configure Android Studio on Linux/windows

platform. 2 Design a mobile app for media player. 3 Design a mobile app to store data using internal or external storage. 4 Design a mobile app using Google Map and GPS to trace the location.

Suggested Mini Project on Advanced JAVA and Mobile Application Development Design and develop a mobile app for beginner trekkers by recording the paths from regular trekkers by using, Material Design Pattern for UI, Storage [SQLite database/File/Shared Preference/cloud], 3. Internet connection /Wi-Fi/Bluetooth, GPS and Google Map. Books Recommended

1. “Java: The Complete Reference” , Herbert Schildt, TMG Publication, ISBN 9780070636774 , 7th Edition

2. Java generics and collections, Thomas Powell, O'Reilly Media, ISBN: 0596527756, 2006.

3. Android Studio 2 Development Essentials Paperback by Neil Smyth 4. Android Programming for Beginners Paperback by John Horton

Sr.No. Topics Hours

SD Module-II

PYTHON and DATA Science with R

PYTHON:

1 Python Basics : Data types, Statements and

Expressions, Operators and Math’s, Conditionals, Loops, Strings, List , Tuples , Set Operation, Dictionary (Dict), Date and Times.

7

2 Functions, Packages and Classes: Lambda function, Regular expression, Packages, Files, Exception Handling, Classes ,Objects, Method ,class and instance variable, constructor, destructor, inheritance.

8

3 Numpy and Matplotlib :Array operations, Numpy Side Effects, 2D Numpy Arrays , Numpy Basic Statistics, Universal Function, Matplotlib: Introduction, Simple plots, Line API, Legend API, Figures, Subplots, Axes and Ticks.

7

4 Pandas: Look Ups, Selections and Indexing, Filling Methods, Series operation, Handling NaN values, Mapping, DataFrames, Reading Files, Plotting,Joins, Correlation, Histograms, Rolling calculation, DateTime indexing, Groupping, Aggregate Functions, pandas.IO.Data, Panel.

8

370


DATA SCIENCE WITH R:

1 Introduction to Data Science- What is Data Science? Current landscape of perspectives, Skill sets needed, The Data Science Process life cycle, Role of Data Scientist. Data pre-processing. ETL – extract, transform, and load.

7

2 Introduction to R-What is R? Installation of R. Basic features of R. R Objects. Creating Vectors and Matrices. Getting Data in and out of R. Using different packages related to data science. Managing Data frames and Functions.

7

3 Descriptive Statistics using R - Discrete and continuous random variables, densities and distributions .Data Summarization: Measures of Central Tendency, Measures of Dispersion (quartiles, five number summary, variance, standard deviation), Measures of shape (skewness, kurtosis), Measures of association (covariance, correlation), Outliers. Using R for descriptive statistics and data visualization using ggplot2 package.

8

4 Predictive Analysis using Machine Learning Techniques using R: Machine learning - what, how, where. Supervised, unsupervised and semi-supervised learning. Training, validation, testing, generalization, over fitting. Building a Regression model using R.Features and feature engineering. Using Decision trees, Linear classifiers, Naïve Bayes, Nearest neighbor methods in R packages.

8

List of Laboratory Assignments for PYTHON 1 Getting Started with Python (Example Word count exercise) 2 Build the Hangman Game using Python. 3 Write python code loads the any dataset (example Game_medal.csv),

and plot the graph. 4 Write python code loads the any dataset (example Game_medal.csv),

and does some basic data cleaning. Ask some questions on that data set.

List of Laboratory Assignments for DATA Science with R 1 Getting Started with R installation, R objects and basic statistics. 2 Using R for data preprocessing, exploratory analysis, visualization. 3 Using R for correlation and regression analysis. 4 Data analysis case study using R for readily available data set using

any one machine learning algorithm Suggested Mini Project PYTHON and DATA Science with R

1. Implementing a simple Recommender System based on user buying pattern. 2. Twitter Sentiment Analysis in Python 3. Applying linear regression model to a real world problem

Books Recommended

371


1. “Learn PYTHON The Hard Way”, Zed A. Shaw, Pearson, ISBN: 978-93-325-8210-1, Third Edition, 2017

2. “Fundamentals of PYTHON”, Kenneth A Lambert and B L Juneja, CENGAGE Learning, ISBN:978-81-315-2903-4

3. "The Art of Data Science." A Guide for Anyone Who Works with Data. Peng, Roger D., and Elizabeth Matsui. Skybrude Consulting 200 (2015): 162

4. Evans, James R., and Carl H. Lindner. "Business analytics: the next frontier for decision sciences." Decision Line 43.2 (2012): 4-6

SD Module-III

Advanced JAVA and Data Science with R

ADVANCED JAVA:

1 Data Structures in Java: Enumeration, BitSet, Vector,

Stack, Dictionary, Hashtable, Properties.

6

2 Generics and Collection Framework: Generic Methods and Generic Classes. Interfaces (Set, List, Queue, and Dequeue) and classes (ArrayList, Vector, LinkedList, PriorityQueue, HashSet, LinkedHashSet, and TreeSet).

6

3 Serialization and Networking: Serializing an Object and Deserializing an Object, Socket Programming.

6

4 Database Connectivity and Multithreading: SQL, JDBC, Thread life cycle, Thread methods, Thread Pools, Executor Service.

6

5 GUI in JAVA: AWT, Applet, Swing. 6 DATA SCIENCE WITH R::

1 Introduction to Data Science- What is Data Science? Current landscape of perspectives, Skill sets needed, The Data Science Process life cycle, Role of Data Scientist. Data pre-processing. ETL – extract, transform, and load.

7

2 Introduction to R-What is R? Installation of R. Basic features of R. R Objects. Creating Vectors and Matrices. Getting Data in and out of R. Using different packages related to data science. Managing Data frames and Functions.

7

3 Descriptive Statistics using R - Discrete and continuous random variables, densities and distributions .Data Summarization: Measures of Central Tendency, Measures of Dispersion (quartiles, five number summary, variance, standard deviation), Measures of shape (skewness, kurtosis), Measures of association (covariance, correlation), Outliers. Using R for descriptive statistics and data

8

372


visualization using ggplot2 package.

4 Predictive Analysis using Machine Learning Techniques using R: Machine learning - what, how, where. Supervised, unsupervised and semi-supervised learning. Training, validation, testing, generalization, over fitting. Building a Regression model using R.Features and feature engineering. Using Decision trees, Linear classifiers, Naïve Bayes, Nearest neighbor methods in R packages.

8

List of Laboratory Assignments for Advanced JAVA 1 Design a system with the help of advance data structures in Java and

enhance the system using collections and generics. 2 Enhance the above system with the help of socket programming use

client server architecture. 3 Enhance above system by using JDBC, Multithreading, concurrency,

synchronous and asynchronous callbacks, ThreadPools using ExecutorService.

4 Transform the above system from command line system to GUI based application

List of Laboratory Assignments for DATA Science with R 1 Getting Started with R installation, R objects and basic statistics. 2 Using R for data preprocessing, exploratory analysis, visualization. 3 Using R for correlation and regression analysis. 4 Data analysis case study using R for readily available data set using

any one machine learning algorithm Suggested Mini Project on Advanced JAVA and Mobile DATA Science with R

1. Implementing a simple Recommender System based on user buying pattern. 2. Applying linear regression model to a real world problem.

Books Recommended

1. “Java: The Complete Reference” , Herbert Schildt, TMG Publication, ISBN 9780070636774 , 7th Edition

2. “Java generics and collections”, Thomas Powell, O'Reilly Media, ISBN: 0596527756, 2006.

3. “The Art of Data Science.” A Guide for Anyone Who Works with Data. Peng, Roger D., and Elizabeth Matsui. Skybrude Consulting 200 (2015): 162.

4. “Business analytics: the next frontier for decision sciences.”,Evans, James R., and Carl H. Lindner, Decision Line 43.2 (2012): 4-6.

Pedagogy 1. Demonstration in labs 2. Case Study

373



A) Continuous Assessment k) Assignments l) Mini Project


a) Lab Exam Benchmarked against similar courses in other national/ international universities /organizations

S. No.


1. Skill Development Lab University of Pune 2.


Name of Members


Dr. Swati Ahirrao Mrs. Kalyani Kadam





Signature

Name of Experts Dr. M. L. Dhore

Designation Professor

Org. / Inst. VIT, Pune

Signature


374






Under Graduate

Course Title: Mobile Applications Course Code: Number of Credits: 3 Level: 3 Learning Outcome (s): The students are able to:

1. Investigate technology and trends impacting mobile application development.

2. Develop mobile applications using open source tools. 3. Identify issues related to User Interface Design. 4. Demonstrate mobile application development by integrating with cloud

services. 5. Explore various tools and techniques for mobile application development.

Pre-learning: Knowledge of Mobile Computing, Mobile Operating Systems. Course Outline

Pedagogy

1. Lectures 2. Research papers 3. Workshops

Books Recommended 1. Jeff McWherter, Scott Gowell, Professional Mobile Application Development,

John Wiley &Sons, Ref: www.it-ebooks.org 2. Android Studio Development Essentials, ref: http://www.techotopia.com/

375


S. No. Topics Hours

1.

Introduction: Overview of mobile operating system, types of OS: Android and IOS, characteristics of mobile applications, history of mobile application frameworks, and overview of mobile application development languages: C and Java

8

2.

Mobile Web: Introduction to WAP,WAP Architechture, Wireless Markup Language (WML), Input Methods, Browsers and Web Platforms, Tools for Mobile Web Development

10

3. User interface Design: Overview and theories related to UID, application models, data visualization

7

4.

Application development using cloud: Managing application data, integrating data with cloud services, addressing enterprise requirements for mobile applications – performance, scalability, availability, security

10

5.

Advanced Tools, Techniques: J2ME programming basics, HTML5 Script Extensions, JSON, Code Execution, Cloud based browsers, JS Debugging and profiling, Background Execution, Supported Technologies and API,Standard JavaScript Behavior, Java Libraries, Mobile Libraries, UI Frameworks: JQueryMobile, Montage, iUI, jQTouch

10

376



1. Unit test I 2. Unit test II 3. Projects 4. Quiz


S. No.


1. Mobile Application development Ohio State University 2. Mobile Applications SPPU Pune


Name of Members


Vijayshri Khedkar Aniket Jagtap




Signature

Name of experts: Dr Raj Kamal Signature of Dean: Date:

377






Development

Course Title: Big Data Analytics Course Code: Number of Credits:4 Level : 4 Learning Outcome (s): The students are able to:

1. Differentiate between Name Node, Secondary Name Node, Data Node. 2. Compare MapReduce-1 and MapReduce-2 frameworks for solving Big data

problems 3. Differentiate Hive and RDBMS. 4. Experiment pig queries and examine the performance. 5. Test Sorting, Aggregate functions in HiveQL. 6. Analyze Query execution performance with in-memory databases like Apache

Spark. Pre-learning: Knowledge of Big data, No-SQLis desirable Course Outline S.No. Topic Hours

1 Hadoop Architecture

Hadoop Storage: HDFS, Common Hadoop Shell commands, Anatomy of File Write and Read., Name Node, Secondary Name Node, and Data Node, Hadoop MapReduce paradigm, Map and Reduce tasks, Job, Task trackers - Cluster Setup – SSH &Hadoop Configuration – HDFS Administering –Monitoring & Maintenance, Hadoop ecosystem components - Schedulers - Fair and Capacity, Hadoop 2.0 New Features- NameNode, High Availability, HDFS Federation, MRv2, YARN, Running MRv1 in YARN.

15

378


2 Hive What is Hive?, Architecture of Hive, Hive services, Hive Clients, How it differs from RDBMS, Introduction to HiveQL, Data Types and file formats in Hive, File encoding, Common problems while working with Hive. HiveQL: Managed and external tables, Understand storage formats, Sorting And Aggregating, Map Reduce Scripts, Joins & Subqueries, Writing user defined functions, Data types and schemas, Querying data.

15

3 PIG Concepts of Pig , Installation of a Pig engine, Queries, Case Study

15

4 Apache Spark RDD, RDD Transformations & Meaning, Advanced Spark programming

15

Pedagogy


Books Recommended

1. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop Solutions”, Wiley, ISBN: 9788126551071, 2015.

2. Chris Eaton, Dirk deroos et al. , “Understanding Big data ”, McGraw Hill, 2012.

3. Tom White, “HADOOP: The definitive Guide” , O Reilly 2012. 4. Vignesh Prajapati, “Big Data Analytics with R and Haoop”, Packet Publishing 2013. 5. Tom Plunkett, Brian Macdonald et al, “Oracle Big Data Handbook”, Oracle Press, 2014. 6. http://www.bigdatauniversity.com/ 7. Jy Liebowitz, “Big Data and Business analytics”,CRC press, 2013 Suggested Evaluation Methods

A. Continuous Assessment a) Unit test 1 b) Unit Test 2 c) Assignments d) Presentation e) Quizzes


379



S. No.




Name of Member


Dr. Swati Ahirrao




Signature

Name of Experts Dr. Sandeep deshmukh

Designation Data Analyst

Org. / Inst. freelancer

Signature


380






Under Graduate

Course Title: Optimization Techniques and Algorithms Course Code: Number of Credits: 4 Level: 4 Learning Objective/Outcome (s): The students are able to

1. Explain the use of optimization techniques and understand formulation of design problems 2. Understand the use of modern optimization techniques 3. Explain Genetic Algorithm and its application to various engineering problems 4. Explain Particle Swarm Optimization and Cohort Intelligence Optimization and its

application to various engineering problems

Pre-learning: Knowledge of basic Engineering Mathematics and design of algorithms is desirable. Course Outline: Sr. No. Topics Hours

1

Introduction to Optimization: Introduction to optimum design and what is optimization, engineering applications of optimization, design variables, constraints, objective functions, variable bounds, Formulation of design problems classification of optimization techniques, generalized problems formulation of optimization problem, Concept of global and local minima, problem formulation and graphical optimization method.

10

2

Introduction to Optimization Algorithms: Classification of optimization algorithms (deterministic and stochastic), Introduction to heuristic and metaheuristic algorithms and their differences, Properties & Characteristics of Metaheuristics, Nature inspired optimization algorithm types, Self-organizing systems, different problem classes, Concept of Hybridization of algorithms and No-Free-Lunch Theorem

10

3 Genetic Algorithms: Introduction to Evolutionary techniques, Motivation from the 20

381


Darwinian Evolution , Genetic Algorithm Mechanism , Flow chart Search Operators and their Variations : Crossover, mutation, crossover and mutation rates Selection Schemes: Fitness proportional selection and fitness scaling, ranking, tournament selection, selection pressure and its impact on evolutionary search Applications of Genetic Algorithm and Illustration of the algorithm using relevant problems, Simulated Annealing: Introduction, Flow chart, Algorithm and Features

4

Swarm and Socio-inspired Optimization Particle Swarm Optimization: Introduction to Swarm Intelligence and swarm optimization, mechanism and flowchart, mathematical implementation and Improvement to the Particle Swarm Optimization Method and Applications Cohort Intelligence: Basic Concepts of Socio-inspired class of algorithms, Cohort Intelligence Algorithm (CI) and methodology, Applications (to continuous and combinatorial problems), Variations of CI algorithm.

20

Pedagogy

1. Lectures 2. Case Studies 3. Tutorial

Books Recommended 1. “Nature-Inspired Optimization Algorithms”, 1st Edition, Xin-She Yang, Elsevier 2. “Introduction To Optimum Design”,Jasbir Arora, IIIrd Edition ,Elsevier Academic Press 3. “Optimization for Engineering Design: Algorithms and Examples”, Kalyanmoy Deb, PHI

Learning 4. Genetic algorithms in search, optimization and machinery, Goldberg, D., Barnen, Addison-

Wesley, NewYork 5. Cohort Intelligence: A Socio-inspired Optimization Method, Kulkarni A.J., Abraham A. and

Krishnasamy G., Springer 6. Engineering Optimization: methods and applications, Ravindran A., Raqsdell K.,John Wiley

and Sons, New Jersey

Suggested Assessment/ Evaluation Methods A. Continuous Assessment

a. Unit Tests b. Assignment c. Mini Project d. Case Study


382



S. No.


1 Optimization Theory and Applications

Nanyang Technological University, Singapore

Name of Members

Prof Meeta Kumar


Dr. Anand Kulkarni


Associate Professor

Associate Professor


Symbiosis Institute of Technology


Signature

Name of Expert

Dr. Anand Kulkarni


383






Under Graduate

Course Title: Wireless Sensor Networks Course Code: Number of Credits: 4 Level: 4 Learning Outcome (s): The students are able to:

1. Explain basic network architecture and the execution platform (hardware and OS) in Wireless Sensor Networks (WSN).

2. Explore routing protocols intended for various applications in WSN. 3. Simulate clustering in WSN. 4. Demonstrate localization algorithms and indoor mapping using tag and

anchor nodes. 5. Develop deeper understanding on important research problems in WSN.

Pre-learning: Knowledge of wireless communication may be beneficial but not compulsory.

384


Course Outline

Pedagogy

1. Lectures 2. NPTEL

Books Recommended 1. H. Karl and A. Willig, Protocols and Architecture for Wireless Sensor

Networks, Wiley Publisher. 2. Raghvendra, Cauligi S, Sivalingam, Krishna M., Zanti Taieb, Wireless Sensor

Networks, Springer. 3. Kazem, Sohraby, Daniel Minoli, Taieb Zanti, Wireless Sensor Networks:

Technology, Protocols and Applications, John Wiley & Sons, ISBN:978-0-471-74300-1.

Suggested Assessment/ Evaluation Methods A. Continuous Assessment (CA) 1. Unit test I 2. Unit test II 3. Presentations 4. Projects 5. Assignments. 6. Quiz.

S. No. Topics Hours

1.

Introduction: Overview of sensor networks, Adhoc networks, Mobile Adhoc Networks (MANET), Vehicular Adhoc Network (VANET), Design principles of WSN, network architecture, hardware platform and motes, introduction to network simulator

10

2.

Protocols in WSN Routing in WSN, routing protocols: energy-efficient routing protocols, geographical routing protocol, data centric routing protocols, opportunistic routing, IEEE 802.15.4, Zigbee

15

3.

Clustering in WSN Clustering overview, rationale behind clustering, clustering in WSN, Applications and case studies based on clustering, three best clustering algorithms

10

4.

Localization in WSN Localization and positioning, various localization techniques and algorithms, Simultaneous Localization And Mapping(SLAM), Indoor Localization

10

5.

Research problems and ongoing challenges Coverage problem, energy harvesting, duty-cycling, QoS management, security challenges: possible attacks, attack modelling, dynamic key distribution, data aggregation and data compression

15

385


B. End semester evaluation

Written exam



1. Wireless Sensor Networks University of Rochester 2. Wireless Sensor Networks NIT Jalandhar


Name of Members


Vijayshri Khedkar Aniket Jagtap




Signature

Name of experts: Dr Parag Kulkarni Signature of Dean: Date:

386






Development

Course Title: Predictive Analytics Course Code: Number of Credits : 4 Level : 4 Learning Outcome (s): The students are able to: 1. Analyze how statistical methods of measures relationships and distribution can predict the data. 2. Examine the different methods of regression for developing predictive model. 3. Discover the supervised learning methods of classification and compare their predictability. 4. Discover the unsupervised learning methods of clustering and dimensionality reduction and examine their predictability. 5. Implementing the different algorithms with a statistical tool. Pre-learning: Knowledge of Big data, No-SQL and Big Data Analytics Course Outline S.No. Topic Hours

1 Statistics in Prediction Bi-variate measures of relationship: correlation and regression, Sampling, sampling distribution (z,t,f, chi-squared statistic), Hypothesis Testingand Anova Demonstration of techniques on statistical tool

20

2 Prediction with Regression and Time Series Analysis Simple Linear Regression, Multiple Linear Regression, Logistic regression Time Series Analysis Demonstration of techniques on statistical tool

10

387


3 Supervised Learning Methods Statistics vs. Machine Learning, Structure of a Machine Learning Problem, Classification with Simple Rule, Learning Rules, Decision Tree algorithms, Random Forest method, Naive Bayesian Classifier Demonstration of techniques on statistical tool

15

4 Unsupervised learning Methods Introduction to unsupervised learning methods, clustering techniques, K-means algorithms,DBSCAN algorithm, dimensionality reduction with Principal component Analysis Demonstration of techniques on statistical tool

10

5 Case study: Application using Predictive Analytics Techniques and Tools

5

Pedagogy


Books Recommended 1. “Data Analytics”, Anil Maheshwari, Tata McGraw Hill.

2. “Mastering Predictive Analytics with R”, Rui Miguel Forte, Packt Publishing Ltd, (2015)


a) Unit Tests b) Seminars c) Quizzes



S. No.


1 Predictive Analytics University of California ,Irvine 2. Data Anaytics and Visualization New York University

Name of Member


Dr. Swati Ahirrao




Signature

388


Name of Experts Dr. Parag Kulkarni

Designation Professor and Founder

Org. / Inst. iKnowlation Ltd

Signature


389






Under Graduate Course Title: Machine Learning Course Code: 70122811 Number of Credits: 4 Level: 5 Learning Outcome (S): The students are able to:

1. Develop an appreciation for what is involved in learning from data, 2. Formulate the mapping of a wide variety of pre-processing involved in

learning algorithms to industry system’s data,

3. Summarize the analysis given by validated learning algorithms, 4. Explain ANN algorithms to achieve signal processing, optimization,

classification and the advantages and limitations of the machine learning concepts,

5. Plan and execute successful machine learning and data mining projects, including selecting an adequate process for specific task and avoiding the main machine learning pitfalls. Also recognize when machine learning and Text-mining tools are applicable for specific system.

Pre Learning: Data Mining, Text Mining, Statistics and Probability, Programming skills Course Outline

S. No. Topics Hours

Unit I Introduction of Machine Learning concepts: Definition of learning systems. Goals and applications of machine learning. Aspects of developing a learning system: training data, concept representation, function approximation. Inductive Classification: The concept learning task. Concept learning as search through a hypothesis space. General-to-

10

390


specific ordering of hypotheses. Finding maximally specific hypotheses. Version spaces and the candidate elimination algorithm. Learning conjunctive concepts. The importance of inductive bias.

2 Decision Tree Learning: Representing concepts as decision trees. Recursive induction of decision trees. Picking the best splitting attribute: entropy and information gain. Searching for simple trees and computational complexity. Over fitting, noisy data, and pruning. Translating decision trees into rules.

10

3 Evaluation of Learning Algorithms: Measuring the accuracy of learned hypotheses. Comparing learning algorithms: cross-validation, learning curves, and statistical hypothesis testing.

15

4 Introduction of Artificial Neural Networks: Neurons and biological motivation. Linear threshold units. Perceptron: representational limitation and gradient descent training. Multilayer networks and back propagation.

10

5 Outline of Bayesian Learningconcepts: Probability theory and Bayes rule. Naive Bayes learning algorithm. Parameter smoothing. Generative vs. discriminative training. Logistic regression. Overview of Text Classification models, learning from unclassified data and Support Vector Machines.

15

Pedagogy:

● Interactive classroom teaching ● Seminars

o Use of softwares such as SVMLite, XLMiner, Rapid Miner, Weka ● Mini projects

Books Recommended

● “Machine Learning” by Tom M. Mitchell, 2006 edition ● “Neuro - Fuzzy and soft computing: a computational approach to learning

and Machine intelligence” by Jyh - Shing ROger Jang/ Chuen - Tsai Sun/ Eiji Mizutani, 2010

Suggested Evaluation Methods: Online assignments, analysis of research papers and their results, lab and written paper / exam Benchmarked against similar courses in other national/ international universities /organizations: S.No

Name of the course Institute where it was offered

1 M.Tech (Advanced computing) Maulana Azad National Institute of Technology – NIT Bhopal

2 M.Tech programme in CSE Centre for Development of Advanced Computing, Noida

391


3 M.Tech Computer Science &

Engineering NIT, Warangal

4 M.Tech Advanced Computing Sastra University, Thanjavur Sub-specialization committee: Name of Member Dr.Shraddha Phansalkar Shruti Patil Preeti Mulay

Designation AP CS/IT AP CS/IT AP CS/IT Org. / Inst. SIT SIT SIT Signature

Name of the Expert: Dr. Parag Kulkarni Signature of Dean : Date:

392






Under Graduate

Course Title: Internet of Things Course Code: Number of Credits: 4 Level: 4 Learning Outcome (s): Students are able to:

1. Learn and explore the basics of networking. 2. Experience data collection from sensors using microcontroller device. 3. Demonstrate understanding on CoAP and MQTT protocols. 4. Develop clear understanding on IoT Cloud integration. 5. Explore on IoT privacy issue and Blockchain.

Pre-learning: Knowledge of Operating system and Computer network is essential.

393


Pedagogy 1. Lectures 2. Projects 3. Research paper discussions

Course Outline

Books Recommended

1. Raj Kamal, Internet of Things Architecture and Design principles, McGrawHill. 2. Olivier Hersent, David Boswarthick, Omar Elloumi, The Internet of Things: key

applications and protocols, Willey publication. 3. Research papers.

S. No. Topics Hours

1.

Overview of Internet of Things Networking basics: TCP/IP, IPv6 and concept of socket and web socket, IoT definition, IoT conceptual framework, Technology behind IoT, M2M Communication, Key technology enablers:NFC, RFID and Bluetooth Low Energy(BLE)

5

2.

Sensors and IoT microcontroller Sensor technology, serial port interface with microcontroller, types of sensors: temperature, humidity, accelerometer, gyroscope, CO sensor, CO2 sensor, VoC sensor, LIDAR Participatory sensing: Case studies of Industrial IoT and Automotive IoT Multi-sensor data fusion

15

3.

Communication and messaging protocols Basic definitions related to web connectivity, Constrained RESTful environment, Constrained Application Protocol(CoAP), Message Queuing Telemetry Transport (MQTT) protocol, 6LoWPAN, LoRaWAN, Z-Bee and Z-Wave

15

4.

IoT Middleware and computing Cloud computing for data storage and computing, Integration of IoT and Cloud computing, Sensing-as-service architecture, IoT middleware, contextualization, context-aware computing, Fog computing, edge computing, case studies and research paper discussions

15

5.

IoT privacy and security challenges Basics of privacy and vulnerabilities in IoT, security requirements, identity management issue, privacy issue in healthcare, Smart City and Smart Grid, lightweight security protocols: homomorphic encryption and lattice-cryptography, Blockchains.

10

394


Suggested Assessment/ Evaluation Methods 1. Unit test I 2. Unit test II 3. Projects 4. Presentation 5. Quiz.


S. No.


1. Internet of Things Uppsala University Sweden 2. Internet of Things Virginia University


Name of Members


Vijayshri Khedkar Prachi Kadam




Signature


395







President of India) _____________________________________________________________________



Course Title : Smart Urban Planning Course Code : 070121630 Number of Credits : 03 Level : 01 Learning Outcome (s): Students are able to

1. State the objectives and principles of town planning. 2. List the different stages in town planning with their settlement patterns and

physical forms and explain the physical planning process with surveys and plan, land-use planning.

3. Discuss different planning standards for the physical planning of a town. 4. Describe the spatial aspects of planning for rural and urban settlements. 5. Describe the physical growth characteristics and the relative socio-economic

consequences. 6. Discuss the different levels in planning like development plan, regional plan

with their characteristics. 7. Discuss the role different organizations involved in planning. 8. Discuss the role of acts regulation in the field of planning. 9. Explain different types of landscaping with application in modern and

historical eras. 10.Locate and prepare the layout plans, neighbourhood plans, town planning

schemes for the different case studies. 11.Discuss the conservation-preservation of old core area of a city.

Pre-learning: Nil

396


Course Outline: Sr No. Topic Hours

1

Introduction to Town Planning: Brief history of human settlements, from stone age and milestones, objective of town planning, principles, stages in town development, growth of towns settlements in prehistoric, Vedic, Harappan, settlements and their physical forms during various dynasties up to 18th century and during colonization (case studies - Jaipur, New Delhi etc.), town planning after independence (case studies - Chandigarh, Gandhinagar etc.)

4

2

Theory of Urban Planning: The physical planning process and the relation between surveys and plan, land-use planning, determinants of land use and of spatial patterns of urban land uses, concentric zone model, sector model, multiple nuclei model etc., economic base of the city, sectors of the urban economy and base identification etc. various surveys for physical planning and techniques of analysis realization of the plan, the parts of the town and their relationship, planning standards, site layout and development, zoning and density control

6

3

Spatial Aspects: Settlements–rural and urban settlements in their regional setting hinterlands, towns and cities their geographical characteristics, urban concentrations and growth characteristics factors, historical, administrative, location, economic, socio-economic consequences, the essential characteristics of city/town, importance of morphological aspects in town planning, geological factors affecting urban development, urban geological factors governing the growth of ancient cities

6

4

Levels In planning- regional/city/neighborhood :City development plan: scope & purpose , surveys- demographic, housing, land use, etc., traffic; transport- urban road objectives, classification, traffic management, legislative mechanism for development plan (DP), MRTP, planning agencies for various levels of planning, their organization and purpose (CIDCO-MHADA-MIDC), introduction to land acquisition, UDPFI (for land use, infrastructure etc.), SEZ

4

5

Landscaping: Environmental art and design for urban landscape, objectives, principles, elements, material, soft landscaping, hard landscaping, and garden styles, modern and historical, water body conservation and creation

4

6

Planning Studio: Planning insight and acquaintance with various planning related exercises such as, layout planning, neighborhood planning, town planning scheme for planned urban extension, conservation-preservation of old core area of a city

4

Pedagogy

1. Multimedia technique presentations on growth of towns settlements in prehistoric, Vedic, Harappan, settlements and their physical forms

2. Interactive sessions on physical planning stages of a city

397


3. Seminar on spatial aspects of Indian cities like Chandigarh, Gandhinagar , Jaipur, New Delhi

4. Brainstorming sessions on conservation-preservation of old core area of a city

5. Case studies on planning of existing cities with different planning concepts and forms

Books Recommended

1. Methushoba Mohan, Principles of architechture, Oxford University Pres. 2. G. K. Hiraskar, Town planning, Dhanpat Rai Publications. 3. S. Rangwala, Town planning, Charotar Publishing House, Anand. 4. Emerald Architecture: case studies in green buildings: - ISBN 978-0-07-

154411-5.

Suggested Assessment/ Evaluation Methods A. Continuous Assessment

a. Unit test b. Assignments c. Presentation d. Quiz a. Surprise test

B. End Semester Examination Course Outcomes: The student will be able to

CO1: State the objectives and principles of town planning. CO2: Discuss different planning standards for the physical planning of a town. CO3: Describe the spatial aspects of planning for rural and urban settlements. CO4: Discuss the different levels in planning like development plan, regional

plan with their characteristics.

CO5: Explain different types of landscaping with application in modern and historical eras.

CO6: Locate and prepare the layout plans, neighborhood plans, town planning schemes for the different case studies.



CO1 3 - - - - 1 - 1 2 1 1 1 1 1

CO2 - - - 2 - 1 - 1 1 1 1 1 1 1

CO3 - - - - - 1 - 1 1 1 1 1 2 1

398


CO4 - - - 1 - 1 - 1 1 1 1 1 1 1

CO5 - - 2 - - 1 - 1 1 1 1 1 1 2

CO6 - - - 2 - 1 - 1 1 1 1 1 1 1


S. No.


1 Town & Country Planning SavitribaiPhule Pune University 2 Architecture and town planning Mumbai University

Name of Members

Prof. Vaishnavi Dabir

Prof. Dhanya N


Assistant Professor


Signature

Name of Experts

Dr. Kanchan Khare

Prof. S.R Pathak

Designation Professor Professor

Org. / Inst. SIT COE Pune

Signature

Signature of Dean: v Date:

399




Founder: Prof.Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India)



President of India) _____________________________________________________________________



Course Title : Water Resource Planning and Management Course Code : 070121631 Number of Credits : 03 Level : 01 Learning Outcome (s): Students are able to 1. Summarize the basic concept and terminologies associated with water

resources engineering. 2. Identify the role of disciplines of ecology and socioeconomics play in

management of water resources. 3. Define the concept of Integrated Water Resources Management within the

broader context of development. 4. Describe the private sector involvement in water resources management. 5. Recognize and explain the links between water and human health. 6. Distinguish blue and green water and its role in food production. 7. Illustrate the principles of international and national law in the area of water

management.

Pre-learning: None

400


Course outline: Sr. No.

Topic Hours

1

Context for IWRM

Water as a global issue: key challenges and needs, definition of IWRM within the broader context of development, complexity of the IWRM process, examining the key elements of IWRM process

6

2

Water economics

Economic view of water issues: economic characteristics of water good and services, non-market monetary valuation methods, water economic instruments, policy options for water conservation and sustainable use, pricing: distinction between values and charges, private sector involvement in water resources management: PPP objectives, PPP options, PPP processes, PPP experiences through case studies, links between PPP and IWRM

8

3

Water supply and health within the IWRMconsiderations

Links between water and human health: options to include water management interventions for health, health protection and promotion in the context of IWRM, health impact assessment of water resources development

8

4

Water legal and regulatory settings

Basic notion of law and governance: principles of international and national law in the area of water management, understanding UN law on non-navigable uses of international water courses, development of IWRM in line with legal and regulatory framework

8

Pedagogy 1. PowerPoint presentation on the global food security and public-private

participation issues and legal and regulatory settings, in the context of IWRM 2. Interactive classroom teaching on different topics like ‘blue’ versus ‘green’

water debate 3. On site study visit for better understanding of different irrigation methods 4. Case study of different innovative methods employed to manage water

resources efficiently

401


Books Recommended

1. Dr. Modi P.N.: Irrigation, Water Resources & Water Power Engineering. 2. Punmia: Irrigation & Water Power Engineering. 3. Garg S.K.: Irrigation & Water Power Engineering. 4. Dahigaonkar J.G.: T.B. of Irrigation Engineering, Wheeler & Co.


A. Continuous Assessment a. Unit test b. Assignments c. Presentation d. Quiz e. Surprise test

B. End Semester Examination a. Written Exam b. Viva-voce


CO1: Summarize the basic concept and terminologies associated with water resources engineering

CO2: Identify the role of disciplines of ecology and socioeconomics play in management of water resources.

CO3: Recognize and explain the links between water and human health.

CO4: Illustrate the principles of international and national law in the area of water management.



CO1 3 - - - - 1 - 1 1 1 2 1 2 1

CO2 3 - - - - 3 3 2 1 1 2 1 2 2

CO3 3 - - - - 2 3 2 1 1 2 1 2 2

CO4 3 - - - - 1 - 1 1 1 2 1 1 1


402


S. No.


1 Integrated Water resources development

IIT Roorkee

2 Integrated Water resources development and Management

SavitribaiPhule Pune University

Name of Members

Dr. Sayali Apte

Prof. Vaishnavi

Dabir


Assistant Professor


Signature

Name of Experts

Dr. Kanchan Khare

Prof. S. N. Londhe

Designation Professor Professor

Org. / Inst. SIT VIIT Pune.

Signature


403







Course Title: Programming in C Course Code: Number of Credits : 3 Level : Learning Outcome (s): The students are able to: 1. Understand the basic concepts of C Programming for problem-solving. 2. Illustrate the C data types, syntax and constructs. 3. Illustrate C for decision making, branching and looping statements. 4. Understand the concept of Array and Strings to solve different problems. 5. Apply the concepts of Function modules, its usage and memory allocation using Pointers. 6. Understand the concepts of structures and unions: declaration, initialization and implementation. Course Outline S.No. Topic Hours

1 Programming Concepts History of C, Middle level language, compiler, interpreter, character set, pseudo code, Algorithms, constants, variables , keywords, data types, operators and expressions, input / output operations, C Pre-processor and Macros, decision making, branching and looping statements.

7

2 Arrays and Strings Arrays: introduction, one dimensional array and two dimensional arrays: declaration, initialization, programs using arrays. Strings: introduction, declaration, initialization and read/ write operations of strings, string operations.

10

3 Functions Introduction, function definition and declaration, arguments and parameters, local variables and global variables, parameter passing mechanisms: call by value and call by reference, recursion and storage classes.

10

4 Structures and Unions 10

404


Introduction, structure definition, declaration and initialization, operations on structure variables, arrays of structures, nested structures, structure pointers

5 Pointers Introduction, declaration and initialization of pointer variables, dynamic memory allocation functions.

8

Pedagogy

1. Classroom teaching 2. Worksheets 3. Class tests/quiz




a) Unit Tests b) Quizzes



S. No.



Name of Member

Prof.Shilpa Gite Prof.Dipti Kapoor Sarmah



Signature

Name of Experts Dnaneshwar Suryavanshi Designation Sr. Tech.Leader Org. / Inst. Persistent Technologies Signature


405






Accredited by NAAC with ‘A’ Grade Founder: Prof. Dr. S. B. Mujumdar, M.Sc., Ph.D. (Awarded Padma Bhushan and Padma Shri by




Course Title : Environmental Science Course Code : 070121204 Number of Credits : 02 Level : 01 Learning Objective/Outcome (s): The students should be able to: 1. Understand about sustainable technologies for resource conservation. 2. Identify sources, effects and remedial measures for different pollutions. 3. Identify and formalize a generalized water and wastewater treatment process. 4. Identify various sources of solid wastes, their effects and latest management techniques. 5. Know about existing environmental laws and legislations and related case studies Pre-learning: None Course Outline Sr.No. Topics Hours

1.

Multidisciplinary Nature of Environmental Studies: Definition, scope, environment and its relation to the branch. Introduction to basic terminologies. Sustainable development, natural resources and associated problems- water, solar, mineral and energy. Water

07

406


conservation, rain water harvesting. Resettlement and rehabilitation of people; its problems, concerns and case studies

2

Natural resources and environmental pollution: Definition, causes, effects, control measures and case studies of (a) Water pollution (b) Soil pollution (c) Marine pollution (d) Noise pollution (e) Thermal pollution (f) Nuclear pollution. Disaster management: floods, earthquake, cyclone and landslides

06

3

Treatment and Disposal: Overview of water and waste water treatment method-A generalized flowchart of water and wastewater treatment, overview of solid waste disposalmethods

05

4

Towards sustainable future

Concept of sustainable development, Threats to Sustainability, Population and its explosion, Crazy Consumerism, Over exploitation of resources, Strategies for Achieving Sustainable development, Environmental Education, Conservation of Resources, Sustainable Cities and communities, Human health, Role of IT in Environment, Environmental Ethics, Environmental Economies, Concept of green building, Clean development Mechanism

06

5

Environmental Legislations and case studies :

Environmental ethics: Issues and possible solutions. Case studies. Wasteland reclamation. Consumerism and waste products. National: Environment Protection Act, Air (Prevention and Control of Pollution) Act, Water (Prevention and Control of Pollution) Act, Wildlife Protection Act, Forest Conservation Act. International: Montreal protocol, Kyoto protocol, Rio summit and Paris agreement. Issues involved in enforcement of environmental legislation

05

Pedagogy

1. Interactive classroom teaching

407


2. Assignments 3. Group discussions 4. Movies and videos

Books Recommended

1. Chokkan, K.B., Pandya, H. &Raghunathan, H. (eds). 2004. Understanding Environment. Sagar Publication India Pvt. Ltd., New Delhi.

2. Elliot, D. 2003. Energy, Society and Environment, Technology for a Sustainable Future. Routledge Press.

3. Leopold, A. 1949. The Land Ethic. pp. 201-214. Chicago, USA. 4. National Research Council (NRC).1996. Linking Science and

Technology to Society's Environmental Goals. National Academy Press. 5. S. K. Garg. Sewage Disposal and Air pollution Engineering. Khanna

Publishers. 6. M. N. Roa, H. V. N. Rao. Air Pollution. Mc.Graw Hill. 7. C. S. Rao. Environmental Pollution Control Engineering. New Age

International publishers. 8. Iqbal H. Khan, Naved Ahsan. Textbook of Solid Wastes Management.

CBS Publisher & Distributors P Ltd. Suggested Assessment/ Evaluation Methods

a. Unit tests b. Duet Assignments (Presentation) c. File d. Group Discussion


CO1: Understand about sustainable technologies for resource conservation CO2: Identify sources, effects and remedial measures for different pollutions CO3: Identify and formalize a generalized water and wastewater treatment

process CO4: Identify various sources of solid wastes, their effects and latest

management techniques

CO5: Know about existing environmental laws and legislations and related case studies.



CO1 3 1 1 - - 2 3 1 1 2 - 2 1 1

408


CO2 1 - - - - 1 1 1 1 2 - 1 2 2

CO3 2 2 1 2 1 3 3 1 1 2 - 2 2 2

CO4 3 1 1 2 2 2 3 1 1 2 - 1 2 2

CO5 2 1 - 1 - 2 2 1 1 2 - 1 1 1


S. No.


1. Environmental Science Pune University

2. Environmental Studies University of Mumbai

Name of Members

Prof. Mugdha Kshirsagar

Prof. Sayali Apte

Designation Assistant Professor Assistant

Professor


Signature

Name of Experts

Dr.Kanchan Khare

Designation Professor

Org. / Inst. SIT

Signature


409







Course Title: Programming in C Lab Course Code: Number of Credits : 1 Level : 1 Learning Outcome (s): The students are able to: 1 Understand the programming in IDE (Integrated Development Environment)

and write, execute and debug simple programs. 2 Interpret the programming tasks logically and understand making the pseudo-

code and flowchart. 3 Design and implement basic programming solutions including statements,

macros, control structures and methods. 4 Understand and apply the concept of Array and Strings to solve problem

statement. 5 Understand the concepts of Function modules, its usage and memory

allocation using Pointers 6 Understand and apply the concepts of structures and unions: declaration,

initialization and implementation. 7 Identify computational problems, classify tasks and execute it in a group as a

mini-project. Course Outline S.No. Topic Hours

1 Design and develop a flowchart or an algorithm that takes three coefficients a,b and c of a quadratic equation (ax2+bx+c=0) as input and compute all possible roots. Implement a C program for the developed flowchart/algorithm and execute the same to output the possible roots for a given set of coefficients with appropriate messages.

2

410


3 Write a C program to find the roots of a quadratic equation. 2 4 Write a C Program to relate two integers using =, > or < using

nested ifs & multiple ifs. 2

5 Write a C program to find whether (using switch case) (a) A given number is prime or composite. (b) A given number is even or odd.

2

6 Write a C program to generate the Fibonacci Series for a given number ‘n’.

2

7 Write a C program of binary search for a user-given element in a set of ‘n’ numbers.

2


2

10 Write a C program to accept a string from console and to display the following on console (without using built-in functions): (a) Length of the string (b) Total number of characters in the string (c) Total number of vowels in the string (d) Copy one string into the other.

2

11 Write a C program using functions to accept two strings from the console and perform the following operations (without using built-in functions): (a) Compare the strings: equal/not equal (b) Find the longer string. (c) Concatenate the two strings. (d) Find occurrence of substring in the main string

2


2

13 Write a C program of selection sorting using functions. 2 14 Write a C program to find the factorial of a number using

recursion. 2

20 Write a C program using structures to print the pay slip of an employee after accepting details like id. no, name, designation, department and basic salary.

2

23 Mini-Project 4 Pedagogy

4. Class room teaching 5. Practical using tools like Dev C++, Turbo C

6. Conceptual execution in Mini-Projects

Books Recommended 4. “Let Us C”, Yashvant Kanetkar, 12th Edition, 2012, BPB Publications

411


5. “Programming in ANSI C”, E. Balagurusamy, Sixth Edition, 2013, McGraw-Hill Education.

6. “The C Programming Language”, Kernighan, Ritchie, Prentice Hall of India.


a) Assignments b) Quizzes c) Mini Project d) Presentation



S. No.



Name of Member

Prof.Shilpa Gite Prof.Dipti Sarmah



Signature




Signature


412



(Established under section 3 of the UGC Act 1956)

Re - accredited by NAAC with ‘A’ Grade Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India)



President of India) _________________________________________________________________________

__Faculty of Management___ Sub Committee - Specialization for Curriculum Development

For Under Graduate

Course Title: Creative Thinking Course Code: T 6478

Number of Credit: 1 Level:

Learning Outcome

By the end of this course student will be able to

• Understand the importance of R directed thinking complementing L directed thinking • Infer and discover processes and methods of creative problem solving • Enhance and correlate their creative and innovative thinking skills • Understand various disruptive innovations and techniques • Analyze and apply various tools of creativity to some basic problems

Pre-learning: NA

Course Outline The course content will encompass following topics

413


Session No.

Topic Teaching hours

1 Introduction to Creativity and Innovation 1 hr Creativity V/s. Innovation Creativity as thinking skill Critical Thinking V/s. Creative Thinking Lateral Thinking Engineering and Creativity Creativity in Problem Solving

2 TOOLS FOR CREATIVITY: Brain storming Mind mapping SWOC Analysis Fishbone diagram Six thinking hats 1 hr Borrowing brilliance 30 mins Da Vinci’s seven principles 30 mins Provocation and movement 30 mins Examples and case studies 1 hr 3 WHOLE NEW BRAIN 30 mins L directed thinking V/s. R directed thinking From agriculture age to Industrial age to Information age to

Conceptual Age

Need to high touch – design, story symphony, empathy, play, meaning

4 SKILLS FOR DISRUPTIVE INNOVATORS 2 hr Introduction Associating Questioning Observing Networking Experimenting Putting skills into practice Case studies 5 MEDICI EFFECT 3 hr Introduction Intersection Creating medici effect Making intersectional ideas happen Case studies

414


6 TRIZ INNOVATION 1 hr Introduction Ideality Resources Contradictions Pattern of innnovation Case studies 7 BIO MIMICRY 1 hr Introduction Design of various products inspired by nature like Green

building, bullet train, Nike Clothing, Velcro, Adhesive Tape, Turbine, selfheating plastic, friction reducing swimming suit, automated robot, screen display, deep blue.

8 JUGAAD INNOVATION: 2 hr Introduction Jugaad tactics: Seek Opportunities in Adversity, Do more with

less, Think and act Flexibly, Keep it simple, Include the margin, Follow your heart.

Case studies 9 CASE STUDY BY IDEO DESIGN THINKING MODEL 1 hr Self-study content will be declared at the commencement of the

course. Approximately 10% of the assessment will be upon this content

TOTAL 15 Hours

Pedagogy Around 10% of the questions will be asked from self-study content. Content for self-study is - Six Thinking Hats. Students are expected to study above mentioned topic on their own. This topic will not be taught in the classroom. Students should refer to books available in the library for the same.

Books Recommended

1. Daniel H. Pink, A whole new mind, Pearson publication, New Delhi 2. Benyus, J.M.1997. Biomimicry:Innovation Inspired by Nature, HarperCollins,New

York 3. Technical Innovation Center Inc, USA Altshuller G (1997) 40 Principles. TRIZ

Keys to Technical Innovation. Technical Innovation Center Inc, USA Andrews P 4. Kelly, Tom (2001): The Art of Innovation, Lessons in Creativity from IDEO,

America’s Leading Design Firm, Doubleday, NY 5. Tina Seelig, Ingenius, A Crash course on Creativity Hayhouse, U.K

415


6. Edward de Bono, Lateral Thinking, Be more creative and productive, Penguin India 7. Edward de Bono, Teach Yourself to Think, Penguin India 8. Edward de Bono, Six Thinking Hats, Little Brown and Company 9. Jonah Lehrer, Imagine, How creativity works, Canongate, Edinburgh, London 10. John Adair, The Art of Creative Thinking, Kogan Page India, New Delhi 11. Jeff Dyer, Hall Gregersen & Clayton M. Christensen, The Innovator’s DNA,

Harvard Business Publishing 12. Daniel Goleman, Emotional Intelligence, Bloomsbury Publishing India P.Ltd.] 13. Howard Gardner, Five Minds for the Future, Harvard Business Review Press 14. Malcolm Gladwell, Blink: The Power of Thinking Without Thinking, Hachette

Book Group USA 15. Navi Radjou, Jaideep Prabhu, Simone Ahuja, Jugaad Innovation, Wiley Publisher Website References: 1. Ideo.com 2. Asknature.org 3. Edwdebono.com 4. Triz40.com

Note: The latest edition of books should be referred.

Innovation. Suggested Assessment/ Evaluation Methods

Course outcomes CO 1 Understand the importance of right brain directed thinking complementing left brain

directed thinking CO 2 Infer and discover processes and methods of creative problem solving CO 3 Enhance and correlate their creative and innovative thinking skills CO 4 Understand various disruptive innovations and techniques CO 5 Analyze and apply various tools of creativity to some basic problem

CO-PO MAPPING CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 1 - 3 1 - - - - 3 1 3 - 2 - - 2 2 3 2 - 1 - 1 - 3 3 - 2 - - 3 1 3 2 2 - - 1 - 3 2 - - - - 4 2 3 2 2 2 - 1 - 3 2 - - - - 5 2 3 2 - - - - - 3 2 - - - -

416



S. No.


Name of Members

Dr. Arundhati Warke

Designation Professor and HOD

Org. / Inst. SIT

Signature

Signature of Dean:

Date:

417



Specialization: Computer Science (CS)

Course Name : Programming and Problem Solving

(UG/PG) : UG


Level : 2

Subject category Computer science (CS)

Learning Outcomes:


1. Understand and develop Computational Thinking concepts

2. Understand the programming in IDE (Integrated Development Environment) and write, execute and debug simple programs.

3. Understand basic Python Programming, functions, patterns, algorithmic constructs etc.

4. Understand and apply object oriented programming concepts

Pedagogy:

1. Class room teaching

2. Practical Assignments

418


Course outline :

Sr. No. Topic Hours

1 Introduction of Problem Solving:

Objectives and outcomes of Computational Thinking, How is Computational Thinking used, Concepts of logical Thinking and Algorithms, Flow charts ,Objectives of Problem Solving, Defining a problem, devising solutions.

Conceptual introduction: topics in computer science, algorithms; modern computer systems: hardware architecture, data representation in computers, software and operating system

6

2 Basics of Python:

Python Interface, when to use Python, comments, literal constants, numbers, variable, identifier naming, data types, strings, basic I/O statements, logical and physical line, indentation, operators and expressions, tuples, dictionary, lists: indexing, slicing, basic methods, control flow: conditionals and iterators

6

3 Functions and Modules:

Function parameters, local statement, global statement, default argument values, keyword arguments, VarArgs parameters, return statement, recursive functions, Docstrings, byte compiled .pyc files, the from..import statement, module’s name, making your own module, dir function, packages

8

419


4 Classes and Objects

Defining your own classes, superclasses, subclasses, inheritance, searching for missing class components, creating objects, class attributes: class variables and instance variables, defining, adding and removing attributes, explicit constructor invocation, class methods: defining and using, the self parameter meaning and usage, inheritance and overriding, finding class/object components, single inheritance vs. multiple inheritance

10

Books Recommended:

Karl Beecher, “Computational Thinking: The Beginners Guide To Problem solving & Programming”, Publisher: BCS, The Chartered Institute for IT (11 August 2017).

Martin C Brown, “Python The Complete Reference” McGraw Hills

Recommended Evaluation Methods:



1. Essential

a. Unit Tests

b. Assignments

420



a. Written Exam

Parallel/Similar courses in the existing curriculum:

S.No. Name of the course Institute where it was offered

1 Introduction to Computational Thinking and Data Science

MIT, USA

2 Programming for Everybody (Getting started with Python)

Coursera

Sub Specialization Committee

Name of Member

ShilpaGite Gagandeep Kaur



Signature

421



Accredited by NAAC with ‘A’ Grade Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and

Padma Shri by President of India) _________________________________________________________

Computer Science and Engineering Under Graduate

Course Title: Software tool

Course Code:


Level: 1



• Understand the function of various MS-Excel commands.

• Create different types of graphs and charts using Ms. Excel.

• Perform statistical functions using MS-Excel.

• Demonstrate creative thinking in Microsoft PowerPoint.

• Learn the functions of MS outlook for managing the weekly schedule

• Outline different functions in R programming for basic data analysis and visualization

Pre-learning:


1 Introduction to excel and perform basics operation of excel 2

422


2 To study the conditional formatting, cell formatting, sorting etc. functions of MS-Excel

2

3 To study correlation for data analysis by using MS-Excel 2

4 To study the covariance by using MS-Excel tool 2

5 To study the descriptive statistics by using MS-Excel tool 2

6 To study the Rank percentile using MS-Excel tool 2

7 To create academic calendar using MS-Outlook tool 2

8 To configure Email account using MS-Outlook tool 2

9 To manage the date of tests using MS-Outlook 2

10 TO study the histogram by using MS-Excel tool 2

11 To demonstrate the PowerPoint presentation on any topic 4

12 To study the regression and its type by using MS-Excel 2

13 To study the sampling function by using MS-Excel tool 2

14 To study the basic statistical functions and visualization techniques using R tool 2

Pedagogy

1.practical session Suggested Assessment/ Evaluation Methods

A.Continuous Assessment: 1. Presentation 2. Assignments

B.End Semester Examination

1. Practical examination 2. Viva

423


CO_PO mappings

CO Course Outcom e

PO 1

PO 2

PO 3

PO 4

PO 5

PO 6

PO 7

PO 8

PO 9

PO1 0

PO 11

PO 12

PSO1 PSO2

CO 1

Create formula with absolute and relative cell referenc es using MS- Excel tool

3 3 2 2 2 - - - - - - 1 - -

CO 2

Underst and the functioni ng of various MS- Excel comman d

3 3 3 2 - - - - - - - 1 - -

CO 3

Demons trate the ability to use PowerP oint and its applicati on

3 3 2 1 - - - - 3 2 - 1 - -

CO 4

Analyze the data by using statistica l fuctions using MS- Excel tool

3 3 3 2 2 - - - - - - 1 1 -

424


CO 5

Create microsof t outlook profiles to configur e it with an email account.

3 3 2 1 3 - - - - - - 1 1 -

425




Course Name: Philosophy - Foundations of Ethics

Course Code: T6274

UG/PG: UG I Year BA / BBA LLB Semester II


Level: 2

Learning Objectives: 1. To impart the students with the tenets of ethics which are part of daily life. 2. To inculcate the ethical behaviour in the students. 3. To study what is right and wrong in human endeavors. 4. To gain knowledge about the method by which we categorise one’s values and pursue them. 5. To inculcate such ethics in the budding lawyers to face the challenges in their practical law

careers, more about journey than destination.

Pedagogy: 1. Lecture 2. Discussion 3. self study 4. projects

Pre-requisites: • XII Standard • To pursue 5 year UG Law programme in any recognized centre of SIU. • To have suggested reading as per session plan and other resources such as films, documentary, as

provided by the course instructor Course Content Sr. No. Topic Hours

1 Introduction 1.1. Meaning and Definition of Ethics

(05)

426


2 Theories of ethic 2.1. Consequentialism 2.2. Values Clarification 2.3. Philosophical Relativism 2.4. Utilitarianism 2.5. Legalistic Moralism Moral Absolutism 2.6. Ethical Realism 2.7. Ethical Hierarcicalism Graded Absolutism 2.8. Principle Ethics 2.9. Cognitive Moral Development as espoused by Lawrence Kohlberg

(05)

3 Deontology, Religion, Ethics and Rights 3.1. Indian concept of “Dharma” – Mahabharata and Vedas

(05)

4 Ethical Dilemmas 4.1. Case studies (05)

5 Group work 5.1. Projects 5.2. Debates

(10)

Total 30

Books Recommended: • Aristotle, Nichomachean Ethics, University Of Chicago Press (2011) • Boss, Judith A., Ethics for Life: A Text With Readings 4th Edition, Boston, M.A, Mcgraw Hill, (2008) • Goodchild, Lester F., Toward a Foundational Normative in Business Ethics. Journal of Business Ethics,

5, 485-499, (1986) • Johnson, W. Brad, & Ridley, Charles R., The Elements of Ethics for Professionals, New York, NY:

Palgrave Macmillan, (2008) • Lalrinawma V. S., Major Faith Traditions of India, I.S.P.C.K. Organization (2007) • Markkula Center for Applied Ethics, A Framework for Thinking Ethically. Santa Clara CA: Santa Clara

University, (2009) • Xiaorong Li, Ethics, Human Rights and Culture: Beyond Relativism and Culture: Universalism and

Cultural Relativism in Ethics, Palgrave Macmillan (2006)

Essential Readings: • Justice M. Rama Jois, Dharma, 2nd ed, Bharati Vidyapeet, Mumbai (1997) • Justice M. Rama Jois, Ancient Indian Law, Eternal Values in Manu Smriti, Universal Law Publishing

(2004) • Patrick Curry, Ecological Ethics: An Introduction’, Polity Press, Cambridge (2006) • Paul Chippendale, On Values, ethics, Morals & principles, (2001) • Thomas Nagel, What Does It All Mean? A Very Short Introduction to Philosophy, Oxford University

Press (1987)

• William K. Frankena, Ethics, 2nd Ed. Pearson (2005) Research Papers/Articles recommended for

reading:

427



Internal examination

Parallel/Similar courses the existing curriculum: S.No. Name of the course Institute where it was offered 1 Foundation of Ethics SLS, NOIDA

Name of Member


Prof. Vivek Nemane

Prof. Arun Krishnan


Mr. Aditya Nain

Designation Director Academic Associate

Asst. Professor

Asso. Professor and In-charge - Humanities

Teaching Associate

Org. / Inst. SLS, Pune SLS, Pune SLS, Pune SLS, Pune SSLA

Signature


Signature:

Date:

428










Course Title: Machine Learning: Classification Course Code: ________________________________________________ Number of Credits : 3 ___________________________________________ Level : ________________ Learning Objective/Outcome (s): 1. Interpretclassification problems 2. Compareprobability and classification techniques 3. Explain ensemble methods 4. Assess case studies of classification problems Pre-learning: Machine Learning Basics Course Outline Sr.No. Topics Hours

1 Supervised Learning; Classification problems; good and bad classifiers, decision boundaries; nearest neighbor methods

10

2 Probability and classification, Bayes optimal decisions, Naive Bayes and Gaussian class-conditional distribution

10

3 Linear classifiers , Bayes' Rule and Naive Bayes Model, Ensemble methods: Bagging, random forests, boosting , Decision Tree

15

4 Application of classification problems, case studies: face detection, NLP, market segmentation, spam filtering.

10

429


Pedagogy Books Recommended Suggested Assessment/ Evaluation Methods Benchmarked against similar courses in other national/ international universities /organizations

S. No.


Name of Members

Designation

Org. / Inst.

Signature

Name of Experts

Designation

Org. / Inst.

Signature


430








_____ Sub Committee - Specialization for Curriculum Development


Course Title: Machine Learning: Regression Course Code: ________________________________________________ Number of Credits : 3 ___________________________________________ Level : ________________ Learning Objective/Outcome (s): 1. Interpret problems and select suitable regression analysis techniques 2. Compare Linear and logistic regression algorithms and techniques 3. Determine the need of regularised regression approaches 4. Assess case studies of applications of regression analysis 5. Explain hybrid regression techniques Pre-learning: Machine Learning Basics Course Outline Sr.No. Topics Hours

1 Predictive modelling, Types of variables, Regression analysis, why use regression analysis, Types of regression analysis, How to select the right regresision model.

8

2 Linear Regression: with one variable and multiple variables, Gradient Descent, polynomial regression; Logistic Regression: multi-class classification, maximum likelihood algorithm, Overfitting and regularization in linear regression and logistic regression

15

3 Regularized regression approaches; Ridge regression, Balancing of bias and variance, cross validation; Lasso Regression: Coordinate descent, feature selection, Kernel regression: nearest neighbour regression approach, distance metrics,

12

431


4 Applications of regression analysis; case studies; Hybrid regression techniques

10


S. No.


Name of Members

Designation

Org. / Inst.

Signature

Name of Experts

Designation

Org. / Inst.

Signature


432


(Established under section 3 of the UGC Act 1956, by notification No.F.9-12/2001-U3 Government of India) Accredited by NAAC with ‘A’ Grade

Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India) _________________________________________________________________________


Under Graduate

Course Title: Open Source Tools for Data Science

Course Code:


Level: 4

Learning Outcome (s): The students will be able to: 1] Analyze data exploration on Cognitive Class Labs 2] Infer basic and advanced features of Jupyter Notebooks 3] Compare Apache Zeppelin Notebooks with Jupyter Notebooks and with Apache Spark 4] Examine Apache Spark in RStudio IDE 5] Illustrate and examine Seahorse Workflows on Cognitive Class Labs 6] Use OpenRefine for data integration,quality,reconciliation and export. Pre-learning:

Basic knowledge of algorithms, reasonable programming experience in R programming and data structure. Familiarity with linear algebra, probability and statistics.

Course Outline:

Unit No.

Topic Hours

1 Introducing Cognitive Class Labs

Overview of the various data science tools, hosted on Cognitive Class Labs, what is Cognitive Class labs?, account features, creating an account, managing data within my data, getting started with Cognitive Class Labs, exploring My Data on Cognitive Class Labs

10

2 Introducing Jupyter Notebooks 10

433


Jupyter Notebooks & its features, Getting started with Jupyter, Data and Notebooks in Jupyter, Sharing your Notebooks and Data, Lab- Jupyter Notebooks - The Basics, Lab - Jupyter Notebooks - More Features

Lab - Jupyter Notebooks - Advanced Features, Interesting Jupyter Notebooks on the Internet

3 Apache Zeppelin Notebooks

Learn Apache Zeppelin Notebooks, its feature, and how they are different from Jupyter Notebooks,what are Zeppelin Notebooks,Zeppelin for Apache Spark

10

4 Introducing RStudio IDE

Introduction toRStudio IDE, Uploading files, Installing packages and loading libraries in RStudio IDE, Getting started with RStudio IDE RStudio Environment and History,Apache Spark in RStudio IDE

10

5 Introducing Seahorse

Seahorse introduction, Features of Seahorse, Getting started with Seahorse on Cognitive Class Labs ,Creating and uploading Seahorse Workflows on Cognitive Class Labs, Exporting and Cloning the Seahorse Examples on Cognitive Class Labs

10

6 Introducing OpenRefine

Introduction to Data Quality and Integration,Moving toward an Agile Data Process,OpenRefine History and Community OpenRefine Interface Tour,InstallingOpenRefine and Getting Started,Preparing data with OpenRefine - Importing Data, Filtering/ Faceting,Editing cells/columns,Reconciliation,Exporting Data

10

Pedagogy

Books Recommended

1. Jupyter Cookbook: Over 75 recipes to perform interactive computing across Python, R, Scala, Spark, JavaScript, and more Kindle Edition (Kindle Edition) by Dan Toomey

2. https://zeppelin.apache.org/docs/0.5.5-incubating/tutorial/tutorial.html 3. https://hortonworks.com/apache/zeppelin/#tutorials

434


4. R for Data Science: Import, Tidy, Transform, Visualize, and Model Data by Garrett Grolemund and Hadley Wickham

5. https://seahorse.deepsense.ai/ 6. http://openrefine.org/




a) Written Exam



1 BUSINESS INTELLIGENCE & DATA ANALYTICS

Carnegie Mellon University

2 Data Science and Engineering University of Colorado, Boulder

Name of Members Kalyani Kadam Dr.SwatiAhirrao Rahul Joshi

Designation Assistant Professor Associate Professor Assistant Professor


Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

435










Course Title: R Programming Course Code: Number of Credits: 3 Level: 3 Learning Objective/Outcome (s):

1. Identify and use of R software for scientific computing. 2. Develop efficient programs using R to perform routine and specialized data

management and analysis tasks. 3. Experiment with Statistical analysis of data and probability. 4. Make use of R for correlation and regression analysis. 5. Build appropriate statistical tests using R.

Pre-learning: Basic knowledge of programming, probability and statistics Course Outline Sr. No. Topics Hours

1 Introduction to R programming: Basic fundamentals, installation and use of software, data editing, use of R as a calculator, functions and matrix operations, missing data and logical operators, conditional executions and loops

08

2 Data Management: Data management with sequences, repeats, sorting, ordering, and lists, Vector Indexing and Factors, Strings, Display and Formatting

10

3 Statistical analysis of data and probability: Graphics and plots, statistical functions for central tendency, variation, skewness and kurtosis, handling of bivarite data through graphics

10

4 Regression and correlation: Regression model, Simple regression and correlation, Multiple regression, Regression diagnostics

08

436


5 Classical Tests: One Sample Test, two-sample and more than two-sample: both parametric and non-parametric Tests, t-tests, ANOVA

09

Pedagogy Classroom Teaching Hands-On Practice Worksheets NPTEL Handouts & Videos Books Recommended:

1. Introduction to Statistics and Data Analysis - With Exercises, Solutions and Applications in R By Christian Heumann, Michael Schomaker and Shalabh, Springer, 2016

2. The R Software-Fundamentals of Programming and Statistical Analysis -Pierre Lafaye de Micheaux, Rémy Drouilhet, Benoit Liquet, Springer 2013

3. A Beginner's Guide to R (Use R) By Alain F. Zuur, Elena N. Ieno, Erik H.W.G. Meesters, Springer 2009


a) Unit Tests b) Worksheets c) Quizzes


S. No.


1 R Programming for Data Sciences Michigen State University 2 R Programming and Data Analytics New Jersey Institute of

Technology, New Jersey 3 Data Analytics with R IIT, Kharagpur

Name of Members

Ms. Pooja A. Bagane

Mrs. Shraddha Phansalkar

Designation Asst. Professor in CS/IT dept

Head & Associate Professor in CS/IT Dept


Signature

Name of Experts

Designation

Org. / Inst. Signature


437










Course Title: Introduction to Game Development

Course Code: ________________________________________________


Level : 3

Learning Objective/Outcome (s):

1) Understand the major concepts of Game Development. 2) Understanding the concepts of 3D game development. 3) Implement the Gaming User Interface. 4) Demonstrate the unity game programming.

Pre-learning: OOP’s concept, C# basics.

Course Outline

Sr. No. Topics Hours

1 Introduction to Game Development:

Game Development Overview, Intro to Unity3D, Setting Up Your Workstation, Unity3D Editor ConÒguration, Unity3D Editor Walkthrough,Game Graphics Concepts, Creating Game Graphics,

Game Audio Concepts,Creating Game Audio,Asset Creation

10

438


Tools,

Asset Acquisition Resources,The Asset Pipeline

2 Introduction to Unity3D Development :

Working in 3D Space, Setting up the scene, Adding Behaviors, Materials, Lighting, Audio, Cameras, Build & Deploy, Testing WebGL locally in a Browser

10

2 Introduction to Unity3D Development :

Working in 3D Space, Setting up the scene, Adding Behaviors, Materials, Lighting, Audio, Cameras, Build & Deploy, Testing WebGL locally in a Browser

10

3 Games in Unity3D:

Project Overview, Camera Setup, Project Organization, Physics, Player Control and Appearance, Using Game Controllers, Health and Damage, Pickups, UI Basics, Game Manager, Enemies, Particles and SFXs, Animation, Spawners

12

4 Designing and Coding Gameplay Systems:

Learning to Program, Unity Programming Concepts, Movable Targets, Player Setup, Camera Setup, Projectile Setup, Shooting Projectiles, UI Setup, Game Manager, Play Again, Particles, and SFX, Targets that Spawn and Animate.

13

Pedagogy

1. Class room teaching 2. Discussions 3. Tutorials 4. Project

Books Recommended

1. Game Engine Architecture 2nd Edition,Jason Gregory,A K Peters/CRC Press 2. Game Coding Complete, Mike McShaffry,Charles River Media

3. The Art of Game Design: A Book of Lenses, Second Edition, Jesse Schell ,CRC Press

4. Designing Games: A Guide to Engineering Experiences,Tynan Sylvester,O'Reilly Media

5. C# in Depth, 4E,Jon Skeet,Manning Publications

439


6. Theory of Fun for Game Design 2ed,Raph Kostet,O′Reilly

7. Essential Mathematics for Games and Interactive Applications 3rd Edition,James M. Van Verth, Lars M. Bishop, CRC Press

Related Website:

https://www.coursera.org/specializations/game-development


A) Continuous Assessment

1. Essential

a) Unit Tests

b) Seminars

c) Assignments

2. Optional

a) Quizzes

b) Minor project


Written Exam


S. No.


440


Name of Members

Aniket S. Jagtap

Designation Teachning Associate

Org. / Inst. SIT

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

441










Course Title: Principles of Game Design

Course Code :________________________________________________


Level : 3


1) Understand the major concepts of Game Design Process. 2) Understanding the concepts of Game Design. 3) Understand and Implement the Gameplay design and mechanics. 4) Demonstrate the game prototyping.

Pre-learning: OOP’s Concepts, basics of C#, Basics of game development.

Course Outline


442


1 Getting Started with Game Design:

The Game Design Process, Imagining a Game, Exploring the DPE and MDA Frameworks, The Role of the Game Designer, Ideation: A Curious Mind, High Concept & Treatment.

11

2 Game Design:

The Game World, Game World Components, Storytelling in Games, Settings and Plot in Games, Characters in Games, Design documentation.

11

3 Gameplay Implementation:

Gameplay Design, Mechanics, Dynamics & Aesthetics, Level Design vs. Gameplay Design, Game Balance, Mechanic Balance.

12

4 Making Designs Better:

Prototyping, Building a Prototype, Introduction to User Experience,

User Experience & Design, UX - Input Systems, UIX - Output Systems,

A Player Experience Activity, Testing, How to Playtest, Social Issues in Games.

11

Pedagogy


Books Recommended






443



Related Website:




1. Essential

a) Unit Tests

b) Seminars

c) Assignments

2. Optional

a) Quizzes

b) Minor project


Written Exam


Sr. No.


444


Name of Members

Designation

Org. / Inst.

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

445






Under Graduate

Course Title: Introduction to Internet of Things Course Code: Number of Credits: 4 Level: Objectives

1. Explore on ARM CORTEX M3 microcontroller architecture. 2. Experiment on interfacing sensors with micontroller using GPIO, I2C, and SPI

interfaces. 3. Relate various key enablers of IoT. 4. Distinguish between IoT/M2M Communications. 5. Practically experience the concept of lightweight web communication

protocols CoAP and MQTT. 6. Understand the Internet connectivity of IoT devices.

Pre-learning: No pre-requisite Course Syllabus

446


Pedagogy 1. Lectures 2. Projects 3. Research paper discussions

Books Recommended 1. Raj Kamal, Internet of Things Architecture and Design principles, McGrawHill. 2. Olivier Hersent, David Boswarthick, Omar Elloumi, The Internet of Things: key

applications and protocols, Willey publication. 3. Research papers.

S. No. Topics Hours

1.

Basics of embedded system Basics of microcontroller, concept of timers and interrupts, Analog to Digital Conversion, Serial Programming Interface (SPI), General Programming Input Output (GPIO), UART. Types of microcontroller boards: Ruspberry Pi, Arduino, Hydra, Intel Gallio. Sensors and actuators. Various types of sensors. Hands-on exercise

20

2.

Introduction to IoT Conceptual framework of IoT, Technology enablers of IoT, M2M communication, IoT applications an overview and standardization challenges.

5

3.

Communication overview IoT/M2M communication overview, communication technologies: Near Field Communication, RFID, Bluetooth, Zigbee, Wi-Fi, Cellular communication, wireless USB Wired communication: UART, SPI, I2C.Wired USB, Ethernet

10

4.

Web connectivity Lightweight Web communication protocols for connected device-Constraint Restful Environment (CoRE), Constraint Application Protocol (CoAP), Lightweight M2M protocol, Message communication protocols-MQTT, XMPP. Web connectivity for connected network using SOAP, REST, HTTP RESTFUL and WEBSOCKETS. Hands on excercise

10 5

5.

Internet connectivity Internet-based connectivity for IoT/M2M, IPv4, IPv6, 6LoWPAN, LoRaWAN. Interaction of TCP/UDP with application.

10

447


Suggested Assessment/ Evaluation Methods 1. Unit test 2. Assignments 3. Quiz. Benchmarked against similar courses in other national/ international universities /organizations


1. Internet of Things Uppsala University Sweden 2. Internet of Things IIT Kharagpur


Name of Members

Dr.Himanshu Agrawal

ShilpaGite


Assistant Professor


Signature


448






Under Graduate

Course Title: Raspberry Pi and Python Course Code: Number of Credits: 3 Level: 4 Learning Outcome (s): Students are able to: 1. Distinguish between Arduino and Raspberry Pi and learn the Raspberry Pi

architecture. 2. Associate knowledge of Raspberry Pi with Raspian Linux operating system. 3. Experiment on Raspberry Pi board using Python programming. 4. Synthesize the prior understanding on Raspberry Pi, sensors, and Raspian OS,

and do some project work.

Pre-learning: Probability theory Course Syllabus

449


Pedagogy Lectures Lecture by Industry expert. Project work

Books/recommended reading

Raspberry Pi documentation. Martin C. Brown, “Python the complete reference”, McGraw Hill Publication.


S. No.


1. Raspberry Pi and Python Cousera 2.


Name of Members


Shilpa Gite


Org. / Inst. SIT

Signature

Name of experts: Signature of Dean: Date:

1.

Introduction to Raspberry Pi Raspberry Pi architecture, interfacing sensors with raspberry pi, difference between Arduino and Raspberry Pi. Revisiting embedded system

5 5

2.

Raspian operating system for raspberry Pi Fundamentals of Linux. For Raspian: file based navigation, understanding text-based interface, shell programming, GUI.

10

3.

Python programming Revisiting basics of python programming, functions and modules, packages, classes and objects, file handling. Using python for raspberry Pi platform.

10

4.

Project Group project work on developing a farm of connected devices for applications such as environment monitoring, weather monitoring etc.

15

450










Course Title: Software Security Course Code: Number of Credits: 3 Level:3 Learning Objective/Outcome (s):

1. Discover software bugs that pose cyber security threats, explain and recreate exploits of such bugs in realizing a cyber attack on such software, and explain how to fix the bugs to mitigate such threats

2. Defending against low-level exploits

3. Discover cyber attack scenarios to web browsers, and web servers, explain various possible exploits, recreate cyber attacks on browsers, and servers with existing bugs, and explain how to mitigate such threats

4. Articulate the urgent need for software security in critical computer systems, world wide web, and explain various threat scenarios

5. Discover and explain mobile software bugs posing cyber security threats, explain and recreate exploits, and explain mitigation techniques.

6. Articulate the cyber threats to critical infrastructures and Designing and Building Secure Software

Pre-learning: Prerequisites for this course is a very strong programming background with knowledge of program run-time environment, usage of debuggers, and knowledge of shared libraries or dynamically linked libraries

451


Course Outline: Sr. No. Topics Hours

1 Low-level security: Attacks and exploits Control hijacking attacks – buffer overflow, integer overflow, bypassing browser memory protection,Code Injection, Other Memory Exploits, Format String Vulnerabilities

9

2 Unit 2:Defending Against Low-Level Exploits: Memory Safety,Type Safety,Avoiding Exploitation,Return Oriented Programming – ROP,Control Flow Integrity,Secure Coding

8

3 Unit 3:Web security: Attacks and defences: Web Basics,SQL Injection, SQL Injection Countermeasures,Web-based State Using Hidden Fields and Cookies,Session Hijacking,Cross-site Request Forgery – CSRF,

6

4 Unit 4:Designing and Building Secure Software Threat Modeling, or Architectural Risk Analysis,Security Requirements,Avoiding Flaws with Principles,Design Category:Favor Simplicity,Trust With Reluctance,Defence in Depth, Monitoring/Traceability

8

5 Unit 5:Security in Mobile Platforms Android vs. ioS security model, threat models, information tracking, rootkits Threats in mobile applications, analyzer for mobile apps to discover security vulnerabilities Viruses, spywares, and keyloggers and malware detection

8

6 Unit 6:Issues in Critical Infrastructure and SCADA Security Security issues in SCADA, IP Convergence Cyber Physical System Security threats, Threat models in SCADA and various protection approaches, Machine learning and SCADA Security

6

Pedagogy: Books Recommended:

1. Designing Usable and Secure Software with IRIS and CAIRIS, Authors: Faily, Shamal Springer International Publishing

2. Counter Hack Reloaded: A Step-by-Step Guide to Computer Attacks and Effective Defenses (2nd Edition) 2nd Edition by Edward Skoudis (Author), Tom Liston (Author) , Prentice Hall Publication

452


Suggested Assessment/ Evaluation Methods In-Class Discussion Projects &case Study Unit Test Final Exam



1 Software Security IIT Kharagpur 2 Network & Systems Security BITS Pilani 3 Computer Systems Security IIT Kanpur

Name of Members

Dr.Himanshu Agrawal

Mrs. Smita Mahajan


Assistant Professor

Org. / Inst. SIt SIT

Signature

Name of Experts

Designation

Org. / Inst.

Signature


453


SYMBIOSIS INTERNATIONAL (DEEMED UNIVERSITY) (Established under section 3 of the UGC Act 1956)

Re - accredited by NAAC with ‘A’ Grade



Accredited by NAAC with ‘A’ Grade Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri

by President of India) _________________________________________________________________________



Course Title: Usable Security

Course Code:


Level: ________________


454


Pre-learning:______________________________________________

Course Outline


1. Unit 1 : Introduction:

Usability Studies, Human factors and engineering principles, Privacy in a ubiquitous world

10

2. Unit 2 :Web Privacy and Security:

Privacy preferences, Policy authoring Privacy and Trust, Frameworks/Systems, Automatic Trust Negotiation, Semantic Web: Foundations, Semantic Web: Standards and policies

12

3. Unit 3 :Evaluation :

usability studies,A/B testing, quantitative and qualitative evaluation,Running Controlled Experiments,Usability Studies, cybersecurity case study: Phishing Email

4. Unit 4 :Strategies for Secure Interaction Design:

Introduction to usable Security guidelines,Authority Guidelines ,Authorization and Communication Guidelines,Interface Guidelines for Usable Security,Case Study: Phishing Warnings

5. Unit 5 : Usable Authentication:

Usable authentication and Passwords, Authentication methods - two factor, biometric , gesture based, Case study - Smudge attacks.

6. Unit 6 :Usable Privacy :

Usable Privacy basics, Privacy policies and user understanding, Informed consent for privacy, 5 pitfalls of privacy, Inferring personal data and privacy.

455


Pedagogy

Books Recommended



S. No.


Name of Members


Designation

Associate Prof.

Org. / Inst. SIT

456


Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

457





___________________________________________________________________________


Undergraduate

Course Title: Introduction to Data Science Course Code:070124528 Number of Credits: 3 Level: ________________ Learning Objective/Outcome(s): 1. Introduction to major concepts in data science. 2. Use of R language to carry out basic statistical modeling and analysis. 3. To understand the significance of exploratory data analysis (EDA) in data science. Demonstrate different tools to carry out EDA. 4. Apply basic machine learning algorithms for predictive modeling. 5. to create effective visualization of given data. 6. Understanding ethical and privacy issues in data science conduct. Learning Objective/Outcome(s) for DS Lab:

1. Demonstrate implementation of statistical programming concepts in R 2. Demonstrate the application of R package for advanced statistical analysis

Pre-learning: Students are expected to have basic knowledge of algorithms and reasonable programming experience, some familiarity with basic linear algebra, basic probability and statistics.

458


Course Outline Sr. No. Topics Hours 1. Introduction: What is Data Science?

- Big Data and Data Science hype - and getting past the hype - Why now? – Data fication - Current landscape of perspectives - Skill sets needed

4

2. Statistical Inference - Populations and samples - Statistical modeling, probability distributions, fitting a model - Intro to R

8

3. Exploratory Data Analysis and the Data Science Process - Basic tools (plots, graphs and summary statistics) of EDA - Philosophy of EDA - The Data Science Process - Case Study: Real Direct (online real estate firm)

8

4. Three Basic Machine Learning Algorithms - Linear Regression - k-Nearest Neighbors (k-NN) - k-means Feature Generation and Feature Selection (Extracting Meaning From Data) - Motivating application: user (customer) retention - Feature Generation (brainstorming, role of domain expertise, and place for imagination) - Feature Selection algorithms { Filters; Wrappers; Decision Trees; Random Forests

10

5. Mining Social-Network Graphs - Social networks as graphs - Clustering of graphs - Direct discovery of communities in graphs - Partitioning of graphs - Neighborhood properties in graphs Data Visualization - Basic principles, ideas and tools for data visualization

10

6. ` Data Science and Ethical Issues - Discussions on privacy, security, ethics - A look back at Data Science - Next-generation data scientists

5

Pedagogy

1. 30% of the sessions is a classroom teaching 2. 50 % of the content is to be conducted with hands-on. 3. Some of the advanced topics will be based on self-learning

Books Recommended: Cathy O'Neil and Rachel Schutt. Doing Data Science, Straight Talk fromThe Frontline. O'Reilly. 2014.

459




a) Unit tests b) Seminars c) Assignments

2. Optional a) Quiz/MCQ b) Mini Project


CO-PO Articulation Matrix for Data Science



PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12

PO13

PO14

PSO1

PSO2

CO1 2 1 2 1 2 1 1 CO2 3 3 3 3 3 3 2 2 1 CO3 2 2 3 2 3 1 2 CO4 3 3 3 2 2 2 2 CO5 1 2 2 2 2 1 1 CO6 2 1 2 2 3 1 3 3 1 3

460



Government of India) Accredited by NAAC with ‘A’Grade



Under Graduate Course Name: Introduction to Deep Learning Course Code: Number of Credits: 4 Level: 4 Learning Outcome(s): The students are able to:

• Develop the basic understanding and concepts of deep learning. • Experiment with NN and optimisation techniques. • Construct the model(s) using various deep learning functions and techniques. • Identify and apply mathematical details of CNN. • Build model using RNN. • Choose a specific learning technique to provide solution to real life case

studies.


Pedagogy

1. Class room teaching 2. Case studies 3. Mini projects 4. MOOC /Coursera / online learning tools

461


Course Outline Unit no.

Details Hours

1 Introduction to deep learning History and cognitive basis of neural computation, the perceptron / multi-layer perceptron, neural net as a universal approximator, training a neural network, Perceptron learning rule. Introduction to probabilistic reasoning, Bayes theorem and Naive Bayes concepts.

12

2 Convergence in neural networks Rates of convergence, Loss surfaces, Learning rates, and optimization methods, RMSProp, Adagrad, Momentum

8

3 Deep learning functions and techniques Stochastic gradient descent, Acceleration, Overfitting and regularization, Tricks of the trade: Choosing a divergence (loss) function, Batch normalization, Dropout

12

4 Convolutional Neural Networks (CNNs) Weights as templates, Translation invariance, Training with shared parameters, Arriving at the convolutional model, Models of vision, Neocognitron, Mathematical details of CNNs,Alexnet, Inception, VGG

8

5 Recurrent Neural Networks (RNNs) Modeling series, Back propogation through time, Bidirectional RNNs Stability, Exploding/vanishing gradients, Long Short-Term Memory Units (LSTMs) and variants, Resnets

12

6 Introduction to other topics Introduce the concept of reinforcement learning, Markov Decision Process (MDP) and Q learning. Introduction to Autoencoders and dimensionality reduction.

8

Books Recommended Nicholas LoCascio and Nikhil Buduma, “Fundamentals of Deep Learning: Designing Next-Generation Machine Intelligence Algorithms”, 2017, O’Reilly Publications. Joseph J. Allaire, “Deep Learning with R”, 2018, O’Reilly Publications. Suggested Evaluation Methods Unit Tests, Seminars, Assignments, Quizzes, Mini project, End Semester Examination


Name of Member Dr. Shradhha Dr. Swati Ahirrao

462


Dr. Ketan Kotecha Phansalkar

Designation Professor (CS & IT)




Signature Name of the Expert: Dr. Parag Kulkarni Signature of Dean: Date:

463






Under Graduate

Course Name:Machine Learning Clustering & Retrieval Course Code: Number of Credits: 3 Level: 5

Learning outcome(s):


1. Evaluate the concepts related to data, clustering and retrieval of various categories of data and information from different sources.

1. Assess the NN search details and compare it with KD-tree, LSH etc. • Evaluate the concepts related to unsupervised learning, conclude the summarised details with

k-means algorithm. 1. Choose and conclude the results of analysis using various datasets by applying hierarchical

clustering algorithm, incremental clustering algorithms selected from various data mining tools. Pre learning: None. Pedagogy:

- Class room teaching - Case studies - Mini projects - MOOC /Coursera / online learning tools

Course Outline: Books Recommended:

464


Kaufman, L., & Rousseeuw, P. J. (2005). Finding Groups in Data. An Introduction to Cluster Analysis (p. 342). John Wiley & Sons Inc. Maechler, M. (2013). Cluster Analysis Extended Rousseeuw et al. CRAN.

Unit no. Unit no. Hours

1 Introduction to Clustering and retrieval: Clustering and retrieval, most high-impact machine learning tools, Retrieval in various applications and devices we interact with, people on a social media platform, Clustering to aid retrieval, automatically discovering structure in data, like uncovering groups of similar patients, background knowledge and resources

7

2 Nearest Neighbour Search Introduction to a retrieval task of fetching a document similar to one someone is currently reading : nearest neighbour search, Foundations of Regression, overview of two critical components of the algorithms: the data representation and metric for measuring similarity between pairs of data points, discussion of computational burden of the naive nearest neighbour search algorithm, and scalable alternatives using KD-trees for handling large datasets and locality sensitive hashing (LSH) for providing approximate nearest neighbours in high-dimensional spaces, Wikipedia dataset, comparing and contrasting the nearest neighbour results.

8

3 Clustering with k-means Discover thematic groups of articles by "topic", discussion of unsupervised learning task; cluster labels, the clustering output and the relationships between data points in the dataset. Implement is k-means, To scale up k-means, learn about the general MapReduce framework for parallelizing and distributing computations, and iterates of k-means, interpretable grouping of Wikipedia articles.

8

4 Hierarchical Clustering & Closing Remarks An alternative clustering approach called hierarchical clustering, experiment with on the Wikipedia dataset, clustering-type ideas applied in other areas like segmenting time series, discussion of case studies related to clustering and retrieval. Introduce the concepts of incremental, iterative clustering. Explain in brief about Cobweb, EM, DBSCAN etc. algorithms, using various data mining tools like Weka, R, Orange, XLMiner, RapidMiner, ClowdFlows etc.

7

Suggested Evaluation Methods Unit Tests, Seminars, Assignments, Quizzes, Mini project, End Semester Examination

465



Name of Member

Dr. Ketan Kotecha Dr. Shradhha Phansalkar Dr. Preeti Mulay

Designation Professor (CS & IT)




Signature

Name of the Expert: Dr. Parag Kulkarni Signature of Dean: Date:

466






Under Graduate

Course Title: Course Code: BlockChain


Level:

Learning Outcome (s): The students will be able to:

1. Explore overview of the essential concepts of blockchain technology – 2. Exploring the Bitcoin protocol followed by the Ethereum protocol 3. Design the decentralized peer-to-peer network, an immutable distributed ledger and the trust

model that defines a blockchain. 4. Explain verification, validation, and consensus model, underlying algorithms, and essentials

of trust hard fork and soft fork. 5. Design hashing and cryptography foundations indispensable to blockchain programming,

which is the focus of two subsequent specialization courses, Smart Contracts and Decentralized Applications (Dapps).

Pre-learning

Cloud computing and distributed Systems essentials

Course Outline

Unit No.

Topic Hours

1 Blockchain Defined

Define blockchain, structure and operational aspects of Bitcoin,

blockchain, and compare different types of blockchains.

8

2 Ethereum Blockchain

Innovation of the Ethereum blockchain, review its protocol, and explore

16

467


the payment model for code execution.

3 Algorithms & Techniques

Concept of asymmetric key encryption, define the concept of hashing, and explain techniques that use algorithms to manage the integrity of transactions and blocks in blockchain.

12

4 Trust Essentials

Elements of trust in blockchain Consensus protocol and types

8

5 IBM Blockchain fabric development and architecture IBM blockchain solution with the roles of people who model, build, and maintain that blockchain solution, command-line tools to build a simple application in JavaScript that queries for a prepopulated blockchain network ledger, architecture of a blockchain network and about key considerations for developers, administrators, and network consensus, working with a sample Hyperledger Fabric network that includes two organizations, two peer nodes, and an ordering service.

16

Pedagogy

1. 30% of the sessions is a classroom teaching

2. 50% of the content is to be conducted with handson.

3. Some of the advanced topics will be based on self-learning

Books Recommended

1. “Blockchain For Dummies”, Book by Tiana Laurence

2. “Blockchain: Ultimate Guide to Understanding Blockchain, Bitcoin, Cryptocurrencies,

smart Contracts and Future of Money”, Book by Mark Gates

3. “Mastering Ethereum: Building Smart Contracts and Dapps”,Book by Andreas

Antonopoulos and Gavin Wood

4. “Developing a Blockchain Business Network with Hyperledger Composer using the IBM” , Blockchain Platform Starter Plan

468





a) Written Exam


S. No.


1

2

Name of Members

Designation

Org. / Inst.

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

469






Undergraduate

Course Title: Cloud Computing Platforms Course Code: 070124610 Number of Credits:3 Level:4 Pre-learning: Learning/Course Objectives: Students will learn

1. The fundamental ideas behind Cloud Computing, the evolution of the paradigm, its applicability; benefits, as well as current and future challenges

2. The basic ideas and principles in data center design; cloud management techniques and cloud software deployment considerations

3. Cloud storage technologies and relevant distributed file systems, NoSQL databases and object storage

4. Key concepts of virtualization Course Outline: Sr.No. Topics Hours

1 Getting Started with Microsoft Azure: cloud computing, Azure and cloud computing, Azure Management, Subscription management, support, and billing.

3

2 Microsoft Azure management tools: Azure PowerShell, The Azure SDK and the Azure CLI

6

3 Virtual machines in Microsoft Azure: Creating and configuring VMs, Configure disks

6

4 Web Apps and cloud services: Creating and configuring web apps, Deploying and monitoring web apps, Creating and deploying PaaS cloud services

6

5 Creating and configuring virtual networks: Getting started with virtual networks, Creating a virtual network, Getting

6

470


started with Azure Load Balancers 6 Cloud storage: Understanding cloud storage, Create and

manage storage 6

7 Microsoft Azure databases: Understanding options for relational database deployment, Creating and connecting to Azure SQL databases

6

8 Creating and managing Azure AD: Overview of Azure AD, Manage Azure AD authentication

6

Pedagogy

1. 30% of the sessions is a classroom teaching

2. 50% of the content is to be conducted with handson.

3. Some of the advanced topics will be based on self-learning

Books Recommended

1. Microsoft Azure: planning, deploying, and managing your data center in the cloud, M.Copeland, J.Soh, A. Puca, M. Manning and D. Gollob, Apress.

2. Microsoft Azure Cloud - Complete Practical Guide for Ultimate Beginners: Step By Step Azure Cloud Lab Manual Guide, PROTECHGURUS.


a) Unit Tests b) Practical Assignments c) Quizzes


Course Outcomes: 1. Inferthe various cloud services of Azure. 2. Relate Azure PowerShell, the Azure Software Development Kit (SDK)and the Azure cross-

platform command-line interfacein managing Azure subscriptions, their benefits and uses. 3. Test Azure to deploy the highly available and scalable configuration of Azure virtual machines,

and management of Azure virtual machine disks. 4. Experimentcreation and deployment of Web apps by using Azure. 5. Model virtual networks using variety of virtual network components, particularly focusing on

Azure load balancers. 6. Examine use of Azure cloud storage and its benefits. 7. Relate use of Microsoft Azure SQL Database to create, configure, and manage SQL databases in

Azure. 8. Experiment Azure AD, Azure Multi-Factor Authentication and single sign-on (SSO) to enhance

security. Course Articulation Matrix:

471



S. No.


1 Cloud Computing Carnegie Mellon University

2 Virtualization and Cloud Computing IIT Bombay

Name of Members

Dr. Shraddha Phansalkar Prof. Pooja Kamat

Designation Associate Professor and Head (CS & IT)

Assistant Professor (IT)


Signature

Name of Experts Dr. Shraddha Phansalkar

Designation Associate Professor and Head (CS & IT)

Org. / Inst. SIT

Signature

Signature of Dean:

Date:


CO1 2 2 2 2 2 1 1 2

CO2 2 2 2 2 2 1 1 2

CO3 2 2 2 2 2 1 1 2

CO4 2 1 2 2 2 1 1 2

CO5 2 1 2 2 2 1 1 2

CO6 3 2 1 2 2 1 1 2

472





Sub Committee Engineering – Computer Science/IT for Curriculum Development

Course Title: Business Analytics Course Code: Number of Credits: 3 Level: 4 Learning Outcome (s): The students are able to:

1. Analyze relevant statistical tools applicable for business analytics 2. Experiment the numeric data analysis using advanced excel

techniques 3. Infer data and procedures in R 4. Experiment decision tree and clustering problems using R 5. Analyze time series forecasting, predictive modelling and logistic

regression using R 6. Experiment the working areas of big data and Hadoop

Pre-learning: Knowledge of statistics and MS excel are desirable Course Outline Sr. No. Topic Hours

1 Introduction to analytics, statistics for business analytics: Meaning, application areas of business analytics, techniques of analytics, design issues, communication primitives, central tendencies and dispersion, central, limit theorem, sampling distribution, hypothesis testing, simple linear regression, categorical data analysis, analysis of variance (ANOVA), non-parametric tests

5

2 Advanced excel proficiency: Describing numeric data, pivot table analysis, linear regression, comparing two sample variances, comparing two sample means, pair T test, one way ANOVA, two way ANOVA, generating random numbers, rank and percentile, histogram procedure, exponential smoothing and moving average, sampling, covariance and correlation, goal seek and solver

10

473


3 Understanding R: Using R Studio, working with data in R, R procedures

10

4 Data mining using decision tree and clustering in R: Introduction to decision trees, model design and data audit, demo of decision tree development, algorithm behind decision tree and other decision tree, Understanding cluster analysis using R, clustering as strategy, hierarchical clustering, non-hierarchical clustering, K means clustering, variants of hierarchical clustering, different distance and linkage functions

10

5 Time series forecasting and predictive modelling – logistic regression using R: Time series vs causal models moving averages, exponential smoothing, trend, seasonality, cyclicity causal modelling using linear regression forecast accuracy, Data import and sanity check, development and validation, important categorical variable selection, important numeric variable selection, indicator variable creation, stepwise regression, dealing with multi-collinearity, logistic regression score and probability, KS calculation, coefficient stability check, iterate for final model

5

6 Overview of big data and hadoop: Big data and Hadoop and concept, application, cloud computing, generators of big – data

5


Books Recommended 1. “Fundamentals of business analytics”, R N Prasad, Seema Acharya, John Wiley &

Sons. 2. “R for Everyone: Advanced Analytics and Graphics” Jared P. Lander, Addison-

Wesley Professional.


a) Unit Tests b) Seminars c) Quizzes d) Assignments e) Group Discussions


Benchmarked against similar courses in other national/ international universities /organizations S. No. Name of the Course Name of University where it

is offered 1 Business Analytics Mumbai University 2. Advanced Business Analytics using

R IIT Hyderabad

474



Name of Member

Rahul Joshi Dr. Shraddha Phansalkar

Gagandeep Kaur

Dr. Swati Ahirrao






Signature

Name of experts

Mr. Shan Mugavel

Designation Trainer

Org. / Inst. ICTACT Academy, Tamil Nadu, India


475



Government of India) Accredited by NAAC with ‘A’Grade



Under Graduate

Course Title: Power BI Course Code: Number of Credits: 3 Level: 4 Learning Objective/Outcome (s): The students are able to:

Infer the various data preparation activities. Model data as an expert BI analyst. Examine different practises for development of reports and dashboards. Experiment various power BI tools and techniques through development of

capstone project. Pre-learning: Knowledge of relational databases and reporting, data warehouse schema topology, awareness of key business priorities such as revenue, profitability, and financial accounting and Familiarity with Microsoft Office Excel Pedagogy

4. Interactive classroom teaching 5. Demonstration in labs 6. Case study

Course Outline Unit no. Details Hours

1 Data preparation like a super nerd: Overview, desktop layout, features and views, connecting to common data sources, query editor layout and functionality, creating relationships in your data model

12

2 Develop your data nerd prowess: Built-in Aggregations, Calculated Columns and Measures, A Visual Demonstration, Some Slightly Advanced Measures

11

3 Developing reports and dashboards: Data visualization best practices, report and dashboard layout, creating a sales analysis report, creating a project management report

11

476


4 Tips, tricks and capstone project: Telling the story of your data, thinking outside the visual box, theme-ing it up, capstone project

11

Books Recommended

3. Analyzing Data with Power BI and Power Pivot for Excel, A. Ferrari and M. Russo, 2017, Microsoft Press.

4. Power Query for Power BI and Excel, C. Webb, 2014, Apress.


a) Unit Tests b) Practical Assignments c) Quizzes





Name of Members

Designation

Org. / Inst.

Signature

Name of the Expert: Signature of Dean: Date:

477










Course Title: Game Development for Modern Platforms

Course Code:


Level : 4


1) Understanding the various gaming platforms. 2) Implement the various stages of game design. 3) Develop the game with different effects. 4) Execution of the game on various operating systems.

Pre-learning: OOP’s Concepts, basics of C#, Basics of Unity3D.

Course Outline

Sr.No. Topics Hours

1 Introduction to Game Platform:

Brief History of Game Platforms, Modern Game Platforms, Creating Tree Sprite, Creating Ground Tiles, Creating Platforms, Setting up the Player, Tags, Layers, Sorting Layers, Player Animations, Player Animator Controller, Character Controller, Using Game Controllers.

14

478


2 Game Design:

Level Design with a Snap, Moving Platforms, Camera Follow, Character Controller Code, Adding Double Jump, Death Zone, Coins, Victory, Particle Effects, Enemy Setup, Enemy Animation, Attacking and stunning Enemy, Moving Enemy, Player Bounce on Enemy Stun.

15

3 Building the Game:

Parallax Scrolling, Image Effects, User Interface Setup, Hiding UI in the Scene View, Game Manager, Game Manager Code, Custom Editor Tools, Out-of-Game Scenes, The Main Menu, Cross Platform Menu Controller Support, Supporting Mobile Cross Platform Input.

16

4 Preparing to Ship:

Game Polish, Integrating Analytics, Monetization, Play testing and Balancing, Optimization, Building Overview, Building for WebGL,

Building for PC and Mac, Building for iOS, Building for Android, Taking Screenshots, Creating a Game Web Page, Finishing Up.

15

Pedagogy


Books Recommended







Related Website:

479





1. Essential

a) Unit Tests

b) Seminars

c) Assignments

2. Optional

a) Quizzes

b) Minor project


Written Exam


S. No.


Name of Members

Aniket S. Jagtap

Designation Teaching Associate

Org. / Inst. SIT

Signature

Name of Experts

Designation

480


Org. / Inst.

Signature

Signature of Dean:

Date:

481










Course Title: Business of Games and Entrepreneurship

Course Code: ________________________________________________


Level: 3


1) Understand the various business models for the game. 2) Study and understand the project management techniques. 3) Build the portfolio for pitching the game. 4) Plan for starting own company

Pre-learning:______________________________________________

Course Outline

Sr.No. Topics Hours

1 Gaming Business:

The Business of Video games, Funding Models, Market,

Intellectual Property, IP – Copyright, IP- Patents and Trade Secrets,

11

482


IP - Protecting Yourself, SWOT Analysis

2 Teamwork for Game Development:

Teamwork Fundamentals, Project Management Techniques, Complexity and Iteration, SCRUM, Project Management Tools, Leadership, Leadership Qualities, Leadership Style, Leadership Tasks.

10

3 Pitching The Game:

The Art of the Demo, Public Speaking - What Works?, Effective Visuals,

How to Demo Your Game, Perfecting the Resume, Finding a Game Job,

Interviewing.

12

4 Entrepreneurship and Starting a Company:

Friends Are Not A Company, Entrepreneurship, Launching a Business, Business Structures, Business Planning, Client communication,

Physical Communication.

12

Pedagogy


Books Recommended







Related Website:

483





1. Essential

a) Unit Tests

b) Seminars

c) Assignments

2. Optional

a) Quizzes

b) Minor project


Written Exam


S. No.


Name of Members

Aniket S. Jagtap

Designation Teachning Associate

484


Org. / Inst. SIT

Signature

Name of Experts

Designation

Org. / Inst.

Signature

Signature of Dean:

Date:

485



Accredited by NAAC with ‘A’ Grade

Founder: Prof. Dr. S. B. Mujumdar, M.Sc.,Ph.D. (Awarded Padma Bhushan and Padma Shri by President of India) ______________________________________________________________________


Under Graduate

Course Title: IoT security and privacy Course Code: Number of Credits: 3 Level: Objectives: Students will be able to: 1. Familiarize with the fundamentals of network security, information security, and

various attacks. 2. Analyse cryptography for IoT. 3. Experimental study and deeper understanding on CAN bus security in IoT

connected vehicle. 4. Analytical study on privacy challenges in IoT connected home, wearable

connected devices. 5. Relating neural network to address modern security challenges. Pre-learning:

486


Probability theory Pedagogy

Lectures Lectures by Industry experts. Research paper discussions

Books/recommended reading Research papers Industry white papers.

Suggested Assessment/ Evaluation Methods 1. Unit test 2. Assignments 3. Quiz. Benchmarked against similar courses in other national/ international universities /organizations

S. Name of the Course Name of University where it is

1.

Overview of network and information security, security requirements: confidentiality, integrity, authentication and authorization, Types of security attacks: replay, DoS, MITM, message injection, malware, IoT security and privacy challenges: an overview.

5

2.

IoT Cryptography Overview of Public-key cryptography using RSA and ECC. Lightweight cryptography using ECC, hashing. Homomorphic encryption and lattice cryptography.

10

3.

IoT Connected vehicle and cyber security challenges Connected vehicle security: overview,CAN bus security issues, attacks on CAN bus, countermeasures: Intrusion detection and prevention system, lightweight encryption. Ensuring security for the surveillance system in Smart City Independent and group learning through discussions

7 5

4.

IoT privacy challenges Privacy issues in wearables, Smart homes, and Smart Grid. Privacy preservation for wearable. Privacy protection and homomorphic encryption. Blockchain: proof of work on block chain

7 5

5.

Neural cryptography Overview of neural networks, neural network algorithm such as GAN to address modern security challenges. Interactive learning and group discussions based on the research papers on neural cryptography

4 3

487


No. offered 1. IoT security Boston University 2. Cyber security and the Internet

of Things Cousera


Name of Members


Shilpa Gite


Org. / Inst. SIT

Signature

Name of experts: Signature of Dean: Date:

488






Undergraduate

Course Title: Software Defined Networking Course Code: 70124616 Number of Credits: 3 Level: 4 Learning objectives (s): Students are able to:

1. Discuss and compare the differences between traditional network and SDN and learn SDN architecture.

2. Finding the Relation between Open Flow and network virtualization in SDN.

3. Understand the working of SDN with Mini net 4. Analysis of network function virtualization 5. Discussing and understanding of fog computing with SDN and

experiment real-time applications. Pre-learning:

Probability theory Course Outline:

489


Unit No.

Topic Hours

1.

Introduction to SDN Overview of traditional network, issues in configuring traditional routers, evolution of software defined networking, separation of data and control plane.

5

2.

SDN and OpenFlow Fundamentals of how SDN provides global view of the network, SDN architecture, OpenFlow basics, concept of network virtualization, network virtualization using VMware.

8

3.

SDN using Mininet and OpenFlow Overview on Mininet tool, some practical assignments on creating a simple SDN topology in Mininet, more practical assignments on Mininet for larger topologies of SDN. Programming tasks on Mininet.

10

4.

Network Function Virtualization Overview on NFV, NFV and SDN, How NFV is impacting the future, NFV and business automation, NFV and virtualization of mobile base stations, eNodeB basics, Radio Access Network (RAN). SDN in data center

12

5.

Interplay of SDN with Fog SDN and Fog computing, How Fog computing and SDN can

benefit IoT applications, Case studies on SDN and Fog:

emergency applications, Connected vehicle application.

Practical assignments

10

Pedagogy

● Lectures 1. Lectures by Industry experts 2. Project work

Books/ recommended reading

1. Paul Goransson Chuck Black Software Defined Networks, 1st Edition A Comprehensive Approach 2. Research Paper

1. Software-Defined Fog Network Architecture for IoT

490


Suggested Assessment/ Evaluation Methods: 1. Continuous Assessment

i. Unit Tests ii. Assignments iii. Quizzes iv. Class Tests v. Experiential Learning

2. End Semester Examination a. Written examination


CO1: Distinguish traditional network and SDN and learn SDN architecture. CO2: Relate the concepts of SDN with Open Flow and network virtualization. CO3: Associate and experiment knowledge of SDN with Mininet CO4: Analyse network function virtualization CO5: Synthesize the concepts of fog computing with SDN and experiment

real-time applications.


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO 13

PSo1 Pso2

CO1 3 3 3 3 3 2 2

CO2 3 3 3 3 3 2 2

CO3 3 3 3 2 2 2 2

CO4 3 3 3 2 2 2

CO5 3 3 3 3 3 2


S. No.


1. Software Defined Networking IIT Chennai 2. Software Defined Networking CISCO

Sub-specialization committee Name of Members Smita Mahajan


Org. / Inst. SIT

Signature

491


Name of Experts Shraddha Phansalkar


Org. / Inst. SIT

Signature


492










Course Title: Cryptography Course Code: Number of Credits:4 Level:3 Learning Objective/Outcome (s):

1. To make use of standard algorithms ofCryptographyto provide confidentiality, integrity and authenticity.

2. To identify various key distribution and management schemes. 3. To experiment with block ciphers for encryption and decryption, sign and verify

messages using well known signature generation and verification algorithms. 4. To identify various cryptanalysis techniques. 5. To model security applications in the field of Information technology.

Pre-learning:Discrete Structures, Algorithms Course Outline Sr.No. Topics Hours 1 Unit1: Introduction and Mathematical Foundations

Introduction, Overview onModern Cryptography, Number Theory, Probability and Information Theory, One Time Pad, Stream Ciphers and Pseudo Random Generators

12

2 Unit 2 : Symmetric Key Ciphers and Cryptanalysis Introduction, Classical Encryption Techniques: Symmetric Cipher Model, Cryptography,Cryptanalysis and BruteForce Attack, Substitution Techniques, Caesar Cipher,Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One Time Pad, Block Ciphers: Feistal Network, Overview on S-Box Design Principles, Modes of operation of Block Ciphers, DES, avalanche effect, 3DES, AES, Block Cipher, Basic modes of operation, Linear Cryptanalysis, Differential Cryptanalysis, meet in the middle, Other

12

493


Cryptanalytic Techniques.

3 Unit 3 – Message Integrity Message integrity: definition and applications, Private-key authentication, CBC-MAC, Pseudorandom functions, Hash functions, Message Authentication Codes (MACs), Collision resistant hashing, Secure Hash Algorithm, Hash-based message authentication code (HMAC), Authenticated encryption: security against active attacks: Key Distribution Centre (KDC), Modular arithmetic and group theory.

12

4 Unit 4 –Public key cryptography and Cryptanalysis Arithmetic modulo primes, Cryptography using arithmetic modulo primes, ElGamal encryption, Arithmetic modulo composites: The RSA Cryptosystem, Primality Testing, Factoring Algorithms, Other attacks on RSA and Semantic Security of RSA, Discrete logarithm problem (DLP) and Diffie-Hellman key exchange, Cryptanalysis of DLP

12

5 Unit 5 – Digital Signatures Introduction, RSA signatures, DSA signatures, Hash based signatures, certificate transparency, certificate revocation, X.509 certificates, Certification paths

12

Pedagogy Books Recommended:

1. Douglas Stinson, "Cryptography Theory and Practice", 2nd Edition, Chapman & Hall/CRC.

2. Introduction to Modern Cryptography (2nd edition) by J. Katz and Y. Lindell. 3. B. A. Forouzan, "Cryptography & Network Security", Tata Mc Graw Hill. 4. W. Stallings, "Cryptography and Network Security", Pearson Education.

Suggested Assessment/ Evaluation Methods Benchmarked against similar courses in other national/ international universities /organizations

S. No.


1. Introduction to Cryptography Stanford University

2. Introduction to Cryptography University College, London

3. Cryptography and Network Security NPTEL

494


Name of Members

Dr. Himanshu Agarwal

Dipti K. Sarmah


Assistant Professor


Signature

Name of Experts

Designation

Org. / Inst.

Signature


495










Course Title: Hardware Security Course Code: Number of Credits : 3 Level : Learning Objective/Outcome (s):

1. Learning the design of digital system, 2. Better understanding of attacks and providing countermeasures against them, 3. Understand and implement cryptography algorithms on hardware 4. Detection and isolation of hardware Trojans, 5. Protection of the design intellectual property against piracy and tampering.

Pre-learning: Digital Electronics and Logic Design, Cyber Security. Course Outline Sr.No. Topics Hours 1 Unit1: Introduction:

Design of digital systems – VLSI, FPGA, PUF terminology and Measures, PUF properties, PUF Implementations, PUF Quality Evaluation, Design Techniques to Increase PUF Response Quality

10

2 Unit 2 : Hardware Attacks : Basics, categories of hardware attacks – invasive, non-invasive, Side Channel attacks, Design Techniques to Prevent Side-channel Attacks, Counter measures against physical attacks.

10

3 Unit 3 – Hardware based Cyptography- Cryptographic Hardware and their Implementation, hardware implementation of Hash functions, RSA implementation and security, Optimization of Cryptographic Hardware on FPGA.

10

4 Unit 4 – Hardware Trojan Hardware Trojan Nomenclature and Operating Modes, Countermeasures Such as Design and Manufacturing Techniques to

10

496


Prevent/Detect Hardware Trojans, Logic Testing and Side-channel Analysis based Techniques for Trojan Detection, Techniques to Increase Testing Sensitivity Infrastructure Security: Impact of Hardware Security Compromise on Public Infrastructure, Defense Techniques

5 Unit 5 – Secure Hardware Intellectual Properties: Hardware Intellectual Property (IP) Piracy and IC Piracy, Design Techniques to Prevent IP and IC Piracy, Using PUFs to prevent Hardware Piracy, watermarking of Intellectual Property (IP) blocks.

5


S. No.


2. Hardware Security IIT Kharagpur

2. Introduction to Hardware Security and Trust University of Florida

Name of Members


Prachi Kadam

Designation Associate Prof. Assistant Prof.


Signature

Name of Experts

Designation

Org. / Inst.

Signature


497


Faculty of Engineering Disciplines: CS/IT

Course Name: Internet of Things Lab

(UG/PG): UG: 2019-23 onwards and PG : 2018-20 onwards.


Level: 3


1. To experiment and understand the basics of embedded micro controller and sensors.

2. To experiment and understand the interfacing of sensors using GPIO, SPI with Embedded micro-controller.

3. To learn and express your understanding of local data storage and data storage on a remote server.

4. To express your understanding on messaging protocols such as CoAP, and MQTT.

5. To synthesise your understanding and develop a farm of communicating base stations.

6. To test and understand data analytics at cloud.

Pedagogy:

1. Hands-on sessions.

2. Industry interaction.

Pre-requisites: Computer network, embedded systems, operating systems.

498


Course Outline

Unit No. Topic Hours

1. Task-1 Getting familiar with the embedded micro controller, sensors, actuators.

4

2. Task-2 Interfacing sensors with micro controller board using GPIO, SPI, and I2C.

4

3. Task-3 Storing sensors data on the micro-controller local SD card.

4

4. Task-4 Send the data to a remote server after every 15 minutes.

4

5

Task-5 To study RestFul architecture, experiment with light-weight messaging protocol CoAP and publish-subscribe MQTT protocol.

4

6

Task-6 Using short range wireless communication including ZigBee, Wi-Fi make a farm of communicating devices. This may be applicable as farm of communicating base stations in the farm fields or a farm of communicating base stations monitoring environment pollution.

5

7

Task-7 Upload the sensor data from base station to the public cloud/private cloud and write a simple rule to generate an alert. Send this alert to the micro controller display(actuator)

5

Suggested Reading:

1. Research papers.

2. Industry white papers.

3. Thesis and Industry reports.

4. Case studies.

499


Suggested Evaluation Methods:

- Continuous assessment of lab tasks.

- Lab Journal.

Parallel/Similar courses the existing curriculum:

S. No. Name of the course Institute where it was offered

1. Internet of Things Uppsala University Sweden

2. Internet of Things University of Virginia

Name of

Member Dr Himanshu

Agrawal

Designation Associate

Professor

Org. / Inst. SIT

Signature

Name of the Expert:

Signature:

500



Specialization: Computer Science and Information Technology Course Name: Human Computer Interface (UG/PG): UG Number of Credits: 3 Level: 4 Learning Outcomes The students will be able to:

1. Analyze the role of user in information Systems. 2. Examine different models in development of an interface such as Cognitive model,

Linguistic model. 3. Outline the phases of designing user friendly interface using LUCID development

methodology. 4. Categorize various documentation like CSCW, Web Presentation required to build and use a

user friendly interface. 5. Explore new modes of Human Computer Interaction (HCI) using voice, gesture, eye

movement. Pedagogy

1. Interactive sessions and Brainstorming 2. Classroom teaching 3. Seminars 4. Mini project

Pre-requisites None Course Outline Sr. No. Topic Hours

1.

Introduction The Human - I/P, O/P channels, human memory, thinking, emotion, individual differences (diversity), human psychology he computer: Introduction to I/P, O/P devices, the user: the role of users in information systems, user characteristics, needs, the interface: goals of user interaction design, importance of human factors &motivations, paradigms for interaction.

09

2. Principles of models & guidelines Principle 1: recognize diversity, principle 2: 8 golden rules of HCI principle 3: prevent errors, guidelines for data display, guidelines for data

501


entry, study of HCI patterns, models: types of models, cognitive models, GOMS & keystroke-level model, stages of action models, linguistic models, BNF & task action grammar, object action interface model.

09

3.

Design Process Trans design process: what is a design? the process of design, user focus, aims of user centered design process, three pillars of design, participatory design, scenarios, navigation design, screen design, development methodology (LUCID). S/w tools: design tools.

09

4.

Documentation and Social Issues Documentation: CSCW & web: presentation styles- error messages, printed manuals, online facilities, CSCW: groupware, goals of co-operations, asynchronous interactions, application to education &social issues, hypermedia: users &their tasks, 0-AI model for web-site designing.

09

5.

Introduction to Research in Human-Computer Interaction Why do HCI research? research prototypes , interdisciplinary nature of HCI research , examples of HCI research , new interaction techniques , new modes of human-computer communication , voice , gesture , eye movement , tangible user interfaces

09

6

Evaluation criteria for UI testing Usability testing , suitability testing , accessibility testing, remote usability testing, automated usability evaluation tools, testing methods - think aloud , videotaping , customer satisfaction, questionnaires, user research-qualitative & quantitative, various qualitative research techniques.

7

User Experience (UX) Introduction, Relation with user interface design, Cognitive model, UX process, User research methods, Elements of UX, Design process, Design sketching, Design validation, Testing. Case Study Web interfaces, gaming interfaces, embedded system interfaces, kiosks, mobile interfaces, e-commerce, ATM interface etc.

Books Recommended 1. "Human Computer Interaction", Alan J, Dix. Janet Finlay, Rusell Beale, Pearson Education, 3rd

Edition, 2004, ISBN 81-297-0409-9. 2. "Designing the User Interface", Ben Shneiderman, Pearson Education, 2001, ISBN 81-7808-

262- 4. 3. "Human Computer factors: A Study of Users & Information Systems", Andy Smith, McGraw Hill,

1997. 4. "The essentials of Interaction Design", Alan Cooper, John Wiley, 2002, ISBN 81-265-0213-4

Research Papers/Articles recommended for reading 1. Castro D.,”Reference Model for Development of Human-Computer Interfaces”, L. ; EGC, Fed.

Univ. of Santa Catarina, Florianopolis, Computational Science and Engineering Workshops, 2008. CSE WORKSHOPS '08. 11th IEEE International Conference on July 2008.


502





B) End Semester Examination Written Exam Parallel/Similar courses in the existing curriculum Sr. No. Name of the course Institute where it is offered Sub-specialization committee

Name of Member

Prof. Shilpa Gite Prof. Vijayashri Khedkar




Signature


503



COMPUTER SCIENCE AND INFORMATION TECNOLOGY

Format to submit syllabus Course Name:Advanced Algorithms (UG/PG): UG Number of Credits:3 Level:4 Learning Objective(s):

1. To learn and apply Algorithm complexity analysis theory to practical problems. 2. To introduce advanced algorithm design strategies.

Outcomes: 1. Analyze, compare and design better algorithms using algorithm design strategies.

2. Derive recurrence equations for recursive algorithms and apply methodologies to solve

recurrences and analyzethe algorithms.

3. Analyze advanced algorithms for solving many real-life problems using Graph data structures.

4. Design optimized algorithms for parallel machines (multiple processors) to provide real-time solutions to real-time problems.

5. Design approximation algorithms to solve NP-hard optimization problems.

Pedagogy: 1. Interactive classroom teaching and discussions 2. Real world applications and examples 3. Expert lectures 4. Interaction with industry experts 5. NPTEL video Lectures 6. Brainstorming sessions 7. Group Discussions 8. Presentations

Pre-requisites:

1. Fundamentals of algorithm design strategies 2. Searching, sorting and graph algorithms

504


3. Familiarity of programming and programming languages like C, C++ 4. Data structure concepts

Course Outline

S.No. Topic Hours

1

Analysis of Algorithms : The Role of Algorithms in Computing:Algorithms, Algorithms as a technology Analysis of Algorithms: Insertion sort, Analyzing algorithms, Designing algorithms Growth of Functions: Asymptotic notation: Standard notations and common functions Divide-and-Conquer: The substitution method for solving recurrences 83 The recursion-tree method for solving recurrences , The master method for solving recurrences

09

2

Sorting Algorithms and Complexities : Heapsort: Heaps, Maintaining the heap property, Building a heap, The heapsort algorithm, Priority queues Quicksort: Description of quicksort, Performance of quicksort, A randomized version of quicksort, Analysis of quicksort Sorting in Linear Time: Lower bounds for sorting, Counting sort, Radix sort, Bucket sort

09

3

Graph Algorithms and Complexities : Introduction: Graph and Greedy method Minimum cost Spanning Trees: Prim’s and Kruskal’s algorithms and complexities. Shortest Path: Single source and All-Pair algorithms and complexities. Single-Source Shortest Paths: The Bellman-Ford algorithm, Dijkstra’s algorithm All-Pairs Shortest Paths : Shortest paths and matrix multiplication, The Floyd-Warshall algorithm, Johnson’s algorithm for sparse graphs

09

4

Approximation Algorithms : Introduction Absolute Approximation: Planar graph coloring, Maximum programs stored problem, NP-hard Absolute Approximations €- Approximations: Scheduling Independent tasks, Bin packing Polynomial Time Approximation Schemes: Scheduling Independent tasks,, 0/1 Knapsack

09

5

Introduction to Parallel Algorithms : Introduction, Computational model Fundamental Techniques and algorithms: Prefix computation, List ranking Merging: A Logarithmic time algorithm, Odd Even Merge, A work optimal Algorithm, O(loglogm) time algorithm

09

505


Books Recommended

1. Cormen, Leiserson, Rivest, "Algorithms", PHI 2. Horowitz, Sahni, "Fundamentals of Computer Algorithm", Galgotia 3. Bressard, "Fundamentals of Algorithms", PHI 4. Lakshmivarahan S., Dhall S., "Analysis and Design of Parallel Algorithms",

McGrawHill 5. S. Baase, S and A. Van Gelder, "Computer Algorithms: Introduction to Design

and Analysis", 3rd edition. Addison Wesley, 2000 6. Aho, Hopcraft, Ullman, "The Design and Analysis of Computer Algorithms",

Addison Wesley

Research Papers/Articles recommended for reading: 1. Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (1974). The design and analysis of computer

algorithms. Addison-Wesley Pub. Co., section 1.3 2. Juraj Hromkovič (2004). Theoretical computer science: introduction to Automata, computability,

complexity, algorithmics, randomization, communication, and cryptography. Springer. pp. 177–178. ISBN 978-3-540-14015-3.

3. Giorgio Ausiello (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer. pp. 3–8. ISBN 978-3-540-65431-5.

4. Wegener, Ingo (2005), Complexity theory: exploring the limits of efficient algorithms, Berlin, New York: Springer-Verlag, p. 20, ISBN 978-3-540-21045-0

5. Robert Endre Tarjan (1983). Data structures and network algorithms. SIAM. pp. 3–7. ISBN 978-0-89871-187-5.

6. Examples of the price of abstraction?, cstheory.stackexchange.com 7. The term lg is often used as shorthand for log2 8. How To Avoid O-Abuse and Bribes, at the blog "Gödel’s Lost Letter and P=NP" by R. J. Lipton,

professor of Computer Science at Georgia Tech, recounting idea by Robert Sedgewick 9. However, this is not the case with a quantum computer

10. It can be proven by induction that 11. This approach, unlike the above approach, neglects the constant time consumed by the loop

tests which terminate their respective loops, but it is trivial to prove that such omission does not affect the final result

12. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.&Stein, Clifford (2001). Introduction to Algorithms. Chapter 1: Foundations (Second ed.). Cambridge, MA: MIT Press and McGraw-Hill. pp. 3–122. ISBN 0-262-03293-7.

13. Sedgewick, Robert (1998). Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd ed.). Reading, MA: Addison-Wesley Professional. ISBN 978-0-201-31452-6.

14. Knuth, Donald. The Art of Computer Programming. Addison-Wesley. 15. Greene, Daniel A.; Knuth, Donald E. (1982). Mathematics for the Analysis of Algorithms (Second

ed.). Birkhäuser. ISBN 3-7643-3102-X. 16. Goldreich, Oded (2010). Computational Complexity: A Conceptual Perspective. Cambridge

University Press. ISBN 978-0-521-88473-0.

506


Suggested Evaluation Methods: 1. ResearchSeminars 2. Home work theory and practical assignments 3. Tests/Oral/ Practical exams


Name of Member

Ambika Vishal Pawar

Meeta Kumar Suman Tanwar





Signature


507



Specialization: Computer Science and Information Technology Course Name: Human Computer Interaction (HCI) Lab (UG/PG): UG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Analyze the role of user in information Systems. 2. Examine different models in development of an interface such as Cognitive model,

Linguistic model. 3. Outline the phases of designing user friendly interface using LUCID development

methodology. 4. Categorize various documentation like CSCW, Web Presentation required to build and use a

user friendly interface. 5. Explore new modes of Human Computer Interaction (HCI) using voice, gesture, eye

movement. Pedagogy

1. Interactive sessions and brain storming to evaluate the role of the end user in the success of an information system

2. Mini project Pre-requisites None List of experiments in HCI Lab:

Sr. No.

Topic Hours

1 Analyze the interactivity with Social Exposure and Smartphone Motion Gestures.

3

2 Search Natural Language Processing and its interfaces available for linguistic model.

3

3 To develop and evaluate LUCID process model. 3 4 Explore different options for User-Centered Design. 3 5 Compare and contrast Flipkart and Amazon or any 2 popular

online shopping portals. 3

508


Books Recommended 6. "Human Computer Interaction", Alan J, Dix. Janet Finlay, Rusell Beale, Pearson Education, 3rd

Edition, 2004, ISBN 81-297-0409-9. 7. "Designing the User Interface", Ben Shneiderman, Pearson Education, 2001, ISBN 81-7808-

262- 4. 8. "Human Computer factors: A Study of Users & Information Systems", Andy Smith, McGraw Hill,

1997. 9. "The essentials of Interaction Design", Alan Cooper, John Wiley, 2002, ISBN 81-265-0213-4

Research Papers/Articles recommended for reading 5. Castro D.,”Reference Model for Development of Human-Computer Interfaces”, L. ; EGC, Fed.

Univ. of Santa Catarina, Florianopolis, Computational Science and Engineering Workshops, 2008. CSEWORKSHOPS '08. 11th IEEE International Conference on July 2008.


7. https://pdfs.semanticscholar.org/1b21/f79b062c06f7e62e47c5366ae92b2350c61d.pdf Suggested Evaluation Methods A) Continuous Assessment

1. Essential a) Seminars b) Assignments 2. Optional



Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered 1. HCI LAB IDC, IIT Bombay 2. HCI LAB Stanford University Sub-specialization committee

Name of Member Shraddha Phansalkar Vijayshri Khedkar

Shilpa Gite Swati Ahirrao






Signature


509


Sub Committee for Curriculum Development COMPUTER SCIENCE AND INFORMATION TECNOLOGY

Format to submit syllabus

Course Name:Advanced Algorithms Lab (UG/PG): UG Number of Credits:1 Level:4 Learning Objective(s):

1. To learn and apply Algorithm complexity analysis theory to practical problems. 2. To introduce advanced algorithm design strategies.

Pedagogy: 1. Interactive classroom teaching and discussions 2. Real world applications and examples 3. Expert lectures 4. Interaction with industry experts 5. Brainstorming sessions 6. Group Discussions

Pre-requisites:

1. Fundamentals of algorithm design strategies 2. Searching, sorting and graph algorithms 3. Familiarity of programming and programming languages like C, C++ 4. Data structure concepts

510


Course Outline

Books Recommended

1. Cormen, Leiserson, Rivest, "Algorithms", PHI 2. Bressard, "Fundamentals of Algorithms", PHI 3. Horowitz, Sahni, "Fundamentals of Computer Algorithm", Galgotia 4. Lakshmivarahan S., Dhall S., "Analysis and Design of Parallel Algorithms",

McGrawHill 5. S. Baase, S and A. Van Gelder, "Computer Algorithms: Introduction to Design

and Analysis", 3rd edition. Addison Wesley, 2000 6. Aho, Hopcraft, Ullman, "The Design and Analysis of Computer Algorithms",

Addison Wesley

Research Papers/Articles recommended for reading: 1. Alfred V. Aho; John E. Hopcroft; Jeffrey D. Ullman (1974). The design and analysis of computer

algorithms. Addison-Wesley Pub. Co., section 1.3 2. Juraj Hromkovič (2004). Theoretical computer science: introduction to Automata, computability,

complexity, algorithmics, randomization, communication, and cryptography. Springer. pp. 177–178. ISBN 978-3-540-14015-3.

3. Giorgio Ausiello (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer. pp. 3–8. ISBN 978-3-540-65431-5.

4. Wegener, Ingo (2005), Complexity theory: exploring the limits of efficient algorithms, Berlin, New York: Springer-Verlag, p. 20, ISBN 978-3-540-21045-0

5. Robert Endre Tarjan (1983). Data structures and network algorithms. SIAM. pp. 3–7. ISBN 978-0-89871-187-5.

6. Examples of the price of abstraction?, cstheory.stackexchange.com 7. The term lg is often used as shorthand for log2

S.No. Topic Hours

1 Analysis, Proof of analysis and Implementation of Insertion Sort Algorithm 2

2 Analysis, Proof of analysis and Implementation of Merge Sort Algorithm 2

3 Analysis, Proof of analysis and Implementation of Quick Sort Algorithm 2

4 Analysis, Proof of analysis and Implementation of Heap Sort Algorithm 2

5 Analysis, Proof of analysis and Implementation of BFS and DFS graph traversal Algorithms

4

6. Analysis, Proof of analysis and Implementation of Prim’s MST Algorithm 2

7. Analysis, Proof of analysis and Implementation of Kruskal’s MST Algorithm 2

8. Analysis, Proof of analysis and Implementation of Dijkstra’s shortest path Algorithm

4

9. Parallel Algorithm Analysis 4

511


8. How To Avoid O-Abuse and Bribes, at the blog "Gödel’s Lost Letter and P=NP" by R. J. Lipton, professor of Computer Science at Georgia Tech, recounting idea by Robert Sedgewick

9. However, this is not the case with a quantum computer

10. It can be proven by induction that 11. This approach, unlike the above approach, neglects the constant time consumed by the loop

tests which terminate their respective loops, but it is trivial to prove that such omission does not affect the final result

12. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.&Stein, Clifford (2001). Introduction to Algorithms. Chapter 1: Foundations (Second ed.). Cambridge, MA: MIT Press and McGraw-Hill. pp. 3–122. ISBN 0-262-03293-7.

13. Sedgewick, Robert (1998). Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd ed.). Reading, MA: Addison-Wesley Professional. ISBN 978-0-201-31452-6.

14. Knuth, Donald. The Art of Computer Programming. Addison-Wesley. 15. Greene, Daniel A.; Knuth, Donald E. (1982). Mathematics for the Analysis of Algorithms (Second

ed.). Birkhäuser. ISBN 3-7643-3102-X. 16. Goldreich, Oded (2010). Computational Complexity: A Conceptual Perspective. Cambridge

University Press. ISBN 978-0-521-88473-0.

Suggested Evaluation Methods: 1. Seminars 2. Home work theory and practical assignments 3. Tests/Oral/ Practical exams


Name of Member

Ambika Vishal Pawar

Meeta Kumar Suman Tanwar





Signature


512






Development

Course Title: Introduction to Big Data Course Code: Number of Credits:3 Level : Learning Outcome (s): The students are able to:

1. Differentiate between Name Node, Secondary Name Node, Data Node.

2. Compare MapReduce-1 and MapReduce-2 frameworks for solving Big data problems

3. Differentiate Hive and RDBMS. 4. Experiment pig queries and examine the performance. 5. Test Sorting, Aggregate functions in HiveQL. 6. Analyze Query execution performance with in-memory databases like

Apache Spark. Pre-learning: Knowledge of Big data, No-SQLis desirable Course Outline S.No. Topic Hours

1 Hadoop Architecture

Hadoop Storage: HDFS, Common Hadoop Shell commands, Anatomy of File Write and Read., Name Node, Secondary Name Node, and Data Node, Hadoop MapReduce paradigm, Map and Reduce tasks, Job, Task trackers - Cluster Setup – SSH &Hadoop Configuration – HDFS Administering –Monitoring & Maintenance, Hadoop ecosystem components - Schedulers - Fair and Capacity, Hadoop 2.0 New Features- NameNode, High Availability, HDFS Federation, MRv2, YARN, Running MRv1 in YARN.

12

513


2 Hive What is Hive?, Architecture of Hive, Hive services, Hive Clients, How it differs from RDBMS, Introduction to HiveQL, Data Types and file formats in Hive, File encoding, Common problems while working with Hive. HiveQL: Managed and external tables, Understand storage formats, Sorting And Aggregating, Map Reduce Scripts, Joins & Subqueries, Writing user defined functions, Data types and schemas, Querying data.

12

3 PIG Concepts of Pig , Installation of a Pig engine, Queries, Case Study

12

4 Apache Spark RDD, RDD Transformations & Meaning, Advanced Spark programming

9

Pedagogy


Books Recommended

1. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop Solutions”, Wiley, ISBN: 9788126551071, 2015.

2. Chris Eaton, Dirk deroos et al. , “Understanding Big data ”, McGraw Hill, 2012.

3. Tom White, “HADOOP: The definitive Guide” , O Reilly 2012. 4. Vignesh Prajapati, “Big Data Analytics with R and Haoop”, Packet Publishing 2013. 5. Tom Plunkett, Brian Macdonald et al, “Oracle Big Data Handbook”, Oracle Press, 2014. 6. http://www.bigdatauniversity.com/ 7. Jy Liebowitz, “Big Data and Business analytics”,CRC press, 2013 Suggested Evaluation Methods


a) Unit test 1 b) Unit Test 2 c) Assignments d) Presentation e) Quizzes



514


S. No.




Name of Member


Dr. Swati Ahirrao




Signature

Name of Experts Dr. Sandeep deshmukh

Designation Data Analyst

Org. / Inst. freelancer

Signature


515



Specialization: Computer Science and Information Technology Course Name: Neural Networks (UG/PG): UG Number of Credits: 3 Level: Learning Outcomes The students are able to:

1. Outline the basic concepts of Neural Networks (NN). 2. Apply various NN learning processes and rules. Design and implement

applications of Neural Networks (NN) in different sectors such as manufacturing, finance, medical etc.

3. Sketch and use various Perceptron Models & Networks. 4. Apply multilayer perceptron models in real life concepts. 5. Implement and use NN theorems, models and learning techniques.

Pre Learning: Statistics, probability, fundamentals of data analytics. Pedagogy 1. Lab using programming languages like MATLAB and C 2. Case studies 3. Mini projects

516


Course Outline

S. No. Topics Hours

1

Introduction to Neural Networks: What is a Neural Network?, Human Brain, Models of Neuron, Neural Networks viewed as directed graphs, Feedback, Network Architectures, Knowledge representation, Artificial Intelligence and Neural Networks.

10

2

NN learning process: Introduction, Error-correction learning, Memory-based learning, Hebbian learning, Competitive learning,Boltzamann learning, Credit Assignment problem, Learning with a Teacher, Learning without a Teacher, Learning tasks, Memory, Adaptation.

10

3

Perceptron Models & Networks: Statistical nature of the learning process, Statistical learning theory, Approximately correct model of learning. Single Layer Perceptron: Adaptive filtering problem, Unconstrained optimization techniques, Linear least-squares filters, Least-mean square algorithm, Learning curves, Learning rate annealing techniques, Perceptron convergence theorem, Relation between the Perceptron and Bayes classifier for a Gaussian environment.

10

4

Multilayer perceptron models: Introduction, Back-propagation Algorithm, XOR problem, Heuristics for making the back-propagation algorithm perform better, Output representation and decision rules, Feature detection,Hessian matrix, Generalization, approximation of functions, Cross validation, Network pruning techniques, virtues and limitations of backpropagation learning, Convolution networks..

8

5

Study of NN Theorems, models and learning: Kolmogorov Theorem, Hopfield Neural Model and the Hamming Neural Model, Learning of multilayer NN, tree based learning, associative learning, SVM based Learning.

7

517


Books Recommended 1. S. Rajasekharan and G. A. Vijayalakshmi pai, “Neural Networks, Fuzzy logic,

Genetic algorithms: synthesis and applications”, PHI Publication, 2004.

2. Simon Haykin, “Neural Networks- A comprehensive foundation”, Pearson Education, 2001.

3. S. N. Sivanandam, S. Sumathi, S. N. Deepa “Introduction to Neural Networks using MATLAB 6.0”, TMH, 2006.


a) Lab Test b) Lab Assignments

B) End Semester Examination a) Lab Exam b) Viva-Voce

Parallel/Similar courses in the existing curriculum Sr. No.


1. Neural Networks and Fuzzy Logic

BITS Pilani

2. Neural Networks in Communication

Pune University


Name of Member Poorva Agrawal Dr. Shraddha Phansalkar Designation Assistant Professor(CS & IT) Associate Professor (CS & IT) Org. / Inst. SIT SIT Signature

Name of the Expert: Dr. Parag Kulkarni Signature of Dean: Date:

518





(Established under section 3 of the UGC Act 1956, by notification No.F.9-12/2001-

U3 Government of India) Accredited by NAAC with ‘A’ Grade


______________________________________________________________________________ Sub Committee - Specialization for Curriculum Development


Course Title: Data Science Number of Credits : 3 Level : ________________ Learning Objective/Outcome(s):

1. .Introduction to major concepts in data science. 2. Use of R language to carry out basic statistical modeling and analysis. 3. To understand the significance of exploratory data analysis (EDA) in data science.

Demonstrate different tools to carry out EDA. 4. Apply basic machine learning algorithms for predictive modeling. 5. To createeffective visualization of given data. 6. Understanding ethical and privacy issues in data science conduct.

Pre-learning: Students are expected to have basic knowledge of algorithms and reasonable programming experience, some familiarity with basic linear algebra, basic probability and statistics. Course Outline Sr.No. Topics Hours 1. Introduction: What is Data Science?

- Big Data and Data Science hype - and getting past the hype - Why now? - Datafication - Current landscape of perspectives

4

519


- Skill sets needed 2. Statistical Inference

- Populations and samples - Statistical modeling, probability distributions, fitting a model - Intro to R

8

3. Exploratory Data Analysis and the Data Science Process - Basic tools (plots, graphs and summary statistics) of EDA - Philosophy of EDA - The Data Science Process - Case Study: RealDirect (online real estate firm)

8

4. Three Basic Machine Learning Algorithms - Linear Regression - k-Nearest Neighbors (k-NN) - k-means Feature Generation and Feature Selection (Extracting Meaning From Data) - Motivating application: user (customer) retention - Feature Generation (brainstorming, role of domain expertise, and place for imagination) - Feature Selection algorithms { Filters; Wrappers; Decision Trees; Random Forests

10

5. Mining Social-Network Graphs - Social networks as graphs - Clustering of graphs - Direct discovery of communities in graphs - Partitioning of graphs - Neighborhood properties in graphs Data Visualization - Basic principles, ideas and tools for data visualization

10

6. ` Data Science and Ethical Issues - Discussions on privacy, security, ethics - A look back at Data Science - Next-generation data scientists

5

Pedagogy

4. 30% of the sessions is a classroom teaching 5. 50 % of the content is to be conducted with handson. 6. Some of the advanced topics will be based on self learning

Books Recommended: Cathy O'Neil and Rachel Schutt. Doing Data Science, Straight Talk From The Frontline. O'Reilly. 2014.

520



1. Essential a) Unit tests b) Seminars c) Assignments

2. Optional a) Quiz/MCQ b) Mini Project



S. No.


Name of Members

Designation

Org. / Inst.

Signature

Name of Experts

Designation

Org. / Inst.

Signature


521






Under Graduate

Course Title: Optimization Techniques and Algorithms

Course Code:


Level: 4


The students are able to



Pre-learning:

Knowledge of basic Engineering Mathematics and design of algorithms is desirable.

522


Course Outline:


1

Introduction to Optimization:

Introduction to optimum design and what is optimization, engineering applications of optimization, design variables, constraints, objective functions, variable bounds, Formulation of design problems classification of optimization techniques, generalized problems formulation of optimization problem, Concept of global and local minima, problem formulation and graphical optimization method.

10

2

Introduction to Optimization Algorithms:

Classification of optimization algorithms (deterministic and stochastic), Introduction to heuristic and metaheuristic algorithms and their differences, Properties & Characteristics of Metaheuristics, Nature inspired optimization algorithm types, Self-organizing systems, different problem classes, Concept of Hybridization of algorithms and No-Free-Lunch Theorem

10

3

Genetic Algorithms:

Introduction to Evolutionary techniques, Motivation from the Darwinian Evolution , Genetic Algorithm Mechanism , Flow chart

Search Operators and their Variations : Crossover, mutation, crossover and mutation rates

Selection Schemes: Fitness proportional selection and fitness scaling, ranking, tournament selection, selection pressure and its impact on evolutionary search

Applications of Genetic Algorithm and Illustration of the algorithm using relevant problems,

Simulated Annealing: Introduction, Flow chart, Algorithm and Features

20

4

Swarm and Socio-inspired Optimization

Particle Swarm Optimization:

Introduction to Swarm Intelligence and swarm optimization,

20

523


mechanism and flowchart, mathematical implementation and Improvement to the Particle Swarm Optimization Method and Applications

Cohort Intelligence:

Basic Concepts of Socio-inspired class of algorithms, Cohort Intelligence Algorithm (CI) and methodology, Applications (to continuous and combinatorial problems), Variations of CI algorithm.

Pedagogy

1. Lectures 2. Case Studies 3. Tutorial

Books Recommended

1. “Nature-Inspired Optimization Algorithms”, 1st Edition, Xin-She Yang, Elsevier 2. “Introduction To Optimum Design”,Jasbir Arora, IIIrd Edition ,Elsevier Academic Press 3. “Optimization for Engineering Design: Algorithms and Examples”, Kalyanmoy Deb, PHI






A. Continuous Assessment a. Unit Tests b. Assignment c. Mini Project d. Case Study



S. No.




524


Name of Members

Prof Meeta Kumar


Dr. Anand Kulkarni


Associate Professor

Associate Professor




Signature

Name of Expert

Dr. Anand Kulkarni

Signature of Dean:

Date:

525



Specialization: Computer Science and Information Technology Course Name: Neural Networks Lab (UG/PG): UG Number of Credits: 1 Level: Learning Outcomes The students are able to:

1. Choose and relate, Artificial Neural Networks (ANN) and its activation function implementations with different ANN models.

2. Prepare and use ANN learning rules. 3. Sketch and use Perceptron Models & Networks. 4. Compute using various ANN training models. 5. Use and demonstrate several ANN theorems. 6. Apply ANN models to solve real world problems.

Pedagogy 1. Lab using programming languages like MATLAB and C 2. Case studies 3. Mini projects

Pre-requisites None Course Outline S.

No. Topics Hours

1 Introduction to ANN & its models: Implementation of Artificial Neural Networks and Activation Functions using McCulloch and Pitts’s Neuron Models.

5

2 ANN learning rules: Artificial Neural Networks Unsupervised Learning Rules. Artificial Neural Networks Supervised (Perceptron & Delta) Learning Rules.

5

3 Perceptron Models & Networks: Perceptron Models, Discrete, Continuous and Multi-Category models, Training Algorithms, Discrete and Continuous Perceptron Networks.

5

4 Introduction to Training models: Study and Implementation of Credit Assignment Problem, Generalized Delta Rule, Backpropagation (BP) Training.

5

5 Study of ANN Theorems: Implementation of Backpropagation Algorithm, Kolmogorov

5

526


Theorem. 6 Study of ANN models:

Implement the Hopfield Neural Model and the Hamming Neural Model.

5

Books Recommended 1. John Yen and Reza Langan, “Fuzzy Logic: Intelligence, Control and Information”,

Pearson Education, 2004 2. Simon Haykin, “Neural Networks- A comprehensive foundation”, Pearson

Education, 2001 3. S. N. Sivanandam, S. Sumathi, S. N. Deepa “Introduction to Neural Networks

using MATLAB 6.0”, TMH, 2006

Suggested Evaluation Methods” Lab Test, Lab Assignments, ESE Lab Exam and Viva-Voce Parallel/Similar courses in the existing curriculum Sr. No.


1. Neural Networks and Fuzzy Logic Lab BITS Pilani 2. Neural Networks in Communication Lab Pune University Sub-specialization committee

Name of Member

Poorva Agrawal Dr. Shraddha Phansalkar

Designation Assistant Professor (CS & IT) Associate Professor (CS & IT)

Org. / Inst. SIT SIT Signature Name of the Expert: Signature: Date:

527


Faculty of Engineering Specialization: Computer Science

Course Name:Data Science Lab (UG/PG):PG Number of Credits:2 Level:3 Learning Objectives

1. Demonstrate implementation of statistical programming concepts in R 2. Demonstrate the application of R package for advanced statistical analysis

Pedagogy

1. Hands-on sessions in lab with R 2. Practical assignments 3. Case-study

Pre-requisites : None Course outline

528


Books Recommended

1. The R Book, second edition, Michael J. Crawley,Wiley Publications. 2. Hands-on Programming with R, Garrett Grolemund, O’Reilly publications

Website for tutorials: www.tutorialspoint.com/r Suggested Evaluation Methods

A. Continuous Assessment Essential

Lab assignments Lab tests

B. End Semester Examination ESE written exam

S.No. Topic Hours

1

R-Programming Basics Basic Syntax, Data types, variables, operators, loops, if-else Functions, strings, vectors, list, matrices, arrays, factors, data frames

6

2

R-data interfaces Importing data from file formats Csv, excel and binary files Data frames and R –database

6

3 R-plotting tools Pie charts, Bar charts, boxplots, Histograms, line graph, scatterplots 6

4

Statistics with R Mean, mode and median, Linear regression, Multiple regression, logistic regression, Binomial and Poisson distributions Time series analysis, decision tree and non-linear Least Square in R Chi-square analysis

8

5 Case study Applying R in multivariate analysis, Bayesian analysis and tree models and survival analysis

4

529


Parallel/Similar courses in the existing curriculum: S.No. Name of the course Institute where it was offered Sub specialization committee

Name of Member



Org. / Inst. SIT

Signature


530






Under Graduate

Course Title: OptimizationTechniques and Algorithms Lab Course Code: Number of Credits: 1 Level: 4 Learning Objective/Outcome (s): The students are able to



Pre-learning: Knowledge of basic Engineering Mathematics and design of algorithms is desirable. Course Outline:

531


Books Recommended

1. “Nature-Inspired Optimization Algorithms”, 1st Edition, Xin-She Yang, Elsevier 2. “Introduction To Optimum Design”,Jasbir Arora, IIIrd Edition ,Elsevier Academic Press 3. “Optimization for Engineering Design: Algorithms and Examples”, Kalyanmoy Deb, PHI






A. Continuous Assessment a. Tutorial b. Lab Assignment c. Case Study



1 Formulation of optimization problems(at least three to four problems could be formulated) 06

2 Formulation the linear problem and further solving using graphical optimization approach 06

3 Computing the solution to a uni-modal / multimodal problem using Genetic Algorithm 06

4 Computing the solution to a uni-modal / multimodal problem using Swarm intelligence approach like PSO 06

5 Computing the solution to a uni-modal / multimodal problem using Cohort IntelligenceAlgorithm 06

532



S. No.




Name of Members Prof Meeta Kumar Dr. Shraddha Phansalkar

Dr. Anand Kulkarni

Designation Assistant Professor Associate Professor Associate Professor




Signature


Name of Expert

Dr. Anand Kulkarni

533



Specialization: Computer Science and Information Technology Course Name: Machine Learning Lab (UG/PG): PG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Apply machine learning techniques in the design of computer systems, using tools of ML, 2. Explain the relative strengths and weaknesses of different machine learning 3. Methods and evaluate results, 4. Demonstrate knowledge of the incremental learning using naïve bays and evaluate results, 5. Evaluate cross validation techniques and give comparative analysis, 6. Apply machine learning techniques to a selected problem of ANN.

Pedagogy

1. Interactive sessions and brain storming to evaluate the role of the end user in the success of an information system

2. Seminars 3. Mini project

Pre-requisites None Lab syllabus: Sr. No. Topic Hours 1 Basics of R, ROC curve, regression etc. Introduction to SVMLight, LIBSVM,

SVMTool etc.

3

2 Apply Bayes theorem on a sample case study and data set. Evaluate Results.

3

3 Apply Naïve Bayes theorem on a sample case study and data set. Evaluate Results.

3

4 Evaluate Cross validation technique(s) using ML tools, using sample data set and case study to give comparative analysis for the best methodology.

4

5 Discuss case study using ML tools for ANN.

2

534


Text Books:

1. E. Alpaydin: "Introduction to Algorithms", 3rd ed. MIT Press, 2014. ISBN 978-0-26202-818-9.

2. Bishop, C. (2006). Pattern Recognition and Machine Learning. Berlin: Springer-Verlag.

Reference books:

1. MacKay, David. Information Theory, Inference, and Learning Algorithms. Cambridge, UK: Cambridge University Press, 2003. ISBN: 9780521642989.

2. Hastie, T., R. Tibshirani, and J. H. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. New York, NY: Springer, 2001. ISBN: 9780387952840.

3. Mitchell, Tom. Machine Learning. New York, NY: McGraw-Hill, 1997. ISBN: 9780070428072.





Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Sub-specialization committee Name of Member Shraddha Phansalkar ShrutiPatil Preeti Mulay Swati Ahirrao






Signature


535



Specialization: Computer Science and Information Technology Course Name: Natural Language Processing Lab (UG/PG): UG/PG Number of Credits: 1 Level: 4 Learning Objectives The students will be able to:

1. Learn and assess major NLP tools using open source technology, 2. Become agile with NLTK programming 3. Predict using NLP Models 4. Use language influentially, with the help of NLP translation Models 5. Evaluate information retrieval details using Toolkit 6. Develop an emotion detection /sentiment analysis using advanced NLP Techniques

Pedagogy 1. Interactive sessions and brain storming to evaluate the role of the end user in the success of

an information system 2. Mini project

Pre-requisites None List of experiments in NLP Lab:

Sr. No.

Topic Hours

1 Introduction to open source NLP tools like GATE or UIMA.

3

2 Introduction to NLTK.

2

3 Cricket Game or any other game Prediction.

3

4 Machine Translation from English-Hindi.

3

5 Query Expansion for Information Retrieval.

2

6 Emotion detection for texts.

2

Textbooks:

536


1. Daniel Jurafsky and James H Martin. “Speech and Language Processing”, Second Edition, Pearson Education, 2009.

2. Steven Bird, Ewan Klein, and Edward Loper, “Natural Language Processing with Python-Analyzing Text with the Natural Language Toolkit”, O'Reilly Media, 2009. Reference Books: 1. James A..“Natural language Understanding”, Second Edition, Pearson Education, 1994. 2. Bharati A., Sangal R., Chaitanya V..“Natural language processing: a Paninian perspective”,PHI, 2000. 3. Siddiqui T., Tiwary U. S..“Natural language processing and Information retrieval”, OUP,2008. Suggested Evaluation Methods C) Continuous Assessment



D) End Semester Examination Written Exam

Parallel/Similar courses in the existing curriculum S.No. Name of the course Institute where it is offered Sub-specialization committee Name of Member Shraddha Phansalkar ShrutiPatil Preeti Mulay Swati Ahirrao






Signature


537





______________________________________________________________________ Sub Committee Engineering – Computer Science/IT for Curriculum

Development Course Title: Computer Graphics Course Code: Number of Credits: 3 Level: 2 Course Outcome (s): The students are able to: 1. Describe concepts of computer graphics with emphasis on the working

of drawing and rendering algorithms and their comparative analysis. 2. Express 2D and 3D transformations on objects. 3. Explain windowing and clipping techniques on line and polygon. 4. Illustrate hidden surfaces removal techniques, shading, curves and

fractal generation methods. 5. Demonstrate the logic to develop animation and gaming programs.

Pre-learning: Basic programming, basics of linear algebra and matrices

538


Course Outline Sr. No. Topic Hours

1

Introduction Basic concepts, applications of computer graphics, graphics display devices, pixel, frame buffer, resolution, aspect ratio, line generation using Digital Differential Analyzer (DDA) and Bresenham's algorithm, thick line segments, antialising of lines, circle generation using DDA and Bresenham's algorithm, ellipse generation algorithms, polygon types, their representations, entering polygons, polygon filling using seed fill, edge fill, scan conversion algorithm. Scan conversion in real time, solid area scan conversion, run length encoding.

9

2

2D & 3D Transformation Introduction, translation, scaling, rotation, matrix representation and homogeneous coordinates, composite transformation: rotation about an arbitrary point, reflection and shear transformation, 3D Transformations: translation, rotation, scaling and reflection, composite transformations: rotation about an arbitrary axis, 3D viewing transformations, concept of parallel and perspective projections, viewing parameters.

9

3

Windowing and clipping Windowing and clipping using viewing transformation, 2D clipping, Sutherland-Cohen, subdivision line clipping algorithm, midpoint subdivision algorithm, generalized clipping, Cyrus-Beck algorithm, interior and exterior clipping, polygon clipping, Sutherland-Hodgman algorithm, 3D clipping, mid-point subdivision algorithm.

9

4

Hidden surfaces and lines, curves and fractals Hidden surfaces and lines study using Back-face removal algorithm, hidden line methods, Z buffer, Warnock and Painters algorithm, light, color and shading: diffused illumination, point source illumination, shading algorithm, curves and fractals study curve generation, interpolation, interpolating algorithms, interpolating polygons, B-Spline and corners, Bezier curves, fractals, fractal surfaces and lines.

9

5

Animation and Gaming Uses of animation, types of animation, principles of animation, techniques of animation such as onion skinning, motion cycling, masking, flip book animation, rotoscoping & blue-screening, color cycling, morphing, animation on the web, 3D

9

539


animation, creating animation. Gaming: Introduction, Gaming platform (NVIDIA, i8060 etc.), Advances in Gaming, Graphics Tools: Introduction, Interactive graphics tool: OpenGL

Pedagogy

1. Classroom teaching 2. Seminars

Books Recommended 1. Computer Graphics (Principles and Practice) by Foley, van Dam, Feiner and

Hughes, Addisen Wesley 2. Computer Graphics by D Hearn and P M Baker, Printice Hall of India 3. Mathematical Elements for Computer Graphics by D F Rogers, McGraw Hill 4. Curves and Surfaces for Computer Aided Geometric Design by G Farin,

Academic Press 5. Computer Graphics with Open GL by Donald D. Hearn, Pearson Suggested Assessment/ Evaluation Methods

A) Continuous Assessment a) Unit Tests b) Seminars c) Quizzes d) Assignments e) Group Discussions


Benchmarked against similar courses in other national/ international universities /organizations S. No. Name of the Course Name of University where it

is offered 1 Computer Graphics IIT, Delhi 2. Computer Graphics Pune University Sub-specialization committee

Name of Member

Gagandeep Kaur

Designation Assistant Professor (IT Dept.)

Org. / Inst. SIT

Signature

Name of experts

Designation

Org. / Inst.


540






Under Graduate/Post Graduate

Course Title: Software TestingTools Course Code: T7139 (Under Graduate) Number of Credits:3 Level: 4 Learning Outcome (s): The students are able to:

1. Classify, distinguish and compare different software testing approaches.

2. Analyse and design good test cases using different case studies and test case deign strategies such as black box testing and white box testing.

3. Analyse, classify and compare different automation tools like Bugzilla, Selenium, and QTP, and list its features.

Pre-learning: Knowledge of Software Engineering is desirable. Course Outline S.No. Topic Hours

1 Introduction to Software Testing Need of testing, basic concepts: errors, faults, defects, failures, test bed. type of testing : unit testing, integration testing system, system testing, regression testing, alpha, beta and acceptance testing , functional testing, performance testing, recovery testing, white box testing, black box testing, verification and validation model, test case design, review of specification, static and dynamic black box testing.

13

2 Software Testing Life Cycle and Test Management Testing Life Cycle: roles and activities, test planning: forming a test team, develop test plan review, test cases design strategies: black box approach: random testing, equivalence class partitioning and boundary value analysis. White box approach: test adequacy criteria, coverage and control flow graphs, paths, loop testing, mutation tests. Test execution:

13

541


build test data, life cycle of defect, defect tracking. 3 Automation Testing Tools

Selenium, Test Complete, Bugzilla, Unified Functional Testing (Formerly known as QTP)

19

Pedagogy

1. Classroom teaching 2. Seminars 3. Interactive Sessions/Case Study

Books Recommended 1. “Practical Software Testing”, Iien Burnstein, Springer Publication. 2. “Effective Methods for Software Testing”, William E Perry, Wiley Publication,

Second Edition. 3. “Software Metrics A Rigorous and Practical Approach”, Norman E. Fenton,

Thomson Publication, Second Edition.




2. Optional e) Quizzes



S. No.


1 Software Testing and Analysis Illinois Institute of Technology, Chicago.

2. Software Testing IIT Bombay 3. Software Verification and Validation

Testing Thapar University, Patiala

Name of Members Ms. Dipti Kapoor Sarmah

Ms. Gagandeep Kaur




Signature

542


Name of Experts

Mr. Vivek Nighojkar

Designation

Senior Software Development Test Engineer

Org. / Inst. Afour Technologies Pvt. Ltd.

Signature


543



Course Name: Natural Language Processing (NLP) (UG/PG): UG Number of Credits: 3 Level: 4 Learning Outcomes The students will be able to:

1. Learn and assess major NLP concepts, issues and solutions, 2. Become agile with the elements of NLP, 3. Learn how to parse or analyse the input given using natural language, 4. Learn how to “Hear what's behind the words” using NLP models / NLTK kit, 5. Use language influentially, using approaches suggested by NLP models, 6. Compare and contrast approaches to NLP

Pedagogy

1. Interactive sessions and Brainstorming 2. Classroom teaching 3. Seminars 4. Mini project

Pre-requisites None Course Outline Sr. No. Topic Hours

1.

Unit 1 Introduction to NLP concepts. Natural language and formal language, Regular expression, NLP applications in various domains, case studies, tools and techniques applicable for NLP, Models, ambiguity, phases in NLP,

4

2.

Unit 2 Knowledge and Comprehension Explain the elements and applications of: text processing, part-of-speech tagging, BoW, morphology, chunking, semantic analysis,discourse processing, dialog models, natural language applications, Handling of unknown words, named entities, multi word expressions, A survey on

8

544


natural language grammars, lexeme, phonemes, phrases and idioms, word order, agreement, tense, aspect and mood and agreement, Context Free Grammar, Introduction to applications of Machine Learning for NLP.

3.

Unit 3 Parsing Unification, probabilistic parsing, shallow parsing, TreeBank, Semantics- Meaning representation, semantic analysis, lexical semantics, WordNet. Introduction to Opinion Mining.

8

4.

Unit 4 Applications and Analysis Simple language processing with the Natural Language Toolkit (NLTK), Machine Learning with the NLTK, Apply cooperative group skills and critical-thinking skills germane to NLP, Understand and discuss few current research papers related to NLP.

8

5.

Unit 5 Synthesis and Evaluations Compare and contrast approaches to NLP, Discuss the limitations and promise of NLP. Research orientation - Semantic Role Labeling, Text Entailment, Cross Lingual Information Retrieval, Named Entity Recognition, Word Sense Disambiguation

12

Books Recommended

1. Allen, James, Natural Language Understanding, Second Edition, Benjamin/Cumming, 1995. 2. Charniack, Eugene, Statistical Language Learning, MIT Press, 1993. 3. Jurafsky, Dan and Martin, James, Speech and Language Processing, Second Edition,

Prentice Hall, 2008. 4. Manning, Christopher and Heinrich, Schutze, Foundations of Statistical Natural Language

Processing, MIT Press, 1999. 5. Radford, Andrew et. al., Linguistics, An Introduction, Cambridge University Press, 1999.

Research Papers/Articles recommended for reading Journals :

1. Computational Linguistics, Natural Language Engineering, Machine Learning, Machine Translation, Artificial Intelligence, AI Magazine, IEEE SMC

2. Conferences : Annual Meeting of the Association of Computational Linguistics (ACL),

Computational Linguistics (COLING), European ACL (EACL), Empirical Methods in NLP (EMNLP), Annual Meeting of the Special Interest Group in Information Retrieval (SIGIR), Human Language Technology (HLT).




545


b) Mini Project B) End Semester Examination Written Exam

Parallel/Similar courses in the existing curriculum Sr. No. Name of the course Institute where it is offered Sub-specialization committee

Name of Member

Dr. Prof. Preeti Mulay

Prof. Vijayashri Khedkar

Dr. Prof. Swati Ahirrao





Signature

Name of the Expert: Er. Vivek Gavane, C-DAC, Pune. Signature: Date:

546






Under Graduate Course Name: Introduction to Artificial Intelligence and Machine Learning Course Code: Number of Credits: 3 Level: Learning Outcome(s): The students are able to:

1. Explain definition, goals and applications of Artificial Intelligence (AI) with examples

2. Illustrate various properties of Internal Representation in AI 3. Evaluate solving problems in AI by various search techniques 4. Illustrate various knowledge representations using predicate and non-

monotonic logicofAI 5. Analyze and apply various AI techniques to real world applications 6. ApplyNatural Language Processing (NLP)techniques in various AI applications 7. Outline and organizearchitecture of Expert System and implementrelated

case studies 8. Illustrate various learning techniques including incremental learning, deep

learning and machine learning


547



1 Introduction to Artificial Intelligence (AI) Definition, goals of AI, AI Applications, AIrepresentation, properties of internal representation.

6

2 Problem Solving Solving problems in AI by searching, study and analysis of various searching algorithms, heuristic search techniques, best first search, mean and ends analysis, A* and AO* Algorithm.

6

3 Knowledge Representation using Predicate, Non-monotonic Logic Predicate calculus, predicate and arguments, ISA hierarchy, frame notation, resolution, natural deduction.Truth maintenance system (TMS), statistical and probabilistic reasoning, fuzzy-logic, structure knowledge representation, semantic-net, frames, script, conceptual dependency.

12

4 AI techniques Distance based NN, Multilayer NN, k-NN, Pattern recognition, Feature extraction/selection, Self-organizing neural network, learning strategy (Winner-take-all), Learning vector quantization, case study discussion

6

5 Introduction of Machine Learning concepts: Definition of learning systems. Goals and applications of machine learning. Aspects of developing a learning system: training data, concept representation, function approximation. Inductive Classification: The concept learning task. Concept learning as search through a hypothesis space. General-to-specific ordering of hypotheses. Finding maximally specific hypotheses. Version spaces and the candidate elimination algorithm. Learning conjunctive concepts. The importance of inductive bias.

10

6 Evaluation of Learning Algorithms: Measuring the accuracy of learned hypotheses. Comparing learning algorithms: cross-validation, learning curves, and statistical hypothesis testing.

6

Pedagogy 1. Class room teaching 2. Case studies 3. Mini projects

Books Recommended 1. “Artificial Intelligence application programming”, M.Tim Jones, Dreamtech Press 2. “Artificial intelligence: A modern approach”, Stuart J. Russell, Peter Norvig,

Printice Hall of India Private Ltd, 2008, Second edition, ISBN: 9788120323827 3. “Artificial intelligence”, Ravi Bhushan Mishra, PHI Learning Pvt Ltd

548


Suggested Evaluation Methods Unit Tests, Seminars, Assignments, Quizzes, Mini project, End Semester Examination

Benchmarked against similar courses in other national/ international universities /organizations: S.No. Name of the course Institute where it is offered 1. Computer Science & Artificial

Intelligence VIT Vellore

2. Artificial Intelligence: Principles and Techniques

Stanford University, USA.


Name of Member

Poorva Agrawal Dr. Shradhha Phansalkar Preeti Mulay





Name of the Expert: Er. Vivek Gavane Signature of Dean: Date:

549





______________________________________________________________________


Undergraduate

Course Title: Network Security Lab

Course Code: 070122720 Number of Credits: 1

Level: 3

Learning Objective/Outcome (s): The students are able to:

1. To understand widely used algorithms such as DES, RSA and Diffie-Hellman key exchange. 2. To get deeper insight into attacks models: TCP attacks, Distributed Denial of Service attacks. 3. To study protocols: Internet Protocol security (IPSec), Transport layer security, S/MIME. 4. To investigate how to detect intrusion detection and countermeasures for viruses, worms and malicious

programs. Pre-learning None

550


Course Outline

Sr. No.

List of Experiments No. of Sessions

1. Network forensic lab using Nmap tool 3

2. Basic cryptography - Caesar cipher and substitution ciphers using an open source tool Cryptool.

3

3. Symmetric and Asymmetric key Encryption - DES, Triple DES and RSA

2

4. Hashing - one-way randomness in hash-function 2

5. Mini- Project 5 Pedagogy

1. Computer simulations using N-map tool, Cryptool.

Books Recommended 5. William Stallings, “Network Security Essentials- Applications and Standards”, Third Edition, Pearson

Education. 6. William Stallings, “Cryptography and Network Security: Theory and Practice”Fourth Edition, John Wiley.


1. Evaluation of Lab performance 2. Viva

Course Outcomes: CO1: Understand working on N-map tool for Network forensic CO2: Perform basic cryptography CO3: Implement Symmetric and Asymmetric key Encryption algorithms CO4: Perform Hashing function Course Articulation Matrix: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)


CO1 2 2 3 1 1

CO2 2 2 3 1 1

CO3 2 2 3 1 1

CO4 2 2 3 1 1

CO5 2 2 3 1 1

551



S. No.


1 Network Security IIT Kharagpur

2. Network Security North Carolina State University


Name of Members Dr Himanshu Agrawal Prof. Prachi Kadam

Designation Associate Professor Assistant Professor (CS & IT)


Signature

552

Faculty of Engineering Specialization: Civil Engineering - Symbiosis ...

Documents

Transcript of Faculty of Engineering Specialization: Civil Engineering - Symbiosis ...