learning center of excellence with google department … · learning center of excellence with...

Learning Center Of Excellence With Google

DEPARTMENT OF COMPUTER APPLICATIONS

Teaching and Examination Scheme for Master of Science (Information Technology) 2 Year

Course

EFFECTIVE FROM ACADEMIC SESSION 2017-18

Year: I Semester: I

Course

Type

Course

Code

Course Name Credits

LTPC

Weightage

(in%)

CE ESE

CA 503 Discrete Mathematics Structure 3003 40 60

PC101 Proficiency in Co-Curricular

Activities – I

2

EC-220 Digital Electronics 3003 40 60

CA 504 Fundamentals of Computer 3003 40 60

HS 101 Human Values & Ethics 1001

CA 517 Problem Solving using C 3003 40 60

CA 559 C programming Lab 0032 60 40

CA-521 Internet & Web Designing Tools 3003 40 60

CA 513 System Analysis and Designing

Fundamentals

3003 60 40

CA 507 Social Media Marketing Lab 0032 40 60

Total Credits 25

Course Title: DISCRETE MATHEMATICS STRUCTURE Course Code : CA 503

Semester : I Core / Elective : Core

Teaching Scheme in Hrs (L:T:P) : 3:0:0:3 Credits : 3 Credits

Type of course : Lecture + Assignments Total Contact Hours : 35

Continuous Internal Evaluation : 40 Marks ESE : 60 Marks

Programmes: Master of Science (Information Technology)

Pre-requisites:

Should have basic knowledge and interest about mathematics.

Course Objectives:

1. Understand mathematics fundamentals.

2. Ways of implementing concepts into formula.

Course Content:

Topic and Contents Hour

s

UNIT-1 7

Sets & Relations- Sets, Types of Sets, MultiSets, Operations on Sets, Relations and

Properties of Relations, Representation of Relations, Equivalence Relation,

Closures of Relations, recurrence relation

UNIT-2 7

Formal logic-statement, tautologies, quantifier, predicator and validity, normal form,

propositional. Logic, predicate logic, Proposition Methods of Proof-Direct Proofs,

Indirect Proofs, Mathematical Induction, Method of Contradiction., Permutations

and Combinations, Lattices, Pigeon Hole Principle

UNIT-3 7

definition of semi group, subsemigroup, cyclic semigroup, homomorphism and

isomorphism, monoid, Group, abelian group, properties of group, subgroup, group

homomorphism, kernel of homomorphism, permutation group, dihedral group, cyclic

group, costs, normal subgroup

UNIT-4 7

Basic Introduction of Graphs, Terminology, types of graph-simple

graph,multigraph,pseudograph,,subgraph,isomorphism,path,circuits,cycles,connecte

d, graph, cutest, euler path ,circuit, euler graph,Hamiltonian graph. weighted graph

and shortest path algo, planar graph, graph coloring, polya’s theory of enumeration

UNIT 5 7

Grammar and Languages- Phrase structure Grammar, Types of Grammars and

Languages, Finite State Machines and Languages, Minimization of Finite State

Machines.

TOTAL 35

Reference:

1 . Lipschutz, Seymour, “Discrete Mathematics”, McGraw Hill.

2. Tremblay, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”,

McGraw Hill.

3. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.

4. Deo, Narsingh, “Graph Theory With application to Engineering and Computer.Science.”,PHI.

5. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi.

6 Kolman B., Busby R: Discrete Mathematical

Course outcomes:

On successful completion of the course, the student will be able to:

1. Put logical idea into mathematical forms.

2. Understand a concept and of graph and trees.

Course Assessment and Evaluation:

The Course will be delivered through lectures, class room interaction, exercises and self-study

cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

DIR

ECT

ASS

MEN

T

CIE

Mid Term

Test

Student

Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9

Student feedback Middle of the

course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of

course Questionnaire

1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods

CIE – Continuous Internal Evaluation ESE –End Semester Examination

Composition of Educational Components:

Questions for CIE and SEE will be designed to evaluate the various educational components

(Bloom’s taxonomy) such as:

Sl.

No. Educational Component

Weightage

(%)

1 Remembering and Understanding 35

2 Applying the knowledge acquired from the course 25

3 Analysis and Evaluation 40

Course Title: DIGITAL ELECTRONICS: Course Code : EC 220






Pre-requisites:

Should have basic knowledge and interest about the subject.

Course Objectives:

To acquire the basic knowledge of digital logic levels and application of knowledge to

understand digital electronics circuits. To prepare students to perform the analysis and

design of various digital electronic circuits.

Course Content:

Topic and Contents Hours

UNIT-1: Number System And Data Representation

7

Number System: Binary , Octal , Decimal And Hexadecimal Number

System And Their Interconversion. Binary Codes: Bcd, Excess 3,Parity ,

Gray, Ascii And Ebcdic Codes , Their Advantages And Disadvantages. Data

Representation: ( Related To 8 Bit Number), Real Number Representation,

Underflow, Overflow, Range And Accuracy Of Numbers.

UNIT-2: Binary Arithmetic 7

Binary Addition, Decimal Subtraction Using 9’s And 10’s Complement,

Binary Subtraction Using 1’s And 2’nd Compliment,

Multiplication And Division .

Logic Gates: Truth Table, Properties And Symbolic Representation Of

NOT, AND ,OR,NOR,NAND ,EX-OR,EX – NOR GATES, NOR and

NAND GATES As A Universal Gates.

UNIT-3: Boolean Algebra 7

Reference:

● M. Morris Mano, Michael D. Ciletti, "Digital Design",

Prentice Hall of India Pvt. Ltd., 2008.

Course outcomes:


Acquired knowledge about basics of digital electronics.

Acquired knowledge about solving problems related to number systems and Boolean algebra.

Ability to identify, analyze and design combinational circuits.

Ability to design various synchronous and asynchronous sequential circuits.

Acquired knowledge about internal circuitry and logic behind any digital system.

Laws And Identities Of Boolean Algebra, Demorgan’s Theorem,

Use Of Boolean Algebra For Simplification Of Logic Expression,

Karnaugh Map For 2,3,4 Variable,

Simplification Of Sop And Pos Logic Expression Using K-Map.

UNIT-4: Combinational / Sequential Circuits

7

Half Adder , Full Adder, Parallel Adder, Half Subtractor, Full Subtractor, 4

Bit Binary Adder/ Subtractor, Multiplexer , dEmultiplexer, Decoder , Encoder

,Parity Detector.Construction And Working With Timing Diagram

Of Bistable, Monostable And Astable Multivibrator Using Logic Gates.

Sequential Circuits : Flip-Flop: Construction And Working Of RSFF,

CKRSFF, DFF,TFF,JKFF AND JKM SFF, Counters:

Construction And Working Of Asynchronous , Synchronous , Up-

Down Counter, Shift Register And Their Types, Ring Counter And

Johnson Counter With Their Timing Diagram.

UNIT 5: Architecture Of 8086 7

Block Diagram Of 8086,Pin Diagram 0f 8086, Minimum

And Maximum Mode, Addressing Modes , Instruction Set : Data Transfer,

Arithmetic, Logical , String Manipulation, Control Transfer,

Unconditional Branch, Conditional Branch, Flag, Processor Control.

TOTAL 35



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods





Sl.


Weightage

(%)




Course Title: Fundamental of Computer Course Code : CA 504






Pre-requisites:

Student should have basic knowledge of c.

Course Objectives:

The course is designed to aim at imparting a basic level appreciation programme for the

common man.

Course Content:


UNIT-1: 7

Types of computers and generations .Basic architecture of computers and its

building blocks .Input-Output devices, Memories Overview, definition and

function of operating system, need of operating , System, Batch processing,

spooling, multi-programming, multi-processing, Time sharing, online

processing, real time system

UNIT-2: 7

Classification of Computer Languages

Machine, assembly and high level languages .Brief idea of operating system.

Assembler, compiler and interpreter. Number Systems: Binary, octal, decimal

and hexadecimal representation of numbers. Integers and floating point

numbers. Representation of characters, ASCII and EBCDIC codes. Binary

Arithmetic: addition, subtraction, complements

UNIT-3: 7

An overview of information technology, difference between data and

information, quality, of information, Information system. Introduction to

internet: www, web browser, search engine, email, open source software’s,

Search Engine optimization.

UNIT-4: RELATIONAL MODELS 7

Introduction to e-commerce and its advantage, security threats to e-

commerce, Electronic payment system, E-governance, EDI and its benefits.

Introduction to cryptography, digital signature and smart card technology,

Steganography & Watermarking

UNIT 5: 7

Introduction to LAN, WAN, MAN: Transmission media Data transmission

type: Introduction to OSI reference model, TCP/IP Model. Analog and digital

signals, modulation, Network topologies, client-server architecture, ISDN,

Broadband, Firewalls, Virus & Worms

TOTAL 35

Reference:

BY PK. SINHA.

Course outcomes:


1.Analysing problems, and designing and implementing algorithmic solutions.

2 Solving problems properly, achieving an implementation that is correct, effective and

efficient.

3 Using computers at user level, including operative systems and programming

environments.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods


Composition of Educational Components: Questions for CIE and SEE will be designed to evaluate the various educational components


Sl.


Weightage

(%)




Course Title: Human Values & Ethics Course Code : HS 101





Pre-requisites:

Student should have basic knowledge

Course Objectives:

1. Understand mathamatics fundamentals.

2. Ways of implementing concepts into formula.

Course Content:


UNIT-1 6

Universal human aspirations: Happiness and prosperity; Human values and ethics:

Concept, definition, significance and sources; Fundamental values: Right conduct,

peace, truth, love and nonviolence; Ethics: professional, environmental, ICT;

Sensitization towards others particularly senior citizens, developmentally challenged

and gender.

UNIT-2 6

Spirituality, positive attitude and scientific temper; Team work and volunteering;

Rights and responsibilities; Road safety; Human relations and family harmony;

Modern challenges and value conflict: Sensitization against drug abuse and other

social evils; developing personal code of conduct (SWOT Analysis); Management of

anger and stress.

Total 12

Reference:

1. Gaur RR, Sangal R & Bagaria GP. 2011. A Foundation Course in Human Values and

Professional Ethics. Excel Books.

2. Mathur SS. 2010. Education for Values, Environment and Human Rights. RSA International.

3. Sharma RA. 2011. Human Values and Education -Axiology, Inculcation and Research. R.

Lall Book Depot.

4. Sharma RP & Sharma M. 2011. Value Education and Professional Ethics. Kanishka

Publishers.

5. Srivastava S. 2011. Human Values and Professional Ethics. S K Kataria & Sons.

6. Srivastava S. 2011. Environmental Science. S K Kataria & Sons.

7. Tripathi A.N. 2009. Human Values. New Age International (P) Ltd Publishers.

Course outcomes:


1. Developing personal code.

2. Understand human values.




