GOGTE INSTITUTE OF TECHNOLOGY · 2018-08-02 · Gogte Institute of Technology shall stand out as an...

KARNATAK LAW SOCIETY‘S

GOGTE INSTITUTE OF TECHNOLOGY UDYAMBAG, BELAGAVI-590008

(An Autonomous Institution under Visvesvaraya Technological University, Belagavi)

(APPROVED BY AICTE, NEW DELHI)

Department of Computer Science & Engineering

Scheme and Syllabus (2016 Scheme)

5th

Semester Computer Science & Engineering

INSTITUTION VISION

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

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

and entrepreneurial skills.

MISSION

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

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

solving ability with an analytical and innovative mindset.

QUALITY POLICY

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

disciplined and a research oriented environment.

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

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

innovating and excelling in every sphere of quality education.

DEPARTMENT VISION

To be recognized as center of Excellence for Education, research and entrepreneurial skills in

the field of Computer Science and Engineering with an aim of building creative IT

professionals to meet global challenges.

MISSION

To train the students, to cultivate inquisitive mindset for identifying and analyzing real life

problems and develop optimal computer solutions for the benefit of the society.

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

1. The graduates will acquire core competence in basic science and engineering

fundamentals necessary to formulate, analyze and solve engineering problems and to

pursue advanced study.

2. The graduates will acquire necessary techno-managerial and life-long learning skills to

succeed as computer engineering professionals with an aptitude for higher education

and entrepreneurship.

3. The graduates will maintain high professionalism and ethical standards and also develop

the ability to work in teams on IT as well as multidisciplinary domains.

PROGRAM OUTCOMES (POs)

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

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

problems.

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

engineering problems reaching substantiated conclusions using first principles of

mathematics, natural sciences, and engineering sciences.

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

and design system components or processes that meet the specified needs with

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

environmental considerations.

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

research methods including design of experiments, analysis and interpretation of data,

and synthesis of the information to provide valid conclusions.

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

modern engineering and IT tools including prediction and modeling to complex

engineering activities with an understanding of the limitations.

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

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

relevant to the professional engineering practice.

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

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

need for sustainable development.

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

and norms of the engineering practice.

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

leader in diverse teams, and in multidisciplinary settings.

10. Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and

write effective reports and design documentation, make effective presentations, and give

and receive clear instructions.

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

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

and leader in a team, to manage projects and in multidisciplinary environments.

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

engage in independent and life-long learning in the broadest context of technological

change.

PROGRAM SPECIFIC OUTCOMES (PSOs)

1. Problem solving skills: Ability to identify and analyze problems and propose solutions

by applying fundamental concepts and algorithms.

2. Project development skills: Ability to apply and demonstrate best practices of software

development processes to solve real life problems.

3. Professional skills and Entrepreneurship: Ability to demonstrate professional and

leadership qualities required to pursue innovative career in Information Technology,

self-employment and higher studies.

Scheme of Teaching

Fifth Semester

Fifth Semester (Regular)

S.N

o. Course

Code Course

Contact

Hours

Total

Contac

t

Hours/

week

Tota

l

credi

ts

Marks

L – T - P

CIE SEE Total

1. 16CS51 Unix System Programming PC1 3 – 1 – 0 4 4 50 50 100

2. 16CS52 Formal Languages and Automata

Theory PC2 3 – 1 – 0 4 4 50 50 100

3. 16CS53 Software Engineering PC3 3 – 0 – 0 3 3 50 50 100

4. 16CS54 Computer Networks PC4 3 – 0 – 0 3 3 50 50 100

5. 16CS55X Elective – I PE 3 – 0 – 0 3 3 50 50 100

6. 16CSL56 Database Applications Laboratory L1 0 – 0 – 3 3 2 25 25 50

7. 16CSL57 Computer Networks Laboratory L2 0 – 0 – 3 3 2 25 25 50

8. 16CSL58 Operating System and Unix System

Programming Laboratory L3 0 – 0 – 3 3 2 25 25 50

9. 16CS59 Design Thinking and Innovation ES 1 – 0 – 2 3 2 50 50

Total 29 25 375 325 700

Fifth Semester (Diploma)

S.N

o. Course Code Course

Contact

Hours

Total

Contac

t

Hours/

week

Tota

l

credi

ts

Marks

L – T - P

CIE SEE Total

1. 16DIPMATC51 Mathematics –III

Numerical Methods and Probability 4 – 1 – 0 5 5 50 50 100

2. 16CS51 Unix System Programming PC1 3 – 1 – 0 4 4 50 50 100

3. 16CS52 Formal Languages and

Automata Theory PC2 3 – 1 – 0 4 4 50 50 100

4. 16CS53 Software Engineering PC3 3 – 0 – 0 3 3 50 50 100

5. 16CS54 Computer Networks PC4 3 – 0 – 0 3 3 50 50 100

6. 16CS55X Elective – I PE 3 – 0 – 0 3 3 50 50 100

7. 16CSL56 Database Applications

Laboratory L1 0 – 0 – 3 3 2 25 25 50

8. 16CSL57 Computer Networks Laboratory L2 0 – 0 – 3 3 2 25 25 50

9. 16CSL58

Operating System and Unix

System Programming

Laboratory

L3 0 – 0 – 3 3 2 25 25 50

10. 16CS59 Design Thinking & Innovation ES 1 – 0 – 2 3 2 50 50

Total 34 30 425 375 800

Electives-I Course Code (Elective ) – V Semester

1 16CS551 Advanced Web Programming

2 16CS552 Advanced JAVA

3 16CS553 Python Programming

4 16CS554 Advanced Algorithms

Unix System Programming

(Theory)

Course Code 16CS51 Credits 4

Course type PC1 CIE Marks 50 marks

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

Total Hours: 40 SEE Duration 3 Hours for

100 marks

Course learning objectives

1. To introduce POSIX and UNIX standards as applicable to files and processes.

2. To develop the ability to handle processes and its related functionalities.

3. To apply inter process communication using various methods of inter process communication.

4. To give basic knowledge about UNIX signals handling.