Sl.


Weightage

(%)




Course Title: PROBLEM SOLVING USING C Course Code : CA 517





Programmes: MASTER OF COMPUTER APPLICATIONS

Pre-requisites:

Basic logical understanding and knowledge of basic computing.

Course Objectives:

Explore traditional programming into practice

Course Content:


UNIT-1: Introduction About Program And Programming

Language

7

Introduction about program and programming language, History of C,

Salient Features, Structure of a C Program, Data Types and Storage, Data

Type Qualifiers, Variables, Declaring Variables, Initializing Variables,

Constants, Integer Constants, Floating Point Constants, Character

Constants, String Constants, Symbolic Constants, Expressions and

Operators: Assignment Statements, Arithmetic Operators, Relational

Operators, Logical Operators, Comma and Conditional Operators, Type

Cast Operator, Size of Operator.

UNIT-2: Control statements 7

Control Statements, Arrays and Functions: Decision Control Statements,

if Statement, switch Statement, Loop Control Statements, Introduction to

Arrays, Array Declaration, Syntax of Array Declaration, Size

Specification, Array Initialization, Initialization of Array Elements in the

Declaration, Character Array Initialization, Subscript, Processing the

Arrays, Multi-Dimensional Arrays, Strings, Functions, Definition of a

Function, Declaration of a Function, Function Prototypes, The Return

Statement, Types of Variables and Storage Classes, Automatic Variables,

External Variables, Static Variables, Register Variables, Types of

Function Invoking, Call by Value, Call by Reference, Recursion

UNIT-3: Pointers, Structures & Unions 7

Pointers and their Characteristics, Address and Indirection Operators,

Pointer Type Declaration and Assignment, Pointer to a Pointer, Null

Pointer Assignment, Pointer Arithmetic, Passing Pointers to Functions, A

Function Returning More than One Value, Function Returning a Pointer,

Arrays and Pointers, Arrays of Pointers, Pointers and Strings, Declaration

of Structures, Accessing the Members of a Structure, Initializing

Structures, Structures as Function Arguments, Structures and Arrays,

Unions, Initializing an Union, Accessing the Members of an Union

UNIT-4: C Preprocessor Directives and File Handling 7

The C Preprocessor, # define to Implement Constants, # define to Create

Functional Macros, Reading from Other Files using # include, Conditional

Selection of Code using #ifdef, Using #ifdef for different computer types,

Using #ifdef to temporarily remove program statements, Other

Preprocessor Commands, Predefined Names Defined by Preprocessor,

Macros Vs Functions, Files, File Handling in C Using File Pointers, Open

a file using the function fopen ( ), Close a file using the function fclose( ),

Input and Output using file pointers, Character Input and Output in Files,

String Input / Output Functions, Formatted Input / Output Functions,

Block Input / Output Functions, Sequential Vs Random Access Files,

Positioning the File Pointer

UNIT 5: Graphics in C 7

Introduction to graphics, initialization of Graphics, Graphics Functions,

Programs using Library Functions, Working with Text, Filling Patterns

with Different Colors and Styles, Mouse Programming

TOTAL 35

Reference:

1. Programming in C by E. Balaguruswamy, TMH Publications

2. Programming with C by Gottfried, Schaums, TMH Publications

3. Thinking in C by Mahapatra, PHI Publications

Course outcomes:


1. Should able to write basic and advance program using c.

2. Should be able to design and develop modules using c.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: C PROGRAMMING Lab Course Code :CA 559


Teaching Scheme in Hrs (L:T:P) : 0:0:3:2 Credits : 2Credits

Type of course : Practical assignments Total Contact Hours : 2 hours weekly



Pre-requisites:

Basic knowledge of Logic is required.

Course Objectives:

To learn concepts of Programming Language

To learn the writing of program

Course Content:

S.No. Name of Experiments Hours

1 C Program to Check if a given Integer is Odd or Even 2

2 C Program to Calculate the Sum of Odd & Even Numbers 2

3 C Program to Check if a given Integer is Positive or Negative 2

4 C Program to Find the Number of Integers Divisible by 5 2

5 C Program to Accept two Integers and Check if they are Equal 2

6 C Program to Find the Largest Two Numbers in a given Array 2

7 C Program to Find the Second Largest & Smallest Elements in

an Array 2

8 C Program to Calculate the Addition or Subtraction & Trace of

2 Matrices 2

http://www.sanfoundry.com/c-program-two-integers-equal/

9 C Program to Calculate the Addition or Subtraction & Trace of

2 Matrices 2

10 C Program to Find the Second Largest & Smallest Elements in

an Array 2

Course outcomes:


1. Learn structured programming analysis and design.

2. To Learn the Programming Concept



Sl.


Weightage

(%)




Course Title: Internet and web designing Tools Course Code : CA 521






Pre-requisites:

Student should have basic knowledge of web designing tools

Course Objectives:

Learn web designing and development using java and latest technologies

Course Content:


UNIT-1: basic Internet technologies 7

The Internet, Classification of Networks, Networking Models, What is

Packet Switching, Accessing the Internet, Internet Protocols, Internet

Protocol (IP), Transmission Control Protocol (TCP), Internet Address,

Structure of Internet Servers Address, Address Space, How does the

Internet work, Intranet & Extranet, Internet Infrastructure, Protocols and

Services on Internet, Domain Name System, SMTP and Electronic Mail,

Http and World Wide Web, Usenet and Newsgroups, FTP, Telnet, Search

Engines, Web Browser

UNIT-2: Front page 7

Creating Your First Web Pages, Create a Web Page, Organize a Page with

Links, Lists, and Tables, Display Graphics and Photos on a Page, Layout

a Page with Tables, Designing an Entire Web Site, Create a New Web

Site, Develop a Site Quickly with Templates, Publish Your Site, Connect

a Database to Your Site, Format Your Site Through Cascading Style

Sheets, Divide a Page into Separate Frames

UNIT-3: Cascading Style Sheets 7

Introduction, CSS and its working, Colors and backgrounds, Fonts, Text,

Links, Identification and grouping of elements (class and id), Grouping of

elements (span and div), The box model, The box model - margin &

padding, The box model - borders, The Box model - Height and width,

Floating elements (floats), Positioning of elements, Web-standards and

validation

UNIT-4: JavaScript 7

Introduction to JavaScript, JavaScript Variables and Data Types,

Declaring Variables, Data Types, Statements and Operators , Control

Structures, Conditional Statements, Loop Statements, Object-Based

Programming, Functions, Executing Deferred Scripts, Objects, Message

box in JavaScript, Dialog Boxes, Alert Boxes, Confirm Boxes, Prompt

Boxes, JavaScript with HTML, Events, Event Handlers, Forms, Forms

Array, String Object, Date & Time Object, Number Object

UNIT 5: DHTML 7

Introduction, Applications of DHTML, Use of DHTML, Combining

JavaScript and CSS, Working with Objects, Browser Detection, Pop Up

Menus, Animating a Layer, Filters and Transitions

TOTAL 35

Reference:

1. Pro XML Development with Java Technology: From ... - by Ajay Vohra, Deepak Vohra

2. Information Technology and Economic Development - by Yutaka Kurihara, Sadayoshi

Takaya, Hisashi

Course outcomes:


1. Should be able to design a website.

2. Have correlation with frontend and backend



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

http://books.google.co.in/books?id=pQ2h64OBSSAC&dq=Web+Technologies+and+Development+reference+book&printsec=frontcover&source=in&hl=en&ei=5rFuSsHYJ8GJkQWOuLTDBQ&sa=X&oi=book_result&ct=result&resnum=11

http://books.google.co.in/books?id=pQ2h64OBSSAC&dq=Web+Technologies+and+Development+reference+book&printsec=frontcover&source=in&hl=en&ei=5rFuSsHYJ8GJkQWOuLTDBQ&sa=X&oi=book_result&ct=result&resnum=11

http://books.google.co.in/books?id=CimtoH4k438C&dq=Web+Technologies+and+Development+reference+book&printsec=frontcover&source=in&hl=en&ei=5rFuSsHYJ8GJkQWOuLTDBQ&sa=X&oi=book_result&ct=result&resnum=12

and

assessment

methods




Sl.


Weightage

(%)




Prerequisites: Basics of System requirements,Data,information.

Course Objectives: The major objective of this course that :

1.Students will be learning about system concept .

2. Students will be learning about initial investigation.

3. Students will be learning about structured analysis

4. Students will be learning about documentation for the new system

Course Content:

Topic and Contents Hours UNIT-1: Introduction to SAD 7

Course Title: Systems Analysis and Designing

Fundamentals Course Code : CA 513


Teaching Scheme in Hrs (L:T:P) : 3:0:0 Credits : 3 Credits


Continuous Internal Evaluation : 40 Marks SEE : 60 Marks


Fundamentals of System: Important Terms related to

Systems, Classification of Systems, Real Life Business Subsystems

· ,Real Time Systems, Distributed Systems, Development of a successful

System ,Various Approaches for development of Information

Systems, Structured Analysis and Design Approach, Prototype ,Joint

Application Development

UNITS-2: Process of System Development 07

Systems Development Life Cycle , Phases of SDLC ,Project Identification

and Selection, Project Initiation and planning , Analysis, Logical Design,

Physical Design, Implementation, Maintenance , Product of SDLC

Phases, Approaches to Development, Prototyping, Joint Application

Design, Participatory Design, Case Study

UNITS-3: Process of System Planning 07

Fact finding Techniques, Interviews, Group Discussion

Site Visits, Presentations, Questionnaires, Issues involved in, Feasibility

Study, Technical Feasibility, Operational Feasibility, Economic

Feasibility, Legal Feasibility, Cost Benefit Analysis, Preparing Schedule,

Gathering Requirements of System, Joint Application

Development, Prototyping

UNIT-4: Modular and Structured Design 7

Design Principles-Top Down Design, Bottom Up Design, Structure

Charts, Modularity, Goals of Design, Coupling, Cohesion

UNIT 5: System Design and Modelling 07

Logical and Physical Design, Process Modeling, Data Flow Diagrams,

Data Modeling, E-R Diagrams, Process Specification Tools, Decision

Tables, Decision Trees, Notation Structured English ,Data Dictionary

TOTAL 35

Reference:

1. Modern System Analysis & Design by A Hoffer, F George, S Valacich Low Priced Ed.

Pearson Education

Course outcomes:


1.Students will be learning about system concept with various elements of system.

2. Students will be learning about initial investigation.

3. Students will be learning about structured analysis

4. Students will be learning about documentation for the new system

5. Students will be learning about system security.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: SOCIAL MEDIA MARKETING LAB Course Code :CA507






Pre-requisites:

Basic knowledge of Marketing and Social network site is required.

Course Objectives:

To learn concepts of online shopping

To learn the suffering on web

Course Content:


1 Digital Marketing 2

2 Website Basic 2

3 SEO 2

4 SEM 2

5 Email Marketing 2

6 ORM 2

7 Google Analytics 2

8 Google Adsense 2

9 Facebook & twitter Traffic 2

10 Google web traffic 2

Course outcomes:


Learn the use of online marketing and social network.

To Learn the web surfing Concept.

Learning Center Of Excellence with Google


Teaching and Examination Scheme for Master of Science (Information Technology)

2 Year Course EFFECTIVE FROM ACADEMIC SESSION 2017-18

Year: I Semester: II

Course

Type

Course

Code

Course Name Credits

LTPC

Weightage

(in%)

CE ESE

EM-102 Employability Skills – V 0201 40 60

PC102 Proficiency in Co-Curricular

Activities –I I

2 -

CA 506 Relational Database

Management System

3003 40 60

CA 514 Object oriented programming &

C++

3003 40 60

CA 554 Industrial oriented project DBMS

lab

0032 60 40

CA 562 C++ lab 0032 60 40

CP 202 Software Engineering 3003 40 60

CP 201 Data Structure & Algorithm 3003 40 60

CA 651 Data Structure & Algorithm Lab 0032 60 40

PE 652 Project Stage I 0032 60 40

Total Credits 23

Course Title: Employability Skills – V Course Code : EM 102

Semester : II Core / Elective : Core


Type of course : Lecture + Assignments Total Contact Hours :12

Program: Master of Science (Information Technology)

Pre-requisites:

Must have knowledge of personality development.

Course Objectives:

To have good overall development for placement

Course Content:

S.No. Topic Details Contact

Hours

1 Communication Role Play, Reading, Formal writing skills

Listening, Interaction Process, Interpersonal

Relationship

3

2 Attitude &

Manners

Motivation, Team Building, Winning

Strategy, CAN DO,

3

3 Preparation,

presentation

Presentation skills, Preparation Skills, 3

4 Industry Concept & Importance of SIP, Industrial

Mentoring & Networking

3

Total 12

References: Brilliant employability skills by

Course outcomes:

On completion of this course students will be able to:

Improvement in communication skills,Develop self confidence

Course Title: RELATIONAL DATABASE

MANAGEMENT SYSTEM Course Code : CA 506






Pre-requisites:

Have basic knowledge of computer with back end features.

Course Objectives:

1. Understand the concepts of database management system

2. Types of data models

3. Learn different diagrams for database design.

Course Content:


UNIT-1: 7

Overview of DBMS, Basic DBMS terminology, data base system v/s

file system, data independence. Architecture of a DBMS.

UNITS-2: INTRODUCTION TO DATA MODELS 7

Introduction to data models: entity relationship model, hierarchical model:

from network to hierarchical, relational model, comparison of network,

hierarchical and relational models.

UNITS-3: DATA MODELLING USING ER DIAGRAM 7

Data modelling using the Entity Relationship Model: ER model concepts,

notation for ER diagram, mapping constraints, keys, Concepts of Super

Key, candidate key, primary key, Generalization, aggregation, reduction

of an ER diagrams to tables, extended ER model, relationships of higher

degree.

UNIT-4: RELATIONAL MODELS 7

Relational model: storage organizations for relations, relational algebra,

relational calculus. Normalization: Functional dependencies, normal forms,

first, second, third normal forms, BCNF, inclusion dependencies, loss

less join decompositions, normalization using FD, MVD, and JDs,

alternative approaches to database design.

UNIT 5: 7

Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL

data types and literals, Types of SQL commands, SQL operators and their

procedure, Transaction Manager, Recovery, Concurrency control

TOTAL 35

Reference:

1. Database Management Systems by Raghu Ramakrishnan

2. Fundamentals of Database Management Systems by Mark L. Gillenson

3. Database System Concepts by Abraham Silberschatz, Henry F. Korth, and Sudarshan

4. Database Systems: Design, Implementation, and Management by Peter Rob and Carlos Coronel

5. Database Systems: The Complete Book (2nd Edition) by Hector Garcia-Molina, Jeffrey D. Ullman,

and Jennifer Widom

Course outcomes:


1. Understand database concepts.

2. Understand database design.

3. Understand SQL queries

4. Understand how to connect database with front end tools



cases.

http://www.amazon.com/Fundamentals-Database-Management-Systems-Gillenson/dp/0471262978/ref=sr_1_4?s=books&ie=UTF8&qid=1281202196&sr=1-4

http://www.amazon.com/Mark-L.-Gillenson/e/B001ITYYWW/ref=sr_ntt_srch_lnk_4?qid=1281202196&sr=1-4

http://www.amazon.com/Database-System-Concepts-Abraham-Silberschatz/dp/0073523321/ref=sr_1_14?s=books&ie=UTF8&qid=1281202196&sr=1-14

http://www.amazon.com/Abraham-Silberschatz/e/B000APPDZ2/ref=sr_ntt_srch_lnk_14?qid=1281202196&sr=1-14

http://www.amazon.com/Henry-F.-Korth/e/B001H6UQRI/ref=sr_ntt_srch_lnk_14?qid=1281202196&sr=1-14

http://www.amazon.com/Database-Systems-Design-Implementation-Management/dp/1423902017/ref=sr_1_5?s=books&ie=UTF8&qid=1281202196&sr=1-5

http://www.amazon.com/Peter-Rob/e/B001H6MMHK/ref=sr_ntt_srch_lnk_5?qid=1281202196&sr=1-5

http://www.amazon.com/Carlos-Coronel/e/B001H6NK6M/ref=sr_ntt_srch_lnk_5?qid=1281202196&sr=1-5

http://www.amazon.com/Database-Systems-Complete-Book-2nd/dp/0131873253/ref=sr_1_12?s=books&ie=UTF8&qid=1281202196&sr=1-12

http://www.amazon.com/Hector-Garcia-Molina/e/B001IQXEHQ/ref=sr_ntt_srch_lnk_12?qid=1281202196&sr=1-12

http://www.amazon.com/Jeffrey-D.-Ullman/e/B000APLJT6/ref=sr_ntt_srch_lnk_12?qid=1281202196&sr=1-12

http://www.amazon.com/Jennifer-Widom/e/B000APBU54/ref=sr_ntt_srch_lnk_12?qid=1281202196&sr=1-12

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: OBJECT ORIENTED PROGRAMMING

& C++ Course Code : CA 514



Type of course: Lecture + Assignments Total Contact Hours : 35



Pre-requisites:

Have knowledge about basic programming language.

Course Objectives:

1. Understand programming logic to solve assign problem

2 Features of object oriented programming.

Course Content:


UNIT-1: OOPS CONCEPTS AND INTRODUCTION TO C++ 7

OOP Concepts & Introduction to C++: Objects and Classes, Data Abstraction,

Encapsulation, Messaging, Modularity, Polymorphism, Inheritance, Types of

Inheritance, Introduction to C++: Why Program in C++? , A Brief History of

C++, Good Things About C++, Pitfalls of C++, Compiling and running C++

Program, Basic Input / Output Statements, Variables, Variable Types and

Declaring Variables, Casting of Variables, Operators, Operator Precedence,

Control Statements, Branching Statements (if, else, switch), Loops (for, while,

do), Functions: What is a Function?, Function Basics, Parameters to Functions,

Returning Values from Functions, Function Overloading, Recursion and

Recursive Functions.

UNIT-2: OBJECTS AND CLASSES 7

Objects & Classes, Pointers and Arrays: Object, Object Design, Declaring a

Class, Using a Class (Instantiation), Constructors and Destructors, Protect your

Private Parts, Inline Functions, What is a Pointer?, Pointers and Instances,

Dynamic Memory Allocation, Array, Declaring, Initializing and

Implementing an Array (Single, Double and Multidimensional)

UNIT-3: INHERITANCE AND POLYMORPHISM 7

Inheritance, Virtual Methods, and Polymorphism: What is Inheritance?,

Inheritance Syntax, Types of Inheritance, Virtual Classes, Abstract Classes,

Virtual Methods, Operator Overloading, Friend Functions.

UNIT-4: FILE HANDLING 7

File Handling: Input and Output with Streams, Streams, Formatting and

Manipulators, Formatted Output of Integers, Formatted Output of Floating-

Point Numbers, Output in Fields, Output of Characters, Strings, and Boolean

Values, Formatted Input, Formatted Input of Numbers, Unformatted

Input/Output, Files, File Streams, Creating File Streams, Open Modes, Closing

a File, Reading and Writing Blocks, Object Persistence

UNIT 5: STORAGE CLASSES 7

Storage Classes and Namespaces, Storage Classes of Objects, The Storage

Class extern, The Storage Class static, The Specifiers auto and register, The

Storage Classes of Functions, Namespaces, The Keyword using, Exception

Handling, Exception Handlers Throwing and Catching Exceptions, Nesting

Exception Handling, Introduction to Templates and Containers

TOTAL 35

Reference:

1. Object Oriented programming with C++ by E. Balagurusamy

2. Success with C++ by Kris James

3. Object Oriented programming with C++ by David Parsons

4. Programming in C++ by D. Ravichandran

5. Programming in C++ by Dewhurst and Stark

Course outcomes:


1. Differentiate about programming concepts

2. Implement algorithm into practice



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

ASS

ESS

MEN

T End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: Industrial oriented project DBMS Lab Course Code :CA 554






Pre-requisites:

Students should have Basic knowledge of database is required.

Course Objectives:

To learn concepts of Programming Language

To learn how to write query in database

Course Content:


1 To create a table and then perform Insertion, Deletion and Updating and then execute single line and group line functions.

2

2 To create a table and execute the TCL and DCL commands.

2

3 To create a table and to manipulate various database objects.

2

4 To create a table and create locks, partitions for the

particular database. 2

5 To write a PL/SQL procedure for an application using user-

defined and predefined exceptions. 2

6 To write a PL/SQL program for an application using cursor. 2

7 To create a program to prepare reports for an application

using functions. 2

8 To create a PL/SQL block for transaction applications of a

typical application using triggers. 2

9 To create a PL/SQL block for transaction applications of a

typical application using Packages. 2

10 To create an employee application using VB as front end

and Oracle as backend. 2

Course outcomes:


Learn data base handling and query writing in database

To Learn the database Concept.

Course Title: C++ Lab Course Code :CA 562






Pre-requisites:

Basic knowledge of ‘C’ programming is required.

Course Objectives:

To learn concepts of Object oriented Programming Language

Course Content:

S.No Name Of Experiments Hours

1 Write a Program of Even and Odd. 2

2 Write a Program of Swap two numbers

2

3 Write a Program Prime Number 2

4 Write a Program Leap Year 2

5 Write a program to Find length of String 2

6 Write a program to Sort Array Element 2

7 Write a program to Sum of Array Elements 2

8 Write a program to print Triangle of Star 2

9 Write a program to Print Alphabet Pattern 2