Pre-requisites: Basic knowledge of Data Structures, Operating Systems, Unix Shell

Programming.

Unit – I 8 Hours Introduction: UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard. UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics.

Unit – II 8 Hours

UNIX Files: File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes,

Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, File

and Record Locking.

Unit – III 8 Hours UNIX Processes: The Environment of a UNIX Process: Introduction, main function, Process

Termination, Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared

Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit,

setrlimit Functions, UNIX Kernel Support for Processes.

Unit – IV 8 Hours Signals and Daemon Processes: Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and waitpid API, The sigsetjmp and siglongjmp Functions, kill, alarm, Interval Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client-Server Model.

Unit – V 8 Hours Inter-process Communication: Introduction, Pipes, popen and pclose Functions, Co-processes, FIFOs, Message Queues, Semaphores, Shared Memory.

Text Books

1. Terrence Chan: UNIX System Programming Using C++, Prentice Hall India, 1999 and onwards.

2. W. Richard Stevens, ―Advanced Programming in the UNIX Environment‖ , Pearson Education, 2

nd Edition and onwards.

Reference Books 1. W. Richard Stevens, Bill Fenner, Andrew M. R., ―UNIX

® Network Programming The Sockets

Networking API‖, Volume 1, Prentice Hall India, 2nd

edition and onwards.

Course Outcome (COs)

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

Level

1 Describe the features of POSIX and UNIX standards as applicable to files and

processes using programming.

L2

2 Design and implement programs for inter process communication using pipes. L3

3 Implement and demonstrate the concept of UNIX signals and daemon

processes.

L3

Program Outcome of this course (POs) PO No.

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

engineering fundamentals, and an engineering specialization to the solution of

complex engineering problems.

1

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

problems and design system components or processes that meet the specified

needs with appropriate consideration for the public health and safety, and the

cultural, societal, and environmental considerations.

3

3. Life-long learning: Recognize the need for, and have the preparation and

ability to engage in independent and life-long learning in the broadest context

of technological change.

12

Course delivery methods Assessment methods

1. Chalk and board 1. Internal assessment

2. PPT 2. Assignment

3. Video lectures 3. Quiz

4. Seminar / project

Scheme of Continuous Internal Evaluation (CIE):

Components Average of best two

IA tests out of three

Average of two

assignments /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50

Writing two IA test is compulsory.

Minimum qualifying Marks :20 Marks (Minimum 10 Marks from IA is must)

Minimum marks required to qualify for SEE :20

Scheme of Semester End Examination (SEE):

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

calculation of SGPA and CGPA.

2. Minimum marks required in SEE to pass:40

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

questions. SEE question paper will have two compulsory questions (any 2 units) and choice will

be given in the remaining three units.

Formal Languages and Automata Theory

( Theory)





100 marks


1. To study abstract computing machines, Language representation techniques, Regular

Expressions, Grammar constructions and associated theories and tools to realize formal

language.

2. Employ finite state machines to solve problems in computing.

3. Discuss the hierarchy of problems arising in the computer science.

4. Understand the Turing theory and its significance.

Pre-requisites : Basic knowledge of problem solving and Discrete mathematics

Unit – I 8 Hours

Introduction to Finite Automata: Introduction to Finite Automata, Structural Representation. The

central concepts of Automata theory – Alphabet, Strings & Languages. Deterministic Finite Automata

(DFA), Non-Deterministic and Equivalence of NFA and DFA,

Self learning : FA with Epsilon ( ε) transitions and Applications of Finite automata.

Unit – II 8 Hours

Regular Expressions and languages: Regular Expressions, Finite Automata and Regular Expressions,

Properties of Regular Languages (RL): Proving Languages not to be Regular. Equivalence and

Minimization of Automata.

Self learning : Closure properties of Regular Languages and Applications of Regular Expressions

Unit – III 8 Hours

Context-Free Grammars (CFG) and Languages (CFL): Context-Free Grammars, Parse Trees,

Applications of Context-Free Grammars, Ambiguity in Grammars and Languages. Normal forms for

Context Free Grammar.

Self learning : Closure properties and Pumping lemma for Context Free Languages.

Unit – IV 10 Hours

Pushdown Automata (PDA): Definition of Pushdown Automata, The languages of a PDA:

Acceptance by Final state & Empty stack.

Introduction to Turing Machines (TM): Turing Machine model : Definition of Turing Machine ,

Transition Function , Instantaneous Description & Moves , Programming a Turing Machine , Language

recognition by Turing Machine.

Self learning : Deterministic Pushdown Automata, Turing Machine as a acceptors, Turing Machine as

Transducers.

Unit – V 6 Hours

LEX and YACC Tools: The Simplest Lex Program, Recognizing Words with Lex. Grammars: Parser-

lexer communication, A Yacc Parser, Rules section. Running Lex and Yacc and examples

Using Lex: Regular Expressions and examples.

Using Yacc: Shift reduce parsing, Arithmetic Expressions and Ambiguity.

Text Books

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, ―Introduction to Automata Theory,

Languages and Computation‖, Pearson Education, 3/E, 2013 and onwards.

2. John R. Levine and Tony Mason and Doug Brown, Lex and Yacc, ―UNIX programming tools‖,

2/E, 1992 and onwards.

3. S . P. Euguene Xavier ―Theory of Automata , Formal Languages and Computation ―, 5 / E 2008.

Reference Books

1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey

D. Ullman , ―Compilers Principles, Techniques and Tools”,Pearson Education , 2 / E,2008

2. Peter Linz, ―An Introduction to Formal Languages and Automata‖,Narosa Publishing House,

5/E, 2011.



Level

1 Explain the importance of Automata theory and Demonstrate the use of

Deterministic and Non-deterministic automata for obtaining the solution for

engineering problems.

L2

2 Explain the Concept of Regular Languages, Context free Languages and

Construct the Regular Expressions, Context free grammars for the given set of

pattern descriptions and language descriptions respectively.

L3

3 Analyze the properties of Regular and Context free Languages and Prove and

disprove certain languages to be Regular and Context Languages using

pumping lemma.

L5