10 Write a program to Print Number Series 2

Course outcomes:


Learn object oriented programming concept



Sl.


Weightage

(%)




Course Title: SOFTWARE ENGINEERING Course Code : CP 202






Pre-requisites:

Should have basic idea about software development life cycle

Course Objectives:

1. To learn about project management.

2. Understand software development life cycle

3. Understand system design and analysis of a program.

Course Content:


UNIT-1: INTRODUCTION TO SOFTWARE ENGINEERING 7

Introduction to Software Engineering: Introduction, Definitions of

Software Engineering, Program V/s. Software, Software

Characteristics, Software Components, Software Applications,

Software Crisis, Software Processes, Software Quality Attributes, Key

challenges faced by the Software Engineering, Software Engineer,

SDLC, Software System Development Methodologies, CASE tools

UNIT-2: SOFTWARE PROJECT MANAGEMENT 7

Software Project Management: Project Management Process,

Feasibility Study, Software Project Planning, Project Execution,

Monitoring and Control, Project Termination Analysis, SCM, Process

Management Process, CMM, Risk Management Process, Software

Project Planning, Scheduling a Software Project,

UNIT-3: REQUIREMENT ENGINEERING 7

Requirement Engineering: Introduction to Requirement Engineering,

Functional Requirements, Non-Functional Requirements, Domain

Requirements, Requirement Engineering Process, Software

Requirements Specification (SRS)

UNIT-4: STRUCTURE ANALYSIS AND DESIGN 7

Structured Analysis & Design: Data Modeling, Data Objects,

Attributes And Relationships , Cardinality And Modality, Entity –

Relationship Diagram , Functional Modeling, Data Flow Diagram,

Logical And Physical DFDs , Leveling Of DFDs, Control Flow

Diagram, Behavioral Modeling , Data Dictionary, Structured

English, Decision Trees, Decision Table, Software Design Model ,

Conceptual and Technical Designs , Characteristics of a Good

Design , Design Principles, Design Guidelines , Decomposition

and Modularity

UNIT 5: QUALITY ASSURANCE ACTIVITY 7

Quality Assurance Activities: Types of Quality Assurance Activities ,

Verification and Validation, Testing, Testing Fundamentals, Strategic

Issues in Testing, Test Plan, Testing Principles, General Testing

Strategies, Code Testing, Specification Testing, Black Box Testing,

White Box Testing, Testing Process

TOTAL 35

Reference:

1. C. Banerjee, “Software Engineering”, First Edition, Genius Publications

2. Roger, S. Pressman, “Software Engineering-A Practitioner’s Approach”, Third Edition,

McGraw Hill

3. R.E. Fairley, “Software Engineering Concepts”, McGraw Hill

4. Jalote “An Integrated Approach to Software Engineering”, Narosa Publishing House.

Course outcomes:


1. Design a software

2. Understand and analyse system requirements

3. Understand system life cycle



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: DATA STRUCTURE AND ALGORITHM Course Code : CP 201






Pre-requisites:

Have basic knowledge of computer with understanding of basic programming languages.

Course Objectives:

1. To impart logical understanding to solve given task

2. Understand algorithm and their types for said cause.

Course Content:


UNIT-1: DATA STRUCTURE 7

Data Structure: Definition, Implementation, Operation, Application,

Algorithm writing and convention. Analysis of algorithm, Complexity

Measures and Notations ,Arrays: Representation of arrays

(multidimensional), Address calculation using column and row major

ordering. Linked Lists : Implementation, Doubly linked list, Circular

linked list, unrolled linked list, skip-lists, Splices, Sentinel nodes,

Application (Sparse Matrix, Associative Array, Functional

Programming)

UNIT-2: STACKS 7

Stacks : Definition, Implementation, Application (Tower of Hanoi,

Function Call and return, Parentheses Matching, Back-tracking,

Expression Evaluation), Queues : Definition, dequeue, enqueue, priority

queue, bounded queue, Implementation, Application

UNIT-3: TREES 7

Tree: Definition of elements, Binary trees: Types (Full, Complete,

Almost complete), Binary Search Tree, Traversal, (Pre, In, Post & Level

order), Pruning, Grafting. Application: Arithmetic Expressions

Evaluation Variations: Indexed Binary Tree, Threaded Binary Tree, AVL

tree, Multi-way trees, B tree, B+ tree, Forest, Tree and Dictionary

UNIT-4: GRAPH 7

Graphs: Elementary definition, Representation (Adjacency Matrix,

Adjacency Lists), Traversal (BFS, DFS)Application: Spanning Tree

(Prim's and Kruskal's Algorithm), Dijkstra's algorithm, shortest path

algorithms

UNIT 5: SORTING 7

Sorting: Bubble, Selection, Insertion, Quick, Radix, Merge, Bucket,

Heap, Searching: Hashing, Symbol Table, Binary Search, Simple String

Searching

TOTAL 35

Reference:

1. Aho A.V., J.E.Hopcroft. J.D.Ullman: Data Structures and Algorithms, Addison Wesley. 2. Brastrad: Algorithms, PHI.

3. Horowitz and Sahni: Algorithms Design and Analysis, CS Press. 4. Kruse R.L.: Data structure and Program Design.PHI.

5. Tenenbaum : Data structures in C,PHI

6. Trembley & Sorenson :An Introduction to Data Structures, Mc-Graw Hill International

Course outcomes:


1. Should able to learn object oriented language

2. Differentiate traditional and object oriented programming concepts.

3. Implement algorithm and design on their own.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Graded

Assignments

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: DSA LAB Course Code : CA 651



Type of course : Practical assignments Total Contact Hours : 2 Hours Weekly



Pre-requisites:

Must have knowledge about data structure.

Course Objectives:

The practical implementation of data structure will be done by students through this lab work,

which will built efficient programming skills in students.

Course Content:

S.No Name of Experiments Hours

1 Addition and Multiplication of Two Polynomials.

2

2 Addition and Transpose of Sparse Matrices.

2

3 Singly Linked List: Create, Display, Insertion, Deletion, Search,

Reverse

2

4 Singly Circular Linked List: Create, Display, Insertion, Deletion,

Search,

2

5 Doubly Linked List: Create, Display, Insertion, Deletion, Search,

Reverse

2

6 Stack Application: Inter conversion of Infix, Prefix & Postfix

2

7 Stack Application: Palindrome & Matching Parenthesis.

2

8 .Binary Search Tree Implementation: Creation, Insertion,

Deletion, Copy,Mirror, Traversal (Preorder, Postorder, Inorder).

2

9 Queue Application: Job Scheduling.

2

10 Graph Application: Depth First Search, Breadth First Search, And

Shortest Path Algorithm.

2

Course outcomes:

On completion of this course students will be able to:

● Know about the basic concepts of Function, Array and Link-list.

● Understand how several fundamental algorithms work particularly those concerned with Stack, Queues, Trees and various Sorting algorithms.

● Design new algorithms or modify existing ones for new applications and able to analyze the space & time efficiency of most algorithms.

Pre-requisites:

1.Basic knowledge of software development and its various phases.

Course Objectives:

Student should develop a software application.

Course Content:

Course Title: PROJECT STAGE-I Course Code : PE

652


Teaching Scheme in Hrs (L:T:P) : 3:0:0 Credits : 2Credits

Type of course : Practical assignment Total Contact Hours : 37




Software application design and Development (Minor Project) 2 hrs. weekly

Course outcomes:

On successful completion of the course, the student will be able to develop a software

application.



Teaching and Examination Scheme for Master of Science (Information Technology)

2 Years


Year: II Semester: III

COURSE

TYPE

Course

Code

Course Name Credits

LTPC

Weightage

(in%)

CE ESE

EM 201 Employability Skills – VI 0201 40 60

PC 201 Proficiency in Co-Curricular

Activities – III

2

HS 203 Economics and Social Science 3003 40 60 CA 616 Logic ,Discrete mathematics

structure

3003 40 60

CA 615 Programming in Java 3003 40 60 CA-661 Industrial Project oriented Java

lab

0032 60 40

SM-601 Project Training Seminar 0032 60 40

CA 620 Web Development 3003 40 60

CA 622 Web Development Lab 0032 60 40

CA 623 E Commerce & Digital Marketing 3003 40 60

CA 650 E-Commerce & Digital Marketing

Lab

0032 60 40

CP 307 Introduction to Android 3003 40 60

CA-655 Introduction to Android Lab 0032 60 40

CA 659 Networking Lab with CISCO

Certification

0032 60 40

CA 613 Data Communication

&Networking

3003 40 60

Total Credits 26

Course Title: Employability Skills – VI Course Code : EM 201

Semester : III Core / Elective : Core


Type of course : Lecture Total Contact Hours : 12


Prerequisites: Knowledge about grammar

Course Objectives: 1.Self management

2.Interacting with other

Course Content:

S.No. Topic Details Contact

Hours

1 Communication Negotiation & Reasoning, Interaction Process,

Interpersonal Relationship

2

2 Quantitative Number System, Ratio & Proportion, Partnership,

Percentage, Profit &Loss

3

3 Reasoning, Analytical Reasoning, Coding & Decoding,

Series

2

4 Motivation Leadership & Styles, Self Esteem, Winning

strategies,

3

5 Preparation,

presentation

Self Esteem, Preparation of CV, Writing

Application, Placement Mantra

2

Total

12

References: Brilliant employability skills by

Course outcomes:

. On successful completion of the course, the student will be able to:

Develop self confidence

Course Title: ECONOMICS AND SOCIAL SCIENCE Course Code : HS 203






Pre-requisites:

Understand economics.

Course Objectives:

● Foster intellectual curiosity, critical thinking, and logical reasoning.

● Develop knowledge of quantitative and qualitative methods for understanding human

behavior.

Course Content:

Unit Course Contents Total

Contact

Hours

35

I Introduction: Definition meaning, nature and scope of

economics.

7

II

Micro Economics: Definition, meaning and scope of

Microeconomics. Importance and limitations.

7

III

Concept of Demand and supply :Utility Analysis, Law of

Demand, Demand determinants, Demand Distinctions. Law of

Supply, Elasticity

7

IV Introduction to social Sciences: impact of british rule on

India(Economic Social and Cultural). Indian National movement,

Physiography of India.

7

V Political Economy: Agriculture, Socio-Economic development,

Challenges to Indian Democracy, Political Parties and pressure

groups.

7

Total

35

Reference Books:-

1.Micro Economics by M.L.Sethi

2. Advanced Microeconomics by M.L. Singham

Course outcomes:


1. Structure, analyze, evaluate, and support an argument both orally and in writing in the

social sciences.

2. Interpret, compare, and contrast ideas in the social sciences.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Total

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Pre-requisites:

Should have basic knowledge and interest about mathematics.

Course Objectives:

Understand mathematics fundamentals.

Ways of implementing concepts into formula.

Course Content:

Topic and Contents Hours UNIT-1: 7

Set Theory : Fundamentals - Sets and subsets, Venn Diagrams, Operations on sets, Laws of Set Theory, Power Sets and Products, Partition of sets, The Principle of Inclusion - Exclusion. Logic : Propositions and Logical operations, Truth tables, Equivalence, Implications, Laws of Logic, Normal forms, Predicates and quantifiers, Mathematical Induction.

UNITS-2: 07

Relations, diagraphs and lattices : Product sets and partitions, relations and diagraphs, paths in relations and diagraphs, properties of relations, equivalence and partially ordered relations, computer representation of relations and diagraphs, manipulation of relations, Transitive closure and Warshall’s algorithm, Posets and Hasse Diagrams, Lattice.

UNITS-3: 07

Course Title: Logic ,Discrete mathematics structure Course Code :CA 616





Programmes: Master’s of Science (Information Technology

Functions and Pigeon Hole Principle : Definitions and types of functions : injective, subjective and bijective, Composition, identity and inverse, Pigeon hole principle.

UNIT-4: 7

Graphs and Trees : Graphs, Euler paths and circuits, Hamiltonian paths and circuits, Planner graphs, coloring graphs, Isomorphism of Graphs. Trees : Trees, rooted trees and path length in rooted trees, Spanning tree and Minimal Spanning tree, Isomorphism of trees, Weighted trees and Prefix Codes.

UNIT 5: 07

Algebraic structures with one binary operation - semi groups, monoids and groups, Product and quotient of algebraic structures, Isomorphism, homomorphism, automorphism, Cyclic groups, Normal sub group, codes and group codes, Algebraic structures with two binary operations rings, integral domains and fields. Ring homomorphism and Isomorphism.

TOTAL 35

Reference: 1 . Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.

2. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”,

McGraw Hill.

3. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.

Course outcomes: On successful completion of the course, the student will be able to:

1. Put logical idea into mathematical forms.

2. Understand a concept and of graph and trees.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods





Sl.


Weightage

(%)




Course Title: PROGRAMMING IN JAVA Course Code : CA 615






Pre-requisites:

Understand basic programming

Course Objectives:

Understand fundamentals of object-oriented programming in Java, including defining

classes, invoking methods, using class libraries, etc.

Course Content:


UNIT-1 7

An overview of Java: Object oriented programming, Two paradigms,

abstraction, the, OOP principles, Java class libraries Data types, variables and

arrays: Integers, floating-point types, characters, Boolean, Iterates, Variable,

Data types and casting, automatic type promotion in expressions arrays.

UNITS-2 7

Operators: Arithmetic operators, bitwise operators, relational operators,

Boolean logical assignment operators, conditional Operator, operator

precedence Control statements: -Java's selection statements, iteration

statements, jump statements Introduction to classes: Class fundamentals,

declaring object reference variable, Introducing methods, constructors,the key

word, garbage collection, the finalize () method Methods and Classes:-

Overloading methods, using objects as parameters, recursion

Inheritance: Inheritance basics, using super, method overriding, dynamic

method dispatch, using abstract Classes

UNITS-3 7

Using final with inheritance, Package and Interfaces, Package access’s

protection, importing packages Exception handling: Exception handling

fundamentals. Exception types, Uncaught Exceptions Using try and catch,

multiple catch clauses, nested try statements throw, Finally Java built in

exception creating your own exception subclasses, using exceptions.

Multithreaded Programming: The Java thread model, the main thread,

creating thread, creating multiple thread, using is alive () and join (). Thread

priorities, synchronization, Inter thread Communications, suspending

resuming and stopping thread using multithreading

UNIT-4 7

String handling: The string constructor, string length, special string operator

character extraction, string comparison,searching string, modifying string,

data conversion, changing the case of characters, string buffer.

UNIT 5 7

Networking: Networking basics, Java and the Internet Address, TCP/IP

client Sockets URL,URL connection, TCP/IPserver Sockets The Applet

Class. The Applet Class: Its architecture displays methods. The HTML

APPLET. Passing parameters to Applet. The getDocumentation Base () and

get Code Base () methods Applet Context and Show Document.

TOTAL 35

Reference:

1. The Complete Reference: Patrick Naughton and Herbert Schildt

2. Khalid Maugham LPE Publisher

3. Head First Java : Keith Sherrie

Course outcomes:


1. Implement Object Oriented Programming Concepts.

2. Use and create packages and interfaces in a Java program.

3. Use graphical user interface in Java programs.

4. Create Applets.

5. Implement exception handling in Java.

6. Implement Multithreading.

7. Use Input/output Streams.

8. Handle security implementations in Java.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Total

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.

No. Educational Components

Weightage

(%)




Course Title: Industrial Project oriented Java lab Course Code :CA 661

Semester : III Core / Elective : P Core

Teaching Scheme in Hrs (L:T:P) : 0 :0:3:2 Credits : 2 Credits

Type of course :PRACTICAL LAB Total Contact Hours : 2 Hours Weekly



Pre-requisites: Must have knowledge about java

Course Objectives:

1. Be aware of the important topics and principles of software development.

2. Have the ability to write a computer program to solve specified problems.

3. Be able to use the Java SDK environment to create, debug and run simple Java

programs.

Course Content:


1 Programs based on inheritance property.

2

2 Programs of operator overloading (complex number

arithmetic, polar coordinates).

2

3 Programs using friend functions. 2

4 Write a Program for implementing exception handling . 2

5 Write a Program for implementing multithreading . 2

6 Write a Program for creating a stack and its operation. 2

7 To implement spell checker using dictionary. 2

8 To implement color selector from a given set of colors. 2

9 To implement shape selector from a given set of shapes. 2

10 To implement a calculator with its functionality. 2

Course outcomes:


To do programming in Java,and using its utilities and functions.

Course Title: Project Training Seminar Course Code :SM 601




Continuous Internal Evaluation : 60 Marks ESEs : 40 Marks


Pre-requisites:

Basic knowledge of minimum one programming is required.

Course Objectives:

To learn concepts of Development of project

Course Content:


To Develop a project using of any programming language and

SRS

2 hours

weekly

Course outcomes:


Learn the project development.

Course Title: Web development Course Code : CA 620






Prerequisites: Knowledge of HTML

Course Objectives: This course enables students to understand web page site planning,

management and maintenance. The course explains the concepts of developing advanced HTML

pages with the help of frames, scripting languages, and evolving technologies like DHTML, and

XML.

Course Content:


UNIT-1: 7

PHP Introduction: - Introduction PHP and MySQL, Benefits of using

PHP MySQL, Setup of PHP Environment, Testing the Page,

Troubleshooting Installation Errors.

UNITS-2: 7

PHP Programming Concepts: - Write your First PHP Program,

Embed PHP in HTML / HTML in PHP, PHP Data Types, Variables in

PHP, Super Global Variables, Operators in PHP, Conditional

Statements, Loops (For, While, Do While, Foreach

UNITS-3: 7

PHP Functions: - Using Functions in PHP, User defined Functions,

Predefined Functions, Common Functions, String Functions, File

Functions, Date Functions, Hash Functions, Mail Function.

UNIT-4: 7

Arrays and Array Functions: - Why use Arrays, Types of Arrays,

Creating Arrays, Accessing Arrays, Array Functions, Using Array

Functions

UNIT 5: 7

MySQL Database Training: - What is Database, understanding an

RDBMS, Understanding Tables, Records, and Fields, SQL Language,

working with PHPMyAdmin, Creating and Types

TOTAL 35

Reference:

1.Complete reference HTML.

2. JavaScript Bible

3. HTML, DHTML, JavaScript, Perl & CGI Ivan Bayross W. Sebesta

Course outcomes:

● understand, analyze and apply the role languages like HTML, CSS, XML, JavaScript and

protocols in the workings of web and web applications.

● understand about network and security programming using Java and know about the

application of dynamic page functionality in web pages using CGI, Servlets, JSP, ASP.

create and communicate between client and server using Java and create a good, effective

and dynamic website.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

ASS

ESS

MEN

T End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods





Sl.


Weightage

(%)




Course Title: Web Development Lab Course Code : CA 622



Type of course : Practical Assignment Total Contact Hours : 2 Hours weekly



Pre-requisites:

Basic knowledge of computer system and networking.

Course Objectives:

Describe the basic concepts of how data networks and the Internet support business

communications and everyday activities.

Units Course Contents Total

Contact Hrs.

1 Introduction of PHP MySQL and setup Xampp 2 hours

2 Testing Page , troubleshooting installation errors 2 hours

3 Embed php in html and print value in next page 2 hours

4 Using data type & variable in php 2 hours

5 Conditional statement and array 2 hours

6 Making and using function string function etc. 2 hours

7 Using array and types of array 2 hours

8 Accessing array and array function 2 hours

9 Basics of database and Query 2 hours

10 Table Records, RDBMS, working PHPMyAdmin 2 hours

Course outcomes:


Learn the project development.

Course Title: E-Commerce and Digital Marketing Course Code : CA 623

Semester : III Core / Elective : Elective





Pre-requisites:

Basic Knowledge about the ecommerce market.

Course Objectives:

Digital Marketing Course is an initiative designed to educate students and practitioners in the

area of Digital Marketing analytics and make them ready for jobs or prepare them to launch

campaign for their own organizations.

Course Content:

Units Course Contents Hrs.

1 Introduction: Motivation, Forces behind E-Commerce Industry

Framework, Brief history of E Commerce, Advantages and

Disadvantages of E-Commerce, Inter Organizational E-Commerce Intra

Organizational E-Commerce

7

2 Architectural framework, Network Infrastructure for E-Commerce

Network Infrastructure for E Commerce, Market forces behind I Way,

Component of I way Access Equipment, Global Information Distribution

Network, Broadband Telecommunication.

7

3

Electronic Payments and Encryption: Overview of Electronics payments,

Digital Token based Electronics payment System, Smart Cards, Credit

Card I Debit Card based EPS, Emerging financial Instruments, Home

Banking, Online Banking, World Wide Web & Security, Encryption,

Transaction security, Secret Key Encryption, Public Key Encryption,

Virtual Private Network (VPN), Implementation Management Issues.

7

4 Introduction of Social Media, Social Media Optimization, eMail

Marketing, Mobile Marketing, performance marketing, online public

relations, content marketing, search engine optimization, search engine

marketing.

7

5

Introduction to Digital Marketing Tools: Google Analytics, Google

Adwords, Google Adsense, Hootsuite, Facebook Campaign Manager,

Twitter Campaign Manager

7

Total 35

Reference:

Reference Books: Digital Marketing strategy, implementation & practice by Dave

Chaffey

Course outcomes:


The students will understand various channels and activities essential to plan implementing and

manage an effective digital marketing strategy for their businesses.



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Total

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)




Course Title: E-Commerece and Digital Marketing Lab Course Code : CA 650





Pre-requisites: Basic knowledge of Ecommerce tools and technologies and Digital Marketing

Course Objectives:

1. Understanding about the Digital Marketing, Basics of Website creation, SEO and SEM,

etc.

2. Understanding about new terms like Google Analytics and Social Media Traffic etc.

Course Content:

Unit

s.

List of Experiments Total Contact

Hrs

1 Marketing 2 hours weekly

2 Website Basic 2 hours weekly

3 SEO 2 hours weekly

4 SEM 2 hours weekly

5 Email Marketing 2 hours weekly

6 ORM 2 hours weekly

7 Google Analytics 2 hours weekly

8 Google Adsense 2 hours weekly

9 Facebook & twitter Traffic 2 hours weekly

10 Google web traffic 2 hours weekly

Course outcomes:

On successful completion of the course, the student will be able to understand various channels

and activities essential to plan implementing and manage an effective digital marketing strategy

for their businesses.

Course Title: Introduction To Android Course Code : CP 307







Pre-requisites:

Knowledge about JAVA and OOPS is required.

Course Objectives:

The Android environment

● Tools for creating Android applications

● The Android approach to structuring applications

● Basic user interfaces

● Application life cycles

Course Content :


Contact

Hrs.

1

Hello Android Introduction to Android Android Flavors Android OS

Architecture Gradle Build System Setting up Android Development

Environment System Requirements Android Studio Installation Create First

Android Application Understand Project Hierarchy.

User Interface & Event Handling Layouts & Views Resources User Input

Control Listview and Scrolling Views Recyclerview & Card View Themes &

Styles Material Design Providing Resources for adaptive layouts Dialogs –

Alert, Progress and Custom Floating Action Button Localization

7

2

Activities and Intents Activity Lifecycle Activity State Explicit Intent

Implicit Intent Intent resolution.

Exploring Actionbar Getting Access of Action Bar Option Menus Context

Menus Popup Menus Navigation Drawer Tab Navigation Swipe View with

View Pager

7

3 Broadcast Receivers & Notification:Broadcastreceiver Sending a Broadcast

Creating Receiver Registering broadcast receiver Notification Integrating

notification with broadcast receiver.

Services Service Types of Service Service Declaration Creating a Service

Extending Service Class Start a Service Stop a Service Creating a Bound

Service Life cycle of Service

7

4

Fragments What is Fragment? Creating a Fragment Fragment Lifecycle

Handling Fragment Events Fragment Communication

7

5

Background Tasks & Networking Asynctask Asynctask with Progress Bar

Android Networking Connecting to Internet using Asynctask Downloading an

Image using Asynctask Alarm Manager Job Scheduler Thread Handlers.

7

Total

35

Reference:

Programming Android :Java Programming by Zigurd Mennies ,Laird Dornim.

Course outcomes:


The students will be introduced to mobile programming. Introduction to mobile programming

gives answer to where to start , how to implement and what are the requirements .



cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Weekly Test

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts at

BTE

1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods





Sl.


Weightage

(%)



3 Analysis and Evaluation

40

Course Title: Introduction To Android Lab Course Code : CA 655



Type of course : Practical Assignments Total Contact Hours : 2 Hours weekly



Pre-requisites:

Knowledge about JAVA and OOPS is required.

Course Objectives:

The Android environment

● Tools for creating Android applications

● The Android approach to structuring applications

● Basic user interfaces

● Application life cycles ss


1 Create the simple calculator. 2

2 Create an app that explores the life-cycle of an activity. 2

3 Create an app of registration form. 2

4 Create a simple game. 2

5 Create a Music Player using Spiner. 2

6 Create a chat application. 2

7 Create an application using Navigation Drawer. 2

8 Create an application of notification. 2

9 Create an application of game. 2

10 Create an application of android tutorial using Sqlite. 2

Course outcomes:


Learn the android application.

Course Title: NETWORKING LAB with CISCO Course Code :CA 659


Teaching Scheme in Hrs (L:T:P) :0: 0:3:2 Credits : 2 Credits

Type of course : PRACTICAL LAB Total Contact Hours : 2 HOURS WEEKLY


Program : Master of Science (Information Technology)

Pre-requisites:

Basic knowledge of computer system and networking .

Course Objectives:

Describe the basic concepts of how data networks and the Internet support business

communications and everyday activities.

Course Content:


CISCO Certification 2 Hours

weekly

Course outcomes:


Students build simple LAN topologies by applying basic principles of cabling; performing basic

configurations of network devices, including routers and switches; and implementing IP

addressing schemes.

Pre-requisites:

Student should have basic knowledge of internet , networking devices.

Course Objectives:

The objective of this course is to provide knowledge about networking

devices,networking tools,data communication method etc.

Course Content:

Course Title: DATA COMMUNICATION AND NETWORKING Course Code : CA 613






Topic and Contents Hours UNIT-1: protocol 7

Network, Network Protocols, Edge, Access Networks and Physical Media,

Protocol Layers and their services models, Internet Backbones, NAP’s and

ISPs.

UNITS-2: Application Layer 7

Application Layer: Protocol and Service Provided by application layer,

transport Protocols. The world wide web. HTTP, Message formats, User

Server Interaction And Web caches. FTP commands and replies.

Electronic Mail, SMTP, Mail Message Formats and MIME and Mail

Access Protocols DNS The internet’s directory service DNS records and

Message.

UNITS-3: Transport Layer 7

Transport Layer: Transport Layer Service and Principles, Multiplexing and

Demultiplexing applications, connectionless Transport. UDP Segment

structure and UDP Checksum. Principles of Reliable Data Transfer-Go

back to N and Selective Repeat. Connection Oriented Transport TCP

Connection and Segment Structure, Sequence Numbers and

acknowledgement numbers, Telnet, Round trip time and Timeout. TCP

connection management.

UNIT-4: Network Layer and Routing 7

Network Layer and Routing: Network service model, Routing principles.

Link State routing Algorithm, A distant Vector routing & OSPF algorithm.

Router Components; Input Prot, Switching fabric and output port. IPV6

Packet format. Point To Point Protocol (PPP), transition States, PPP

Layers-Physical Layer and Data Link Layer, Link Control Protocols. LCP

Packets and options. Authentication PAP and CHAP, Network Control

Protocol (NCP).

UNIT 5: Sonet/SDH 7

Sonet/SDH :Synchronous Transport Signals. Physical configuration-

SONET Devices, Sections, Lines and Paths. SONET Layers-Photonic

Layer, section layer, Line layer, path layer and device layer relationship.

Sonnet Frame format. Section Overhead, Line overhead and path

overhead. Virtual Tributaries and types of VTs.

TOTAL 35

Reference:

1. Data Communications and Networking (McGraw-Hill Forouzan Networking) by Behrouz

A. Forouzan

2. Introduction to Data Communications and Networking by Wayne Tomasi

3. Networking and Data Communications by V. C. Marney-Petix

Course outcomes:

On successful completion of the course, the student will be able to gainknowledge about

networking devices,networking tools,data communication method etc.

Course Assessment and Evaluation: The Course will be delivered through lectures, class room interaction, exercises and self-study

cases.

Method What To

whom

When/where

(Frequency

in the

course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer

books

1 to 8


Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total 40

ESE End Sem

Evaluation

End of the

course 60

Answer

scripts 1 to 9


course

Feedback

forms

1 to 4,

delivery

of the course

http://www.amazon.com/Data-Communications-Networking-McGraw-Hill-Forouzan/dp/0073250325/ref=sr_1_1?s=books&ie=UTF8&qid=1281202509&sr=1-1

http://www.amazon.com/Behrouz-A.-Forouzan/e/B001IOBDOE/ref=sr_ntt_srch_lnk_1?qid=1281202509&sr=1-1

http://www.amazon.com/Behrouz-A.-Forouzan/e/B001IOBDOE/ref=sr_ntt_srch_lnk_1?qid=1281202509&sr=1-1

http://www.amazon.com/Introduction-Communications-Networking-Wayne-Tomasi/dp/0130138282/ref=sr_1_5?s=books&ie=UTF8&qid=1281202509&sr=1-5

http://www.amazon.com/Wayne-Tomasi/e/B001ITYE4A/ref=sr_ntt_srch_lnk_5?qid=1281202509&sr=1-5

http://www.amazon.com/Networking-Data-Communications-V-Marney-Petix/dp/0835948749/ref=sr_1_18?s=STORE&ie=UTF8&qid=1281202593&sr=1-18

http://www.amazon.com/V.-C.-Marney-Petix/e/B001K7W3OS/ref=sr_ntt_srch_lnk_18?qid=1281202593&sr=1-18

End of Course

survey

End of


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




Sl.


Weightage

(%)






Teaching and Examination Scheme for Master of Computer Application 3 Year

2 Years(Lateral Entry)


Year: II Semester: IV

Pre-

requisites:

Knowledge about English grammer.

Course Objectives:

1.Self management

2.Interacting with other

Course Content:


UNIT-1: Communication 2

Role Plays - Negotiation, Listening, Interaction Process, Interpersonal Relationship

UNITS-2: Quantitative 2

COURSE

TYPE

Course

Code

Course Name Credits

LTPC

Weightag

e (in%)

CE ESE

EM 202 Employability Skills – VII 0201 40 60

PC 202 Proficiency in Co-Curricular Activities –

IV

2

PE 701 Project Stage II 0002 60 40

PC CA 617 Operating System 3003 40 60

CA 709 ERP system 3003 40 60

CA 619 Introduction to IOT 3003 40 60

CP 407 Artificial intelligence 3104 40 60

CA 723 Research Methodology 3104 40 60

CA 315 Computer Graphics 3003 40 60

CA 655 Computer Graphics Lab 0021 60 40

CP 408 Advance Computer Architecture 3003 40 60

CA 618 Object Oriented Analysis & Design 3003 40 60

CA 627 Entrepreneurship and small scale

business Management

3003 40 60

Total 27

Mixture & Allegation, Simple & Compound Interest, Time and work, Pipes and cistern,

Time Speed Distance,

UNITS-3: Reasoning, 3

Blood Relations, Direction Sense, Analogies, Odd one out, Logical Reasoning,

UNIT-4: Motivation 03

Mission, Vision ,Goal, Motivation & Types of Motivation, Practice Sessions on Leadership

thru case method,

UNIT 5: Preparation, presentation 12

Role play Presentation skills & Preparation

TOTAL 12

References: Brilliant employability skills by Trought, Frances Course outcome:

1. Students will learn about the self management.

2. Students will learn how to interact with other person

Pre-requisites:

Student should have knowledge of oops concepts.

Course Objectives:

To impart advance content of programming language like python which is now popular in industry.

Course Content:


Student should develop a software application as his/her major project with the

consultation of industry experts.

2 hrs. weekly

Course outcomes:

Course Title: PROJECT STAGE-II Course Code : PE 701

Semester : IV Core / Elective : Core


Type of course : practical Total Contact Hours : 25



This course provides learning exposer to students to solve major industry problem in the form of software

with the help of software industry.

Course Title: Operating System Course Code : CA 617






Pre-requisites:

Basic understanding about operating system and knowledge about subject

Course Objectives:

- To learn the fundamentals of Operating Systems - To gain knowledge on Distributed operating system

concepts that includes architecture, Mutual exclusion algorithms, Deadlock detection algorithms and

agreement protocols - To gain insight on the distributed resource management components viz. the

algorithms for implementation of distributed shared memory, recovery and commit protocols - To know

the components and management aspects of Real time, Mobile operating Systems.

Course Content:


UNIT-1 7

Introduction to Operating Systems, Operating system services,

multiprogramming, time-sharing system, storage structure. System calls,

multiprocessor system. Basic concepts of CPU scheduling, Scheduling criteria,

Scheduling algorithms, algorithm evaluation, multiple processor scheduling, real

time scheduling I/0 devices organization, I/0 devices organization, I/0 devices

organization, I/0 buffering

UNITS-2 7

Process concept, process scheduling, operations on processes Threads, inter-

process communication, precedence graphs Critical section problem,

semaphores, and classical problems of synchronization. Deadlock problem,

deadlock characterization, deadlock prevention, deadlock avoidance, deadlock

detection, recovery from deadlock, Methods for deadlock handling.

UNITS-3

7

Concepts of memory management, logical and physical address space swapping,

contiguous and non-contiguous allocation paging, segmentation, and paging

combined with segmentation

UNIT 4 7

Concepts of virtual memory, demand paging, page replacement algorithms

Allocation of frames, thrashing, demand segmentation. Security threads

protection intruders-Viruses-trusted system

UNIT 5 7

Disk scheduling, file concepts, file access methods, allocation methods, directory

systems, file protection,Introduction to distributed systems and parallel

processing case study.

TOTAL 35

Reference:

1. A.S.Tanenbaum-Modern Operating Systems, Pearson Education Asia.

2. D.M.Dhamdhere-Operating Systems-A Concept based approach, Tata Mc-Graw Hills.

3. Achyut godble -Operating Systems, Tata Mc-Graw Hills.

4. Stallings-Operating System, Pearson.

Course outcomes:


The students should be able to: -Demonstrate the Mutual exclusion, Deadlock detection and agreement

protocols of Distributed operating system - Learn the various resource management techniques for

distributed systems - Identify the different features of real time and mobile operating systems -Modify

existing open source kernels in terms of functionality or features used.


The Course will be delivered through lectures, class room interaction, exercises and self-study cases.

Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Assignments

Total

ESE End Sem

Evaluation

End of the

course 60

Answer scripts

at BTE 1 to 9


course

Feedback

forms

1 to 4, delivery

of the course

End of Course survey End of course Questionnaire

1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods



Questions for CIE and SEE will be designed to evaluate the various educational components (Bloom’s

taxonomy) such as:

Sl.


Weightage

(%)




Course Title: ERP SYSTEM Course Code : CA 709



Pre-requisites:

Basic understanding about software engineering.

Course Objectives:

To make student able to build an understanding of the fundamental concepts of ERP systems,

their architecture, and working of different modules in ERP. Students will also able to develop

and design the modules used in ERP systems, and can customize the existing modules of ERP

systems.

Course Content:


UNIT-1 7

Enterprise wide information system, Custom built and packaged approaches,

Needs and Evolution of ERP Systems, Common myths and evolving

realities, ERP and Related Technologies, Business Process Reengineering.

UNITS-2 7

ERP Benefits, classification, Present global and Indian market

scenario,milestones and pitfalls, Forecast, Market players and profiles,

Evaluation criterion for ERP product, ERP Life Cycle.

UNITS-3

Analytical Hierarchy Processes (AHP), Various ERP modules and applications,

Vendor selection criteria for successful ERP solution.

7

UNIT 4

ERP implementation strategies, Success and failure factors for implementation,

Hidden costs, ERP success inhibitors and accelerators, Management concern

for ERP success, Useful guidelines for ERP Implementations.

7

UNIT 5 07

Technologies in ERP Systems and Extended ERP, Case Studies Development

and Analysis of ERP Implementations in focusing the various issues

discussed in above units Learning and Emerging Issues. Concept of E-




Governance : Concept, E-Governance frame work, area of application like

public sector, service industry.

TOTAL 35

Reference Books:

1. ERP Systems , THM

Course outcomes:


Understand the basic concepts and technologies used in the field of management information systems;

• Have the knowledge of the different types of management information systems;



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60 Answer scripts 1 to 9


course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




taxonomy) such as:

Sl.


Weightage

(%)




Course Title: INTRODUCTION TO INTERNET OF THINGS

Course Code : CA 619






Pre-requisites:

Basic understanding about programming

Course Objectives:

To assess the vision and introduction of IoT.

2. To Understand IoT Market perspective.

3. To Implement Data and Knowledge Management and use of Devices in IoT Technology.

4. To Understand State of the Art - IoT Architecture.

5. To classify Real World IoT Design Constraints, Industrial Automation in IoT.

Course Content:


UNIT-1 7

Introduction & Concept : Introduction, physical design of IoT, Logical design of

IoT, IoT enabling Technologies, IoT level and development Templet.

UNITS-2 7

Domain Specific Iot’s: Home automation, Cities, Environment, Energy, Retail,

Logistics, Agriculture, Industry, Health & Lifestyle .

UNITS-3

IoT and Machine to Machine(M2M): M2M, Difference between IoT and M2M,

SDN and NFV for IoT,

7

UNIT 4 7

IoT System Management with NETCONF-YANG : Need for IoT system

management, simple network management protocol (SNMP), Network Orator

Requirement, NETCONF, YANG, IoT systems management with NETCONF-

YANG

UNIT 5 7

Developing Internet of things : Introduction, IoT Design Methodology, Case

study on Internet of things for weather Monitoring

TOTAL 35

Reference:

Iot by Arshdeep Bahga .

Introduction of things by Vijay Madisetti.

Course outcomes:


Interpret the vision of IoT from a global context.

Determine the Market perspective of IoT.

Compare and Contrast the use of Devices, Gateways and Data Management in IoT.

Implement state of the art architecture in IoT.



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

DIRE

CT

ASS

MEN

T

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer scripts

at BTE 1 to 9


course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




taxonomy) such as:

Sl.


Weightage

(%)




Course Title: ARTIFICIAL INTELLIGENCE Course Code : CP 407






Pre-requisites:

Background in computer programming, undergraduate algorithms and data structures, and basic discrete

mathematics and probability theory.

Course Objectives:

Various symbolic knowledge representation to specify domains and reasoning tasks of a situated software

agents.

Use different logical systems for inference over formal domain representations, and trace how a particular

inference algorithm works on a given problem specification.

Course Content:


UNIT-1 07

Meaning and definition of artificial intelligence, Various types of production systems,

Characteristics of production Systems Study and comparison of breadth first search and

depth first search. Techniques, other Search Techniques like hill Climbing, Best first

Search. A* algorithm, AO* algorithms etc, and various types of control strategies

UNITS-2 07

Knowledge Representation, Problems in representing knowledge, knowledge

representation using propositional and predicate logic, comparison of propositional and

predicate logic Resolution, refutation, deduction, theorem proving, inference, monotonic

and nonmonotonic reasoning

UNITS-3 07

Probabilistic reasoning, Bayes theorem, semantic networks scripts schemas, frames,

conceptual dependency and fuzzy logic, forward and backward reasoning

UNIT-4 07

Game playing techniques like minimax procedure, alpha-beta cut-offs etc, planning, Study