4 Explain the concept PDA, Turing Machine and Build PDA and Turing

machine for the given set of problem descriptions.

L3

5. Formulate the finite automata concept in the design of lexical analyzer &

parsers using software tools.

L6





1

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

complex engineering problems reaching substantiated conclusions using first

principles of mathematics, natural sciences, and engineering sciences.

2





3

4. Life-long learning: Recognize the need for, and have the preparation and

ability to engage in independent and life-long learning in the broadest context

of technological change.

12


1. Chalk and board 1. Internal assessment

2. PPT 2. Assignment

3. Video lectures 3. Quiz

4. Seminar / project




Average of two

assignments /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50




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

shall be given in SEE question paper.








Software Engineering

(Theory)





100 marks

Course Learning objectives

1. To bring the importance/need for Software Engineering.

2. To create awareness about professional and ethical responsibilities of software engineers.

3. To introduce the concept of building applications by applying the required SDLC (Software

Development Life Cycle) phases

4. To emphasize on the formulation, design, implementation and testing the software project

under the estimated time/budget.

5. To explore the software testing techniques for any practical application

Pre-requisites : Database Management Systems

Unit – I

8 Hours

Introduction: Professional Software Development: Software Engineering, Software Engineering

Diversity, Software Engineering and web, Software Engineering ethics.

Software Process: Software Process models: The Waterfall model, Incremental development, Reuse-

oriented software engineering, Process activities: Software specification, Software design and

implementation, Software validation, Coping with Change: Prototyping, Incremental Delivery,

Boehm‘s Spiral Model.

Self Study : Case Studies.

Unit - II 8 Hours

Agile Software Development: Agile methods, Plan driven and Agile Development,

Self Study: Extreme Programming.

Project Planning: Software pricing, Plan-driven development: project Plans, Planning process, Project

scheduling: Schedule Representation, Agile Planning, Estimation techniques: Algorithmic cost

modeling.


Requirements Engineering: Functional and non-functional requirements: Functional requirements,

non-functional requirements, The Software requirements document, Introduction to Requirements

specification, Requirements Engineering processes: Requirement elicitation and Analysis.

Unit – IV 8 Hours

Design and Implementation: Object-oriented design using UML: System Context and Interaction,

Architectural design, Object Class identification, design Models, Interface Specification.

Software Testing: Development testing: Unit Testing, Component Testing,

Self Study : System Testing.

Unit – V 6 Hours

Quality Management: Introduction, Software quality, Software standards: The ISO 9001 standard

framework.

Configuration management: Introduction to Change management, Version management.

Text Books

1. Ian Sommerville: Software Engineering, Pearson Education, 8th Edition and onwards.

Reference Books

1. Roger.S.Pressman: Software Engineering-A Practitioners approach, 7th Edition and above, Tata

McGraw Hill, 2007.

2. Pankaj Jalote: An Integrated Approach to Software Engineering, Wiley India, 2009.



Level

1. Recall the professional & ethical responsibilities of Software Engineering. L1

2. Distinguish the various software process models. L2

3. Predict the requirements and the cost for the development of Software. L3

4. Compare the various software testing processes L4





1




2





3


1. Chalk and talk 1. Quiz

2. Power Point Presentations 2. Assignment

3. Demos 3. IA Test

4. Videos




Average of two

assignments /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50













Computer Networks

(Theory)

Subject Code: 16CS54 Credits: 03

Course Type: PC4 CIE Marks: 50 marks

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

Total Hours: 40 SEE Duration: 3 Hours for 100

marks


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

networks.

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

3. Encode and decode for the given transmitted data byte and apply algorithms for different error

checking and correction codes.

4. Compare and discuss various algorithms of transmission & application protocols.

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

Organization, Operating systems.

Unit – I 06 Hours

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

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

Unit – II 09 Hours

Data, Signals and Transmission Media: Analog and Digital, Performance, Circuit Switched

Networks, Datagram Networks, and Virtual Circuit Networks.

Self-Study:

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

technical specifications report.


Data Link Layer: Error Detection and Correction-Introduction, Cyclic Codes, Checksum,

Framing, Flow and Error Control, Protocols, Noiseless Channels and Noisy channels.

Unit – IV 09 Hours

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

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

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

Self-Study:

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

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

Unit – V 08 Hours

Transport Layer: Process To process delivery, UDP, TCP, Application and Network Management:

Application Layer Overview, Domain Name System, Email, File transfer and FTP.

Tutorial:

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

Text Books:

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

2006 and onwards.

Reference Books:

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

key architectures, Tata McGraw Hill, 2nd

Edition, 2004 and onwards.

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

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




Level

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

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

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

Circuits. L2

3.

Compare the difference between Error Detection and Error Correction techniques

for Noisy and Noiseless channels L2

4. Illustrate an appropriate subnet and Super netAddressing schemes using the

concepts of IP addressing. L2

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


1. Chalk and talk 1. Student Assignments

2. Presentations 2. Internal Assessment Test

3. Remedial Classes 3. Semester end Examination

4. Group assignments/Seminars


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

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

problems.

1

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

and design system components or processes that meet the specified needs with appropriate

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

considerations.

3

3 Environment and sustainability: Understand the impact of the professional engineering

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

need for sustainable development.

7

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

leader in diverse teams, and in multidisciplinary settings.

9




Average of

assignments (Two) /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50


Minimum marks required to qualify for SEE : 20










Advanced Web Programming

( Elective)


Course type PE CIE Marks 50 marks



100 marks


1. To write Ajax applications

2. To utilize JavaScript for the entire development cycle from front end to back end, database and

deployment.

3. To learn to write responsive code that can be deployed on any device.

Pre-requisites : Computer Concepts and C Programming, Database Management Systems, Web

Programming

Unit – I 8 Hours

Building Rich Internet Applications with AJAX: Limitations of Classic Web application

model, AJAX principles, Technologies behind AJAX, Asynchronous communication and AJAX

application model, XMLHTTP Object – properties and methods, handling different browser

implementations of XMLHTTP, The same origin policy, Cache control, AJAX Patterns:

Predictive fetch pattern, Submission throttling pattern, Periodic refresh, Multi stage download, Fall

back patterns.

Unit – II 8 Hours

Introducing Full Stack Development: Node.js, Express, MongoDB, AngularJS, Supporting cast;

Designing a MEAN stack architecture: Planning a real application, breaking the development into

stages, Hardware Architecture


Creating and setting a MEAN project: Create Express Project, Modifying Express for MVC, Import

Bootstrap for responsive layout, Setting up Heroku, Building a static site with Node and Express:

Defining routes in Express, Building basic controllers, Creating views, Connecting Express application

to MongoDB, Defining Mongoose schemas, Database development with MongoDB and Mongoose,

Installing the stack and supporting softwares

Unit – IV 7 Hours

Writing a REST API: Rules of REST API, Setting up the API in Express, GET, POST,PUT and

DELETE methods; Consuming a REST API: Call an API from Express, Using Lists of data from API,

Getting single documents from API, Adding data to the database via API, Protecting data Integrity with

data validation, writing modular JavaScript and JavaScript callbacks.

Unit – V 8 Hours

Adding Angular components to an Express application, Building a single page application with

Angular: basic and Advanced topics. Authenticating users, Managing sessions and securing APIs.

Moving the data from views to the controllers

Text Books

1. Nicholas Zakas et al, Professional Ajax, Wrox Publications, 2006 and onwards.

2. Simon Holmes, Getting MEAN: Mongo, Express, Angular, Node, Dreamtech press, 2015, 1st

Edition and onwards.



Level

1. Explain basic principles of Ajax, MEAN and MVC L2

2. Implement Responsive design techniques in Web Applications L3

3. Illustrate use of REST APIs to access data L3





1


problems and design system components or processes that meet the specified needs

with appropriate consideration for the public health and safety, and the cultural,

societal, and environmental considerations.

3

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

engage in independent and life-long learning in the broadest context of technological

change.

12


1. Lecture 1. Internal Assessment Test

2. Demonstration 2. Assignment

3. Hands on 3. Quiz

4. Presentation 4. Programming Exercises




Average of two

assignments /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50













Advanced Java

(Elective)





100 marks

Course Learning Objectives

1. To introduce the concept of multithreading in java and to present the mechanisms of Thread

synchronization and communication.

2. To introduce the design of Graphical User Interface (GUI) programming through Java Swing.

3. To familiarize the Data Base and connectivity through the Java database connectivity (JDBC)

and to introduce the basics of J2EE.

4. To explore the concept of web programming using Java Servelets.

Pre-requisites : Core Java Programming, DBMS.

Unit – I 8 Hours

Collections: Overview, Collection Interfaces, Collection classes, storing user defined classes in

collections, working with Maps, Comparators, the collections algorithms.

Unit – II 8 Hours

Multithreading: The Java thread model, the main thread, creating a thread, multiple threads, isAlive()

and join(), thread priorities, synchronization, inter thread communication, suspending, resuming and

stopping threads, thread state.


Introducing GUI Programming: Swing Features, Components and Containers, Event handling,

painting in Swing. Exploring Swing, JLabel and ImageIcon, JTextField, the Swing Buttons, JButton,

JToggleButton, Check-Boxes, Radio Buttons, JTabbedPane, JScrollPane, JList, JComboBox, Trees,

JTable.

Unit – IV 8 Hours

Java Database Connectivity (JDBC): Manipulating Databases with JDBC, Connecting to and

querying a database, RowSet Interface, PreparedStatements, Stored Procedures, Transaction Processing

Unit –V 8 Hours

Java Servlets: Background, the life cycle of a Servlet, Servlet development options, Tomcat web-

server, A simple Servlet. The Servlet API, the javax.servlet package, reading servlet parameters,

javax.servlet.http package, handling HTTP requests and responses, using cookies, session tracking.

Text Books

1. ―Java The Complete Reference‖ by Herbert Schildt, Ninth edition onwards,TataMcGraw Hill.

2. ―Advanced Java 2 Platform HOW TO PROGRAM‖ by H.M.Deitel, P. J. Deitel, Ninth edition

onwards – Prentice Hall.

Reference Book

1. ―J2EE Design and Development‖ by Rod Johnson, Wrox publishers, July 2004 and onwards.

Course Outcomes (COs)

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

Level

1. Make use of Java thread library and runnable interface to demonstrate the use of

multithreading.

L3

2. Make use of the collection framework to store and manipulate data efficiently. L3

3. Create and Design GUIs using Java Swing. L5

4. Apply JDBC and Java Servelet for software development. L3





1





3

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

and modern engineering and IT tools including prediction and modeling to

complex engineering activities with an understanding of the limitations.

5


1. Chalk and talk 1. Quiz

2. Power Point Presentations 2. Assignment

3. Demos 3. IA Test

4. Audio and Videos




Average of

assignments (Two) /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50


Minimum qualify for CIE : 20 Marks (10 Marks from IA tests is required)

Minimum marks required to qualify for SEE : 20

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

weightage shall be given in SEE question paper.




2. Minimum marks required in SEE to pass: 40

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

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

will be given in the remaining three units.

Python Programming

(Elective)





100 marks


1. To acquire programming skills in core Python.

2. To present Object Oriented concepts and implementation skills in Python.

3. To develop the skill of designing Graphical user Interfaces in Python.

4. To develop the ability to write database and web applications in Python.

Pre-requisites : Computer Concepts and C Programming, Database Management Systems, Web

Programming.

Unit – I 8 Hours

Introduction to Python, use IDLE to develop programs, Basic coding skills, working with data

types and variables, working with numeric data, working with string data, Python functions,

Boolean expressions, selection structure, iteration structure, define and use functions and

modules, Illustrative programs, Exercises.

Unit – II 8 Hours

Basic skills for working with lists, work with a list of lists, work with tuples, An introduction to file

I/O, use text files, use CSV files, use binary files, handle a single exception, handle multiple

exceptions, Two more skills, get started with dates and times, get started with dictionaries.

Illustrative programs, Exercises.