of the block world problem in robotics, Introduction to understanding and natural languages

processing

UNIT 5 07

Introduction to learning, Various techniques used in learning, introduction to neural

networks, applications of neural networks, common sense, reasoning, some example of

expert systems.

TOTAL 35

1. References: Thomas Dean-Artificial Intelligence-Theory & Practice, Pearson Education, Asia. 2. Alison Cawsey - The Essence of Artificial Intelligence, Pearson Education, Asia.

Course outcome:

1. Use various symbolic knowledge representation to specify domains and reasoning tasks of a situated

software agent.

2. Use different logical systems for inference over formal domain representations, and trace how a

particular inference algorithm works on a given problem specification.

3. Understand the conceptual and computational trade-offs between the expressiveness of different formal

representations.

Transferable skills: Upon completion, students will be able to:

4. Use key logic-based techniques in a variety of

research settings;

5. communicate scientific knowledge at different

levels of abstraction.



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Total

ESE End Sem

Evaluation

End of the

course 60

Answer scripts

at BTE 1 to 9


course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




taxonomy) such as:

Sl.


Weightage

(%)




Course Title: RESEARCH METHODOLOGIES Course Code : CA 723






Pre-requisites:

Basic understanding about research .

Course Objectives:

1. Learn about primary and secondary data collection methods

2. Use of sampling

3. Algorithm design and development

Course Content:


UNIT-1: Introduction to Research Methods 7

Philosophy of Science, Evolutionary Epistemology, Scientific Methods,

Hypotheses Generation and Evaluation, Code of Research Ethics, Definition

and Objectives of Research, Various Steps in Scientific Research, Types of

Research; Research Purposes - Research Design - Survey Research - Case Study

Research.

UNITS-2: Data Collection and Sampling Design 7

Sources of Data: Primary Data, Secondary Data; Procedure Questionnaire-

Survey and Experiments – Design of Survey and Experiments - Sampling

Merits and Demerits - Control Observations - Procedures – Sampling Errors.

UNITS-3: Statistical Modeling and Analysis 7

Statistical Modeling and Analysis, Time Series Analysis

Probability Distributions, Fundamentals of Statistical Analysis and Inference,

Multivariate methods, Concepts of Correlation and Regression, Fundamentals

of Time Series Analysis and Spectral Analysis, Error Analysis, Applications of

Spectral Analysis.

UNIT-4: Evolutionary Algorithms 7

Introduction to evolutionary algorithms - Fundamentals of Genetic algorithms,

Simulated Annealing, Neural Network based optimization, Optimization of

fuzzy systems.

UNIT 5: Research Report 7

Structure and Components of Research Report, Types of Report, Layout of

Research Report, Mechanism of writing a research report

TOTAL 35

Reference Books:

1. C.R. Kothari, Research Methodology Methods and Techniques, 2/e, Vishwa Prakashan, 2006.

2. Bendat and Piersol, Random data: Analysis and Measurement Procedures, Wiley Interscience,

2001.

3. Shumway and Stoffer, Time Series Analysis and its Applications, Springer, 2000.

4. Jenkins, G.M., and Watts, D.G., Spectral Analysis and its Applications, Holden Day, 1986.

Course outcomes:


Find the product of matrices, value of determinants, and inverse of matrix and solve the simultaneous linear