Object Oriented Programming, An introduction to classes and objects, define a class, work with

object composition, work with encapsulation, work with inheritance, override object methods. Two

more skills for the road, Techniques for object-oriented design, Illustrative programs, Exercises.

Unit – IV 7 Hours

SQLite Manager to work with a database, Python to work with a database, The Movie List program,

create a GUI that handles an event, working with components, The Future Value program, Illustrative

programs, Exercises.

Unit – V 8 Hours

Writing CGI Scripts in Python, Running Server-Side Examples, Climbing the CGI Learning Curve,

Saving State Information in CGI Scripts,

Text Books

1. Michael Urban and Joel Murach, Python Programming, Shroff/Murach, 2016 and onwards. 2. Mark Lutz, Programming Python, O`Reilly, 4th Edition, 2010 and onwards.



Level

1. Explain basic principles of Python programming language L2

2. Implement object oriented concepts, database and web application L3

3. Illustrate 3 tier architecture of software development in Python L3





1





3

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

resources, and modern engineering and IT tools including prediction and

modeling to complex engineering activities with an understanding of the

limitations.

5


1. Lecture 1. Internal Assessment Test

2. Demonstration 2. Assignment

3. Hands on 3. Quiz

4. Presentation 4. Programming Exercises




Average of two

assignments /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50













Advanced Algorithms

(Elective)





100 marks


1. To introduce various algorithm analysis techniques.

2. To formulate solutions for graph based problems in algorithmic form.

3. To understand fundamentals of number theory and their application in cryptography

4.

5.

To study and compare various string search algorithms.

To understand and appreciate probabilistic and randomized algorithms.

Pre-requisites :

Design and Analysis of Algorithms.

Unit – I 8 Hours

Review of Analysis Techniques: Standard notations and common functions; Recurrences and Solution

of Recurrence equations- The substitution method, The recurrence – tree method, The master method;

Amortized Analysis: Aggregate, Counting and Potential method.

Unit – II 6 Hours

Graph Algorithms: Johnson‘s Algorithm for sparse graphs; Detecting Negative Cycle-Floyd Warshal

Algorithm. Single source shortest path in DAG. Flow networks and Ford-Fulkerson method.


Number-Theoretic Algorithms: Theoretic Algorithms: Elementary notions; GCD, Extended Euclid;

Solving modular linear equations; Powers of an element; Modular Inverse, Chinese Remainder

theorem, Fermat‘s theorem, Miller-Rabin for primality test. RSA cryptosystem.

Unit – IV

8 Hours

String-Matching Algorithms: Naïve string Matching; Rabin - Karp algorithm; String matching with

finite automata and its time complexity; Knuth-Morris-Pratt Algorithm and its time complexity, Boyer

– Moore algorithms.

Unit – V 8 Hours

Probabilistic and Randomized Algorithms: Deterministic and Non-deterministic algorithms, Concept

of NP-Hard and NP-Complete. TSP example. Probabilistic algorithms; Randomizing deterministic

algorithms, Monte Carlo and Las Vegas algorithms.

Text Books

1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, Prentice-Hall

of India, 3rd

Edition and onwards.

2. Kenneth A. Berman, Jerome L. Paul: Algorithms, Cengage Learning, 2002 and onwards.

Reference Books

1. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: Fundamentals of Computer Algorithms,

Universities press, 2007, 2nd Edition.



Level

1. Apply masters theorem for given recurrence relation and compute complexity. L3

2. Apply standard graph algorithms to compute shortest distance/max flow in a

network.

L3

3. Apply Number theoretic algorithms to solve the numeric problems. L3

4. Apply Fermat‘s theorem/Miller-Rabin algorithm to test Primality. L3

5.

6.

List and analyze/compare string matching algorithms

Analyze, compare and contrast randomized algorithms.

L4

L4


1. Engineering knowledge: Apply the knowledge of mathematics, Science,



1




2





3


1. Lecture & Board 1. Assignments

2. Power-point Presentation 2. Quiz

3. Online Videos / Learning 3. Internal Assessment Tests




Average of two

assignments /

activity

Quiz

Class

participation

Total

Marks

Maximum Marks: 50 25 10 5 10 50













Database Application Laboratory

Course Code 16CSL56 Credits 2

Course type LAB CIE Marks 25 marks


Total Hours: 36 SEE Duration 3 Hours for 50 marks


1 Gain a good understanding of the architecture and functioning of Database Management

Systems as well as associated tools and techniques.

2 Understand and apply the principles of data modeling using Entity Relationship and develop a

good database design.

3 Understand the use of Structured Query Language (SQL) and its syntax.

4 Apply Normalization techniques to normalize a database.

LAB TERM WORKS:

A. A certain Business Enterprise has Employees working in various departments. Each department

has a manager and department is associated with one or more projects. Further, employees will be

working on one or more projects as workers. Some employees act as supervisors and their

salaries will be higher than workers but less than the managers. The projects have a name and are

located at different places. The employees may have one or more or may not have dependents.

Design a ER-Model for this application scenario using all the standard notations of ER-Model.

Apply the ER-to-Relational Rules to get the relational schema and do the following :

1. Create the database in Oracle DBMS with all necessary constraints(Primary and

Foreign keys)

2. Populate each table with appropriate data

3. Execute queries on the tables created.

B. Design an ER-Model for an educational institute which is required to record the students

attendance and IA performance in all the subjects and inform the same to their parents. The institute

will have many department, each with its own faculty and Head of the department. The subjects the

students study can be either elective or core. A faculty has to take atleast one subject and atmost 2

subjects and the subjects are not shared. The students take 3 tests and the average is computed by

taking average of best two of the three scores. The model be designed to record only the CIE marks and

not SEE marks. After the ER-Model, map it to relational schema by indentifying Primary and Foreign

keys. Create the database in Oracle DBMS and do the following.

1. Create the database with all necessary constraints(Primary and Foreign keys)

2. Populate each table with appropriate data

3. Execute queries on the tables created.

C. Consider the schema for airline flight information Database:

FLIGHTS (no: integer, fromPlace: string, toPlace: string, distance: integer, Departs: date,

arrives: date, price: real)

AIRCRAFT (aid: integer, aname: string, cruisingrange: integer)

CERTIFIED (eid: integer, aid: integer)

EMPLOYEES (eid: integer, ename: string, salary: integer)

Create tables and populate with appropriate values(Atleast 5 records in each table) for the given

database.

Write SQL queries to

1. Find the names of aircraft such that all pilots certified to operate them have salaries more than

Rs.80,000.

2. For each pilot who is certified for more than three aircrafts, find the eid, ename and the

maximum cruising range of the aircraft for which she or he is certified.

3. Find the names of pilots whose salary is less than the price of the cheapest route from

Bengaluru to Frankfurt.

4. Find the aids of all aircraft that can be used on routes from Bengaluru to New Delhi

D. Consider the following schema for Order Database:

SALESMAN (Salesman_id, Name, City, Commission)

CUSTOMER (Customer_id, Cust_Name, City, Grade, Salesman_id)

ORDERS (Ord_No, Purchase_Amt, Ord_Date, Customer_id,

Saleman_id)


database.

Write SQL queries to 1. Count the customers with grades above Bangalore‘s average. 2. Find the name and numbers of all salesmen who had more than one customer. 3. List all salesmen names and customer names for whom order amount is more than 4000.

(Use UNION operation.) 4. Demonstrate the DELETE operation by removing salesman with id 1000. All his orders must also

be deleted.

E. Consider the schema for Movie Database:

ACTOR (Act_id, Act_Name, Act_Gender) DIRECTOR (Dir_id, Dir_Name, Dir_Phone) MOVIES (Mov_id, Mov_Title, Mov_Year, Mov_Lang, Dir_id) MOVIE_CAST (Act_id, Mov_id, Role) RATING (Mov_id, Rev_Stars)


database. Write SQL queries to

1. List the titles of all movies directed by ‗Sanjay Leela Bansali‘. 2. Find the movie names where one or more actors acted in two or more movies. 3. Find the title of movies and number of stars for each movie that has at least one rating and find

the highest number of stars that movie received. Sort the result by movie title. 4. Update rating of all movies directed by ‗Ram Gopal Verma‘ to 5.

Text Books

1. Elmasri and Navathe: Fundamentals of Database Systems, Addison-Wesley, 3rd

edition and

onwards

2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, McGraw-Hill,

2nd

edition and onwards.

Reference Books

1. Silberschatz, Korth and Sudharshan: Data base System Concepts, Mc-GrawHill, 3rd

edition

and onwards.

2. C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, Pearson

education, 5th edition and onwards.


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

1 Apply the ER-Modeling concepts and design a database L3

2 Demonstrate use of DDL and DML statements L3

3 Identify and write SQL statements for the given end user queries L3





2




cultural, societal, and environmental considerations

3




limitations.

5


Components Conduct of the lab Journal submission Total

Marks

Maximum Marks: 25 10 15 25

Submission and certification of lab journal is compulsory to qualify for SEE.

Minimum marks required to qualify for SEE : 13 marks out of 25

Assessment methods

1. Lab Journal

2. Lab Test

3. Demo and Viva




2. Student has to perform one experiment completely based on the chit picked.

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

4. Initial write up 10 marks

50 marks Conduct of experiments 20 marks

Viva- voce 20 marks

Computer Networks Laboratory

(Lab)


Course type Lab CIE Marks 25 marks




1 Understand the design and simulation of wired and wireless networks with different traffics.

2 Know the analysis of wired and wireless networks with respect to different performance

analysis parameters.

3 Realize error detection, routing, message passing and traffic shaping algorithms

Pre-requisites: Basic UNIX Commands, Data Structures and Computer Networks.

PART A

The following experiments shall be conducted using either NS2 OR any suitable simulator

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

vary the bandwidth and find the number of packets dropped.

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

n3. Apply TCP traffic between n0-n3 and UDP traffic between n1-n3. Apply relevant applications over

TCP and UDP agents changing the parameter and determine the number of packets by TCP/UDP.

3. Simulate the transmission of ping messaged over a network topology consisting of 6 nodes and find

the number of packets dropped due to congestion.

4. Simulate a Wireless Sensor Network using N-nodes (6-10), change error rate and data rate and

compare the throughput.

5. Simulate simple ESS and with transmitting nodes in wire-less LAN by simulation and determine the

performance with respect to transmission of packets.

PART B

The following experiments shall be conducted using C/JAVA

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

7. Write a program for distance vector algorithm to find suitable path for transmission.

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

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

09. Write a program for simple RSA algorithm to encrypt and decrypt the data.

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



Level

1. Design and simulate wired and wireless networks with different traffics. L4

2. Demonstrate the analysis of wired and wireless networks with respect to

different performance analysis parameters. L4

3.

Implement error detection, routing, message passing and traffic shaping

algorithms

L3


1. Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex


1

2. Identify, formulate, review research literature, and analyze complex

engineering problems reaching substantiated conclusions using first principles of


2

3. Recognize the need for, and have the preparation and ability to engage in independent

and life-long learning in the broadest context of technological change. 12

Text Books:

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

2006 and onwards.

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

onwards.

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


Reference Books:

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

key architectures, Tata McGraw Hill, 2nd


Assessment methods

1. IA Test

2. Viva-Voce

3 Lab Journal Evaluation.



Marks








Initial write up 10 marks

50 marks

Conduct of experiments 20 marks

Viva- voce 20 marks

3. Student is required to solve one problem from PART-A and one problem from PART-B. The

questions are allotted based on lots. Both Questions carry equal marks. .

Operating System and Unix System Programming Laboratory

(Lab)


Course type Lab CIE Marks 25 marks




1. To present description of the concepts of operating systems to schedule, manage and to

improve the utilization of the CPU.

2. To illustrate the process of memory management and file system management.

3. To demonstrate UNIX system programming API‘s.

4. To get acquainted with knowledge of UNIX operating system environment like race

condition, zombie.

Pre-requisites: C Programming, Computer Organization, Basic UNIX Commands, Operating System,

Data Structures.

List of experiments

PART A

1) Consider the following jobs submitted to a system:

Process Arrival time

(ms)

CPU burst time (ms) Priority

Print 0 7 3

e-mail 2 3 2

File transfer 2 8 1

Web service 3 4 4

Implement a scheduling algorithm that schedules all processes in Round Robin for a fixed quantum of 4ms

and switches till all processes finish their bursts.

2) Consider a set of memory partitions and a set of processes w.r.t first and best fit. A partition can hold

only a single process contiguously. Compare various memory allocation strategies with reference to

external and internal fragmentation.

3) Write a C program to simulate Banker‘s algorithm for the purpose of dead lock avoidance.

4) A word processor and a spreadsheet process are trying to access a printer that is shared among several

processes. Devise a mechanism to ensure that the two processes cooperate in an orderly manner to avoid

inconsistent system state.

5) Compare the performance in terms of number of page faults for the algorithm that suffers from Belady‘s

anomaly with the one that replaces a page that has not been used for the longest period of time.

PART B

1) Write a C/C++ POSIX compliant program to check the compile time and run time configuration limits:

(i) Number of clock ticks

(ii) Maximum number of child processes

(iii) Maximum path length

(iv) Maximum number of characters in a file name

(v) Maximum number of open files / process

2) Suppose two processes, parent and child, try to access a shared resource such as stdout. The output may

not be desirable, called as race condition which occurs due to the order in which the processes are

scheduled internally. Develop a C/C++ program to illustrate the race condition.

3) Consider a child process that has been terminated but not yet been reaped leading to a resource leak.

Write a C/C++ program to create a resource leak and also identify its presence.

4) Consider the last 100 bytes as a region. Write a C/C++ program to check whether the region is locked or

not. If the region is locked, print pid of the process which has locked. If the region is not locked, lock the

region with an exclusive lock, read the last 50 bytes and unlock the region.

5) Suppose a writer process generates data to be consumed by a reader process on the same machine.

Develop a suitable inter process communication mechanism between the two processes that allows not just

for one-time but also at subsequent times during execution.



Level

1. Compare scheduling algorithms, memory allocation strategies, page replacement

algorithms and file organization techniques. L4

2. Determine whether a system is safe in context of deadlocks. L5

3. Develop mechanism for process synchronization. L3

4. Demonstrate the working of different API‘s of Unix system. L2

5. Apply Unix system calls for system level tasks. L3

Program Outcome of this course (POs)

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

and engineering.

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


3. Graduates will demonstrate the ability to analyze the given problems and design solutions,

as per the needs and specifications.

PO No.

1

2

4

Assessment methods

1. Experiments

2. Viva-Voce

3. Lab Journal Evaluation.



Marks








3.

Initial write up 10 marks

50 marks

Conduct of experiments 20 marks

Viva- voce 20 marks

Instructions: In the examination, each student picks one question from the lot of 12 questions.

Design Thinking and Innovation


Course type PC CIE Marks 50 marks

Hours/week: L-T-P 1-0-2 SEE Marks ----

Total Hours: 40 SEE Duration -----

Course Description:

In this course, students will learn how to apply Design Thinking to create new product and service

innovations. This course intends to excite students about the power of Design Thinking with its roots in

empathetic design, and—through hands-on experiences—equip them with the skills needed to use it.

Students will experience the intersection of diversity, ethics/social responsibility, critical thinking and

communication as they identify problems to address, craft their design challenge, engage in field

research, synthesize their findings, brainstorm solutions, present their concepts, while expanding their

personal/professional networks.


1. To understand the various processes and systems to address human needs by creating tangible

products.

2. To pursue learners with emphasis on learning-by-doing and following a comprehensive process

of design, engineering and producing products and systems.

3. To train the eye and hand in creative thinking, sharpen observational skills through site visits

and case studies.

Pre-requisites : None

Course content:

UNIT - I 4 Hours

1. Introduction to Product Design: Introduction to the course, role of Product Design in the

domain of industry, product innovation, Designer‘s philosophy and role in product design,

What is good design?

2. Product Design Methodology :User Centered Design methods, Systems Approach, Product Design

and Development Methodology, Design Thinking, Creativity and Innovation.

• Research and analysis: Question framing and conducting research, design strategy.

• Concept building: Create a Concept, Conceptualize Designs, Sketching, prototyping.

• Testing: Usability Testing, Refine and Enhance Design

Discussions shall be done with reference to some Design Case Studies.

Unit II (Branch specific):

Product Design Project (Problem Solving / Re-Design):

• Introduction to engineering design • Problem identification and requirement specification • Engineering design process • System design: conceptulization, synthesize, analyze • Documentation and writing technical reports • Preliminary Report Submission • Final Report Submission and presentation

The course will be organized as workshop sessions with some mini-lectures and considerable individual

work. All students will be encouraged to develop their own projects of innovations using these

methods.

Text Books:

1. James Garratt, Design and Technology

2. WuciusWong, Principles of Design

3. Eskild Tjalve, A Short Course in Industrial Design

4. Francis D. K. Ching, Architecture - Form, Space and Order

5. Virtual & Physical Prototyping, Taylor & Francis

6. Engineering Design: A Systematic Approach, Pahl, G., Beitz, W., Feldhusen, J., Grote, K.-

H.3rd ed. 2007, XXI, 617 p., ISBN 978-1- 84628-319- 2

E-Resourses:

1. http://www.ulrich-eppinger.net/

2. http://www.npd-solutions.com

3. http://www.qfdi.org

4. http://www.cheshirehenbury.com/rapid/


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

Level

1. Develop sketches, virtual and physical appearance models to communicate proposed

designs L2, L3

2. Ability to apply the principles of design studied in abstract to a minor project L3

3. Refine product design considering design principles and manufacturing requirements

and constraints. L4

4. Design products using user centered design process L6

5. Make mock-up model and working prototype along with design documentation. L6

Program Outcome (POs) PO No.

1.

Identify, formulate, research literature, and analyze complex engineering

problems reaching substantiated conclusions using first principles of


PO2

2.

Design solutions for complex engineering problems and design system

components or processes that meet the specified needs with appropriate

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

environmental considerations.

PO3

3.

Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to

comprehend and write effective reports and design documentation, make

effective presentations, and give and receive clear instructions.

PO10


1. Lectures 1. Report

2. PPT, Videos 2. Model making

3. Practice session 3. Presentation


Components Report Creative Project and

presentation

Mid review

and

Participation

Total

Marks

Maximum Marks: 50 20 20 10 50

Eligibility for passing: 20 marks

Report:

A report shall contain the various aspects of the course undergone and needs to discuss the issues

discussed in the course as a whole. The project report will also include the concepts and principles used

for the creative project and relate them clearly to the content of the course. Also, it should contain the

relevant bibliography (at least 3-5 scholarly sources).

Creative Project

Students will apply their insights on concepts and ideas explored in the course for designing the

product or solving the industry/societal problem. The product (prototype/model) should be displayed

and presented.

Mid review and Participation

Each student will be evaluated according to their contribution to the project, level of preparedness and

oral presentation.

Numerical Methods and Probability

(Computer Science / Information Science)

(Only for Lateral Entry Students)

Subject Code: 16DIPMATC51 Credits: 5

Course Type: BS CIE Marks: 50

Hours/week: L – T – P 5 –0– 0 SEE Marks: 50

Total Hours: 50 SEE Duration: 3 Hours

Course Learning Objectives (CLOs):

Students should

1. Apply the numerical techniques to real world problems.

2. Understand the concept of numerical integration techniques and use to engineering

problems.

3. Understand the concept of Probability and its various rules.

4. Understand types of random variables and their probability distributions.

5. Extend the concept of probability to Joint PDF.

6. Get acquainted with basic concepts of stochastic process and their applications.

Prerequisites:

1. Basic differentiation

2. Basic Integration

Detailed Syllabus

Unit-I 10 hrs

Finite Differences and Interpolation: Forward and Backward differences, Newton‘s Forward and

Backward Interpolation Formulae, Divided Difference, Newton‘s Divided Difference Formula (without

proof). Lagrange‘s Interpolation Formula. Illustrative examples. Numerical Integration: Trapezoidal

rule, Simpsons 1/3rd rule, Simpsons 3/8th rule, Weddle‘s rule. Practical Examples.

Unit II 10 hrs

Basic Probability: Definitions, Addition theorem ,Multiplication law. Problems. Conditional

probability Examples. Baye‘s theorem Examples

Unit III 10 hrs

Random Variable and probability distributions: Random Variables (RV), Discrete and Continuous

Random variables, (DRV,CRV) Probability Distribution Functions (PDF) and Cumulative Distribution

Functions(CDF), Expectations, Mean, Variance. Binomial, Poisson, Exponential and Normal

Distributions.

Unit IV 10 hrs Joint PDF: Discrete Joint PDF, conditional Joint PDF, Expectations (Mean, Variance and

Covariance).

Unit –V 10 hrs

Stochastic Processes: Definition and classification of stochastic processes. Discrete state and discrete parameter stochastic

process, Unique fixed probability vector, Regular Stochastic Matrix, Transition probability, Markov

chain.

Text Books: 1. B.S. Grewal – Higher Engineering Mathematics, Khanna Publishers, 42

nd Edition, 2012.

2. B. V. Ramana- Higher Engineering Mathematics, Tata McGraw-Hill Publishing Company Ltd.

Reference Books:

1. Erwin Kreyszig –Advanced Engineering Mathematics, John Wiley & Sons Inc., 9th Edition,

2006

2. Peter V. O‘ Neil – Advanced Engineering Mathematics, Thomson Brooks/Cole, 7th Edition,

2011.

3. Glyn James – Advanced Modern Engineering Mathematics, Pearson Education, 4th Edition,

2010.



Level

1. Use Numerical methods to study interpolation and extrapolation L3

2. Use different rules of numerical integration for some problems L2

3. Understand the basic probability concepts with applications in practical problems L3

4. Understand the concept of Random variables, PDF, CDF and its applications L2

5. Extend the basic probability concept to Joint Probability Distribution L2

6. Understand the Stochastic processes and applications L3





PO1




PO2




limitations.

PO5


1. Black board teaching 1. Internal Assessment Tests

2. Power point Presentation 2. Assignments

3. Scilab/ Matlab/ R-Software 3. Quiz


Components Average of

best two tests

out of three

Average of

two

Assignments/

Mathematical

/Computation

al/Statistical

tools of 4 labs

in a semester

Quiz/Seminar/

Project

Class

Participation

Total

Marks

Maximum 25 10 5 10 50


* Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full

questions.

* SEE question paper will have Two compulsory questions and choice will be given to remaining

three units.

* SEE will be conducted for 100 marks of three hours duration. It will be reduced to 50 marks for the


Bloom’s Taxonomy of Learning

Objectives

Bloom‘s Taxonomy in its various forms represents the process of learning. It was

developed in

1956 by Benjamin Bloom and modified during the 1990‘s by a new group of

cognitive

psychologists, led by Lorin Anderson (a former student of Bloom‘s) to make it relevant to

the

21st century. The revised taxonomy given below emphasizes what a learner ―Can Do‖.

Lower order thinking skills (LOTS)

L1 Remembering Retrieve relevant knowledge from memory.

L2

Understanding Construct meaning from instructional material, including oral, written, and

graphic communication.

L3

Applying Carry out or use a procedure in a given situation – using learned

knowledge.

Higher order thinking skills (HOTS)

L4

Analyzing Break down knowledge into its components and determine the relationships

of the components to one another and then how they relate to an overall

structure or task.

L5

Evaluating Make judgments based on criteria and standards, using previously learned

knowledge.

L6

Creating Combining or reorganizing elements to form a coherent or functional whole

or into a new pattern, structure or idea.

Date post:	27-Jun-2020
Category:	Documents
Upload:	others
View:	0 times
Download:	0 times

GOGTE INSTITUTE OF TECHNOLOGY · 2018-08-02 · Gogte Institute of Technology shall stand out as an...

Documents