equation.

Find the product of vectors and their geometrical applications in finding moment of force, work done.

Determine probability of various types of events.

Solve the problems related to logarithms.

Solve the problems on trigonometric functions with angle of any magnitude.

Evaluate the limiting value of algebraic and trigonometric functions.



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Total

ESE End Sem

Evaluation

End of the



course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




taxonomy) such as:

Sl.


Weightage

(%)




Course Title: Computer Graphics Course Code : CA 315

Semester : IV Core / Elective : Elective





Pre-requisites:

Student Should have knowledge of basics of mathematics, graphics devices.

Course Objectives:

The objective of this course is to make students to develop computer animation ,design and

multimedia.

Course Content:


Contact

Hrs.

1

Introduction: What is Computer Graphics, Elements of a Graphics,

Workstation, Graphics hardware, I/O devices, Introduction to Raster scan

displays, Storage tube displays, refreshing, flicking, interlacing, color

monitors, display processors resolution

7

2

Point Clipping. Line Clipping Algorithms, Polygon Clipping algorithms,

Introduction to Hidden Surface elimination, Basic illumination model, diffuse

reflection, specular reflection, phong shading, Gourand shading ray tracing,

color models like RGB, YIQ, CMY, HSV etc.

7

3

Scan conversion techniques, image representation, line drawing, simple

DDA, Bresenham’s Algorithm, Circle drawing, general method, symmetric

DDA, Bresenham’s Algorithm, curves, parametric function, Beizier Method,

B-sp-line Method.

7

4

2D & 3D Co-ordinate system, Translation, Rotation, Scaling, Reflection

Inverse

Transformation, Composite transformation, world coordinate system,

screens coordinate system.

7

5 Parallel and perspective projections, Representation of 3D object on 2D

screen.

7

Total 35

Reference books:

1. D.Rogers and J. Adams, Mathematical Elements for Computer Graphics, McGraw –Hill International Edition.

2. Computer Graphics (Schaum Series) by Lipschutz (MC Graw Hill) 3. Hearn and P. Baker. Computer Graphics, Prentice Hall. 6. Computer Graphics by Yashwant Kanetkar

Course outcomes:

On successful completion of the course, the student will be able to develop computer animation ,design

and multimedia.



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the

course 60

Answer scripts

at BTE 1 to 9


course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




taxonomy) such as:

Sl.


Weightage

(%)




Course Title: Computer Graphics Lab Course Code : CA 655



Type of course : Practical Assignments Total Contact Hours : 20



Pre-requisites:

Student Should have knowledge of basics of mathematics, graphics devices.

Course Objectives:

The objective of this course is to make students to develop computer animation ,design and

multimedia.

Course Content:

S.No Name of Experiments Hours

1 To implement DDA algorithms for line and circle. 2 hours weekly

2 To implement Bresenham’s algorithms for line, circle and ellipse drawing

2 hours weekly

3 To implement Mid Point Circle algorithm using C . 2 hours weekly

4 To implement Mid Point Ellipse algorithm using C 2 hours weekly

5 To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing

2 hours weekly

6 To implement Cohen–Sutherland 2D clipping and window–viewport mapping.

2 hours weekly

7 To implement Liang Barksy Line Clipping Algorithm 2 hours weekly

8 To perform 3D Transformations such as translation, rotation and scaling.

2 hours weekly

9 To convert between color models. 2 hours weekly

10 To perform basic operations on image using any image editing software

2 hours weekly

Reference:

Reference Books:

1. Ralf Steinmetz & Klara Nahrstedt - Multimedia: computing, Communication & Applications,

Pearson Education Asia.

2. Prabhat K.Andleigh-Multimedia System Design, Prentice Hall, Iran Thakrar

Course outcomes: On successful completion of the course, the student will be able to develop computer animation ,design

and multimedia.

Course Title: ADVANCED COMPUTER ARCHITECTURE Course Code : CP 408






Prerequisites: ECE 152, CPS 104, or consent of instructor, Knowledge

Course Objectives: The course focuses on processor design, pipelining, superscalar, out-of-order

execution, caches (memory hierarchies), virtual memory, storage systems.

Advanced topics include a survey of parallel architectures and future directions in computer architecture

Course Content:


UNIT-1 7

Introduction: Parallel Computing, Parallel Computer Model, Program and Network Properties, Parallel Architectural Classification Schemes, Flynn’s & Fang’s Classification, Performance Metrics and Measures, Speedup Performance Laws: Multiprocessor System and Interconnection Networks; IEEE POSIX Threads: Creating and Exiting Threads, Simultaneous Execution of Threads, Thread Synchronization using Semaphore and Mutex, Canceling the Threads.

UNIT-2 7

pipelining and memory hierarchy: Basic and Intermediate Concepts, Instruction Set

Principle; ILP: Basics, Exploiting ILP, Limits on ILP; Linear and Nonlinear Pipeline

Processors; Superscalar and Superpipelined Design; Memory Hierarchy Design:

Advanced Optimization of Cache Performance, Memory Technology and Optimization,

Cache Coherence and Synchronization Mechanisms.

UNIT-3 7

Multithreaded Architectures, Distributed Memory MIMD Architectures Shared Memory

MIMD Architecture, Clustering, Instruction Level Data Parallel Architecture, SIMD

Architecture, Fine Grained and Coarse Grained SIMD Architecture, Associative and

Neural Architecture Data Parallel Pipelined and Systolic Architectures, Vector

Architectures

UNIT-4 7

Parallel Algorithms: PRAM Algorithms: Parallel Reduction, Prefix Sums, Preorder Tree

Traversal, Merging two Sorted lists; Matrix Multiplication: Row Column Oriented

Algorithms, Block Oriented Algorithms; Parallel Quicksort, Hyper Quick sort; Solving

Linear Systems: Gaussian Elimination, Jacobi Algorithm; Parallel Algorithm Design

Strategies

UNIT-5 7

Meaning and definition of artificial intelligence, Various types of production systems,

Characteristics of production Systems Study and comparison of breadth first search and

depth first search. Techniques, other Search Techniques like hill Climbing, Best first

Search. A* algorithm, AO* algorithms etc, and various types of control strategies

TOTAL 35

Reference Books: 1. Hwang & Briggs-Computer Architecture & Parallel Processing, Mcgraw Hill. 2. Subrata Das-Advanced Computer Architecture, Vol I & II.

Course outcomes:

● To apply the knowledge of performance metrics to find the performance of systems. ● To create an assembly language program to program a microprocessor system. ● To design a hardware component for an embedded system ● To deal with different types of computers ● To identify high performance architecture design

● To identify the problems in components of computer. ● To develop independent learning skills and be able to learn more about different computer

architectures and hardware. ● To learn & use the new technologies in computers. ● To use the knowledge of micro programming in the field of speech processing.


● The Course will be delivered through lectures, class room interaction, exercises and self-study

cases.

Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the



course

Feedback

forms

1 to 4, delivery

of the course

ASSE

SSM

ENT


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods

● CIE – Continuous Internal Evaluation ESE –End Semester Examination


● Questions for CIE and SEE will be designed to evaluate the various educational components


Sl.


Weightage

(%)




Course Title: OBJECT ORIENTED ANALYSIS & DESIGN Course Code : CA 618






Pre-requisites:

Student must have knowledge about the object oriented.

Course Objectives:

1. To describe the object-oriented software development process, including object- oriented

methodologies and work flow

2. To be able to explain and justify designs based on design principles, patterns, and heurist

Course Content:


UNIT-1 7

Unified Modeling Language, Basic structures and modeling classes, common modeling techniques, relationships, common mechanism, class diagrams

UNITS-2 7

Advanced structured modeling, advanced classes and relationships, interfaces, types and

roles, instances and object diagram.

UNITS-3 7

Behavioral modeling in OO perspective 7

UNIT-4

Object- oriented concepts and principles. Identifying the elements of an object model.

Object oriented projects metrics and estimation

7

UNIT 5

. Design for object – oriented systems. The system design process. 7

TOTAL 35

Reference Books:

Object oriented software engineering by Timothy C. Lethbridge and Robert Laganière

Course outcome:

1. Will explain the object- oriented software development process, including object-oriented

methodologies and work flo

2. Will be able to justify designs based on design principles, patterns, and heurist



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

Mid Term

Test Two tests 20

Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

40

Total

ESE End Sem

Evaluation

End of the c

ourse 60 Answer scripts 1 to 9


course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods

3. CIE – Continuous Internal Evaluation ESE –End Semester Examination


4. Questions for CIE and SEE will be designed to evaluate the various educational components


Sl.


Weightage

(%)




Course Title: ENTREPRENEURSHIP AND SMALL

SCALE BUSINESS MANAGEMENT Course Code : CA 627






Pre-requisites:

1. Basics in management rules and techniques..

Course Objectives:

1. Apply the concept of management techniques.

2. Apply the various techniques for business management

Course Content:


UNIT-1: INTRODUCTION: 7

Definition, meaning, importance and relevance types & characteristics and

classification of entrepreneurship, identification of business barriers to

entrepreneurship. Opportunities, environment scanning in rough 7 Domains of

market attractiveness & porter’s 5-forcus model

UNITS-2: NEEDS, TOOLS TECHNIQUES 7

For market assessment & survey, entrepreneurship motivations & environment

innovations & creativity.

UNITS-3: BUSINESS PLAN WRITING 7

scope, type, process of identifying target market, survey industry &

competition analysis.

UNIT-4: ENTREPRENEURSHIP DEVELOPMENT

PROGRAM

7

Objectives, Programs of EDP, Entrepreneurial development cause Relevance

& Accruements or EDP

UNIT 5: SMALL BUSINESS MANAGEMENT 7

Starting up a new business venture, Scope of fund raising to start up a new

venture.

TOTAL 35

Reference:

1.Jain P.C handbook for New Entrepreneurs: Oxford University Press

2.Drucker Peter F: Innovation & Entrepreneur

3.Lalitha D Rani : Women Entrepreneur. APH Publishing Corporation

Course outcomes:


1.Will able to find the concept of small scale business management.

2.Will able to find various types of business management techniques.



Method What To

whom

When/where

(Frequency

in the course)

Max

Marks

Evidence

collected

Contributing

to course

outcomes

DIRE

CT

ASS

MEN

T

CIE

Mid Term

Test

Student

Two tests 20 Midterm

Answer books 1 to 8

Weekly Test

Two Weekly

Test 10

Weekly Test

Copies 7 to 9

Two

Assignments

10

Log of record

1 to 6

Total

40

ESE End Sem

Evaluation

End of the



course

Feedback

forms

1 to 4, delivery

of the course


1 to 9,

Effectiveness

of delivery of

instructions

and

assessment

methods




taxonomy) such as:

Sl.


Weightage

(%)




learning center of excellence with google department … · learning center of excellence with...

Documents