SARVEPALLI RADHAKRISHNAN UNIVERSITY, …srku.edu.in/pdf/BE(CSE) III-VIII SEM(REG 2016 BATCH ON...

SARVEPALLI RADHAKRISHNAN UNIVERSITY,

Bachelor of Engineering (Computer Science & Engineering)

Scheme of Examination

S.

No.

Subject

Code Subject Name

1 MA112 MATHEMATICS -III

2 CS302 COMPUTER SYSTEM ORGANIZATION

3 CS303 DIGITAL CIRCUIT & SYSTEM

4 CS304 JAVA

5 CS305 DATA STRUCTURES & ALGORITHM

6 CS306

HARDWARE INSTALLATION AND

MAINTENANCE

7 CS307 GD / SEMINAR

8 CS308 CRITICAL THINKING

TOTAL

L: Lecture T:Tutorial

Note: For Sr. no. 7 & 8, there will be no examination and credits will be awarded only on the basis of internal assessment.

SARVEPALLI RADHAKRISHNAN UNIVERSITY, BHOPAL

Grading


Scheme of Examination w.e.f. 2016-17 Semester/Year :III /II

Subject Name

Maximum Marks Allotted

Theory Practical

End

Sem.

Mid

Sem

Quiz,

Assignment

End

Sem

Lab

work

Assignment

/ Quiz

60 30 10 0 0 0

COMPUTER SYSTEM ORGANIZATION 60 30 10 0 0 0

DIGITAL CIRCUIT & SYSTEM 60 30 10 20 20 10

60 30 10 20 20 10

DATA STRUCTURES & ALGORITHM 60 30 10 20 20 10

HARDWARE INSTALLATION AND 0 0 0 50 50 50

0 0 0 0 50 50

0 0 0 0 50 50

300 150 50 110 210 180

P:Practical


BHOPAL


Hours/

Week

Credit Total

Marks Assignment

/ Quiz L T P

0 3 1 0 4 100

0 3 1 0 4 100

10 3 1 2 5 150

10 3 1 2 5 150

10 3 1 2 5 150

50 0 0 2 1 150

50 0 0 2 1 100

50 0 0 2 1 100

180 15 5 12 26 1000





S.

No.

Subject

Code Subject Name

1 CS401 DATA COMMUNICATION

2 CS402 DISCRETE STRUCTURES

3 CS403 OOT

4 CS404 ANALYSIS & DESIGN OF ALGORITHM

5 CS405 OPERATING SYSTEM

6 CS406 DOT NET

7 CS407 MENTAL ABILITY APTITUDE

8 CS408 PROFESSIONAL ACTIVITIES

TOTAL




Grading


Scheme of Examination w.e.f. 2016-17 Semester/Year :IV /II

Subject Name


Theory Practical

End

Sem.

Mid

Sem

Quiz,

Assignment

End

Sem

Lab

work

Assignment

/ Quiz

DATA COMMUNICATION 60 30 10 0 0 0

60 30 10 0 0 0

60 30 10 20 20 10

ANALYSIS & DESIGN OF ALGORITHM 60 30 10 20 20 10

60 30 10 20 20 10

0 0 0 50 50 50

MENTAL ABILITY APTITUDE 0 0 0 0 50 50

PROFESSIONAL ACTIVITIES 0 0 0 0 50 50

300 150 50 110 210 180

T:Tutorial P:Practical


BHOPAL


Hours/

Week

Credit Total

Marks Assignment

/ Quiz L T P

0 3 1 0 4 100

0 3 1 0 4 100

10 3 1 2 5 150

10 3 1 2 5 150

10 3 1 2 5 150

50 0 0 2 1 150

50 0 0 2 1 100

50 0 0 2 1 100

180 15 5 12 26 1000

P:Practical





S.

No.

Subject

Code Subject Name

1

CS501 MICRO PROCESSOR AND

INTERFACING

2

CS502 PRINCIPLES OF PROGRAMMING

LANGUAGES

3 CS503 DATABASE MANAGEMENT SYSTEM

4

CS504 COMPUTER GRAPHICS &

MULTIMEDIA

5 CS505 THEORY OF COMPUTATION

6 CS506 INDUSTRIAL TRAINING

7 CS507 VALUE EDUCATION

8 CS508 UML

TOTAL




Grading


Scheme of Examination w.e.f. 2016-17 Semester/Year :V /III

Subject Name


Theory Practical

End

Sem.

Mid

Sem

Quiz,

Assignment

End

Sem

Lab

work

Assignment

/ Quiz

MICRO PROCESSOR AND 60 30 10 20 20 10

PRINCIPLES OF PROGRAMMING 60 30 10 0 0 0

DATABASE MANAGEMENT SYSTEM 60 30 10 20 20 10

COMPUTER GRAPHICS & 60 30 10 20 20 10

THEORY OF COMPUTATION 60 30 10 0 0 0

0 0 0 50 50 50

0 0 0 0 50 50

0 0 0 0 50 50

300 150 50 110 210 180



BHOPAL


Hours/

Week

Credit Total

Marks Assignment

/ Quiz L T P

10 3 1 0 4 150

0 3 1 0 4 100

10 3 1 2 5 150

10 3 1 2 5 150

0 3 1 2 5 100

50 0 0 2 1 150

50 0 0 2 1 100

50 0 0 2 1 100

180 15 5 12 26 1000

P:Practical





S.

No.

Subject

Code Subject Name

1 CS 601 NETWORK MANAGEMENT

2 CS 602 COMPILER DESIGN

3

CS 603 SOFTWARE ENGINEERING &

PROJECT MANAGEMENTS

4 CS 604 COMPUTER NETWORKING

5 CS 605 ADV. COMPUTER ARCHITECTURE

6 CS 606 ENGINEERING PROJECT(MINOR)

7 CS 607 MATLAB

8 CS 608 ETHICS AND VALUES

TOTAL




Grading


Scheme of Examination w.e.f. 2016-17 Semester/Year :VI /III

Subject Name


Theory Practical

End

Sem.

Mid

Sem

Quiz,

Assignment

End

Sem

Lab

work

Assignment

/ Quiz

NETWORK MANAGEMENT 60 30 10 0 0 0

60 30 10 0 0 0

SOFTWARE ENGINEERING &

PROJECT MANAGEMENTS 60 30 10 20 20 10

COMPUTER NETWORKING 60 30 10 20 20 10

ADV. COMPUTER ARCHITECTURE 60 30 10 20 20 10

ENGINEERING PROJECT(MINOR) 0 0 0 50 50 50

0 0 0 0 50 50

0 0 0 0 50 50

300 150 50 110 210 180



BHOPAL


Hours/

Week

Credit Total

Marks Assignment

/ Quiz L T P

0 3 1 0 4 100

0 3 1 0 4 100

10 3 1 2 5 150

10 3 1 2 5 150

10 3 1 2 5 150

50 0 0 2 1 150

50 0 0 2 1 100

50 0 0 2 1 100

180 15 5 12 26 1000

P:Practical





S.

No.

Subject

Code Subject Name

1 CS 701 ELECTIVE I

2 CS 702 N/W & WEB SECURITY

3 CS 703 WEB TECHNOLOGY

4 CS 704 DATA MINING AND WAREHOUSING

5 CS 705 SOFT COMPUTING

6

CS 706 MOBILE APPLICATION

DEVELOPMENT

7 CS 707 NETWORK SIMULATOR

8 CS 708 ERP

TOTAL



Elective -I

CS-7011 Cloud Computing

CS-7012 Wireless Sensor Network

CS-7013 Information Storage and Management


Grading


Scheme of Examination w.e.f. 2016-17 Semester/Year :VII /IV

Subject Name


Theory Practical

End

Sem.

Mid

Sem

Quiz,

Assignment

End

Sem

Lab

work

Assignment

/ Quiz

60 30 10 0 0 0

60 30 10 0 0 0

60 30 10 20 20 10

DATA MINING AND WAREHOUSING 60 30 10 20 20 10

60 30 10 20 20 10

0 0 0 50 50 50

0 0 0 0 50 50

0 0 0 0 50 50

300 150 50 110 210 180



Information Storage and Management

BHOPAL


Hours/

Week

Credit Total

Marks Assignment

/ Quiz L T P

0 3 1 0 4 100

0 3 1 0 4 100

10 3 1 2 5 150

10 3 1 2 5 150

10 3 1 2 5 150

50 0 0 2 1 150

50 0 0 2 1 100

50 0 0 2 1 100

180 15 5 12 26 1000

P:Practical





S.

No.

Subject

Code Subject Name

1 CS 801 ENGINEERING PROJECT (MAJOR)

2 CS 802 COMPREHENSIVE VIVA

3 CS 803 SEMINAR & GROUP DISCUSSION

TOTAL

L: Lecture


Grading


Scheme of Examination w.e.f. 2016-17 Semester/Year :VIII /IV


Theory Practical

End

Sem.

Mid

Sem

Quiz,

Assignment

End

Sem

Lab

work

Assignment

/ Quiz

(MAJOR) — — — 300 150 150

— — — 100 50 50

SEMINAR & GROUP DISCUSSION — — —

100 100

400 300 300

T:Tutorial

BHOPAL


Hours/

Week

Credit Total

Marks L T P

32 16 600

12 6 200

8 4 200

52 26 1000

P:Practical


MA-

Unit I

Functions of complex variables : Analytic functions, Harmonic Conjugate, CauchyEquations, Line Integral, Cauchy’s Theorem, Cauchy’s Integral Poles & Residues, Residue Theorem , Application of Residues theorem for evaluation of real

integrals

Unit II

Errors & Approximations, Solution of Algebraic & Trancedental Equations (Regula Falsi , Newton-Raphson, Iterative, SecantGauss Elimination, Gauss Jordan, Crout’s methods , Jacobi’s and Gauss

methods

Unit III

Difference Operators, Interpolation Interpolation Formulae, Lagrange’s and divided difference formulae ), Numerical Differentiation and Numerical Integration.

Unit IV

Solution of Ordinary Differential Equations(Taylor’s Series, Picard’s Method, Modified Euler’s Method, Runge-Kutta Method, Milne’s Predictor &and Regression, Curve Fitting (Method of Least Square).

Unit V

Concept of Probability: Probability Mass function, Probability density function. Discrete

Distribution: Binomial, Poisson’s, Continuous Distribution: Normal DisExponential Distribution, Gamma|:Students t-test, Fisher’s z-test, Chi

Reference:

(i)Numerical Methods using Matlab by J.H.Mathews and K.D.Fink, P.H.I.

(ii)Numerical Methods for Scientific and Engg. Computation by MKJain, Iyengar and RK Jain, New Age International Publication

(iii)Mathematical Methods by KV Suryanarayan Rao, SCITECH Publuication

(iv)Numerical Methods using Matlab by Yang,Wiley India (v)Pobability and Ravichandran ,Wiley India

(vi)Mathematical Statistics by George R., Springer

ARVEPALLI RADHAKRISHNAN UNIVERSITY, BHOPAL

-112 - MATHEMATICS-III

Functions of complex variables : Analytic functions, Harmonic Conjugate, CauchyEquations, Line Integral, Cauchy’s Theorem, Cauchy’s Integral Formula, Singular Points, Poles & Residues, Residue Theorem , Application of Residues theorem for evaluation of real

Errors & Approximations, Solution of Algebraic & Trancedental Equations (Regula Falsi , Raphson, Iterative, Secant Method), Solution of simultaneous linear equatins by

Gauss Elimination, Gauss Jordan, Crout’s methods , Jacobi’s and Gauss-Siedel Iterative

Difference Operators, Interpolation (Newton Forward & Backward Formulae, Central mulae, Lagrange’s and divided difference formulae ), Numerical

Differentiation and Numerical Integration.

Solution of Ordinary Differential Equations(Taylor’s Series, Picard’s Method, Modified Kutta Method, Milne’s Predictor & Corrector method ), Correlation

and Regression, Curve Fitting (Method of Least Square).

Probability Mass function, Probability density function. Discrete

Distribution: Binomial, Poisson’s, Continuous Distribution: Normal DisDistribution, Gamma Distribution, Beta Distribution, Testing of Hypothesis

test, Chi-Square Method

(i)Numerical Methods using Matlab by J.H.Mathews and K.D.Fink, P.H.I.

for Scientific and Engg. Computation by MKJain, Iyengar and RK Jain, New Age International Publication

(iii)Mathematical Methods by KV Suryanarayan Rao, SCITECH Publuication

(iv)Numerical Methods using Matlab by Yang,Wiley India (v)Pobability and

(vi)Mathematical Statistics by George R., Springer

BHOPAL

Functions of complex variables : Analytic functions, Harmonic Conjugate, Cauchy- Riemann Formula, Singular Points,

Poles & Residues, Residue Theorem , Application of Residues theorem for evaluation of real

Errors & Approximations, Solution of Algebraic & Trancedental Equations (Regula Falsi , Method), Solution of simultaneous linear equatins by

Siedel Iterative

Forward & Backward Formulae, Central mulae, Lagrange’s and divided difference formulae ), Numerical

Solution of Ordinary Differential Equations(Taylor’s Series, Picard’s Method, Modified Corrector method ), Correlation

Probability Mass function, Probability density function. Discrete

Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, of Hypothesis

for Scientific and Engg. Computation by MKJain, Iyengar and RK

(iv)Numerical Methods using Matlab by Yang,Wiley India (v)Pobability and Statistics by


CS- 302 - COMPUTER SYSTEM ORGANIZATION

Unit I

Computer Basics and CPU: Von Newman model, various subsystems, CPU, Memory, I/O, System Bus, CPU and Memory

register, Micro operations, Register Transfer Language, Instruction Fetch, decode and execution, data movement and manipulation, Instruction formats and addressing modes of

basic computer. 8085 microprocessor organization

Unit-II

Control Unit Organization: Hardwired control unit, Micro and nano programmed control unit,

Control Memory, Address Sequencing, Micro Instruction formats, Micro program sequencer,

Microprogramming, Arithmetic and Logic Unit: Arith

mul-tiplication and division, Floating point and decimal arithmetic and arithmetic units,

design of arithmetic unit.

Unit-III

Input Output Organization: Modes of data transfer direct memory access, Interrupt structures, I/O Interface, Asynchronous data transfer, I/O

processor, 8085 I/O structure, 8085 instruction set and basic programming. Data transfer

Serial / parallel, synchronous/asynchronous, simplex/half duplex and fu

Unit-IV

Memory organization: Memory Maps, Memory Hierarchy, Cache Memory and mappings. Associative memory, Virtual memory, Memory Management Hardware.

Unit V

Multiprocessors: Pipeline and Vector processing, Instruction and and array processors, Interconnection structure and inter

References:

1. Morris Mano: Computer System Architecture, PHI.

2. Tanenbaum: Structured Computer Organization, Pearson Education

3. J P Hayes, Computer Architecture and Organisations, Mc

4. Gaonkar: Microprocessor Architecture, Programming, Applications with 8085; Penram Int.

5. William Stallings: Computer Organization and Architecture, PHI

6. ISRD group; Computer orgOrganization; TMH

7. Carter; Computer Architecture (Schaum); TMH

8. Carl Hamacher: Computer Organization, TMH


COMPUTER SYSTEM ORGANIZATION

Computer Basics and CPU: Von Newman model, various subsystems, CPU, Memory, I/O, System Bus, CPU and Memory registers, Program Counter, Accumulator, Instruction


essor organization



Microprogramming, Arithmetic and Logic Unit: Arithmetic Processor, Addition, subtraction,

tiplication and division, Floating point and decimal arithmetic and arithmetic units,

Input Output Organization: Modes of data transfer - program controlled, interrupt driven adirect memory access, Interrupt structures, I/O Interface, Asynchronous data transfer, I/O

processor, 8085 I/O structure, 8085 instruction set and basic programming. Data transfer

Serial / parallel, synchronous/asynchronous, simplex/half duplex and full duplex.

Memory organization: Memory Maps, Memory Hierarchy, Cache Memory - and mappings. Associative memory, Virtual memory, Memory Management Hardware.

Multiprocessors: Pipeline and Vector processing, Instruction and arithmetic pipelines, Vector and array processors, Interconnection structure and inter-processor communication.

Morris Mano: Computer System Architecture, PHI.

Tanenbaum: Structured Computer Organization, Pearson Education

rchitecture and Organisations, Mc- Graw Hills, New Delhi

Gaonkar: Microprocessor Architecture, Programming, Applications with 8085; Penram Int.

William Stallings: Computer Organization and Architecture, PHI

ISRD group; Computer orgOrganization; TMH

Computer Architecture (Schaum); TMH

Carl Hamacher: Computer Organization, TMH

BHOPAL

Computer Basics and CPU: Von Newman model, various subsystems, CPU, Memory, I/O, registers, Program Counter, Accumulator, Instruction




metic Processor, Addition, subtraction,

tiplication and division, Floating point and decimal arithmetic and arithmetic units,

program controlled, interrupt driven and direct memory access, Interrupt structures, I/O Interface, Asynchronous data transfer, I/O

processor, 8085 I/O structure, 8085 instruction set and basic programming. Data transfer -

ll duplex.

Organization and mappings. Associative memory, Virtual memory, Memory Management Hardware.

arithmetic pipelines, Vector processor communication.

Graw Hills, New Delhi

Gaonkar: Microprocessor Architecture, Programming, Applications with 8085; Penram Int.


CS- 303 DIGITAL CIRCUIT & SYSTEM

Unit I Number systems & codes, Binary

Minimization of switching function, Concept of

Quine & McCluskey's method, Cases with don't care terms, Multiple output switching

function.

Unit II Introduction to logic gates, Universal gate, Half adder, Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition , BCD adders, Look

Unit III Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt trigger

circuits & Schmitt-Nand gates. Logic families : RTL, DTL, All types of TTL circuits , ECL,

I2L , PMOS, NMOS & CMOS logic, Gated flip

between TTL to MOS.

Unit IV Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor

memories & designing with ROM and PLA. Introduction t

Synchronous & asynchronous counters, Designing of Combinational circuits like code

converters.

Unit V Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters.

References:

1. M. Mano; "Digital Logic & Computer Design"; PHI.

2. Malvino & Leach; "Digital Principles & Applications”; TMH

3. W.H. Gothman; "Digital Electronics"; PHI.

4. Millman & Taub; "Pulse, Digital & Switching Waveforms"; TMH

5. Jain RP; Modern digital Electronics; TMH

6. R.J. Tocci, "Digital Systems Principles & Applications".

List of experiment (Expandable)

1. To study and test of operation of all logic gates for various IC’s (IC#7400,IC#7403,IC#

7408,IC#74332,IC#7486).

2. Verification of Demorgan’s theorem.

3. To construct of half adder and full adder

4. To construct of half subtractor and full subtractor circuits

5. Verification of versatility of NAND gate.

6. Verification of versatility of NOR gate.

7. Designing and verification of property of full adder.

8. Design a BCD to excess-3 code converter.

9. Design a Multiplexer/ Demultiplexer.


303 DIGITAL CIRCUIT & SYSTEM

Binary arithmetic , Boolean algebra and switching

Minimization of switching function, Concept of prime implicant , Karnaugh map method,

McCluskey's method, Cases with don't care terms, Multiple output switching

Introduction to logic gates, Universal gate, Half adder, Half subtractor, Full adder, Full es & parallel addition , BCD adders, Look-ahead carry generator.

Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt trigger

Nand gates. Logic families : RTL, DTL, All types of TTL circuits , ECL,

I2L , PMOS, NMOS & CMOS logic, Gated flip-flops and gated multivibrator , Interfacing

Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor

memories & designing with ROM and PLA. Introduction to Shift Registers, Counters,


Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and

ano; "Digital Logic & Computer Design"; PHI.

Malvino & Leach; "Digital Principles & Applications”; TMH

W.H. Gothman; "Digital Electronics"; PHI.

Millman & Taub; "Pulse, Digital & Switching Waveforms"; TMH

Jain RP; Modern digital Electronics; TMH

Tocci, "Digital Systems Principles & Applications".

List of experiment (Expandable)

To study and test of operation of all logic gates for various IC’s (IC#7400,IC#7403,IC#

Verification of Demorgan’s theorem.

er and full adder

To construct of half subtractor and full subtractor circuits

Verification of versatility of NAND gate.

Verification of versatility of NOR gate.

Designing and verification of property of full adder.

3 code converter.

Design a Multiplexer/ Demultiplexer.

BHOPAL

switching function.

prime implicant , Karnaugh map method,

McCluskey's method, Cases with don't care terms, Multiple output switching

Introduction to logic gates, Universal gate, Half adder, Half subtractor, Full adder, Full ahead carry generator.

Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt trigger

Nand gates. Logic families : RTL, DTL, All types of TTL circuits , ECL,

flops and gated multivibrator , Interfacing

Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor

o Shift Registers, Counters,


Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and

To study and test of operation of all logic gates for various IC’s (IC#7400,IC#7403,IC#


CS- 304 JAVA TECHNOLOGY

UNIT-I

Basic Java Features - C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data

Types, Class, Methods, Objects, Strings and Arrays, Type Casting, Operators, Precedence relations, Control Statements, Exception Handling, File and Streams, Visibility, Constructors,

Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes

UNIT–II

Java Collective Frame Work -Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees,Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and It

Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, MCollections.

UNIT–III

Advance Java Features - Multithreading: Thread States, Priorities and Thread Scheduling,

Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads,

Multithreading with GUI, Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI,

Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle

UNIT–IV

Advance Java Technologies - Servlets: Overview and Architecture, Setting Up the Apache

Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP

Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and

Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips

UNIT–V

Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.

References:

1. Deitel & Deitel, ”JAVA, How to Program”; PHI, Pearson.

2. E. Balaguruswamy, “Programming In Java”; TMH Publications

3. The Complete Reference: Herbert Schildt, TMH

4. Peter Norton, “Peter Norton Guide To Java Programming”, Techmedia.

5. Merlin Hughes, et al; Java Network Programming , Manning Publications/Prentice Hall

6. Cay Horstmann, Big JAVA, Wiely India.


304 JAVA TECHNOLOGY

C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data

Types, Class, Methods, Objects, Strings and Arrays, Type Casting, Operators, Precedence ntrol Statements, Exception Handling, File and Streams, Visibility, Constructors,

Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract

- Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees,Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector.

Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un

Multithreading: Thread States, Priorities and Thread Scheduling,


Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI,


Servlets: Overview and Architecture, Setting Up the Apache


s, Scripting, Standard Actions, Directives, Multimedia: Applets and

Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips

Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.

Deitel & Deitel, ”JAVA, How to Program”; PHI, Pearson.

E. Balaguruswamy, “Programming In Java”; TMH Publications

The Complete Reference: Herbert Schildt, TMH

Peter Norton, “Peter Norton Guide To Java Programming”, Techmedia.

t al; Java Network Programming , Manning Publications/Prentice Hall

Cay Horstmann, Big JAVA, Wiely India.

BHOPAL

C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data

Types, Class, Methods, Objects, Strings and Arrays, Type Casting, Operators, Precedence ntrol Statements, Exception Handling, File and Streams, Visibility, Constructors,

Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract

Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees, Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface

erator, Linked List, Vector.

Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java.

aps, Properties Class, Un-modifiable

Multithreading: Thread States, Priorities and Thread Scheduling,


Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI,


Servlets: Overview and Architecture, Setting Up the Apache


s, Scripting, Standard Actions, Directives, Multimedia: Applets and

Application: Loading, Displaying and Scaling Images, Animating a Series of Images,

t al; Java Network Programming , Manning Publications/Prentice Hall


List of Program to be perform (Expandable)

1. Installation of J2SDK

2. Write a program to show Scope of Variables

3. Write a program to show Concept of CLASS

4. Write a program to show Type Casting in JAVA

5. Write a program to show How Exception Handling is in JAVA

6. Write a Program to show Inheritance

7. Write a program to show Polymorphism

8. Write a program to show Access Specifiers (Public, Private, Protected

9. Write a program to show use and Advantages of CONTRUCTOR

10. Write a program to show Interfacing between two classes

11. Write a program to Add a Class to a Package

12. Write a program to show Life Cycle of a Thread

13. Write a program to demonstrate AWT.

14. Write a program to Hide a Class

15. Write a Program to show Data Base Connectivity Using JAVA

16. Write a Program to show “HELLO JAVA ” in Explorer using Applet

17. Write a Program to show Connectivity using JDBC

18. Write a program to demonstrate multithreading using Java.

19. Write a program to demonstrate applet life cycle.

20. Write a program to demonstrate concept of servlet.


List of Program to be perform (Expandable)

Write a program to show Scope of Variables

Write a program to show Concept of CLASS in JAVA

Write a program to show Type Casting in JAVA

Write a program to show How Exception Handling is in JAVA

Write a Program to show Inheritance

Write a program to show Polymorphism

Write a program to show Access Specifiers (Public, Private, Protected) in JAVA

Write a program to show use and Advantages of CONTRUCTOR

Write a program to show Interfacing between two classes

Write a program to Add a Class to a Package

Write a program to show Life Cycle of a Thread

Write a program to demonstrate AWT.

Write a Program to show Data Base Connectivity Using JAVA

Write a Program to show “HELLO JAVA ” in Explorer using Applet

Write a Program to show Connectivity using JDBC

Write a program to demonstrate multithreading using Java.

te a program to demonstrate applet life cycle.

Write a program to demonstrate concept of servlet.

BHOPAL

) in JAVA


CS-

Unit I

Introduction: Basic Terminology, Data types and its classification, Algorithm complexity notations like big Oh Array Defini

Multidimensional Arrays, Address calculation, Array as Parameters, Ordered List and

operations, Sparse Matrices, Storage pools, Garbage collection. Recursion

processes, simulating recursion, Backtracking, Recursive algorithms, Tail recursion, Removal

of recursion. Tower of Hanoi Problem.

UNIT II

Stack, Array Implementation of stack, Linked Representation of Stack, Application of stack:

Con-version of Infix to Prefix and Postfix Expressio

Array and linked implementation of queues, Circular queues, D

Linked list, Implementation of Singly Linked List, Two

Linked List in Array. Generalized lin

compaction, Polynomial Arithmetic.

UNIT III

Trees: Basic terminology, Binary Trees, , algebraic Expressions, Complete Binary Tree,

Extended Binary Trees, Array and Linked Representation of Binary trees, trees, Threaded Binary trees, Binary Search Tree (BST ), AVL Trees, B

Algebraic Expression, Huffman coding Algorithm.

UNIT IV

Internal and External sorting ,Insertion Sort, Bubble Sort, selection sort Quick Sort,

MergeSort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search,

Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.

Symbol Table, Static tree table, Dynamic Tree table.

Unit V

Graphs: Introduction, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.

Reference: 1. R. Kruse et al, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi

2002

2. ISRD Group; Data structures using C; TMH 3. Lipschutz; Data structure (Schaum); TMH

4. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., N

Delhi. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice

New Delhi. 5. Data Structures Trembley and Sorenson, TMH Publications

6. Pai; Data structure and algorithm; TMH

7. Introduction to Algorithm- Corman, AWL

List of Experiments (expandable):Programs in C relating to different theory units.


305 DATA STRUCTURES

Introduction: Basic Terminology, Data types and its classification, Algorithm complexity notations like big Oh Array Definition, Representation and Analysis of Arrays, Single and


operations, Sparse Matrices, Storage pools, Garbage collection. Recursion-definition and

sion, Backtracking, Recursive algorithms, Tail recursion, Removal

of recursion. Tower of Hanoi Problem.


version of Infix to Prefix and Postfix Expressions and Expression evaluation, Queue,

Array and linked implementation of queues, Circular queues, D-queues and Priority Queues.

Linked list, Implementation of Singly Linked List, Two-way Header List, Doubly linked list,

Linked List in Array. Generalized linked list, Application: Garbage collection and

compaction, Polynomial Arithmetic.


Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Binary Search Tree (BST ), AVL Trees, B-trees. Application:

Algebraic Expression, Huffman coding Algorithm.


Sort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search,


Symbol Table, Static tree table, Dynamic Tree table.

quential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.

R. Kruse et al, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi

Data structures using C; TMH

Lipschutz; Data structure (Schaum); TMH

Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., N

Delhi. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd.,

Data Structures Trembley and Sorenson, TMH Publications

Pai; Data structure and algorithm; TMH

Corman, AWL

List of Experiments (expandable): Programs in C relating to different theory units.

BHOPAL

Introduction: Basic Terminology, Data types and its classification, Algorithm complexity tion, Representation and Analysis of Arrays, Single and


definition and

sion, Backtracking, Recursive algorithms, Tail recursion, Removal


ns and Expression evaluation, Queue,

queues and Priority Queues.

way Header List, Doubly linked list,

ked list, Application: Garbage collection and


Traversing Binary trees. Application:


Sort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search,


quential Representations of Graphs, Adjacency Matrices, Traversal,

R. Kruse et al, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi-

Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., N

Hall of India Pvt. Ltd.,


CS 306 HARDWARE INSTTALATION

PURPOSE

This course is designed to enable the students to get a detailed knowledge of all the hardware components that make up a computer and to understand the different interfaces required for connecting these hardware devices.

INSTRUCTIONAL OBJECTIVES

1. Understand the components on the motherboard

2. Perform system administration tasks

3. Understand different storage media

4. Understand system related problems and methods of troubleshooting

LIST OF EXPERIMENTS

1. Study and Identification of standard

2. Understanding of Motherboard and its interfacing components

3. Install and configure computer drivers and system components.

4. Disk formatting, partitioning and Disk operating system commands

5. Install, upgrade and configure Windows oper

6. Remote desktop connections and file sharing.

7. Identify, Install and manage network connections Configuring IP address and Domain name

system

8. Install, upgrade and configure Linux operating systems.

9. Installation Antivirus and configure the anti

10. Installation of printer and scanner software.

11. Disassembly and Reassembly of hardware.

12. Trouble shooting and Managing Systems

REFERENCES

1. Craig Zacker& John Rourke, “Hill, New Delhi, 2001.

2. Mike Meyers, “Introduction to PC Hardware and Troubleshooting

New Delhi, 2003.

3. Govindarajulu B., “IBM PC and Clones hardware trouble shooting and maintenance

Tata McGraw-Hill, New Delhi, 2002.


CS 306 HARDWARE INSTTALATION AND MAINTENANCE

This course is designed to enable the students to get a detailed knowledge of all the hardware components that make up a computer and to understand the different interfaces required for connecting these hardware devices.

ONAL OBJECTIVES

Understand the components on the motherboard

Perform system administration tasks

Understand different storage media

Understand system related problems and methods of troubleshooting

Study and Identification of standard desktop personal computer

Understanding of Motherboard and its interfacing components

Install and configure computer drivers and system components.

Disk formatting, partitioning and Disk operating system commands

Install, upgrade and configure Windows operating systems.

Remote desktop connections and file sharing.

Identify, Install and manage network connections Configuring IP address and Domain name

Install, upgrade and configure Linux operating systems.

Installation Antivirus and configure the antivirus.

Installation of printer and scanner software.

Disassembly and Reassembly of hardware.

Trouble shooting and Managing Systems

Craig Zacker& John Rourke, “The complete reference : PC hardware”, Tata McGraw

Introduction to PC Hardware and Troubleshooting”, Tata McGraw

IBM PC and Clones hardware trouble shooting and maintenance

Hill, New Delhi, 2002.

BHOPAL

AND MAINTENANCE

This course is designed to enable the students to get a detailed knowledge of all the hardware components that make up a computer and to understand the different interfaces required for

Identify, Install and manage network connections Configuring IP address and Domain name

”, Tata McGraw-

”, Tata McGraw-Hill,

IBM PC and Clones hardware trouble shooting and maintenance”,


CS-307 SEMINAR / GROUP DISCUSSION(INTERNAL

Objective of GD and seminar CONVINCING/ understanding skills of students and it is to give student an opportunity to exercise their rights to express themselves.

Evaluation will be done by assigned faculpresentation.


307 SEMINAR / GROUP DISCUSSION(INTERNAL ASSESSMENT)

Objective of GD and seminar is to improve the MASS COMMUNICATION and understanding skills of students and it is to give student an opportunity to

exercise their rights to express themselves.

will be done by assigned faculty based on group discussion and power point

BHOPAL

ASSESSMENT)

is to improve the MASS COMMUNICATION and understanding skills of students and it is to give student an opportunity to

ty based on group discussion and power point


CS-308 CRITICAL THINKING (INTERNAL ASSESSMENT)

What is critical thinking?

Claims, issues, and arguments Argument structure

Ways to be imprecise Evaluating claims

Arguing fairly

Consistency and contradiction Deductive logic

Explanations

Inductive Arguments Scientific reasoning


308 CRITICAL THINKING (INTERNAL ASSESSMENT)

Claims, issues, and arguments Argument structure

Ways to be imprecise Evaluating claims

and contradiction Deductive logic

Inductive Arguments Scientific reasoning

BHOPAL

308 CRITICAL THINKING (INTERNAL ASSESSMENT)


CS-401

UNIT :- 1

Data Communication: Introduction, Components, data model , Serial & Parallel transmission , Modes of data transmission, Encoding: Unipolar, Polar, Bipolar, Line & Block codes.

Data compression: Lossy & Lossless techniques. Review of analog & digital transmission methods.

UNIT:-2

Multiplexing: Introduction & History, FDM, TDM, WDM, Synchronous & Statistical TDM.

Spread spectrum: Frequency Hopping & Direct Sequence. Terminal handling & Polling. Network Switch-ing Techniques: Circuit, Message, Packet & Hybrid. X.25

UNIT:-3

Physical Layer: Introduction, Interface, Standards, EIA& EIA-449 digital Interface: Connection, specifications & configuration. Modem: Types, features, signal constellation, block schematic. Connecting DeHubs, Repeaters, Bridges, Two & Three layer switches & Gateway. Network Topologies and their comparative study.

UNIT:-4

Transmission Media: Transmission line characteristics, distortions, Crosstalk. Guided Media:

Twisted Pair, Baseband & Broadband Coaxial, Fiber Optic Cable. Unguided media:

Electromagnet-ic polarization , Rays and waves front , Electromagnetic spectrum, Radiation

& Propagation of Waves, Inverse square law , Wave attenuation and absorption, Terrestrial

Propagation, Skip distance , Radio waves, Microwave , Infrared & Satellite Communication

system .

Telephone Network: Components, LATAs, signaling and Services, Digital Subscriber

Line: ADSL, HDSL, SDSL, VDSL, Cable TV network for data transfer.

UNIT:-5

Transmission Errors : Content Error , Flow integrity error , Error detection ,Error correction , Bit error rate.

Error detection & Correction methods: Parity checking, Checksum Error Detection, Cyclic Redun-dancy Check , Hamming Distance , Interleaved codes , Blocode, Hardware Implementation, Checksum .

Suggested Text Books:

1. Gupta Prakash C. “Data communication”, PHI Learning

2. Forouzan, “Data communication and Networking”, 5e, TATA Mc Graw

3. Godbole A., “Data Communication & Network” , TMH

4. Miller, “ Data Network and Comunication”, Cengage Delmar Learning

5. Stallings William , “Data & Computer Communication

6. Tanenbum A.S. “Computer Network”, Pearson Education

7. Kennedy G., “Communication Systems” MGH


401 – DATA COMMUNICATION

Data Communication: Introduction, Components, data representation ,data flow and basic model , Serial & Parallel transmission , Modes of data transmission, Encoding: Unipolar, Polar, Bipolar, Line & Block codes.

Data compression: Lossy & Lossless techniques. Review of analog & digital transmission

Multiplexing: Introduction & History, FDM, TDM, WDM, Synchronous & Statistical

Spread spectrum: Frequency Hopping & Direct Sequence. Terminal handling & Polling. ing Techniques: Circuit, Message, Packet & Hybrid. X.25, ISDN.

Physical Layer: Introduction, Interface, Standards, EIA-232-D, RJ-45, RJ-11, BNC connector 449 digital Interface: Connection, specifications & configuration. Modem: Types,

features, signal constellation, block schematic. Connecting Devices: Active and Passive Hubs, Repeaters, Bridges, Two & Three layer switches & Gateway. Network Topologies and


eband & Broadband Coaxial, Fiber Optic Cable. Unguided media:

ic polarization , Rays and waves front , Electromagnetic spectrum, Radiation


Skip distance , Radio waves, Microwave , Infrared & Satellite Communication


ADSL, HDSL, SDSL, VDSL, Cable TV network for data transfer.

ssion Errors : Content Error , Flow integrity error , Error detection ,Error correction ,

Error detection & Correction methods: Parity checking, Checksum Error Detection, Cyclic dancy Check , Hamming Distance , Interleaved codes , Block Parity , Convolution

code, Hardware Implementation, Checksum .

Gupta Prakash C. “Data communication”, PHI Learning

Forouzan, “Data communication and Networking”, 5e, TATA Mc Graw

Godbole A., “Data Communication & Network” , TMH

Miller, “ Data Network and Comunication”, Cengage Delmar Learning

Stallings William , “Data & Computer Communication”.

Tanenbum A.S. “Computer Network”, Pearson Education

Kennedy G., “Communication Systems” MGH

BHOPAL

representation ,data flow and basic model , Serial & Parallel transmission , Modes of data transmission, Encoding: Unipolar,

Data compression: Lossy & Lossless techniques. Review of analog & digital transmission

Multiplexing: Introduction & History, FDM, TDM, WDM, Synchronous & Statistical

Spread spectrum: Frequency Hopping & Direct Sequence. Terminal handling & Polling. , ISDN.

11, BNC connector 449 digital Interface: Connection, specifications & configuration. Modem: Types,

vices: Active and Passive Hubs, Repeaters, Bridges, Two & Three layer switches & Gateway. Network Topologies and


eband & Broadband Coaxial, Fiber Optic Cable. Unguided media:

ic polarization , Rays and waves front , Electromagnetic spectrum, Radiation


Skip distance , Radio waves, Microwave , Infrared & Satellite Communication


ssion Errors : Content Error , Flow integrity error , Error detection ,Error correction ,

Error detection & Correction methods: Parity checking, Checksum Error Detection, Cyclic ck Parity , Convolution


CS-

Unit-I

Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of

sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on

sets Relation: Definition, types of relation, composition of relations, Pictorial r

of relation, Equivalence relation, Partial ordering relation, Job

Definition, type of functions, one to one, into and onto function, inverse function,

composition of functions, recursively defined functions, pigeo

proving Techniques: Mathematical induction, Proof by contradiction.

Unit-II

Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian

group, properties of groups, Subgroup, cyclic groups, Cosets, fac

groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and

standard results, Rings and Fields: definition and standard results.

Unit-III

Propositional Logic: Proposition, First order logic, Basic logical operation,

tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence,

predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state

machine Finite state machines as models of physical

state machines as language recognizers

Unit-IV

Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and

weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits,

Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs.

Unit V

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of

ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and

complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial

Theorem, Multimonial Coefficients Recurrence Relation and Gener

Introduction to Recurrence Relation and Recursive algorithms , Linear recurrence relations

with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions ,

Generating functions , Solution by method of generating fu

Refereences:

1. C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw 2. Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw

Hill.

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

4. Lipschutz; Discrete mathematics (Schaum); TMH

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

PHI.

6. Krishnamurthy V; “Combinatorics Theory & Application”, East

Delhi. 7. S k Sarkar “ Discrete Mathematics”, S. Chand Pub


402 DISCRETE STRUCTURES

Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of


sets Relation: Definition, types of relation, composition of relations, Pictorial r

of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function:


composition of functions, recursively defined functions, pigeonhole principle. Theorem

proving Techniques: Mathematical induction, Proof by contradiction.


group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation


standard results, Rings and Fields: definition and standard results.

Propositional Logic: Proposition, First order logic, Basic logical operation,



machine Finite state machines as models of physical system equivalence machines, Finite

state machines as language recognizers


weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits,


Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of



Theorem, Multimonial Coefficients Recurrence Relation and Generating Function:



Generating functions , Solution by method of generating functions,

C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.

Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw

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

Lipschutz; Discrete mathematics (Schaum); TMH

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

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

Discrete Mathematics”, S. Chand Pub

BHOPAL

Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of


sets Relation: Definition, types of relation, composition of relations, Pictorial representation

Scheduling problem Function:


nhole principle. Theorem


tor group, Permutation


Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables,



system equivalence machines, Finite


weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits,


Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially,



ating Function:



Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw

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

West Press Pvt. Ltd., New


CS- 403 OBJECT ORIENTED TECHNOLOGY

Unit I

Abstract data types, Objects and classes, Attributes and Methods, Objects as software units, Encapsulation and Information hiding, Objects instantiations and interactions, Obj

lifetime, Static and dynamic objects, global and local objects, Metaclass, Modeling the real world objects.

Unit II

Relationships between classes, Association of objects, Types of Association, Recursive Association, Multiplicities, Navigability, Named of Aggregation, Delegation, Modeling Association and Aggregation.

Unit III

Inheritance and Polymorphism, Types of polymorphism, Static and dynamic polymorphism,

Operator and Method overloading, Inherited methods, interface, Abstract methods and classes, Public and protected properties, Private operations,

Disinheritance, Multiple inheritance.

Unit IV

Container Classes, Container types, typical functions and iterator methods, containers, Persistent objects, stream, and files, Object oriented programming languages,

Unit V

Study of C++/Java as Object-oriented programming language.

References:

1. David Parsons; Object oriented programming with C++; BPB publication

2. Object oriented programming in C++ by Robert Lafore: Galgotia

3. Balagurusamy; Object oriented programming with C++; TMH

4. Java Complete Reference: Herbert Schildt, Mc Graw Hill

5. Hubbard; Programming in C++ (Schaum); TMH

6. Mastering C++ by Venugopal, TMH

List of experiments (Expandable):

Programming assignments may be given to students so that they can better understand the concepts of object oriented programming such as objects, classes, class

association, aggregation, inheritance, polymorphism etc


403 OBJECT ORIENTED TECHNOLOGY

Abstract data types, Objects and classes, Attributes and Methods, Objects as software units, Encapsulation and Information hiding, Objects instantiations and interactions, Obj

lifetime, Static and dynamic objects, global and local objects, Metaclass, Modeling the real

Relationships between classes, Association of objects, Types of Association, Recursive Association, Multiplicities, Navigability, Named association, Aggregation of objects. Types of Aggregation, Delegation, Modeling Association and Aggregation.


Operator and Method overloading, Inherited methods, Redefined methods, the protected interface, Abstract methods and classes, Public and protected properties, Private operations,

Disinheritance, Multiple inheritance.

Container Classes, Container types, typical functions and iterator methods, Heterogeneous containers, Persistent objects, stream, and files, Object oriented programming languages,

oriented programming language.

David Parsons; Object oriented programming with C++; BPB publication

t oriented programming in C++ by Robert Lafore: Galgotia

Balagurusamy; Object oriented programming with C++; TMH

Java Complete Reference: Herbert Schildt, Mc Graw Hill

Hubbard; Programming in C++ (Schaum); TMH

Mastering C++ by Venugopal, TMH

experiments (Expandable):

Programming assignments may be given to students so that they can better understand the concepts of object oriented programming such as objects, classes, class-

association, aggregation, inheritance, polymorphism etc.

BHOPAL

Abstract data types, Objects and classes, Attributes and Methods, Objects as software units, Encapsulation and Information hiding, Objects instantiations and interactions, Object

lifetime, Static and dynamic objects, global and local objects, Metaclass, Modeling the real

Relationships between classes, Association of objects, Types of Association, Recursive association, Aggregation of objects. Types


Redefined methods, the protected interface, Abstract methods and classes, Public and protected properties, Private operations,

Heterogeneous containers, Persistent objects, stream, and files, Object oriented programming languages,

Programming assignments may be given to students so that they can better understand the -relationships,


CS- 404 –ANALYSIS & DESIGN OF ALGORITHM

Unit I

Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort. Introduction to divide and conquer technique, analysis, design and comparison of various algorithms based on this technique, example binary search, merge sort, quick sort,

strassen’s matrix multiplication.

Unit II

Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman coding, minimum spanning trees, knapsack problem, job sequesource shortest path algorithm

Unit III

Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd

Unit IV

Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph

coloring problem etc. Introduction to branch & bound method, examples of branch and bound

method like traveling salesman problem etc. Meaning of lower bound theory and its use in

solving algebraic problem, introduction to parallel algorithms.

Unit V

Binary search trees, height balanced trees, 2techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP

References:

1. Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.

2. Horowitz & Sahani; Analysis & Design of Algorithm

3. Dasgupta; algorithms; TMH

4. Ullmann; Analysis & Design of Algorithm;

5. Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India

List of Experiments( expandable):

1. Write a program for Iterative and Recursive Binary Search.

2. Write a program for Merge Sort.

3. Write a program for Quick Sort.

4. Write a program for Strassen’s Matrix Multiplication.

5. Write a program for optimal merge patterns.

6. Write a program for Huffman coding.

7. Write a program for minimum spanning trees using Kruskal’s algorithm.

8. Write a program for minimum spanning trees using Prim’s algorithm.

9. Write a program for single sources shortest path algorithm.

10. Write a program for Floye-Warsh

11. Write a program for traveling salesman problem.

12. Write a program for Hamiltonian cycle problem.


ANALYSIS & DESIGN OF ALGORITHM

Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort. Introduction to divide and conquer technique, analysis, design and comparison of

on this technique, example binary search, merge sort, quick sort,

Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single

Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd-Warshall algorithm

xamples like 8 queen’s problem, Hamiltonian cycle, Graph



oblem, introduction to parallel algorithms.

Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.

omas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.

Horowitz & Sahani; Analysis & Design of Algorithm

Ullmann; Analysis & Design of Algorithm;

Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India

Experiments( expandable):

Write a program for Iterative and Recursive Binary Search.

Write a program for Strassen’s Matrix Multiplication.

Write a program for optimal merge patterns.

program for Huffman coding.

Write a program for minimum spanning trees using Kruskal’s algorithm.

Write a program for minimum spanning trees using Prim’s algorithm.

Write a program for single sources shortest path algorithm.

Warshal algorithm.

Write a program for traveling salesman problem.

Write a program for Hamiltonian cycle problem.

BHOPAL

Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort. Introduction to divide and conquer technique, analysis, design and comparison of

on this technique, example binary search, merge sort, quick sort,

Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman ncing with deadlines, single

Concept of dynamic programming, problems based on this approach such as 0/1 knapsack,

xamples like 8 queen’s problem, Hamiltonian cycle, Graph



trees, basic search and traversal completeness.


CS-405

Unit I

Introduction to System Programs & Operating Systems, Evolution of Operating System

(mainframe, desktop, multiprocessor, Distributed, Network Operating System, Clustered & Handheld System), Operating system services, Operating system structure, System Call &

System Boots, Operating system design & Implementations, System protection, Buffering & Spooling . Types of Operating System: Bare machine, Batch Processing, Real Time,

Multitasking & Multiprogramming, time

Unit II

File: concepts, access methods, free space managements, allocation methods, directory

systems, protection, organization ,sharin

Scheduling, I/0 devices organization, I/0 devices organization, I/0 buffering, I/O Hardware,

Kernel I/O subsystem, Transforming I/O request to hardware operations. Device Driver: Path

managements, Sub module, Procedur

system in Linux & Windows

Unit III

Process: Concept, Process Control Blocks(PCB), Scheduling criteria Preemptive & non

Preemptive process scheduling, Scheduling algorithms, algorithm evaluation, multip

processor scheduling, real time scheduling, operations on processes, threads, inter process

communication, precedence graphs, critical section problem, semaphores, classical problems

of synchronization. Deadlock: Characterization, Methods for deadlock h

prevention, deadlock avoidance, deadlock detection, recovery from deadlock, Process

Management in Linux.

Unit IV

Memory Hierarchy, Concepts of memory management, MFT & MVT, logical and physical

address space, swapping, contiguous and non

and paging combined with segmentation. Structure & implementation of Page table.Concepts

of virtual memory, Cache Memory Organization, demand paging, page replacement

algorithms, allocation of frames, thrashing,

Unit V

Distributed operating system:-Types, Design issues, File system, Remote file access, RPC,

RMI, Distributed Shared Memory(DSM), Basic Concept of Parallel Processing & Concurent Programming Security & threats protection: Security

Worms & Virus, Security Design Principle, Authentications, Protection Mechanisms. introduction to Sensor network and parallel operating system. Case study of Unix, Linux &

Windows,

List of Experiment

1. Write a program to implement FCFS CPU scheduling algorithm.

2. Write a program to implement SJF CPU scheduling algorithm.

3. Write a program to implement Priority CPU Scheduling algorithm.

4. Write a program to implement Round Robin CPU scheduling algorithm.


405 – OPERATING SYSTEM


multiprocessor, Distributed, Network Operating System, Clustered & Handheld System), Operating system services, Operating system structure, System Call &

System Boots, Operating system design & Implementations, System protection, Buffering & es of Operating System: Bare machine, Batch Processing, Real Time,

Multitasking & Multiprogramming, time-sharing system.


systems, protection, organization ,sharing & implementation issues, Disk & Drum



managements, Sub module, Procedure, Scheduler, Handler, Interrupt Service Routine. File


Preemptive process scheduling, Scheduling algorithms, algorithm evaluation, multip



of synchronization. Deadlock: Characterization, Methods for deadlock handling, deadlock



address space, swapping, contiguous and non-contiguous allocation, paging, segmentation,



algorithms, allocation of frames, thrashing, demand segmentation.

Types, Design issues, File system, Remote file access, RPC,

RMI, Distributed Shared Memory(DSM), Basic Concept of Parallel Processing & Concurent Programming Security & threats protection: Security violation through Parameter, Computer


o implement FCFS CPU scheduling algorithm.

Write a program to implement SJF CPU scheduling algorithm.

Write a program to implement Priority CPU Scheduling algorithm.

Write a program to implement Round Robin CPU scheduling algorithm.

BHOPAL


multiprocessor, Distributed, Network Operating System, Clustered & Handheld System), Operating system services, Operating system structure, System Call &

System Boots, Operating system design & Implementations, System protection, Buffering & es of Operating System: Bare machine, Batch Processing, Real Time,


g & implementation issues, Disk & Drum



e, Scheduler, Handler, Interrupt Service Routine. File


Preemptive process scheduling, Scheduling algorithms, algorithm evaluation, multiple



andling, deadlock



contiguous allocation, paging, segmentation,



Types, Design issues, File system, Remote file access, RPC,

RMI, Distributed Shared Memory(DSM), Basic Concept of Parallel Processing & Concurent violation through Parameter, Computer



5. Write a program to compare various CPU Scheduling Algorithms over different Scheduling

Criteria.

6. Write a program to implement classical inter process communication problem(producer

consumer).

7. Write a program to implement classical inter process communication problem(Reader

Writers).

8. Write a program to implement classical inter process communication

problem(Dining_Philosophers).

9. Write a program to implement & Compare various page replacement algorithm.

10. Write a program to implement & Compare various Disk & Drum scheduling Algor

11. Write a program to implement Banker’s algorithms.

12. Write a program to implement Remote Proccedure Call(RPC).

13. Write a Devices Drivers for any Device or pheriperal.

Suggested Reading:

1. Silberschatz ,”Operating system”, Willey Pub.

2. Stuart,”Operating System Principles, Design & Applications”,Cengage Learning

3. Tannanbaum, “Modern operating system”,PHI Learning

4. Dhamdhere, ”Operating System”,TMH.

5. Achyut S Godbole,”Operating System”, TMH.

6. William stalling, “operating system” Pearson Edu.

7. Deitel & Deitel, “Operating Systems”, Pearson Edu.

8. Flynn & Mchoes, “Operating Systems”, Cengage Learning

9. Haldar, “Operating System”, Pearson Edu.


compare various CPU Scheduling Algorithms over different Scheduling

Write a program to implement classical inter process communication problem(producer

Write a program to implement classical inter process communication problem(Reader

Write a program to implement classical inter process communication

Write a program to implement & Compare various page replacement algorithm.

Write a program to implement & Compare various Disk & Drum scheduling Algor

Write a program to implement Banker’s algorithms.

Write a program to implement Remote Proccedure Call(RPC).

Write a Devices Drivers for any Device or pheriperal.

Silberschatz ,”Operating system”, Willey Pub.

System Principles, Design & Applications”,Cengage Learning

Tannanbaum, “Modern operating system”,PHI Learning

Dhamdhere, ”Operating System”,TMH.

Achyut S Godbole,”Operating System”, TMH.

William stalling, “operating system” Pearson Edu.

perating Systems”, Pearson Edu.

Flynn & Mchoes, “Operating Systems”, Cengage Learning

Haldar, “Operating System”, Pearson Edu.

BHOPAL

compare various CPU Scheduling Algorithms over different Scheduling

Write a program to implement classical inter process communication problem(producer

Write a program to implement classical inter process communication problem(Reader

Write a program to implement classical inter process communication

Write a program to implement & Compare various Disk & Drum scheduling Algorithms

System Principles, Design & Applications”,Cengage Learning


CS- 406 :COMPUTER PROGRAMMING

UNIT I

Introduction .NET framework, features of .Net framework, .Net, elements of .Net.

UNIT II

Basic Features Of C# Fundamentals, Classes and Objects, Inheritance and Polymorphism,Operator Overloading, Structures. and Collections; Strings and Regular Expressions, Handling Exceptions, Delegates and Events.

UNIT III

Installing ASP.NET framework, overview of the ASP .net framework, overview of CLR,

class library, overview of ASP.net control, understanding HTML controls, study of standard controls, validations controls, rich controls.

form, creating windows applications, adding controls to forms, handling Events, and using various Tolls

UNIT IV

Understanding and handling controls events,

OLEDB, and SQL connected mode, disconnected mode, dataset, datacontrols: Overview of data access data control, using grid view controls, using details view

and frame view controls, ado .net data readers, SQL dacontrol, site map data source.

UNIT V

XML: Introducing XML, Structure, and syntax of XML, document type definition (DTD),

XML Schema, Document object model, Presenting and Handling XML. xml data source, using navigation controls, introduction of web parts, using java script, Web Services

References:

1. C# for Programmers by Harvey Deitel, Paul Deitel, Pearson Education

2. Balagurusamy; Programming in C#; TMH

3. Web Commerce Technology Handbook by Daniel

4. Web Programming by Chris Bates, Wiley

5. XML Bible by Elliotte Rusty Harold ,

6. ASP .Net Complete Reference by McDonald, TMH.

7. ADO .Net Complete Reference by Odey, TMH

List of Experiment

1. Working with call backs and delegates in C#

2. Code access security with C#.

3. Creating a COM+ component with C#.

4. Creating a Windows Service with C#


COMPUTER PROGRAMMING –IV (.NET TECHNOLOGIES)

.NET framework, features of .Net framework, architecture and component of

Fundamentals, Classes and Objects, Inheritance and Polymorphism,Operator Overloading, Structures. Advanced Features Of C# Interfaces, Arrays, Indexers

ngs and Regular Expressions, Handling Exceptions, Delegates and

framework, overview of the ASP .net framework, overview of CLR,

library, overview of ASP.net control, understanding HTML controls, study of standard ontrols, validations controls, rich controls. Windows Forms: All about windows form, MDI

form, creating windows applications, adding controls to forms, handling Events, and using

Understanding and handling controls events, ADO.NET- Component object model, ODBC,

OLEDB, and SQL connected mode, disconnected mode, dataset, data-reader Overview of data access data control, using grid view controls, using details view

and frame view controls, ado .net data readers, SQL data source control, object data source

Introducing XML, Structure, and syntax of XML, document type definition (DTD),

Schema, Document object model, Presenting and Handling XML. xml data source, n controls, introduction of web parts, using java script, Web Services

C# for Programmers by Harvey Deitel, Paul Deitel, Pearson Education

Balagurusamy; Programming in C#; TMH

Handbook by Daniel Minoli, Emma Minoli , TMH

Web Programming by Chris Bates, Wiley

XML Bible by Elliotte Rusty Harold ,

ASP .Net Complete Reference by McDonald, TMH.

ADO .Net Complete Reference by Odey, TMH

Working with call backs and delegates in C#

Creating a COM+ component with C#.

Creating a Windows Service with C#

BHOPAL

IV (.NET TECHNOLOGIES)

architecture and component of

Fundamentals, Classes and Objects, Inheritance and Polymorphism, Interfaces, Arrays, Indexers

ngs and Regular Expressions, Handling Exceptions, Delegates and

framework, overview of the ASP .net framework, overview of CLR,

library, overview of ASP.net control, understanding HTML controls, study of standard All about windows form, MDI

form, creating windows applications, adding controls to forms, handling Events, and using

mponent object model, ODBC,

reader Data base Overview of data access data control, using grid view controls, using details view

ta source control, object data source

Introducing XML, Structure, and syntax of XML, document type definition (DTD),

Schema, Document object model, Presenting and Handling XML. xml data source, n controls, introduction of web parts, using java script, Web Services

, TMH


5. Interacting with a Windows Service with C#

6. Using Reflection in C#

7. Sending Mail and SMTP Mail and C#

8. Perform String Manipulation with the String Builder and String Classes and C#:

9. Using the System .Net Web Client to Retrieve or Upload Data with C#

10. Reading and Writing XML Documents with the XML Text

11. Working with Page using ASP .Net.

12. Working with Forms using ASP .Net

13. Data Sources access through ADO.Net,

14. Working with Data readers , Transactions

15. Creating Web Application.


Interacting with a Windows Service with C#

Sending Mail and SMTP Mail and C#

Perform String Manipulation with the String Builder and String Classes and C#:

the System .Net Web Client to Retrieve or Upload Data with C#

Reading and Writing XML Documents with the XML Text-Reader/-Writer Class and C#

Working with Page using ASP .Net.

Working with Forms using ASP .Net

Data Sources access through ADO.Net,

with Data readers , Transactions

BHOPAL

Writer Class and C#


CS 407 MENTAL ABILITY

Analogy

Classification Series

Coding-Decoding Blood Relations

Direction Sense Test

Logical Venn Diagrams Alphabet Test

Sitting Arrangements

Mathematical Operations Arithmetical Reasoning

Inserting the Missing Character

Number, Ranking and Time Sequence Test Eligibility Test


CS 407 MENTAL ABILITY APTITUDES

Decoding Blood Relations

Logical Venn Diagrams Alphabet Test

Operations Arithmetical Reasoning

Number, Ranking and Time Sequence Test Eligibility Test

BHOPAL


CS 408 PROFESSIONAL ACTIVITIES

Professional Activity can include but is not limited to the following.

Active participation in professional and learned societies

Attending conferences or seminars

Chairing conference sessions

Membership in professional and learned societies

Organizing conferences or serving on conference committees

Organizing sessions within conferences

Serving as a peer reviewer or juror for journals, granting agencies, productions, etc.


CS 408 PROFESSIONAL ACTIVITIES

Professional Activity can include but is not limited to the following.

professional and learned societies

Attending conferences or seminars

Membership in professional and learned societies

Organizing conferences or serving on conference committees

Organizing sessions within conferences

a peer reviewer or juror for journals, granting agencies, productions, etc.

BHOPAL

a peer reviewer or juror for journals, granting agencies, productions, etc.


CS-501 – MICRO PROCESSOR AND INTERFACING

Unit-I

Microprocessor and Microprocessor Development Systems: Evolution of Microprocessor, Microprocessor architecture and its operations, memory, inputs

schemes interfacing devices, architecture advancements of microprocessors, Typical microprocessor development system.

Unit-II

8085 Mirprocessor : Architetcure of 8

modes of 8085 microprocessor,Assembly language programs of 8085 microprocessor, Stack,

Subroutines, Time-Delay loops, Modular programming, Macro .

Unit-III

8086 Microprocessor : Architecture , Registers ,M

Addressing ,Memory Read and Write Bus Cycle of 8086,Demultiplexing of the system Bus

in 8086 and 8088 microprocessors, Instruction set and Addressing modes of 8086

microprocessor ,Assembly language programs of 8086 miroproce

Unit-IV

I/O and Memory Interfacing Using 8085/8086: memory interfacing, Interrupts of 8085/8086

Microprocessors, 8259A Programmable Interrupt Controller, Programmable peripheral Interface, 8253 Programmable Counter/Interval Timer. Communication and B

with 8085/8086 Microprocessor :Serial Communication Interface, DMA Controller 8257,

8279-Programmable Keyboard and Display I/O Interface, Bus Interface,8089 I/O processor

Unit-V

8051 Microcontroller: Architetcure of 8051 microcontroller, MemTimers/Counters, Interrupts, Addressing modes, 8051 Instruction set , Assembly language Programs, Applications of microcontrollers.

Suggested Reading:

1. Douglas V Hall, “Microprocessors and interfacing

2. Gaonkar, “Microprocessor Architecture, Programming & Applications with 8085”, TMH

3. Rafiquzzaman, “Microprocessors

4. Savaliya, “8086 Programming & Advance Processor Architecture”, Wiley India

5. Ray, Bhurchandi, “Advanced Microprocessor and

6. Soumitra Kumar Mandal, “Microprocessors and Microcontroller” TMH Pub

List of Experiments

1. To study 8085 based microprocessor system

2. To study 8086 based microprocessor system

3. To develop and run a program for finding out the largest/smal

numbers.


MICRO PROCESSOR AND INTERFACING

Microprocessor and Microprocessor Development Systems: Evolution of Microprocessor, Microprocessor architecture and its operations, memory, inputs-outputs (I/Os), data transfer

schemes interfacing devices, architecture advancements of microprocessors, Typical microprocessor development system.

8085 Mirprocessor : Architetcure of 8085 microprocessor ,Instruction set and Adressing

8085 microprocessor,Assembly language programs of 8085 microprocessor, Stack,

Delay loops, Modular programming, Macro .

8086 Microprocessor : Architecture , Registers ,Memory Segmentation ,8086 Memory



microprocessor ,Assembly language programs of 8086 miroprocessor.


Microprocessors, 8259A Programmable Interrupt Controller, Programmable peripheral Interface, 8253 Programmable Counter/Interval Timer. Communication and Bus Interfacing


Programmable Keyboard and Display I/O Interface, Bus Interface,8089 I/O processor

8051 Microcontroller: Architetcure of 8051 microcontroller, Memory organization, Timers/Counters, Interrupts, Addressing modes, 8051 Instruction set , Assembly language Programs, Applications of microcontrollers.

Douglas V Hall, “Microprocessors and interfacing – Programming & Hardware” TMH

“Microprocessor Architecture, Programming & Applications with 8085”, TMH

Rafiquzzaman, “Microprocessors-Theory & Applications”, PHI

Savaliya, “8086 Programming & Advance Processor Architecture”, Wiley India

Ray, Bhurchandi, “Advanced Microprocessor and peripherals” TMH Pub

Soumitra Kumar Mandal, “Microprocessors and Microcontroller” TMH Pub

To study 8085 based microprocessor system

To study 8086 based microprocessor system

To develop and run a program for finding out the largest/smallest number from a given set of

BHOPAL

MICRO PROCESSOR AND INTERFACING

Microprocessor and Microprocessor Development Systems: Evolution of Microprocessor, outputs (I/Os), data transfer

schemes interfacing devices, architecture advancements of microprocessors, Typical

085 microprocessor ,Instruction set and Adressing

8085 microprocessor,Assembly language programs of 8085 microprocessor, Stack,

emory Segmentation ,8086 Memory




Microprocessors, 8259A Programmable Interrupt Controller, Programmable peripheral us Interfacing


Programmable Keyboard and Display I/O Interface, Bus Interface,8089 I/O processor

ory organization, Timers/Counters, Interrupts, Addressing modes, 8051 Instruction set , Assembly language

Programming & Hardware” TMH

“Microprocessor Architecture, Programming & Applications with 8085”, TMH

lest number from a given set of


4. To develop and run a program for arranging in ascending/descending order of a set of

numbers

5. To perform multiplication/division of given numbers

6. To perform conversion of temperature from 0F to 0C and vice

7. To perform computation of square root of a given number

8. To perform floating point mathematical operations (Addition, Subtraction, Multiplication and

Division)

9. To obtain interfacing of RAM chip to 8085/8086 based system

10. To obtain interfacing of keyboard

11. To obtain interfacing of DMA controller

12. To obtain interfacing of PPI

13. To perform microprocessor based temperature control of hot water


To develop and run a program for arranging in ascending/descending order of a set of

To perform multiplication/division of given numbers

To perform conversion of temperature from 0F to 0C and vice-versa

erform computation of square root of a given number

To perform floating point mathematical operations (Addition, Subtraction, Multiplication and

To obtain interfacing of RAM chip to 8085/8086 based system

To obtain interfacing of keyboard controller

To obtain interfacing of DMA controller

To perform microprocessor based temperature control of hot water

BHOPAL

To develop and run a program for arranging in ascending/descending order of a set of

To perform floating point mathematical operations (Addition, Subtraction, Multiplication and


CS-502 – PRINCIPLES OF PROGRAMMING LANGUAGES

UNIT-I

Language Evaluation Criteria, influences on Language

Programming Paradigms– Imperative, Object Oriented, functional Programming, Logic

Programming. Programming Language Implementation

programming environments. Issues in Language Translation: Syn

analysis and synthesis, Parse Tree, CFG and BNF grammar.

UNIT-II

Data types: Introduction, primitive, character, user defined, array, associative, record, union,

pointer and reference types, design and implementation uses related to

,Variable, concept of binding, type checking, strong typing, type compatibility, named constants, variable initialization. Sequence control with Expressions, Conditional Statements,

Loops, Exception handling.

UNIT-III

Subprograms and Blocks: Fundamentals of sub

static and dynamic scope, Design issues of subprograms and operations, local referencing environments, parameter passing methods, overloaded sub

design issues for functions overloaded operators, co routines.

UNIT-IV

Abstract Data types: Abstractions and encapsulation, introductions to data abstraction, Static

and Stack-Based Storage management. heap based storage management. Garbage Collection. object oriented programming in small talk, C++, Java, C#, PHP, Perl . Concurrency:

Subprogram level concurrency, semaphores, monitors, massage passing, Java threads, C#

threads.

UNIT – V

Exception handling, Exceptions, exception Propagation, Exception handler in

Logic Programming Language : Introduction and overview of logic programming, basic elements of prolog, application of logic programming. Functional Programming Languages:

Introduction, fundamentals. Introduction to 4GL.

Suggested Reading:

1. Sebesta,”Concept of programming Language”, Pearson Edu.

2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning

3. Tucker, “ Programming Languages: Principles and paradigms “, Tata McGraw

4. Terrance W Pratt, "Programming Languages: Design

5 Cavlo Ghezzi & Mehdi Jazayeri " Programming Languages Concepts", Willey India

6 E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley


PRINCIPLES OF PROGRAMMING LANGUAGES

Language Evaluation Criteria, influences on Language design, Language categories,

Imperative, Object Oriented, functional Programming, Logic

Programming. Programming Language Implementation– Compilation and Virtual Machines,

programming environments. Issues in Language Translation: Syntax, Semantics, Stages,

analysis and synthesis, Parse Tree, CFG and BNF grammar.


pointer and reference types, design and implementation uses related to these types. Names


ocks: Fundamentals of sub-programs, Scope and lifetime of variable,

static and dynamic scope, Design issues of subprograms and operations, local referencing environments, parameter passing methods, overloaded sub-programs, generic sub

es for functions overloaded operators, co routines.


Based Storage management. heap based storage management. Garbage Collection. oriented programming in small talk, C++, Java, C#, PHP, Perl . Concurrency:


Exception handling, Exceptions, exception Propagation, Exception handler in C++ and Java.


Introduction, fundamentals. Introduction to 4GL.

esta,”Concept of programming Language”, Pearson Edu.

Louden, “Programming Languages: Principles & Practices” , Cengage Learning

Tucker, “ Programming Languages: Principles and paradigms “, Tata McGraw –

Terrance W Pratt, "Programming Languages: Design and Implementation" Pearson Edu.

Cavlo Ghezzi & Mehdi Jazayeri " Programming Languages Concepts", Willey India

E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

BHOPAL

PRINCIPLES OF PROGRAMMING LANGUAGES

design, Language categories,

Imperative, Object Oriented, functional Programming, Logic

Compilation and Virtual Machines,

tax, Semantics, Stages,


these types. Names


programs, Scope and lifetime of variable,

static and dynamic scope, Design issues of subprograms and operations, local referencing programs, generic sub-programs,


Based Storage management. heap based storage management. Garbage Collection. oriented programming in small talk, C++, Java, C#, PHP, Perl . Concurrency:


C++ and Java.


–Hill

and Implementation" Pearson Edu.

Cavlo Ghezzi & Mehdi Jazayeri " Programming Languages Concepts", Willey India


CS-503 – DATABASE MANAGEMENT SYSTEM

Unit I

DBMS Concepts and architecture Intr

accessing approach, Advantages, of database systems, Data models, Schemas and instances,

Data independence, Data Base Language and interfaces, Overall Database Structure,

Functions of DBA and designer, ER da

the E-R diagram,Concept of Generalization, Aggregation and Specialization. transforming

ER diagram into the tables. Various other data models object oriented data Model, Network

data model, and Relational data model, Comparison between the three types of models.

Unit II

Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations,

Keys, Key attributes of relation, Relational database, Schemas, Integrity constraints.

Referential integrity, Intension and Extension, Relational Query languages:SQL

integrity constraints, Complex queries, various joins, indexing, triggers, ssertions,Relational

algebra and relational calculus, Relational algebra operations like sel

Division, outer union. Types of relational calculus i.e. Tuple oriented and domain oriented

relational calculus and its operations.

Unit III

Data Base Design: Introduction to normalization, Normal forms, Functional dependency, Decomposition, Dependency preservation and losless join, problems with null valued and

dangling tuples, multivalued dependencies.Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relationa

algebra, optimization methods: heuristic based, cost estimation based.

Unit IV

Transaction Processing Concepts:

Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery

from transaction failures. Log based recovery. Checkpoints deadlock handling.Concurrency

Control Techniques: - Concurrency Control, locking Techniques for concurrency control,

time stamping protocols for concurrency control, validation based protocol, mul

granularity. Multi version schemes, Recovery with concurrent transaction. Introduction to

Distributed databases, datamining, datawarehousing, Object Technology and DBMS,

Comparative study of OODBMS Vs DBMS . Temporal, Deductive, Multimedia, Web &

Mobile database .

Unit V

Study of Relational Database Management Systems through Oracle/Postgres SQL/MySQL: Architecture, physical files, memory structures, background process. Concept of tablesegments, extents and block. Dedicated server, multi thre

database links, and snapshot. Data dictionary, dynamic performance view.Security, role management, privilege management, profiles, invoker defined security model. SQL queries, Data extraction from single, multiple tables Usage of like, any, all, exists, in Special operators. Hierarchical queries, inline queries,

flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, branching and looping constrparameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters,usage of parameters in procedures. User defined functions their limitations. Triggers, mutating errors, instead of triggers.


DATABASE MANAGEMENT SYSTEM

DBMS Concepts and architecture Introduction, Database approach v/s Traditional file



Functions of DBA and designer, ER data model:Entitles and attributes, Entity types, Defining

R diagram,Concept of Generalization, Aggregation and Specialization. transforming


ional data model, Comparison between the three types of models.



Referential integrity, Intension and Extension, Relational Query languages:SQL


algebra and relational calculus, Relational algebra operations like select, Project,Join,


relational calculus and its operations.

Data Base Design: Introduction to normalization, Normal forms, Functional dependency, ion, Dependency preservation and losless join, problems with null valued and

dangling tuples, multivalued dependencies.Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relationa

algebra, optimization methods: heuristic based, cost estimation based.

Transaction Processing Concepts: - Transaction System, Testing of Serilizability,



Concurrency Control, locking Techniques for concurrency control,

time stamping protocols for concurrency control, validation based protocol, mul




Study of Relational Database Management Systems through Oracle/Postgres SQL/MySQL: Architecture, physical files, memory structures, background process. Concept of tablesegments, extents and block. Dedicated server, multi threaded server. Distributed database,

database links, and snapshot. Data dictionary, dynamic performance view.Security, role management, privilege management, profiles, invoker defined security model. SQL queries, Data extraction from single, multiple tables equi-join, non equi-join, self-join, outer join. Usage of like, any, all, exists, in Special operators. Hierarchical queries, inline queries,

flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, branching and looping constructs in ANSI SQL. Cursor management: nested and parameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters,usage of parameters in procedures. User defined functions their

rrors, instead of triggers.

BHOPAL

oduction, Database approach v/s Traditional file



ta model:Entitles and attributes, Entity types, Defining

R diagram,Concept of Generalization, Aggregation and Specialization. transforming


ional data model, Comparison between the three types of models.



Referential integrity, Intension and Extension, Relational Query languages:SQL-DDL, DML,


ect, Project,Join,


Data Base Design: Introduction to normalization, Normal forms, Functional dependency, ion, Dependency preservation and losless join, problems with null valued and

dangling tuples, multivalued dependencies.Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relational

Transaction System, Testing of Serilizability,



Concurrency Control, locking Techniques for concurrency control,

time stamping protocols for concurrency control, validation based protocol, multiple




Study of Relational Database Management Systems through Oracle/Postgres SQL/MySQL: Architecture, physical files, memory structures, background process. Concept of table spaces,

aded server. Distributed database,

database links, and snapshot. Data dictionary, dynamic performance view.Security, role management, privilege management, profiles, invoker defined security model. SQL queries,

join, outer join. Usage of like, any, all, exists, in Special operators. Hierarchical queries, inline queries,

flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, ucts in ANSI SQL. Cursor management: nested and

parameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters,usage of parameters in procedures. User defined functions their


Lab Assignments:

1. Delete duplicate row from the table.

2. Display the alternate row from table.

3. Delete alternate row from table.

4. Update multiple rows in using single update statement.

5. Find the third highest paid and third lowest paid salary.

6. Display the 3rd, 4th, 9th rows from table.

7. Display the ename, which is start with j, k, l or m.

8. Show all employees who were hired the first half of the month.

9. Display the three record in the first row and two records in the the third row in a single sql statements.

10. Write a sql statements for rollback commit and save points.

11. Write a pl/sql for select, insert, update and delete statements.

12. Write a pl/sql block to delete a record. If delete operatio

0.

13. Display name, hire date of all employees using cursors.

14. Display details of first 5 highly paid employees using cursors.

15. Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.

16. Write a data base trigger, which acts just like primary key and does not allow duplicate values.

17. Create a data base trigger, which performs the action of the on delete cascade.

18. Write a data base trigger, which should not delete from emp table if the day is

19. In this subject the students are supposed to prepare a small database application in complete

semester like financial accounting system, Railway reservation system, institute timetable

management system. Student record system, library management s

system etc. in RDBMS as follows:

Suggested Reading:-

1. Date C J, “An Introduction To Database System”, Pearson Educations 2. Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill

3. Rob, “ Data Base System:Design Impl

4. Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations 5 . Atul Kahate , “ Introduction to Database Management System”, Pearson Educations

6. Oracle 9i Database Administration Fundamental

7. Paneerselvam,”DataBase Management System”, PHI Learning

8. dev.mysql.com 9. www.postgressql.org


Delete duplicate row from the table.

Display the alternate row from table.

Update multiple rows in using single update statement.

and third lowest paid salary.

Display the 3rd, 4th, 9th rows from table.

Display the ename, which is start with j, k, l or m.

Show all employees who were hired the first half of the month.

Display the three record in the first row and two records in the second row and one record in the third row in a single sql statements.

Write a sql statements for rollback commit and save points.

Write a pl/sql for select, insert, update and delete statements.

Write a pl/sql block to delete a record. If delete operation is successful return 1 else return

Display name, hire date of all employees using cursors.

Display details of first 5 highly paid employees using cursors.

Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.

Write a data base trigger, which acts just like primary key and does not allow duplicate values.

Create a data base trigger, which performs the action of the on delete cascade.

Write a data base trigger, which should not delete from emp table if the day is Sunday.

In this subject the students are supposed to prepare a small database application in complete


management system. Student record system, library management system, hospital management

as follows:

Date C J, “An Introduction To Database System”, Pearson Educations

Korth, Silbertz,Sudarshan, “Fundamental of Database System”, McGraw Hill

Rob, “ Data Base System:Design Implementation & Management”, Cengage Learninig

Elmasri, Navathe, “Fundamentals Of Database Systems”, Pearson Educations

5 . Atul Kahate , “ Introduction to Database Management System”, Pearson Educations

Oracle 9i Database Administration Fundamental-I, Volume I, Oracle Press,TMH.

Paneerselvam,”DataBase Management System”, PHI Learning

dev.mysql.com 9. www.postgressql.org

BHOPAL

second row and one record in

n is successful return 1 else return

Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.

Write a data base trigger, which acts just like primary key and does not allow duplicate values.

Sunday.

In this subject the students are supposed to prepare a small database application in complete


ystem, hospital management

ementation & Management”, Cengage Learninig

5 . Atul Kahate , “ Introduction to Database Management System”, Pearson Educations

Volume I, Oracle Press,TMH.


CS-504 – COMPUTER GRAPHICS & MULTIMEDIA

Unit-I

Introduction to Raster Scan displays, Pixels, Frame buffer, Vector & Character

Random Scan systems, Display devices, Scan Conversion techniques, Line Drawing:

DDA, Bresenham’s Algorithm, Circle Drawing Algorithms: Midpoint Circle

Bresenham’s Algorithm, Polygon fill algorithm: Boundary

Unit-II

2-D Transformation: Translation, Rotation, Scaling, Shearing, Reflection.

Transformation, Homogenous coordinate system, Matrices

Transformation. Windowing & Clipping: World

Viewing Transformation, Line Clipping & Polygon Clipping Algorithms

Unit-III

3-D Transformations: Translation, Rotation and Scaling.

Parallel & Perspective Projection:

elimination: Depth comparison, Back face detection algorithm, Painter’s Algorithm, Z

Algorithm. Curve generation, Bezier and B

reflection, Specular reflection, Phong Shading, Gouraud shading,Ray Trac

RGB, YIQ, CMY, HSV.

Unit-IV

Multimedia : Characteristics of a multimedia presentation , Uses of Multimedia,

Unicode Standard ,text Compression, Text file formats, Audio

Digital Audio, Digital Audio processing, Sound

software ,Video-Video color spaces,

Unit –V

Animation: Uses of Animation, Principles of Animation, Computer

Animation, Animation file formats, Animation softwares.

Compression: Lossless/Lossy Compression techniques, Image, Audio & Video

MPEG Standards ,Multimedia Architecture, Multimedia Databases

Recommended Text:

1.Rogers, "Procedural Elements of Computer Graphics", Tata McGraw Hill

2.Donald Hearn and M.P. Becker “Computer Graphics” Pearson Pub.

3.Parekh “Principles of Multimedia” Tata McGraw Hill

4.Maurya, “Computer Graphics with Virtual Reality System “ , Wiley India

5.Pakhira,”Computer Graphics ,Multimedia & Animation”,PHI learning

6.Andleigh, Thakral , “Multimedia System Design “ PHI Learning


COMPUTER GRAPHICS & MULTIMEDIA

Introduction to Raster Scan displays, Pixels, Frame buffer, Vector & Character

Random Scan systems, Display devices, Scan Conversion techniques, Line Drawing:

DDA, Bresenham’s Algorithm, Circle Drawing Algorithms: Midpoint Circle

Bresenham’s Algorithm, Polygon fill algorithm: Boundary-fill and Flood- fill algorithms

D Transformation: Translation, Rotation, Scaling, Shearing, Reflection.

Transformation, Homogenous coordinate system, Matrices Transformation, Composite

Transformation. Windowing & Clipping: World Coordinate System, Screen Coordinate System,

Clipping & Polygon Clipping Algorithms.

D Transformations: Translation, Rotation and Scaling.

Perspective Projection: Types of Parallel & Perspective Projection, Hidden Surface

comparison, Back face detection algorithm, Painter’s Algorithm, Z

Algorithm. Curve generation, Bezier and B-spline methods. Basic Illumination

reflection, Specular reflection, Phong Shading, Gouraud shading,Ray Tracing, Color models like

Multimedia : Characteristics of a multimedia presentation , Uses of Multimedia,

Unicode Standard ,text Compression, Text file formats, Audio-Components of an audio system,

Digital Audio processing, Sound cards, Audio file formats ,Audio Processing

Video color spaces, Digital Video, Digital Video processing, Video file formats.

Animation: Uses of Animation, Principles of Animation, Computer based anima

Animation, Animation file formats, Animation softwares.

Compression: Lossless/Lossy Compression techniques, Image, Audio & Video

MPEG Standards ,Multimedia Architecture, Multimedia Databases

ements of Computer Graphics", Tata McGraw Hill

2.Donald Hearn and M.P. Becker “Computer Graphics” Pearson Pub.

3.Parekh “Principles of Multimedia” Tata McGraw Hill

4.Maurya, “Computer Graphics with Virtual Reality System “ , Wiley India

Graphics ,Multimedia & Animation”,PHI learning

6.Andleigh, Thakral , “Multimedia System Design “ PHI Learning

BHOPAL

Introduction to Raster Scan displays, Pixels, Frame buffer, Vector & Character generation,

Random Scan systems, Display devices, Scan Conversion techniques, Line Drawing: simple

DDA, Bresenham’s Algorithm, Circle Drawing Algorithms: Midpoint Circle drawing and

ll algorithms

D Transformation: Translation, Rotation, Scaling, Shearing, Reflection. Inverse

Transformation, Composite

Screen Coordinate System,

Types of Parallel & Perspective Projection, Hidden Surface

comparison, Back face detection algorithm, Painter’s Algorithm, Z-Buffer

spline methods. Basic Illumination Model: Diffuse

ing, Color models like

Multimedia : Characteristics of a multimedia presentation , Uses of Multimedia, Text –Types,

Components of an audio system,

cards, Audio file formats ,Audio Processing

Digital Video, Digital Video processing, Video file formats.

based animation, 3D

Compression: Lossless/Lossy Compression techniques, Image, Audio & Video Compressions,


CS-505 –

UNIT 1:

Automata:Basic machine, FSM , Transition graph, Transition matrix, Deterministic and

nondeterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines,

minimization of finite automata, Two

Regular Sets and Regular Grammars:

automata and regular expression, Myhill

Application of pumping lemma, closure properties of regular sets.

UNIT 2:

Context –Free Grammars: Introduction to CFG, Regular Grammars, Derivation trees and

Ambiguity, Simplification of Context free grammars, Normal Forms

and Greibach Normal forms).

UNIT 3:

Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA

corresponding to given CFG, CFG corresponding to a given PDA.

Context Free Languages: The pumping lemma for CFL’s, Closure

Decision problems involving CFL’s.

UNIT 4:

Turing Machines:Introduction, TM model, representation and languages acceptability of TM

Design of

TM,Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing

machine as enumerators.Properties of recursive & recursively enumerable languages,Universal

Turing machine

UNIT 5:

Tractable and Untractable Problems:

these problems like satisfy ability problems, vertex co

traveling sales man problem, Partition problem etc.

Suggested Reading:

1. John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges & computation” , Narosa Publishers.

2. K.L.P Mishra & N.Chandrasekaran,“Theory of Computer Science”, PHI Learning

3. Michael Sipsev,“Theory of Computation”,Cenage Learning

4. John C Martin, “Introdution to languages and theory of computation”, McGraw Hill

5. Daniel I.A. Cohen,“Introduction to Computer Theory”,Wiley In

6. Kohavi,”Switching & Finite Automata Theory”,TMH


– THEORY OF COMPUTATION

Basic machine, FSM , Transition graph, Transition matrix, Deterministic and

FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines,

minimization of finite automata, Two-way finite automata.

Regular Sets and Regular Grammars:Alphabet, words, Operations, Regular sets, Finite

automata and regular expression, Myhill- Nerode theorem Pumping lemma and regular sets,

Application of pumping lemma, closure properties of regular sets.

Introduction to CFG, Regular Grammars, Derivation trees and

Ambiguity, Simplification of Context free grammars, Normal Forms (Chomsky Normal Form

Definition of PDA, Deterministic Pushdown Automata, PDA

corresponding to given CFG, CFG corresponding to a given PDA.

The pumping lemma for CFL’s, Closure properties of CFL’s,

Decision problems involving CFL’s.

Introduction, TM model, representation and languages acceptability of TM


chine as enumerators.Properties of recursive & recursively enumerable languages,Universal

Tractable and Untractable Problems:P, NP, NP complete and NP hard problems, examples of

these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem,

traveling sales man problem, Partition problem etc.

John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges & computation” , Narosa Publishers.

N.Chandrasekaran,“Theory of Computer Science”, PHI Learning

Michael Sipsev,“Theory of Computation”,Cenage Learning

John C Martin, “Introdution to languages and theory of computation”, McGraw Hill

Daniel I.A. Cohen,“Introduction to Computer Theory”,Wiley India.

Kohavi,”Switching & Finite Automata Theory”,TMH

BHOPAL

Basic machine, FSM , Transition graph, Transition matrix, Deterministic and

FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines,

Alphabet, words, Operations, Regular sets, Finite

m Pumping lemma and regular sets,

Introduction to CFG, Regular Grammars, Derivation trees and

(Chomsky Normal Form

Definition of PDA, Deterministic Pushdown Automata, PDA

properties of CFL’s,

Introduction, TM model, representation and languages acceptability of TM


chine as enumerators.Properties of recursive & recursively enumerable languages,Universal

P, NP, NP complete and NP hard problems, examples of

ver problem, Hamiltonian path problem,

John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges &

N.Chandrasekaran,“Theory of Computer Science”, PHI Learning

John C Martin, “Introdution to languages and theory of computation”, McGraw Hill


CS 506 INDUSTRIAL TRAINING

SCHEME OF STUDIES

Duration: 2 weeks after the IV semester in the semester break, Assessment in V semester.

SCHEME OF EXAMINATION

For the assessment of industrial training under

considered.

(a) Term work

In Industry Marks allotted

1. Attendance and General Discipline

2. Daily diary Maintenance

3. Initiative and participative attitude during training

4. Assessment of training by

Marks of various components in industry should be awarded to the students, in consultations

with the Training and Placement Officer/Faculty of Institute and I/c of training from Industry.

During training students will prepare a first

in-charge. After training they will prepare final draft with the help of T.P.O./Faculty of the

institute. Then they will present a seminar on their training and they will face viva

training in the institute.

OBJECTIVE OF INDUSTRIAL TRAINING

The objective of undertaking industrial training is to provide work experience so that student’s

engineering knowledge is enhanced and employment prospects are improved. The student should

take this course as a window to the real World of Work and should try to learn as much as

possible from real life experiences by involving and interacting with industry staff. Industrial

training also provides an opportunity to students to select an engineering problem and po

an industry guide.

Industrial training of the students is essential to bridge the wide gap between the classroom and

industrial environment. This will enrich their practical learning and they will be better equipped

to integrate the practical experiences with the classroom learning process.

LEARNING THROUGH INDUSTRIAL TRAINING

During industrial training students must observe following to enrich their learning:

-Industrial environment and work culture.

-Organizational structure and inter personal comm

-Machines/ equipment/ instruments

-Product development procedures and phases.

-Project planning, monitoring and control.

-Quality control and assurance.

-Maintenance system.

-Costing system.

-Stores and purchase systems.

-Layout of Computer/ EDP/MIS centers.

-Roles and responsibilities of different categories of personnel.

-Customer services.

-Problems related to various areas of Work etc.


CS 506 INDUSTRIAL TRAINING


For the assessment of industrial training undertaken by the students, following components are

Attendance and General Discipline

Initiative and participative attitude during training

Assessment of training by Industrial Supervisor



During training students will prepare a first draft of training report in consultation with section

charge. After training they will prepare final draft with the help of T.P.O./Faculty of the

institute. Then they will present a seminar on their training and they will face viva

OBJECTIVE OF INDUSTRIAL TRAINING



a window to the real World of Work and should try to learn as much as


training also provides an opportunity to students to select an engineering problem and po



ences with the classroom learning process.

LEARNING THROUGH INDUSTRIAL TRAINING


Industrial environment and work culture.

Organizational structure and inter personal communication.

Machines/ equipment/ instruments - their working and specifications.

Product development procedures and phases.

Project planning, monitoring and control.

Layout of Computer/ EDP/MIS centers.

Roles and responsibilities of different categories of personnel.

Problems related to various areas of Work etc.

BHOPAL


taken by the students, following components are



draft of training report in consultation with section

charge. After training they will prepare final draft with the help of T.P.O./Faculty of the

institute. Then they will present a seminar on their training and they will face viva-voce on



a window to the real World of Work and should try to learn as much as


training also provides an opportunity to students to select an engineering problem and possibly





Faculty and TPO are supposed to plan industrial training in such a mann

exposure on most of the above arena in the field (world of work). Students are supposed to

acquire the knowledge on above by

1.Observation,

2.Interaction with officials at the workplace

3.Study of Literature at the workplace (e.g. Us

4."Hands on" experience

5. Undertaking / assisting project work.

6. Solving problems at the work place.

7. Presenting a seminar.

8. Participating in-group meeting/ discussion.

9.Gathering primary and secondary data/ information through various sources, Storage, retrieval

and analysis of the gathered data.

10. Assisting officials and managers in their working.

11. Undertaking a short action research work.

12. Consulting current technical journals and periodicals in the library.

13. Discussions with peers.

GUIDANCE TO THE FACULTY/TPO FOR PLANNING AND IMPLEMENTING

THE INDUSTRIAL TRAINING

The industrial training programme which is spread to 2 weeks’ duration has to be desig

consultation with the authorities of the work place, keeping in view the need of the contents.

Following are some of the salient points: Spelling out the objectives of the industrial training in

behavioral terms and same is informed in advance to th

1) students

2) authorities of the work place

3) supervising

Faculty members.

Discussing and preparing students for the training for which meetings with the students has to be

planned.

Meeting with industrial personnel and orienting them regarding the obj

the expectations of the programme.

Correspondence with the authorities of the work place.

Orientation classes for students on how to make the training most beneficial

diary, writing weekly reports, how to inter

how to behave and undertake responsibilities, how to gather information from the workplace,

ethics etc.

•Guiding students to make individual plans (week wise/ day wise) to undertake industrial

training

•Developing a system of maintaining training records, by teachers for every batch of students for

convenient retrieval.

•Inviting industrial personnel to deliver lectures on some aspects of training.


Faculty and TPO are supposed to plan industrial training in such a manner that students get


acquire the knowledge on above by -

Interaction with officials at the workplace

Study of Literature at the workplace (e.g. User Manual, standards, maintenance schedules, etc.)

/ assisting project work.

problems at the work place.

group meeting/ discussion.

secondary data/ information through various sources, Storage, retrieval

and analysis of the gathered data.

officials and managers in their working.

a short action research work.

current technical journals and periodicals in the library.


THE INDUSTRIAL TRAINING

The industrial training programme which is spread to 2 weeks’ duration has to be desig



behavioral terms and same is informed in advance to the

authorities of the work place


Meeting with industrial personnel and orienting them regarding the objective of the training and

the expectations of the programme.

Correspondence with the authorities of the work place.

Orientation classes for students on how to make the training most beneficial -

diary, writing weekly reports, how to interact with various categories of industrial personnel,


Guiding students to make individual plans (week wise/ day wise) to undertake industrial

Developing a system of maintaining training records, by teachers for every batch of students for

Inviting industrial personnel to deliver lectures on some aspects of training.

BHOPAL

er that students get


er Manual, standards, maintenance schedules, etc.)

secondary data/ information through various sources, Storage, retrieval


The industrial training programme which is spread to 2 weeks’ duration has to be designed in




ective of the training and

monitoring daily

act with various categories of industrial personnel,


Guiding students to make individual plans (week wise/ day wise) to undertake industrial

Developing a system of maintaining training records, by teachers for every batch of students for


ACTION PLAN FOR PLANNING STAGES AT THE INSTITUTION LEVE

S.No. Activity

1. Meeting with Principal

2. Meeting with Colleagues

3. Correspondence with work place (Industries concerned)

4. Meeting with authorities of work place

5. Orientation of students for industrial training

6. Scrutinizing individual training

7. Commencement of industrial training

8. First monitoring of industrial training

9. Second monitoring of industrial training

10. Finalization of Training report

11. Evaluation of performance at Industry level

12. Evaluation of industrial programme in the institution

Each student has to show daily diary report.

Daily diary report consists of systematic recording of learning experiences and events.


ACTION PLAN FOR PLANNING STAGES AT THE INSTITUTION LEVE

Correspondence with work place (Industries concerned)

Meeting with authorities of work place

Orientation of students for industrial training

Scrutinizing individual training plan of students

Commencement of industrial training

First monitoring of industrial training

Second monitoring of industrial training

Finalization of Training report

Evaluation of performance at Industry level

programme in the institution

Each student has to show daily diary report.


BHOPAL

ACTION PLAN FOR PLANNING STAGES AT THE INSTITUTION LEVEL



CS 507 VALUE EDUCATION

UNIT-I

Value Education - Definition - introspection - Self esteem.

UNIT-II

Family values - Components, structure and responsibilities of family Adjustability - Threats of family life and elderly - Time allotment for sharing ideas and concerns.

UNIT-III

Ethical values - Professional ethics on family life - psychology of children and youth development.

UNIT-IV

Social values - Faith, service and secularism

Politics - Social awareness, Consumer awareness, Consumer rights and responsibilities Redressal mechanisms.

UNIT-V

Effect of international affairs on values of life/ Issue of Globalization Terrorism. Environmental issues

Reference Books

1. T. Anchukandam and J. Kuttainimathathil (Ed) Grow Free Live Free,Bangalore (1995)

2. Mani Jacob (Ed) Resource Book for Value Education, Institute for Value Education, New Delhi

2002. 3. DBNI, NCERT, SCERT, Dharma Bharti National Institute of Peace and Value Education,

Secunderabad, 2002. 4. Daniel and Selvamony - Value Education Today, (Madras Christian College, Tambaram and ALACHE, New Delhi, 1990)

5. S. Ignacimuthu - Values for Life 6. M.M.M.Mascaronhas Centre for Research Education Science and Training for FamilyPromotion - Family Life Education, Bangalore, 1993.

WEBSITES AND e-LEARNING SOURCES:

www.rkmissiondhe/.org/education.html/ www.clallam:;org/lifestyle/education.html/

www.sun.com/../edu/progrmws/star.html/

www.infoscouts.com

www.secretofsuccess.com

www.1millionpapers.com http://militarlyfinance.umuc.edu/education/edu


CS 507 VALUE EDUCATION

relevance to present day - Concept of Human Values

Components, structure and responsibilities of family - Neutralization of anger Threats of family life - Status of women in family and society -

Time allotment for sharing ideas and concerns.

Professional ethics - Mass media ethics - Advertising ethics - Influence of ethics psychology of children and youth - Leadership qualities

Faith, service and secularism - Social sense and commitment

Social awareness, Consumer awareness, Consumer rights and responsibilities

onal affairs on values of life/ Issue of Globalization - Modern warfare Environmental issues - mutual respect of different cultures, religions and their beliefs.

T. Anchukandam and J. Kuttainimathathil (Ed) Grow Free Live Free, Krisitu Jyoti Publications,

Mani Jacob (Ed) Resource Book for Value Education, Institute for Value Education, New Delhi

DBNI, NCERT, SCERT, Dharma Bharti National Institute of Peace and Value Education,

Value Education Today, (Madras Christian College, Tambaram and

Values for Life - Better Yourself Books, Mumbai, 1991.

M.M.M.Mascaronhas Centre for Research Education Science and Training for FamilyFamily Life Education, Bangalore, 1993.

LEARNING SOURCES:

www.rkmissiondhe/.org/education.html/

www.clallam:;org/lifestyle/education.html/

www.sun.com/../edu/progrmws/star.html/

http://militarlyfinance.umuc.edu/education/edu-network.html/

BHOPAL

Concept of Human Values - self

Neutralization of anger - Caring for needy

Influence of ethics Leadership qualities - Personality

Social sense and commitment - Students and

Social awareness, Consumer awareness, Consumer rights and responsibilities -

Modern warfare - mutual respect of different cultures, religions and their beliefs.

Krisitu Jyoti Publications,

Mani Jacob (Ed) Resource Book for Value Education, Institute for Value Education, New Delhi

DBNI, NCERT, SCERT, Dharma Bharti National Institute of Peace and Value Education,

Value Education Today, (Madras Christian College, Tambaram and

M.M.M.Mascaronhas Centre for Research Education Science and Training for Family Life


Unit - 1

Introduction to UML, Importance of

Conceptual model of the UML, Architecture

Unit - 2

Structural Modeling, Classes, Relationships

Advanced classes, Advanced relationships

(Refer the above topics)

Unit - 3

Behavioral Modeling, Interactions

diagrams, Events and signals, State

Unit - 4

Architectural Modeling, Architectural Modeling: Components

diagrams, Deployment diagrams,

Unit - 5

Introduction: What is a design pattern?

patterns, The catalog of design patterns

design problems, How to select a design pattern

Unit - 6

Creational Patterns, Abstract Factory

Unit - 7

Structural Patterns, Adapter, Bridge

Unit - 8

Behavioral Patterns, Chain of

Memento, Observer, Strategy, Template Method

Reference books:

1. Designing Flexible Object Oriented systems with UML

2. Object oriented Modeling and Design with UML

edition)

3. The Unified Modeling Language User Guide

Jacobson.


CS 508 UML

Importance of modeling, Principles of modeling, Overview of UML

Architecture, Software development life cycle

Relationships, Common mechanisms, Diagrams, Class

Advanced relationships ,Object diagrams ,Common modeling techniques

Interactions, Interaction diagrams ,Use cases, Use case diagrams

State machines, State chart diagrams

Architectural Modeling: Components, Deployment

, Common modeling techniques

What is a design pattern?, Design patterns in Smalltalk MVC, Describing design

The catalog of design patterns, Organizing the catalog, How design patterns solve

How to select a design pattern, How to use a design pattern

Abstract Factory, Builder, Factory Method, Prototype, Singleton

Bridge, Composite, Decorator, Façade, Flyweight, Proxy

Chain of Responsibility, Command, Interpreter, Iterator

Template Method, What to expect from design patterns?

Flexible Object Oriented systems with UML - Charles Ritcher

oriented Modeling and Design with UML - James Rumbaugh. Micheal Blaha (second

Unified Modeling Language User Guide - Grady Booch, James Rumbaugh, Ivar

BHOPAL

Overview of UML

, Class diagrams

Common modeling techniques

Use case diagrams Activity

Deployment, Component

Describing design

How design patterns solve

Singleton

Proxy

Iterator, Mediator,

What to expect from design patterns?

James Rumbaugh. Micheal Blaha (second

Grady Booch, James Rumbaugh, Ivar


CS-601

Unit-I

Introduction to Network Managements, Network Management Framework, Network Based

Managements, Evolution of Network Management: SGMP, CMIP, SNMP. Network

Implementation and Management Strategies, Network Management Categories: P

Management, Fault Management, Configuration Management, Security Managements,

Accounting Managements. Network Management Configuration: Centralized Configuration,

Distributed Configuration. Selected Management Strategy.

Unit –II

Management Information Base (MIB), Structure of Management Information, NMS Presentation

of the SMI, NMS Meter-ware Network View. Remote Monitoring (RMON), RMON Group.

Desktop Management: Desktop Management Interface(DMI), DMI Architecture, DMI Browser,

DMI/SNMP Mapping, Desktop SNMP Extension Agents. Setting up LAN Access, SNMP

Configuration.

Unit-III

Introduction, layering, OSI Layering, TCP/IP Layering, Protocols & Standards, Internet

standards, Internet administration, Internet Addresses, Internet protocol: introductio

IP routing, subnet addressing, subnet mask, special case of IP addresses, Comparative Study of

IPV4 & IPV6, port numbers Address Resolution Protocol, ARP packet format, Proxy ARP, ARP

command, ARP Example, Reverse Address Resolution Protocol

Packet format, RARP Examples, RARP server design

Unit-IV

Delivery and Routing of IP Packets, Routing Methods, Static versus Dynamic Routing, Routing

table and Routing Module, Classless Addressing: CIDR. Internet Protocol (IP), D

Fragmentation, Options, IP Package. Interior and Exterior Routing, Routing information protocol

(RIP), Open shortest path first protocol (OSPF), BGP, GGP. Private Networks. Virtual Private

Network (VPN), Network Address Translation (NAT).

Unit –V

Internet Control Message Protocols (ICMP):

query, checksum, ICMP Package. IGMP, IGMP Message and its Operation, IGMP Package.

Transmission control protocol, Process

TCP Timers. TCP Operation, TCP Package.. Application layers protocol, Telnet Protocol, File

Transfer Protocol (FTP), Simple Mail Transfer Protocol (SMTP), X

Remote procedure call, and Network file system.

References:

1. Forouzan, TCP/IP Protocol Suite 4th edition, TMH

2. J.Richard Burkey, Network Management Concept and Practice, PHI

3. Stevens, TCP/IP Illustrated Volume

4. Tittel: TCP/IP, Cenage Learning

5. Uyless Black, TCP/IP and related protocols, McGraw Hill.

6. Doughals E. Comer, Internetworking with TCP/IP Vol. I, Principles, Protocols, and

Architecture, Prentice Hall, India.


601 – NETWORK MANAGEMENT



Implementation and Management Strategies, Network Management Categories: P



Distributed Configuration. Selected Management Strategy.

mation Base (MIB), Structure of Management Information, NMS Presentation

ware Network View. Remote Monitoring (RMON), RMON Group.


Desktop SNMP Extension Agents. Setting up LAN Access, SNMP


standards, Internet administration, Internet Addresses, Internet protocol: introductio



command, ARP Example, Reverse Address Resolution Protocol (RARP): Introduction, RARP

Packet format, RARP Examples, RARP server design.


table and Routing Module, Classless Addressing: CIDR. Internet Protocol (IP), D



Network (VPN), Network Address Translation (NAT).

Internet Control Message Protocols (ICMP):- Types of message, message format, error reporting,


Transmission control protocol, Process-to-Process Communication, TCP Services


Transfer Protocol (FTP), Simple Mail Transfer Protocol (SMTP), X-Window system protocol,

Remote procedure call, and Network file system.

orouzan, TCP/IP Protocol Suite 4th edition, TMH

J.Richard Burkey, Network Management Concept and Practice, PHI

Stevens, TCP/IP Illustrated Volume-I, Pearson

Tittel: TCP/IP, Cenage Learning

Uyless Black, TCP/IP and related protocols, McGraw Hill.

. Comer, Internetworking with TCP/IP Vol. I, Principles, Protocols, and

Architecture, Prentice Hall, India.

BHOPAL



Implementation and Management Strategies, Network Management Categories: Performance



mation Base (MIB), Structure of Management Information, NMS Presentation

ware Network View. Remote Monitoring (RMON), RMON Group.


Desktop SNMP Extension Agents. Setting up LAN Access, SNMP


standards, Internet administration, Internet Addresses, Internet protocol: introduction, IP header,



(RARP): Introduction, RARP


table and Routing Module, Classless Addressing: CIDR. Internet Protocol (IP), Datagram,



Types of message, message format, error reporting,


Process Communication, TCP Services Flow Control,


Window system protocol,

. Comer, Internetworking with TCP/IP Vol. I, Principles, Protocols, and


CS-

Unit-I

Introduction to compiling & Lexical Analysis

in compiler, BOOT Strapping & Porting, Compiler structure: analysis

compilation, various phases of a compiler, Lexical analysis: Input buffering , Specification &

Recognition of Tokens, LEX.

Unit-II

Syntax Analysis & Syntax Directed Translation

Brute force approach, recursive descent parsing, transformation on the grammars, predictive

parsing, bottom up parsing, operator precedence parsing, LR parsers (SLR,LALR, LR),Parser

generation.Syntax directed definitions: Co

attributed definition, L-attribute definition, Top down translation, Bottom Up evaluation of

inherited attributes Recursive Evaluation, Analysis of Syntax directed definition.

Unit-III

Type Checking & Run Time

simple type checker, equivalence of expression, types, type conversion, overloading of functions

and operations, polymorphic functions. Run time Environment: storage organization, Storage

allocation strategies, parameter passing, dynamic storage allocation , Symbol table

Unit –IV

Code Generation: Intermediate code generation: Declarations, Assignment statements, Boolean

expressions, Case statements, Back patching, Procedure calls Code Gener

design of code generator, Basic block and flow graphs, Register allocation and assignment, DAG

representation of basic blocks, peephole optimization, generating code from DAG.

Unit –V

Code Optimization: Introduction to Code optimizati

loops in flow graphs, dead code elimination, loop optimization, Introduction to global data flow

analysis, Code Improving transformations ,Data flow analysis of structure flow graph Symbolic

debugging of optimized code.

List of Experiments:

1. Develop a lexical analyzer to recognize a few patterns. 2. Write a programme to parse using Brute force technique of Topdown parsing.

3. Develop LL (1) parser (Construct parse table also).

4. Develop an operator precedence parser (Con

5. Develop a recursive descent parser

6. Write a program for generating for various intermediate code forms

7. Three address code ii) Polish notation

8. Write a program to simulate Heap storage allocation strategy

9. Generate Lexical analyzer 10. Generate YACC specification for a few syntactic categories.

11. Given any intermediate code form implement code optimization techniques

12. Study of an Object Oriented Compiler.


-602 – COMPILER DESIGN

Introduction to compiling & Lexical Analysis:Introduction of Compiler, Major data Structure

Strapping & Porting, Compiler structure: analysis-synthesis model of


Syntax Analysis & Syntax Directed Translation:Syntax analysis: CFGs, Top down parsing,



generation.Syntax directed definitions: Construction of Syntax trees, Bottom up evaluation of S

attribute definition, Top down translation, Bottom Up evaluation of


Run Time Environment: Type checking: type system, specification of



llocation strategies, parameter passing, dynamic storage allocation , Symbol table

Intermediate code generation: Declarations, Assignment statements, Boolean

expressions, Case statements, Back patching, Procedure calls Code Generation: Issues in the



Introduction to Code optimization: sources of optimization of basic blocks,



Develop a lexical analyzer to recognize a few patterns.

Write a programme to parse using Brute force technique of Topdown parsing.

Develop LL (1) parser (Construct parse table also).

Develop an operator precedence parser (Construct parse table also)

Develop a recursive descent parser

Write a program for generating for various intermediate code forms

Three address code ii) Polish notation

Write a program to simulate Heap storage allocation strategy

Generate Lexical analyzer using LEX

Generate YACC specification for a few syntactic categories.

Given any intermediate code form implement code optimization techniques

Study of an Object Oriented Compiler.

BHOPAL

Introduction of Compiler, Major data Structure

synthesis model of


alysis: CFGs, Top down parsing,



nstruction of Syntax trees, Bottom up evaluation of S-

attribute definition, Top down translation, Bottom Up evaluation of


checking: type system, specification of



llocation strategies, parameter passing, dynamic storage allocation , Symbol table

Intermediate code generation: Declarations, Assignment statements, Boolean

ation: Issues in the



on: sources of optimization of basic blocks,



Write a programme to parse using Brute force technique of Topdown parsing.

Given any intermediate code form implement code optimization techniques


References:

1. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools , Pearson Education

2. Raghavan, Compiler Design, TMH Pub.3. Louden. Compiler Construction: Principles and Practice, Cengage Learning

4. C. Holub. Compiler Design in C , Prentice5. Mak, writing compiler & Interpreters, Willey Pub.


V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools ,

Raghavan, Compiler Design, TMH Pub. Louden. Compiler Construction: Principles and Practice, Cengage Learning

C. Holub. Compiler Design in C , Prentice-Hall Inc., 1993. Mak, writing compiler & Interpreters, Willey Pub.

BHOPAL

V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools ,

Louden. Compiler Construction: Principles and Practice, Cengage Learning


CS-603 – SOFTWARE ENGINEERING & PROJECT MANAGEMENT

Unit I:

The Software Product and Software Process

Software Process Models: Linear

Evolutionary Process Models like

Model, RUP and Agile processes. Software Process customization and improvement, CMM,

Product and Process Metrics

Unit II:

Requirement Elicitation, Analysis, and Specification

requirements, Requirement Sources and Elicitation Techniques, Analysis

oriented and Object-oriented software development, Use case Modeling, System

Requirement Specifications, Requirement Validation, Traceability

Unit III:

Software Design :The Software Design Process, Design Concepts and Principles, Software

Modeling and UML, Architectural Design, Architectural Views and Styles, User Inte

Design, Function-oriented Design, SA/SD Component Based Design, Design Metrics

Unit IV:

Software Analysis and Testing

Software Testing Fundamentals, Software Test Process, Testing Levels, Test

Design, Test Oracles, Test Techniques, Black

Testing Frameworks, Integration Testing, System Testing and other Specialized Testing, Test

Plan, Test Metrics, Testing Tools. , Introduction to

comparison with structured software engg.

Unit V:

Software Maintenance & Software Project Measurement

Software Configuration Management (SCM), SoftwareChange Management, Version Control,

Change control and Reporting, Program Comprehension Techniques, Re

Engineering, Tool Support.

Project Management Concepts, Feasilibility Analysis, Project and Process Planning, Resources Allocations, Software efforts, Schedule, and Co

Risk Assessment and Mitigation, Software Quality Assurance (SQA). Project Plan, Project Metrics.

Practical and Lab work

Lab work should include a running case study problem for which different deliverables aend of each phase of a software development life cycle are to be developed. This will include

modeling the requirements, architecture and detailed design. Subsequently the design models will be coded and tested. For modeling, tools like Rational Rose

testing, IDE like Eclipse, NetBeans, and Visual Studio can be used.


SOFTWARE ENGINEERING & PROJECT MANAGEMENT

The Software Product and Software Process:Software Product and Process Characteristics,

Software Process Models: Linear Sequential Model, Prototyping Model, RAD Model,

Evolutionary Process Models like Incremental Model, Spiral Model, Component Assembly


Requirement Elicitation, Analysis, and Specification: Functional and Non

requirements, Requirement Sources and Elicitation Techniques, Analysis Modeling for Function

oriented software development, Use case Modeling, System

Requirement Validation, Traceability

The Software Design Process, Design Concepts and Principles, Software

UML, Architectural Design, Architectural Views and Styles, User Inte

oriented Design, SA/SD Component Based Design, Design Metrics

Software Analysis and Testing :Software Static and Dynamic analysis, Code inspections,

Software Testing Fundamentals, Software Test Process, Testing Levels, Test Criteria, Test Case

Test Oracles, Test Techniques, Black-Box Testing, White-Box Unit Testing and Unit


Plan, Test Metrics, Testing Tools. , Introduction to Object-oriented analysis, design and

comparison with structured software engg.

Software Maintenance & Software Project Measurement :Need and Types of Maintenance,


Change control and Reporting, Program Comprehension Techniques, Re-engineering, Reverse

Project Management Concepts, Feasilibility Analysis, Project and Process Planning, Resources Allocations, Software efforts, Schedule, and Cost estimations, Project Scheduling and Tracking,

Risk Assessment and Mitigation, Software Quality Assurance (SQA). Project Plan, Project

Lab work should include a running case study problem for which different deliverables aend of each phase of a software development life cycle are to be developed. This will include

modeling the requirements, architecture and detailed design. Subsequently the design models will be coded and tested. For modeling, tools like Rational Rose products. For coding and

testing, IDE like Eclipse, NetBeans, and Visual Studio can be used.

BHOPAL

SOFTWARE ENGINEERING & PROJECT MANAGEMENT

:Software Product and Process Characteristics,

Sequential Model, Prototyping Model, RAD Model,

Incremental Model, Spiral Model, Component Assembly


Functional and Non-functional

Modeling for Function-

oriented software development, Use case Modeling, System and Software

The Software Design Process, Design Concepts and Principles, Software

UML, Architectural Design, Architectural Views and Styles, User Interface

oriented Design, SA/SD Component Based Design, Design Metrics

Software Static and Dynamic analysis, Code inspections,

Criteria, Test Case

Box Unit Testing and Unit


oriented analysis, design and

Need and Types of Maintenance,


engineering, Reverse

Project Management Concepts, Feasilibility Analysis, Project and Process Planning, Resources st estimations, Project Scheduling and Tracking,

Risk Assessment and Mitigation, Software Quality Assurance (SQA). Project Plan, Project

Lab work should include a running case study problem for which different deliverables at the end of each phase of a software development life cycle are to be developed. This will include

modeling the requirements, architecture and detailed design. Subsequently the design models products. For coding and


Suggested Reading:

1. Pankaj Jalote ,”An Integrated Approach to Software Engineering”, Narosa Pub, 2005

2. Rajib Mall, “Fundamentals of Software Engineering” Second

3. R S. Pressman ,”Software Engineering: A Practitioner's Approach”, Sixth edition 2006, McGraw-Hill.

4. Sommerville,”Software Enginerring”,Pearson Education.

5. Richard H.Thayer,”Software Enginerring & Project Managements”,Willey India

6. Waman S.Jawadekar,”Software Enginerring”, TMH

7. Schwalbe,”IT Project Managements”,Cengage Learning.


Pankaj Jalote ,”An Integrated Approach to Software Engineering”, Narosa Pub, 2005

Rajib Mall, “Fundamentals of Software Engineering” Second Edition, PHI Learning

R S. Pressman ,”Software Engineering: A Practitioner's Approach”, Sixth edition 2006,

Sommerville,”Software Enginerring”,Pearson Education.

Richard H.Thayer,”Software Enginerring & Project Managements”,Willey India

S.Jawadekar,”Software Enginerring”, TMH

Schwalbe,”IT Project Managements”,Cengage Learning.

BHOPAL

Pankaj Jalote ,”An Integrated Approach to Software Engineering”, Narosa Pub, 2005

Edition, PHI Learning

R S. Pressman ,”Software Engineering: A Practitioner's Approach”, Sixth edition 2006,

Richard H.Thayer,”Software Enginerring & Project Managements”,Willey India


CS-604

Unit –I

Computer Network: Definitions, goals, components, Architecture, Classifications & Types. Layered Architecture: Protocol

Oriented & Connectionless Services, Service primitives, Design issues & its functionality. ISO

OSI Reference Model: Principle, Model, Descriptions of various layers and its comparison with

TCP/IP. Network standardization.

Unit-II

Data Link Layer: Need, Services Provided, Framing , Flow Control, Error control. Data Link

Layer Protocol: Elementary & Sliding Window protocol: 1

Hybrid ARQ. Bit oriented protocols: SD

verification: Finite State Machine Models & Petri net models.

Unit-III

MAC Sublayer: MAC Addressing, Binary Exponential Back

Random Access Schemes/Contention Schemes: for Data Servic

ALOHA), for Local-Area Networks (CSMA, CSMA/CD, CSMA/CA), Collision Free Protocols:

Basic Bit Map, BRAP, Binary

Tree Walk, URN Protocol, High Speed LAN: Fast Ethernet, Gigabit

Performance Measuring Metrics. IEEE Standards 802 series & their variant.

Unit-IV

Network Layer: Need, Services Provided , Design issues, Routing algorithms: Least Cost

Routing algorithm, Dijkstra's algorithm, Bellman

Broadcast Routing, Multicast Routing, Congestion Control Algorithms: General Principles of

Congestion control, Prevention Policies, Congestion Control in Virtual

Congestion Control in Datagram subnets. IP protocol, IP Addre

& IPv6, Mobile IP.

Unit-V

Transport Layer: Design Issues, UDP: Header Format, Per

Unicast/Multicast Real-Time Traffic, TCP: Connection Management, Reliability of Data

Transfers, TCP Flow Control, T

Management.Session layer: Authentication, Authorisation, Session layer protocol (PAP, SCP,

H.245). Presentation layer: Data conversion, Character code translation, Compresion, Encryption

and Decryption, Presentation layer protocol (LPP, Telnet, X.25 packet

Assembler/Disassembler).Application Layer: WWW and HTTP, FTP, SSH, Email (SMTP,

MIME, IMAP), DNS, Network Management (SNMP).

References:

1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pears

2. Dimitri Bertsekas, Robert Gallager, “Data Networks”, PHI Publication, Second Edition.

3. Kaveh Pahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.

4. Uyless Black, “Computer Networks”, PHI Publication, Second Edition.

5. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.


604 – COMPUTER NETWORKING

Computer Network: Definitions, goals, components, Architecture, Classifications & Types. Layered Architecture: Protocol hierarchy, Design Issues , Interfaces and Services, Connection

Oriented & Connectionless Services, Service primitives, Design issues & its functionality. ISO


IP. Network standardization.


Protocol: Elementary & Sliding Window protocol: 1-bit, Go-Back-N, Selective Repeat,

Hybrid ARQ. Bit oriented protocols: SDLC, HDLC, BISYNC, LAP and LAPB. Protocol

verification: Finite State Machine Models & Petri net models.

MAC Sublayer: MAC Addressing, Binary Exponential Back-off (BEB) Algorithm, Distributed

Access Schemes/Contention Schemes: for Data Services (ALOHA and Slotted

Networks (CSMA, CSMA/CD, CSMA/CA), Collision Free Protocols:

Count Down, MLMA Limited Contention Protocols: Adaptive

Tree Walk, URN Protocol, High Speed LAN: Fast Ethernet, Gigabit Ethernet, FDDI,

Performance Measuring Metrics. IEEE Standards 802 series & their variant.


Routing algorithm, Dijkstra's algorithm, Bellman-ford algorithm, Hierar


Congestion control, Prevention Policies, Congestion Control in Virtual-Circuit Subnets,

Congestion Control in Datagram subnets. IP protocol, IP Addresses, Comparative study of IPv4

Transport Layer: Design Issues, UDP: Header Format, Per-Segment Checksum, Carrying

Time Traffic, TCP: Connection Management, Reliability of Data

Transfers, TCP Flow Control, TCP Congestion Control, TCP Header Format, TCP Timer



resentation layer protocol (LPP, Telnet, X.25 packet


MIME, IMAP), DNS, Network Management (SNMP).

Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.

Dimitri Bertsekas, Robert Gallager, “Data Networks”, PHI Publication, Second Edition.

Kaveh Pahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.

Uyless Black, “Computer Networks”, PHI Publication, Second Edition.

Hung Hwang, Fred Baker, “Computer Networks: An Open Source

BHOPAL

Computer Network: Definitions, goals, components, Architecture, Classifications & Types. hierarchy, Design Issues , Interfaces and Services, Connection

Oriented & Connectionless Services, Service primitives, Design issues & its functionality. ISO-



N, Selective Repeat,

LC, HDLC, BISYNC, LAP and LAPB. Protocol

off (BEB) Algorithm, Distributed

es (ALOHA and Slotted-

Networks (CSMA, CSMA/CD, CSMA/CA), Collision Free Protocols:

Count Down, MLMA Limited Contention Protocols: Adaptive

Ethernet, FDDI,


ford algorithm, Hierarchical Routing,


Circuit Subnets,

sses, Comparative study of IPv4

Segment Checksum, Carrying

Time Traffic, TCP: Connection Management, Reliability of Data

CP Congestion Control, TCP Header Format, TCP Timer



resentation layer protocol (LPP, Telnet, X.25 packet


on Education.

Dimitri Bertsekas, Robert Gallager, “Data Networks”, PHI Publication, Second Edition.

Kaveh Pahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.

Hung Hwang, Fred Baker, “Computer Networks: An Open Source



1. Study of Different Type of LAN& Network Equipments.

2. Study and Verification of standard Network topologies i.e. S

3. LAN installations and Configurations.

4. Write a program to implement various types of error correcting techniques.

5. Write a program to Implement various types of framing methods.

6. Study of Tool Command Language (TCL).

7. Study and Installation of Standard Network Simulator: N.S

8. Study & Installation of ONE (Opportunistic Network Environment) Simulator for High Mobility Networks.

9. Configure 802.11 WLAN.

10. Implement & simulate various types of routing algorithm.

11. Study & Simulation of MAC Protocols like Aloha, CSMA, CSMA/CD and CSMA/CA using

Standard Network Simulators.

12. Study of Application layer protocols


Study of Different Type of LAN& Network Equipments.

Study and Verification of standard Network topologies i.e. Star, Bus, Ring etc.

LAN installations and Configurations.

Write a program to implement various types of error correcting techniques.

Write a program to Implement various types of framing methods.

Study of Tool Command Language (TCL).

of Standard Network Simulator: N.S-2, N.S-3.OpNet,QualNet etc .

Study & Installation of ONE (Opportunistic Network Environment) Simulator for High

Implement & simulate various types of routing algorithm.

Simulation of MAC Protocols like Aloha, CSMA, CSMA/CD and CSMA/CA using

Study of Application layer protocols- DNS, HTTP, HTTPS, FTP and TelNet.

BHOPAL

3.OpNet,QualNet etc .

Study & Installation of ONE (Opportunistic Network Environment) Simulator for High

Simulation of MAC Protocols like Aloha, CSMA, CSMA/CD and CSMA/CA using

DNS, HTTP, HTTPS, FTP and TelNet.


CS-605 – ADVANCE COMPUTER ARCHITECTURE (ACA)

Unit-I

Flynn’s Classification, System Attributes to Performance, Parallel computer models Multiprocessors and multicomputers, Multivector and SIMD Computers. Data and resource

dependences,Hardware and software parallelism,Program partitioning and scheduling, Grain size

and latency, Control flow, data flow and Demand driven mechanisms. Static interconnection

networks,Dynamic interconnection Networks: Bus Systems, Crossbar Switch, Multiport

Memory, Multistage and Combining Networks

Unit- II

Instruction set architecture, CISC Scalar Processors

architecture, Memory Hierarchy, Inclusion, Coherence and Locality, Memory capacity planning.

Interleaved memory organization

and Fault Tolerance. Backplane Bus System

timing protocols, Arbitration transaction and interrupt.

Unit-III

Linear pipeline processor, Nonlinear pipeline processor, Instruction pipeline design, Mechanisms

for instruction pipelining, pipeline hazards, DyTomosulo’s algorithm, Branch handling techniques, Arithmetic Pipeline Design, Static

arithmetic pipeline, Multifunctional arithmetic pipelines. Superscaler pipeline design, Super pipeline processor design.

Unit-IV

Cache coherence, Snoopy protocols, Directory based protocols. Message routing schemes in

multicomputer network, deadlock and virtual channel. Vector Processing Principles, Vector

instruction types, Vector-access memory schemes. Vector supercomputer

organization: distributed memory model and shared memory model. Principles of

Multithreading: Multithreading Issues and Solutions, Multiple

Unit-V

Parallel Programming Models, Shared

Model, Object-Oriented Model, Functional and Logic Models, Parallel Languages and Compilers, Language Features for Parallelism, Parallel Programming Environment, Software Tools and Environments.

Suggested Reading: 1. Kai Hwang, “Advanced computer architecture”, TMH. 2. J.P.Hayes, “computer Architecture and organization”; MGH.

3. V.Rajaranam & C.S.R.Murthy, “Parallel computer”; PHI Learning.

4. Kain,”Advance Computer Architecture:

5. M.J Flynn, “Computer Architecture, Pipelined and Parallel Processor Design”; Narosa

Publishing. 6. Hwang and Briggs, “Computer Architecture and Parallel Processing”; MGH.

7. David E. Callav & Jaswinder Pal Singh Marge Kaufmann”Advance Computer Architecture”,

EIS

India.

8. Sajjan G. Shiva, Taylar & Francis, “Advance Computer Architecture


ADVANCE COMPUTER ARCHITECTURE (ACA)

m Attributes to Performance, Parallel computer models Multiprocessors and multicomputers, Multivector and SIMD Computers. Data and resource


flow, data flow and Demand driven mechanisms. Static interconnection


Memory, Multistage and Combining Networks

Instruction set architecture, CISC Scalar Processors , RISC Scalar Processors, VLIW


Interleaved memory organization- memory interleaving, pipelined memory access, Bandwidth

and Fault Tolerance. Backplane Bus System :Backplane bus specification, Addressing and

timing protocols, Arbitration transaction and interrupt.


for instruction pipelining, pipeline hazards, Dynamic instruction scheduling - score boarding and Tomosulo’s algorithm, Branch handling techniques, Arithmetic Pipeline Design, Static

arithmetic pipeline, Multifunctional arithmetic pipelines. Superscaler pipeline design, Super



access memory schemes. Vector supercomputer architecture, SIMD


Multithreading: Multithreading Issues and Solutions, Multiple-Context Processors

Parallel Programming Models, Shared-Variable Model, Message-Passing Model, Data

Oriented Model, Functional and Logic Models, Parallel Languages and Compilers, Language Features for Parallelism, Parallel Programming Environment, Software

computer architecture”, TMH.

J.P.Hayes, “computer Architecture and organization”; MGH.

V.Rajaranam & C.S.R.Murthy, “Parallel computer”; PHI Learning.

Kain,”Advance Computer Architecture: - A System Design Approach”, PHI Learning

chitecture, Pipelined and Parallel Processor Design”; Narosa

Hwang and Briggs, “Computer Architecture and Parallel Processing”; MGH.

David E. Callav & Jaswinder Pal Singh Marge Kaufmann”Advance Computer Architecture”,

. Shiva, Taylar & Francis, “Advance Computer Architecture

BHOPAL

ADVANCE COMPUTER ARCHITECTURE (ACA)

m Attributes to Performance, Parallel computer models - Multiprocessors and multicomputers, Multivector and SIMD Computers. Data and resource


flow, data flow and Demand driven mechanisms. Static interconnection


, RISC Scalar Processors, VLIW


memory interleaving, pipelined memory access, Bandwidth

:Backplane bus specification, Addressing and


score boarding and Tomosulo’s algorithm, Branch handling techniques, Arithmetic Pipeline Design, Static

arithmetic pipeline, Multifunctional arithmetic pipelines. Superscaler pipeline design, Super



architecture, SIMD


Context Processors

del, Data-Parallel

Oriented Model, Functional and Logic Models, Parallel Languages and Compilers, Language Features for Parallelism, Parallel Programming Environment, Software

A System Design Approach”, PHI Learning

chitecture, Pipelined and Parallel Processor Design”; Narosa

David E. Callav & Jaswinder Pal Singh Marge Kaufmann”Advance Computer Architecture”,


CS 606 ENGINEERING PROJECT(MINOR)

Project Work

Objectives: To expose students with project

experience, use of state-of-art technologies. Exposure to techniques and participation in research activities.

The project group will submit the project including title of the project, Technical Key Words and

supporting the project idea, Plan of project execution. A Report consistingliterature survey, platform choice, SRS (System Requirement Specification) Document in

specific format and high-level design document along with.


CS 606 ENGINEERING PROJECT(MINOR)

To expose students with project -product development cycle using industrial

art technologies. Exposure to Learning and knowledge access techniques and participation in research activities.


supporting the project idea, Plan of project execution. A Report consisting of problem definition, literature survey, platform choice, SRS (System Requirement Specification) Document in

level design document along with.

BHOPAL

product development cycle using industrial

Learning and knowledge access


of problem definition, literature survey, platform choice, SRS (System Requirement Specification) Document in


I) Introduction to Matlab

1. Matlab as {best} calculator

2. Standard Matlab windows

3. Operations with variables

a) Naming b) Checking existence c) Clearing d) Operations

4. Arrays

a) Columns and rows: creation and indexing b) Size & length c) Multiplication, division, power d)

Operations

5. Writing script files

a) Logical variables and operators b) Flow control c) Loop operators

6. Writing functions

a) Input/output arguments b) Function visibility, path. c) Example: Matlab startup

7. Simple graphics

a) 2D plots b) Figures and subplots

II) Data and data flow in Matlab.

1. Data types

a) Matrix, string, cell and structure b) Creating, accessing elements and manipulating of data of

different types

2. File Input-Output

a) Matlab files b) Text files c) Binary files d) Mixed text

3. Communication with external devices

a) Serial port b) Parallel port c) Sound ca

III) Function minimization and parameters search.

a) 1D and 2D fits b) Data windowing c) Error bounds

2. Arbitrary function fit

a) Error function b) Fixing parameters

3. Goodness of fit

a) 2 criteria b) Error in parameters

IV) Handle graphics and user interface.

1. Pre-defined dialogs

2. Handle graphics

a) Graphics objects b) Properties of objects c) Modifying properties of graphics objects

3. Menu-driven programs

a) Controls: uimenu and uicontrol b) Interactive graphics c) Large program logic


CS 607 MATLAB

Naming b) Checking existence c) Clearing d) Operations

Columns and rows: creation and indexing b) Size & length c) Multiplication, division, power d)

b) Flow control c) Loop operators

Input/output arguments b) Function visibility, path. c) Example: Matlab startup

Data and data flow in Matlab.

structure b) Creating, accessing elements and manipulating of data of

Matlab files b) Text files c) Binary files d) Mixed text-binary files

3. Communication with external devices

Serial port b) Parallel port c) Sound card d) Video input

Function minimization and parameters search. 1. Polynomial fit

a) 1D and 2D fits b) Data windowing c) Error bounds

Error function b) Fixing parameters

le graphics and user interface.

Graphics objects b) Properties of objects c) Modifying properties of graphics objects

Controls: uimenu and uicontrol b) Interactive graphics c) Large program logic flow

BHOPAL

Columns and rows: creation and indexing b) Size & length c) Multiplication, division, power d)

structure b) Creating, accessing elements and manipulating of data of

Graphics objects b) Properties of objects c) Modifying properties of graphics objects

flow


CS 608 ETHICS AND VALUES

UNIT - I: Introduction

• Nature & scope of human values & Ethics

• Moral Character building

A) Eastern perspective

B) Western perspective

• Uses of the study in social &

UNIT - II: Ethical concepts

• Virtue & Vice

• Right & Wrong

• Justice & Fairness

UNIT - III: Indian Value system

• Dharma (Righteous way of living) its meaning & classification

• Yama : its Five ethical disciplines : i) Satya (Truth) ii

iii) Astheya (Non stealing) iv) Aparigraha (Non

(celibacy)

• Niyama its five rules of self discipline

santosha (happiness) iii) Tapas (Controlling se

scriptures with self introspection) v) iswarapranidana (surrender worship of God)

UNIT - IV: Great personalities

• Socrates - Sacrificing one's life for the sake of truth

• Buddha : Astanaga marga for rightful way of lif

• Mother Theresa - Service to Humanity

UNIT - V: Practical Ethics

• Social Ethics : The justification of civil disobedience in a democratic state.

• Business Ethics : The Moral & Social responsibility of Business organizations

• Medical Ethics Code of pharm

Reference Books:

• McKenzie - (1975) A Manual of ethics new delhi, oxford.

• William Lillie (2007) An introduction to ethics, Delhi, Surjeet.

• Y.V. Satyanarayana, (2013), "medical ethics principle &

publications.

• Jadunath Sinha, (1990) A manual of ethics Calcutta new central book agency.

• Subramanian R. (2013) Professional ethics, New Delhi: Oxford.


CS 608 ETHICS AND VALUES

Nature & scope of human values & Ethics

Moral Character building

: M.K. Gandhi & Vivekananda

Western perspective : Aristotle and Immanuel kant

Uses of the study in social & professional life

Indian Value system

Dharma (Righteous way of living) its meaning & classification

Yama : its Five ethical disciplines : i) Satya (Truth) ii) Ahimsa (Non - Violence)

iii) Astheya (Non stealing) iv) Aparigraha (Non- possession) v) Brahmacharya

Niyama its five rules of self discipline - i) soucha (Physical & mental cleanliness) ii)

santosha (happiness) iii) Tapas (Controlling senses & mind) iv) Swadhya (studying


IV: Great personalities

Sacrificing one's life for the sake of truth

Buddha : Astanaga marga for rightful way of life

Service to Humanity

Social Ethics : The justification of civil disobedience in a democratic state.

Business Ethics : The Moral & Social responsibility of Business organizations

Medical Ethics Code of pharmaceutical ethics, and physician - patient relationship

(1975) A Manual of ethics new delhi, oxford.

William Lillie (2007) An introduction to ethics, Delhi, Surjeet.

Y.V. Satyanarayana, (2013), "medical ethics principle & problem" Germany; lambert

Jadunath Sinha, (1990) A manual of ethics Calcutta new central book agency.

Subramanian R. (2013) Professional ethics, New Delhi: Oxford.

BHOPAL

Violence)

possession) v) Brahmacharya

i) soucha (Physical & mental cleanliness) ii)

nses & mind) iv) Swadhya (studying


Social Ethics : The justification of civil disobedience in a democratic state.

Business Ethics : The Moral & Social responsibility of Business organizations

patient relationship

problem" Germany; lambert

Jadunath Sinha, (1990) A manual of ethics Calcutta new central book agency.


CS-

Unit-I

Introduction: Historical development computing as per NIST , Cloud computing reference model ,Cloud computing environments,

Cloud services requirements, Cloud and dynamic infrastructure, Cloud Adoption and rudiments.Overview of cloud applicprediction, Gene Expression Data Analysis ,Satellite Image Processing ,CRM and ERP ,Social networking .

Unit-II

Cloud Computing Architecture: Interoperability & Standards, Scalability and Fault Tolerance,

Cloud Solutions: Cloud Ecosystem, Cloud Business Process Management, Cloud Service

Management.

Cloud Offerings: Cloud Analytics, Testing Under Control, Virtual Desktop Infrastructure.

Unit –III

Cloud Management & Virtualization Technology:

management,Conceps of Map reduce , Cloud Governance, High Availability and Disaster

Recovery. Virtualization: Fundamental concepts of compute ,storage, networking, desktop and

application virtualization .Virtualization benefits, server virtualization, Block and file level

storage virtualization Hypervisor management software, Infrastructure Requirements , Virtual

LAN(VLAN) and Virtual SAN(VSAN) and their benefits .

Unit-IV

Cloud Security: Cloud Information security fundamentals, Cloud security services, Design

principles, Secure Cloud Software Requirements, Policy Implementation, Cloud Computing

Security Challenges, Virtualization security Management, Cloud Computing Secutity Architecture.

Unit-V

Market Based Management of Clouds, Federated Clouds/Inter Cloud: Characterization & Definition ,Cloud Federation Stack , Third Party Cloud Services .

Case study: Google App Engine, Microsoft Azure, Hadoop , Amazon , Aneka


1. Installation and configuration of Hadoop/Euceliptus etc. 2. Service deployment & Usage over cloud.

3. Management of cloud resources.

4. Using existing cloud characteristics & Service models.

5. Cloud Security Management.

6. Performance evaluation of services over


-7011 CLOUD COMPUTING

: Historical development ,Vision of Cloud Computing, Characteristics of cloud as per NIST , Cloud computing reference model ,Cloud computing environments,

Cloud services requirements, Cloud and dynamic infrastructure, Cloud Adoption and rudiments.Overview of cloud applications: ECG Analysis in the cloud, Protein structure prediction, Gene Expression Data Analysis ,Satellite Image Processing ,CRM and ERP ,Social

Cloud Computing Architecture: Cloud Reference Model, Types of Clouds, Cloud Standards, Scalability and Fault Tolerance,

Cloud Ecosystem, Cloud Business Process Management, Cloud Service

: Cloud Analytics, Testing Under Control, Virtual Desktop Infrastructure.

Cloud Management & Virtualization Technology: Resiliency, Provisioning, Asset



plication virtualization .Virtualization benefits, server virtualization, Block and file level


LAN(VLAN) and Virtual SAN(VSAN) and their benefits .

Cloud Information security fundamentals, Cloud security services, Design

Secure Cloud Software Requirements, Policy Implementation, Cloud Computing

Security Challenges, Virtualization security Management, Cloud Computing Secutity

Market Based Management of Clouds, Federated Clouds/Inter Cloud: Characterization & Definition ,Cloud Federation Stack , Third Party Cloud Services .

Case study: Google App Engine, Microsoft Azure, Hadoop , Amazon , Aneka

Installation and configuration of Hadoop/Euceliptus etc.

Service deployment & Usage over cloud.

Using existing cloud characteristics & Service models.

Performance evaluation of services over cloud.

BHOPAL

,Vision of Cloud Computing, Characteristics of cloud as per NIST , Cloud computing reference model ,Cloud computing environments,

Cloud services requirements, Cloud and dynamic infrastructure, Cloud Adoption and ations: ECG Analysis in the cloud, Protein structure

prediction, Gene Expression Data Analysis ,Satellite Image Processing ,CRM and ERP ,Social

Cloud Reference Model, Types of Clouds, Cloud

Cloud Ecosystem, Cloud Business Process Management, Cloud Service

: Cloud Analytics, Testing Under Control, Virtual Desktop Infrastructure.

Resiliency, Provisioning, Asset



plication virtualization .Virtualization benefits, server virtualization, Block and file level


Cloud Information security fundamentals, Cloud security services, Design

Secure Cloud Software Requirements, Policy Implementation, Cloud Computing

Security Challenges, Virtualization security Management, Cloud Computing Secutity

Market Based Management of Clouds, Federated Clouds/Inter Cloud: Characterization &


Recommended Text:

1. Buyya, Selvi ,” Mastering Cloud Computing “,TMH Pub

2. Kumar Saurabh, “Cloud Computing” , Wiley Pub

3. Krutz , Vines, “Cloud Security “ , Wiley Pub

4. Velte, “Cloud Computing- A Practical Approach” ,TMH Pub

5. Sosinsky, “ Cloud Computing” ,


Buyya, Selvi ,” Mastering Cloud Computing “,TMH Pub

Kumar Saurabh, “Cloud Computing” , Wiley Pub

Krutz , Vines, “Cloud Security “ , Wiley Pub

A Practical Approach” ,TMH Pub

Sosinsky, “ Cloud Computing” , Wiley Pub

BHOPAL


CS-7012 –

Unit 1

Introduction of Wireless Networks, Different Generations of Wireless Networks. Characteristics

of the Wireless Medium: Radio Propagation Mechanisms, Path Loss Modelling and Signal

Coverage, Effect of Multipath and Doppler, Channel Measurement and Modelling Techniques.

Unit 2

Network Planning: Introduction, Wireless Network Topologies, Cellular Topology, Cell

Fundamentals, Signal to Interferences Radio Calculations, Network Planning for CDMA

Systems. Wireless Network Operations: Mobility Management, Radio Resources and Power

Management Unit

Unit3

Multiple Division Techniques: FDMA, TDMA, CDMA, OFDM, SDMA. Comparison of

Multiple Division Techniques, Modulation Techniques

16QAM Mobile Data Networks:Introduction, Data Oriented CDPD Network, GPRS, EDGE and

High Data Rates, SMS in GSM, Mobile Application Protocols.

Unit 4

Introduction to Wireless LAN, Evolution of WLAN, Wireless Home Networking, Technologies

for Home Area Network (HAN), Overview of IEEE 802.11, Reference Architecture, PHY and

MAC Layer, Wireless ATM, HIPERLAN.

UNIT 5

IEEE 802.15 WPAN, HomeRF, Bluetooth, Interference between Bluetooth and 802.11, Adhoc

Networks, Introduction to 2.5 G and 3 G Networks.

References

1. Kaveh Pahlavan, Prashant Krishnamurthy “principles of Wireless Networks”, PHI.

2. Qing- An Zeng, Dharma Prakash Agrawal “Introduction to Wireless and Mobile Systems”

CENGAGE Learning.

3. Sumit Kasera, Nishit Narang, A P Priyanka “2.5 G Mobile Networks: GPRS and EDGE

4. Dr. KAMILO FEHER “Wireless Digital Communications” , PHI

5. Jochen Schiller “ Mobile Communications”, PEARSON


– WIRELESS SENSOR NETWORK



tipath and Doppler, Channel Measurement and Modelling Techniques.



ess Network Operations: Mobility Management, Radio Resources and Power


Multiple Division Techniques, Modulation Techniques – AM, FM, FSK, PSK, QPSK, QAM,

Mobile Data Networks:Introduction, Data Oriented CDPD Network, GPRS, EDGE and

High Data Rates, SMS in GSM, Mobile Application Protocols.


AN), Overview of IEEE 802.11, Reference Architecture, PHY and

MAC Layer, Wireless ATM, HIPERLAN.


Networks, Introduction to 2.5 G and 3 G Networks.

Pahlavan, Prashant Krishnamurthy “principles of Wireless Networks”, PHI.

An Zeng, Dharma Prakash Agrawal “Introduction to Wireless and Mobile Systems”

Sumit Kasera, Nishit Narang, A P Priyanka “2.5 G Mobile Networks: GPRS and EDGE

Dr. KAMILO FEHER “Wireless Digital Communications” , PHI

Jochen Schiller “ Mobile Communications”, PEARSON

BHOPAL



tipath and Doppler, Channel Measurement and Modelling Techniques.



ess Network Operations: Mobility Management, Radio Resources and Power


AM, FM, FSK, PSK, QPSK, QAM,

Mobile Data Networks:Introduction, Data Oriented CDPD Network, GPRS, EDGE and


AN), Overview of IEEE 802.11, Reference Architecture, PHY and


Pahlavan, Prashant Krishnamurthy “principles of Wireless Networks”, PHI.

An Zeng, Dharma Prakash Agrawal “Introduction to Wireless and Mobile Systems”

Sumit Kasera, Nishit Narang, A P Priyanka “2.5 G Mobile Networks: GPRS and EDGE”, TMH


CS-7013 – INFORMATION STORAGE & MANAGEMENT

Unit-I

Introduction to Storage Technology: Data proliferation, evolution of various storage technologies, Overview of storage infrastructure components, Information Lifecycle Management, Data categorization.

Unit-II

Storage Systems Architecture: Intelligent disk subsystems overview, Contrast of integrated vs.

modular arrays, Component architectur

components, properties, performance, and specifications, RAID levels & parity algorithms, hot sparing, Front end to host storage provisioning, mapping and operation.

Unit-III

Introduction to Networked Storage: JBOD, DAS, NAS, SAN & CAS evolution and comparision. Applications, Elements, connectivity, standards, management, security and limitations of DAS,

NAS, CAS & SAN.

Unit –IV

Hybrid Storage solutions; Virtualization: Memory, network, server, stora

center concepts & requirements, Backup & Disaster Recovery: Principles Managing &

Monitoring: Industry management standards (SNMP, SMI

applications, Key management metrics (Thresholds, availability, capacit

performance).

Unit-V

Information storage on cloud :Concept of Cloud, Cloud Computing, storage on Cloud, Cloud

Vocabulary, Architectural Framework, Cloud benefits, Cloud computing Evolution, Applications & services on cloud, Cloud service provi

computing, Cloud Security and integration.

References:

1. G. Somasundaram & Alok Shrivastava (EMC Education Services) editors; Information Storage and Management: Storing, Managing, and Protecting Digital I

2. Ulf Troppens, Wolfgang Mueller

Storage Network explained : Basic and application of fiber channels, SAN, NAS, iSESI, INFINIBAND and FCOE, Wiley India.

3. John W. Rittinghouse and Management and Security, CRC Press, Taylor Frances Pub.

4. Nick Antonopoulos, Lee Gillam; Cloud Computing : Principles, System & Application, Springer.

5. Anthony T. Velete, Toby J.Velk, and Robert EltenpetApproach, TMH Pub.

6. Saurabh , Cloud Computing : Insight into New Era I


INFORMATION STORAGE & MANAGEMENT

Introduction to Storage Technology: Data proliferation, evolution of various storage technologies, Overview of storage infrastructure components, Information Lifecycle Management, Data categorization.


modular arrays, Component architecture of intelligent disk subsystems, Disk physical structure

components, properties, performance, and specifications, RAID levels & parity algorithms, hot sparing, Front end to host storage provisioning, mapping and operation.

ed Storage: JBOD, DAS, NAS, SAN & CAS evolution and comparision. Applications, Elements, connectivity, standards, management, security and limitations of DAS,

Hybrid Storage solutions; Virtualization: Memory, network, server, storage & appliances.


Monitoring: Industry management standards (SNMP, SMI-S, CIM), standard framework

applications, Key management metrics (Thresholds, availability, capacit


Vocabulary, Architectural Framework, Cloud benefits, Cloud computing Evolution, Applications & services on cloud, Cloud service providers and Models, Essential characteristics of cloud

computing, Cloud Security and integration.

G. Somasundaram & Alok Shrivastava (EMC Education Services) editors; Information Storage and Management: Storing, Managing, and Protecting Digital Information; Wiley India.

Ulf Troppens, Wolfgang Mueller-Friedt, Rainer Erkens, Rainer Wolafka, Nils Haustein;

Storage Network explained : Basic and application of fiber channels, SAN, NAS, iSESI, INFINIBAND and FCOE, Wiley India.

James F. Ransome; Cloud Computing : Implementation , Management and Security, CRC Press, Taylor Frances Pub.

Nick Antonopoulos, Lee Gillam; Cloud Computing : Principles, System & Application,

Anthony T. Velete, Toby J.Velk, and Robert Eltenpeter, Cloud Computing : A practical

Saurabh , Cloud Computing : Insight into New Era I

BHOPAL

INFORMATION STORAGE & MANAGEMENT

Introduction to Storage Technology: Data proliferation, evolution of various storage technologies, Overview of storage infrastructure components, Information Lifecycle


e of intelligent disk subsystems, Disk physical structure

components, properties, performance, and specifications, RAID levels & parity algorithms, hot

ed Storage: JBOD, DAS, NAS, SAN & CAS evolution and comparision. Applications, Elements, connectivity, standards, management, security and limitations of DAS,

ge & appliances. Data


S, CIM), standard framework

applications, Key management metrics (Thresholds, availability, capacity, security,


Vocabulary, Architectural Framework, Cloud benefits, Cloud computing Evolution, Applications ders and Models, Essential characteristics of cloud

G. Somasundaram & Alok Shrivastava (EMC Education Services) editors; Information nformation; Wiley India.

Friedt, Rainer Erkens, Rainer Wolafka, Nils Haustein;

Storage Network explained : Basic and application of fiber channels, SAN, NAS, iSESI,

James F. Ransome; Cloud Computing : Implementation ,

Nick Antonopoulos, Lee Gillam; Cloud Computing : Principles, System & Application,

er, Cloud Computing : A practical


CS 702 NETWORK & WEB SECURITY

UNIT I

Introduction to Network Security, Computer Securit y and Cyber Security. Security

Terminologies and Principle, Security Threats, Types of attacks (Operating System, application

level, Shrink Wrap code, Misconfiguration attacks etc.). Introduction to Intrusion,

Terminologies, Intrusion Detection System (IDS), Types of Intrusion Detection Systems, System

Integrity Verifiers (SIVS).Indication of Intrusion: System Indications, File System Indications

Network Indications. Intrusion Detection Tools ,Post attack IDS Measures & Evading IDS

Systems. Penetration Testing, Categories of security assessments, Vulnerability Asses

Types of Penetration Testing. Risk Management.

UNIT II

Cryptography, Classical Cryptographic Techniques, Encryption, Decryption, Code Breaking:

Methodologies, Cryptanalysis, Cryptography Attacks, Brute

Public key cryptography, Principles of Public key Cryptosystems, Cryptographic Algorithms RSA, Data Encryption Standard (DES), RC4, RC5, RC6, Blowfish, Key Management, Diffie

Hellman key exchange, elliptic curve cryptography.

UNIT III

Hash Functions, One-way Hash Func

Requirements, Authentication Functions, Kerberos. Message Authentication codes ,Message

Digest Functions, MD5, SSL (Secure Sockets Layer), SSH (Secure Shell), Algorithms and

Security, Disk Encryption, Gove

Components, Method, Applications, Standard, Algorithm: Signature Generation/Verification,

ECDSA, EIgamal Signature Scheme, Digital Certificates.

UNIT IV

Trojans and Backdoors: Overt and Covert

Data-Sending Trojans, Destructive Trojans, Trojans, Proxy Trojans, FTP Trojans, Security Software Disablers).

Viruses and Worms: Characteristics, Working, Infection Phase, Attack Phase. Sniffers:Definition, spoofing, Sniffing, Vulnerable Protocols, Types.

Phishing: Methods, Process, Attacks Types (ManAttacks, Hidden Attacks, ClientPhishing, DNSBased Phishing, Con

Web Application Security- Secured authentication mechanism, secured session

Cross-site Scripting, SQL Injection and other vulnerabilities

Denial-of Service Attacks: Types of Attacks (Smurf Death Attack, Teardrop Attack, SYN Attack, SYN Flooding), DDoS Attack(Distributed DoS

Attack.), Session Hijacking, Spoofing v Hijacking, TCP/IP hijacking, CAPTCHA Protection

UNIT V

IP Security, Web Security, Firewall

Computer Forensics, Need, Objectives,Stages & Steps of Forensic Investigation in Tracking Cyber Criminals, Incident Handling. Hacking, Classes of Hacker (Black hats, grey hats, white

hats, suicide hackers), Footprinting, Scanning (TypesSpiders, Overview of System Hacking Cycle.


CS 702 NETWORK & WEB SECURITY


Security Threats, Types of attacks (Operating System, application



rifiers (SIVS).Indication of Intrusion: System Indications, File System Indications


Systems. Penetration Testing, Categories of security assessments, Vulnerability Asses

Types of Penetration Testing. Risk Management.


Methodologies, Cryptanalysis, Cryptography Attacks, Brute-Force Attack, Use of Cryptography.

ryptography, Principles of Public key Cryptosystems, Cryptographic Algorithms RSA, Data Encryption Standard (DES), RC4, RC5, RC6, Blowfish, Key Management, Diffie

Hellman key exchange, elliptic curve cryptography.

way Hash Functions, SHA (Secure Hash Algorithm), Authentication



Security, Disk Encryption, Government Access to Keys (GAK) Digital Signature:


ECDSA, EIgamal Signature Scheme, Digital Certificates.

: Overt and Covert Channels, Working, Types (Remote Access Trojans,

Sending Trojans, Destructive Trojans, Trojans, Proxy Trojans, FTP Trojans, Security

Characteristics, Working, Infection Phase, Attack Phase. Sniffers:spoofing, Sniffing, Vulnerable Protocols, Types.

Methods, Process, Attacks Types (Man-in-the-Middle Attacks, URL Obfuscation Hidden Attacks, Client-side Vulnerabilities, Deceptive Phishing, Malware

Phishing, DNSBased Phishing, Content-Injection Phishing, Search Engine Phishing).

Secured authentication mechanism, secured session

site Scripting, SQL Injection and other vulnerabilities

Types of Attacks (Smurf Attack, Buffer Overflow Attack, PingDeath Attack, Teardrop Attack, SYN Attack, SYN Flooding), DDoS Attack(Distributed DoS


IP Security, Web Security, Firewalls: Types, Operation, Design Principles, Trusted Systems.


ckers), Footprinting, Scanning (Types-Port, Network, Vulnerability), ESpiders, Overview of System Hacking Cycle.

BHOPAL


Security Threats, Types of attacks (Operating System, application



rifiers (SIVS).Indication of Intrusion: System Indications, File System Indications


Systems. Penetration Testing, Categories of security assessments, Vulnerability Assessment,


Force Attack, Use of Cryptography.

ryptography, Principles of Public key Cryptosystems, Cryptographic Algorithms RSA, Data Encryption Standard (DES), RC4, RC5, RC6, Blowfish, Key Management, Diffie-

tions, SHA (Secure Hash Algorithm), Authentication



Digital Signature: Analysis,


Channels, Working, Types (Remote Access Trojans,

Sending Trojans, Destructive Trojans, Trojans, Proxy Trojans, FTP Trojans, Security

Characteristics, Working, Infection Phase, Attack Phase. Sniffers:

Middle Attacks, URL Obfuscation side Vulnerabilities, Deceptive Phishing, Malware-Based

Injection Phishing, Search Engine Phishing).

Secured authentication mechanism, secured session management,

Attack, Buffer Overflow Attack, Ping of Death Attack, Teardrop Attack, SYN Attack, SYN Flooding), DDoS Attack(Distributed DoS


s: Types, Operation, Design Principles, Trusted Systems.


Port, Network, Vulnerability), E-Mail



1. Footprinting using footprinting tools(Open Source & Free)(ex

Google Earth etc..)

2. Scanning for vulnerabilities using (Angry IP, HPing2, IPScanner, Global Network

3. NetBIOS Enumeration Using NetView Tool, Nbtstat Enumeration Tool (Open Source).

4. Steganography using tools: Tool: Merge Streams, Image Hide, Stealth Files, Blindside,

STools, Steghide, Steganos, Pretty Good Envelop, Stegdetect,.

5. Steganalysis - Stego Watch- Stego Detection Tool, StegSpy.

6. How to Detect Trojans by using

7. Lan Scanner using look@LAN, wireshark.

8. Understanding DoS Attack Tools

Panther2, Crazy Pinger, Some Trouble, UDP Flood, FSMax.

Suggested Reading:

1. William Stallings, “Cryptography and Network Security: Principles and Practice”

Pearson

2. Charlie Kaufman, Radia Perlman, Mike Speciner, Michael Speciner, “ Network

Security -

Private communication in a public world” TMH

3. Fourozon, “Cryptography & Network Security” TMH

4. Joseph Migga Kizza, Computer Network Security, , Springer Int

5. Atul Kahate,”Cryptography and Network Security” Mc Graw Hill

6. Carl Endorf, Eugene Schultz, Jim Mellander

PREVENSION” TMH

7. Neal, Krawetz, Introduction to Network Security,Cengage Learning


Footprinting using footprinting tools(Open Source & Free)(ex-nslookup, ARIN, Whois,

Scanning for vulnerabilities using (Angry IP, HPing2, IPScanner, Global Network

NetBIOS Enumeration Using NetView Tool, Nbtstat Enumeration Tool (Open Source).

Steganography using tools: Tool: Merge Streams, Image Hide, Stealth Files, Blindside,

STools, Steghide, Steganos, Pretty Good Envelop, Stegdetect,.

Stego Detection Tool, StegSpy.

How to Detect Trojans by using – Netstat, fPort, TCPView, CurrPorts Tool, Process Viewer.

Lan Scanner using look@LAN, wireshark.

Understanding DoS Attack Tools- Jolt2 , Bubonic.c, Land and LaTierra, Targa, Nemesy Blast,

Panther2, Crazy Pinger, Some Trouble, UDP Flood, FSMax.

William Stallings, “Cryptography and Network Security: Principles and Practice”

Charlie Kaufman, Radia Perlman, Mike Speciner, Michael Speciner, “ Network

Private communication in a public world” TMH

Fourozon, “Cryptography & Network Security” TMH

Joseph Migga Kizza, Computer Network Security, , Springer International Edition

Atul Kahate,”Cryptography and Network Security” Mc Graw Hill

Carl Endorf, Eugene Schultz, Jim Mellander “INTRUSION DETECTION &

Neal, Krawetz, Introduction to Network Security,Cengage Learning.

BHOPAL

nslookup, ARIN, Whois,

Scanning for vulnerabilities using (Angry IP, HPing2, IPScanner, Global Network

NetBIOS Enumeration Using NetView Tool, Nbtstat Enumeration Tool (Open Source).

Steganography using tools: Tool: Merge Streams, Image Hide, Stealth Files, Blindside,

Netstat, fPort, TCPView, CurrPorts Tool, Process Viewer.

Jolt2 , Bubonic.c, Land and LaTierra, Targa, Nemesy Blast,

William Stallings, “Cryptography and Network Security: Principles and Practice”

Charlie Kaufman, Radia Perlman, Mike Speciner, Michael Speciner, “ Network

ernational Edition


CS-

UNIT-1

Web Engineering: Introduction, History, Evolution and Need, Time line, Motivation, Categories & Characteristics of Web Applications, Web Engineering Models, Software Engineering v/s Web Engineering. World Wide Web: Introduction to TCP/IP HTTP and FTP.Browser and search engines: Introduction, Search fundamentals, Search strategies, Directories search engines and Meta search engines, Working of the search engines.Web Servers: Introduction, Features, caching, case

UNIT- 2

Information Architecture: Role, Collaboration and Communication, Organizing Information,

Organizational Challenges, Organizing Web sites parameters and Intranets Website Design: Development, Development phases, Design issues, Co

Indexing the Right Stuff, Grouping Content. Architectural Page Mockups, Design Sketches,

Navigation Systems. Searching Systems, Good & bad web design, Process of Web Publishing. Web-site enhancement, submission of websit

Web security: issues, security audit. Web effort estimation, Productivity Measurement, Quality usability and reliability. Requirements Engineering for Web Applications: Introduction,

Fundamentals, Requirement Source, Type, ,Notations Engineering Activities, Adapting RE Methods to Web Application.

UNIT- 3

Technologies for Web Applications I:

documents, Elements, Linking, Anchor Attributes, Image Maps, Meta Informa

Preliminaries, Layouts, Backgrounds, Colors and Text, Fonts, Tables, Frames and layers, Audio

and Video Support with HTML Database integration, CSS, Positioning with Style sheets, Forms

Control, Form Elements.

Introduction to CGI, PERL, JAVA SCReading

UNIT-4

Technologies for Web Applications II:documents, DTD, Ways to use, XML for data files, Embedding XML into HTML documents, Converting XML to HTML for Display, Displaying XML using CSS and XSL, Rewriting HTML as XML, Relationship between HTML, SGML and XML, web personalization , Semantic web, Semantic Web Services, Ontology.

UNIT- 5

E- Commerce: Business Models, Infrastructure, Creating an EEnvironment and Opportunities. Modes & Approaches, Marketing & Advertising Concepts. Electronic Publishing issues, approaches, legalities and technologies,Digital Signatures and Firewalls, Cyber crime and laws, IT Act. ElecPayment Systems: RTGS, NEFT, Internet Banking, Credit/Debit Card. Security: Digital Certificates & Signatures, SSL, SET, 3D Secure Protocol. .


-703 – WEB TECHNOLOGY

Web Engineering: Introduction, History, Evolution and Need, Time line, Motivation, Categories & Characteristics of Web Applications, Web Engineering Models, Software Engineering v/s Web Engineering. World Wide Web: Introduction to TCP/IP and WAP, DNS, Email, TelNet, HTTP and FTP.Browser and search engines: Introduction, Search fundamentals, Search strategies, Directories search engines and Meta search engines, Working of the search engines.Web Servers: Introduction, Features, caching, case study-IIS, Apache.


Organizational Challenges, Organizing Web sites parameters and Intranets Website Design: Development, Development phases, Design issues, Conceptual Design, High


Navigation Systems. Searching Systems, Good & bad web design, Process of Web Publishing. site enhancement, submission of website to search engines.


Fundamentals, Requirement Source, Type, ,Notations Tools. Principles Requirements Engineering Activities, Adapting RE Methods to Web Application.

Technologies for Web Applications I: HTML and DHTML: Introduction, Structure of

documents, Elements, Linking, Anchor Attributes, Image Maps, Meta Informa



Introduction to CGI, PERL, JAVA SCRIPT, JSP, PHP, ASP & AJAX. Cookies: Creating and

Technologies for Web Applications II: XML: Introduction, HTML Vs XML, Validation of documents, DTD, Ways to use, XML for data files, Embedding XML into HTML documents,

for Display, Displaying XML using CSS and XSL, Rewriting HTML as XML, Relationship between HTML, SGML and XML, web personalization , Semantic web, Semantic Web Services, Ontology.

Commerce: Business Models, Infrastructure, Creating an E-commerceEnvironment and Opportunities. Modes & Approaches, Marketing & Advertising Concepts. Electronic Publishing issues, approaches, legalities and technologies, Secure Web document, Digital Signatures and Firewalls, Cyber crime and laws, IT Act. Electronic Cash, Electronic Payment Systems: RTGS, NEFT, Internet Banking, Credit/Debit Card. Security: Digital Certificates & Signatures, SSL, SET, 3D Secure Protocol. .

BHOPAL

Web Engineering: Introduction, History, Evolution and Need, Time line, Motivation, Categories & Characteristics of Web Applications, Web Engineering Models, Software Engineering v/s

and WAP, DNS, Email, TelNet, HTTP and FTP.Browser and search engines: Introduction, Search fundamentals, Search strategies, Directories search engines and Meta search engines, Working of the search


Organizational Challenges, Organizing Web sites parameters and Intranets Website Design: nceptual Design, High-Level Design,


Navigation Systems. Searching Systems, Good & bad web design, Process of Web Publishing.


Tools. Principles Requirements

HTML and DHTML: Introduction, Structure of

documents, Elements, Linking, Anchor Attributes, Image Maps, Meta Information, Image



RIPT, JSP, PHP, ASP & AJAX. Cookies: Creating and

XML: Introduction, HTML Vs XML, Validation of documents, DTD, Ways to use, XML for data files, Embedding XML into HTML documents,

for Display, Displaying XML using CSS and XSL, Rewriting HTML as XML, Relationship between HTML, SGML and XML, web personalization ,

commerce Web Site, Environment and Opportunities. Modes & Approaches, Marketing & Advertising Concepts.

Secure Web document, tronic Cash, Electronic

Payment Systems: RTGS, NEFT, Internet Banking, Credit/Debit Card. Security: Digital


Suggested Experiments:

1.HTML/ DHTML

2.PHP

3.XML

4.Java Script, CGI,

PERL 5.ASP

6.Configuration of Web Servers.

Recommended Books:

1. Roger S.Pressman, David Lowe, “Web Engineering”, Tata Mc Graw Hill Publication, 2007

2. Achyut S Godbole and Atul Kahate, “Web Technologies”, Tata McGraw Hill

3. Gopalan N P , Akilandeswari, “Web Technology: A D

4. Neil Gray, “Web server Programming” Wiley

5. Chris Bates, “Web Programming: Building Internet applications” Wiley

6. Moller, “An Introduction to XML and Web Technologies”, Pearson Education New Delhi, 2009

7. “Web Technologies: Black Book”, Kogent, Dreamtech

8. Internet & World Wide Web How to Program, Pearson education, 3rd edition, by: H.M. Deitel, P.J. Deitel, A.B.

9. C. Xavier, “Web Technology & Design ”, Tata McGraw Hill. 10 Ivan Bay Ross, “HTML,DHTML,Java script,Perl CGI” , BPB


6.Configuration of Web Servers.

Roger S.Pressman, David Lowe, “Web Engineering”, Tata Mc Graw Hill Publication, 2007

Achyut S Godbole and Atul Kahate, “Web Technologies”, Tata McGraw Hill

Gopalan N P , Akilandeswari, “Web Technology: A Developer s Perspective” , PHI

Neil Gray, “Web server Programming” Wiley

Chris Bates, “Web Programming: Building Internet applications” Wiley

Moller, “An Introduction to XML and Web Technologies”, Pearson Education New Delhi, 2009

ook”, Kogent, Dreamtech

Internet & World Wide Web How to Program, Pearson education, 3rd edition, by: H.M. Deitel,

C. Xavier, “Web Technology & Design ”, Tata McGraw Hill. 10 Ivan Bay Ross, “HTML,DHTML,Java script,Perl CGI” , BPB

BHOPAL

Roger S.Pressman, David Lowe, “Web Engineering”, Tata Mc Graw Hill Publication, 2007

eveloper s Perspective” , PHI

Moller, “An Introduction to XML and Web Technologies”, Pearson Education New Delhi, 2009

Internet & World Wide Web How to Program, Pearson education, 3rd edition, by: H.M. Deitel,

C. Xavier, “Web Technology & Design ”, Tata McGraw Hill. 10 Ivan Bay Ross,


CS-704 – DATA MINING AND WAREHOUSING

Unit-I

Introduction, to Data warehousing, needs for developing data Warehouse, Data warehouse systems and its Components, Design of Data Warehouse, Dimension and Measures, Data Marts:Dependent Data Marts, IndependentsModeling of Data Warehouses:Multidimensional Data Model & Aggregates.

Unit-II

OLAP, Characteristics of OLAP System, Motivation for using OLAP, Multidimens

and Data Cube, Data Cube Implementations, Data Cube Operations, Guidelines for OLAP Implementation, Difference between OLAP & OLTP, OLAP Servers:

HOLAP Queries.

UNIT-III

Introduction to Data Mining, Knowledge Discovery, Data MiningSystem categorization and its Issues. Data Processing :Transformation. Data Reduction, Data Mining Statistics. Guidelines for Successful Data Mining.

Unit-IV

Association Rule Mining:-IntroAlgorithms, Improving the efficiency of the Apriori Algorithm, Apriori

Pruning(DHP),Dynamic Itemset Counting (DIC), Mining Frequent Patterns without Candidate Generation(FP-Growth),Performance Evaluation of Algorithms,.

Unit-V

Classification:-Introduction, Decision Tree, The Tree Induction Algorithm, Split Algorithms Based on Information Theory, Split Algorithm Based on the Gini Index, Overfitting and Pruning, Decision Trees Rules, Naïve Bayes Method.

Cluster Analysis:- Introduction, Desired Features of Cluster Analysis, Types of Cluster Analysis Methods: - Partitional Methods, Hierarchical Methods, DensityLarge Databases. Quality and Validity of Clus

References:

1. Berson: Data Warehousing & Data Mining &OLAP , TMH

2. Jiawei Han and Micheline Kamber, Data Mining Concepts & Techniques, Elsevier Pub.

3. Arun.K.Pujari, Data Mining Techniques, University Press.

4. N.P Gopalan: Data Mining Technique & Trend, PHI

5. Hand, Mannila & Smith: Principle of Data Mining, PHI

6. Tan, Introduction to Data Mining, Pearson Pub.


DATA MINING AND WAREHOUSING

Introduction, to Data warehousing, needs for developing data Warehouse, Data warehouse systems and its Components, Design of Data Warehouse, Dimension and Measures, Data Marts:Dependent Data Marts, Independents Data Marts & Distributed Data Marts, Conceptual Modeling of Data Warehouses:-Star Schema, Snowflake Schema, Fact Constellations. Multidimensional Data Model & Aggregates.

OLAP, Characteristics of OLAP System, Motivation for using OLAP, Multidimens

and Data Cube, Data Cube Implementations, Data Cube Operations, Guidelines for OLAP Implementation, Difference between OLAP & OLTP, OLAP Servers:-ROLAP, MOLAP,

Introduction to Data Mining, Knowledge Discovery, Data Mining Functionalities, Data Mining System categorization and its Issues. Data Processing :- Data Cleaning, Data Integration and Transformation. Data Reduction, Data Mining Statistics. Guidelines for Successful Data Mining.

Introduction, Basic, The Task and a Naïve Algorithm, Apriori Algorithms, Improving the efficiency of the Apriori Algorithm, Apriori-Tid, Direct Hasing and

Pruning(DHP),Dynamic Itemset Counting (DIC), Mining Frequent Patterns without Candidate th),Performance Evaluation of Algorithms,.

Introduction, Decision Tree, The Tree Induction Algorithm, Split Algorithms Based on Information Theory, Split Algorithm Based on the Gini Index, Overfitting and Pruning,

s, Naïve Bayes Method.

Introduction, Desired Features of Cluster Analysis, Types of Cluster Analysis Partitional Methods, Hierarchical Methods, Density- Based Methods, Dealing with

Large Databases. Quality and Validity of Cluster Analysis Methods.

Berson: Data Warehousing & Data Mining &OLAP , TMH

Jiawei Han and Micheline Kamber, Data Mining Concepts & Techniques, Elsevier Pub.

Arun.K.Pujari, Data Mining Techniques, University Press.

Technique & Trend, PHI

Hand, Mannila & Smith: Principle of Data Mining, PHI

Tan, Introduction to Data Mining, Pearson Pub.

BHOPAL

Introduction, to Data warehousing, needs for developing data Warehouse, Data warehouse systems and its Components, Design of Data Warehouse, Dimension and Measures, Data Marts:-

Data Marts & Distributed Data Marts, Conceptual Star Schema, Snowflake Schema, Fact Constellations.

OLAP, Characteristics of OLAP System, Motivation for using OLAP, Multidimensional View

and Data Cube, Data Cube Implementations, Data Cube Operations, Guidelines for OLAP ROLAP, MOLAP,

Functionalities, Data Mining Data Cleaning, Data Integration and

Transformation. Data Reduction, Data Mining Statistics. Guidelines for Successful Data Mining.

duction, Basic, The Task and a Naïve Algorithm, Apriori Tid, Direct Hasing and

Pruning(DHP),Dynamic Itemset Counting (DIC), Mining Frequent Patterns without Candidate

Introduction, Decision Tree, The Tree Induction Algorithm, Split Algorithms Based on Information Theory, Split Algorithm Based on the Gini Index, Overfitting and Pruning,

Introduction, Desired Features of Cluster Analysis, Types of Cluster Analysis Based Methods, Dealing with

Jiawei Han and Micheline Kamber, Data Mining Concepts & Techniques, Elsevier Pub.



1. Evolution of data management technologies, introduction to data warehousing concepts.

2. Develop an application to implement defining subject area, design of fact dimension table, data

mart.

3. Develop an application to implement OLAP, roll up, drill down, slice and dice operation

4. Develop an application to construct a multidimensional data.

5. Develop an application to implement data generalization and summarization technique.

6. Develop an application to extract association rule of data mining.

7. Develop an application for classification of data.

8. Develop an application for one clustering technique

9. Develop an application for Naïve Bayes classifier.

10. Develop an application for decision tree.


Evolution of data management technologies, introduction to data warehousing concepts.

implement defining subject area, design of fact dimension table, data

Develop an application to implement OLAP, roll up, drill down, slice and dice operation

Develop an application to construct a multidimensional data.

implement data generalization and summarization technique.

Develop an application to extract association rule of data mining.

Develop an application for classification of data.

Develop an application for one clustering technique

r Naïve Bayes classifier.

Develop an application for decision tree.

BHOPAL

Evolution of data management technologies, introduction to data warehousing concepts.

implement defining subject area, design of fact dimension table, data

Develop an application to implement OLAP, roll up, drill down, slice and dice operation

implement data generalization and summarization technique.


CS

Unit – I

Soft Computing: Introduction of soft computing, soft computing vs. hard computing, various

types of soft computing techniques, applications of soft

Artificial Intelligence : Introduction, Various types of production systems, characteristics of

production systems, breadth first search, depth first search techniques, other Search Techniques

like hill Climbing, Best first Search, A* algorithm,

strategies. Knowledge representation issues, Prepositional and predicate logic, monotonic and

non monotonic reasoning, forward Reasoning, backward reasoning, Weak & Strong Slot & filler

structures, NLP.

Unit – II

Neural Network : Structure and Function of a single neuron: Biological neuron, artificial neuron,

definition of ANN, Taxonomy of neural net, Difference between ANN and human brain,

characteristics and applications of ANN, single layer network, Perceptro

Linear separability, Widrow & Hebb;s learning rule/Delta rule, ADALINE, MADALINE, AI v/s

ANN. Introduction of MLP, different activation functions, Error back propagation algorithm,

derivation of BBPA, momentum, limitation, characteris

Unit – III

Counter propagation network, architecture, functioning & characteristics of counter Propagation

network, Hopfield/ Recurrent network, configuration, stability constraints, associative memory,

and characteristics, limitations and applications. Hopfield v/s Boltzman machine. Adaptive

Resonance Theory: Architecture, classifications, Implementation and training. Associative

Memory.

Unit – IV

Fuzzy Logic: Fuzzy set theory, Fuzzy set versus crisp set, Crisp relation & fuzz

systems: crisp logic, fuzzy logic, introduction & features of membership functions, Fuzzy rule

base system : fuzzy propositions, formation, decomposition & aggregation of fuzzy rules, fuzzy

reasoning, fuzzy inference systems, fuzzy decis

Unit – V

Genetic algorithm : Fundamentals, basic concepts, working principle, encoding, fitness function,

reproduction, Genetic modeling: Inheritance operator, cross over, inversion & deletion, mutation

operator, Bitwise operator, Generational Cycle, Convergence of GA, Applications & advances in

GA, Differences & similarities between GA & other traditional methods.


CS-705 – SOFT COMPUTING


types of soft computing techniques, applications of soft computing.



like hill Climbing, Best first Search, A* algorithm, AO* Algorithms and various types of control





characteristics and applications of ANN, single layer network, Perceptron training algorithm,



derivation of BBPA, momentum, limitation, characteristics and application of EBPA,



mitations and applications. Hopfield v/s Boltzman machine. Adaptive


Fuzzy Logic: Fuzzy set theory, Fuzzy set versus crisp set, Crisp relation & fuzzy relations, Fuzzy



reasoning, fuzzy inference systems, fuzzy decision making & Applications of fuzzy logic.



itwise operator, Generational Cycle, Convergence of GA, Applications & advances in

GA, Differences & similarities between GA & other traditional methods.

BHOPAL




AO* Algorithms and various types of control





n training algorithm,



tics and application of EBPA,



mitations and applications. Hopfield v/s Boltzman machine. Adaptive


y relations, Fuzzy



ion making & Applications of fuzzy logic.



itwise operator, Generational Cycle, Convergence of GA, Applications & advances in


References :

1. S, Rajasekaran & G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic &

Genetic Algorithms, Synthesis & applications, PHI Publication.

2. S.N. Sivanandam & S.N. Deepa, Principles of Soft Computing, Wiley

Publications •Rich E and Knight K, Artificial Intelligence, TMH, New Delhi.

3. Bose, Neural Network fundamental with Graph , Algo.& Appl, TMH •Ko

Neural Network & Fuzzy System, PHI Publication

4. Klir & Yuan ,Fuzzy sets & Fuzzy Logic: Theory & Appli.,PHI Pub. •Hagen,

Neural Network Design, Cengage Learning

Practical list:

1. To perform Union,Intersection and Complement operations.

2. To implement De-Morgan’s Law.

3. To plot various membership functions.

4. To implement FIS Editor. Use Fuzzy toolbox to model tip value that is given after a dinner

based on quality ans service.

5. To implement FIS Editor.

6. Generate ANDNOT function using McCulloch

7. Generate XOR function using McCulloch

8. Hebb Net to classify two dimensional input patterns in bipolar with given targets.

9.Perceptron net for an AND function with bipolar inputs and targets.

10.To calculate the weights for given patterns using heteroassociative neural net.

11.To store vector in an auto-associative net.Find weight matrix & test the net with input

12.To store the vector ,find the weight matrix with no self connection.Test this using a discrete

Hopfield net.


S, Rajasekaran & G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic &

hms, Synthesis & applications, PHI Publication.

S.N. Sivanandam & S.N. Deepa, Principles of Soft Computing, Wiley


Bose, Neural Network fundamental with Graph , Algo.& Appl, TMH •Ko

Neural Network & Fuzzy System, PHI Publication

Klir & Yuan ,Fuzzy sets & Fuzzy Logic: Theory & Appli.,PHI Pub. •Hagen,

Neural Network Design, Cengage Learning

To perform Union,Intersection and Complement operations.

Morgan’s Law.

To plot various membership functions.

To implement FIS Editor. Use Fuzzy toolbox to model tip value that is given after a dinner

Generate ANDNOT function using McCulloch-Pitts neural net.

Generate XOR function using McCulloch-Pitts neural net.

Hebb Net to classify two dimensional input patterns in bipolar with given targets.

9.Perceptron net for an AND function with bipolar inputs and targets.

weights for given patterns using heteroassociative neural net.

associative net.Find weight matrix & test the net with input


BHOPAL

S, Rajasekaran & G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic &

S.N. Sivanandam & S.N. Deepa, Principles of Soft Computing, Wiley


Bose, Neural Network fundamental with Graph , Algo.& Appl, TMH •Kosko:

Klir & Yuan ,Fuzzy sets & Fuzzy Logic: Theory & Appli.,PHI Pub. •Hagen,

To implement FIS Editor. Use Fuzzy toolbox to model tip value that is given after a dinner

Hebb Net to classify two dimensional input patterns in bipolar with given targets.

weights for given patterns using heteroassociative neural net.

associative net.Find weight matrix & test the net with input



CS 706 MOBILE APPLICATION DEVELOPMENT

UNIT I

Mobile Application Development Overview, Platform Development Environment, Characteristics of mobile applications, Different tools for mobile app development, Benefits of mobile application development, Languages for mobile application development, Mobile application architecture, Introduction to C#.

UNIT II

Introduction to two of the bigger names platforms: Android, Windows Phone, Factors in Developing Mobile Applications, Code Sharing TechnData by using C#, Location and Mapping Capabilities Of both Platforms Using C#, Introduction to XAML

UNIT III

Data, Binding, and Pages, Adding an AppBar, Creating Flyouts, Navigating Within a Windows

App, Changes in Code, Supporting Views, Responding to View , Breaking Out of the Snapped

View, Using Tiles and Badges, Improving Static Tiles, Updating Wide Tiles , Creating Live

Tiles, Applying Badges

UNIT IV

Mobile Application Development:

application User, Mobile Website, Getting started with Android, Development, Creating an

android virtual device, Getting started with windows 7, Metro, Application Bar, Tombstoning,

Silverlight vs. Windows Phone 7 Phone gap, Logitech Squ

Mono for Android, Why MonoTouch/Mono for Android?

UNIT V

Widows Store App Development:project, The modern UI, Design inspiration, Governing Principles, Windows Storearchitecture, Deployment and the Windows Store, Multipass layoutUIElement layout properties, Panels, Brushes, graphics, styles, and resources, Displaying

beautiful text, The app bar, App settings and suspend/resume, D

Reference Books:

1. PROFFESIONAL MOBILE APPLICATION DEVELOPMENT (Jeff McWherter, Scott Gowell) Willey Publications

2. Mobile Development with C# (Gregg Shackles) O’REILLY

3. Windows8 App Revealed Using XAML and C# (Adam Freeman)

4. Windows Store APP Development (Pete Brown) MANNING SHELTER ISLAND

5. Professional Windows8 Programming (Nick Lecrenski, Doug Holland, Kevin Ashley) Willey

publications



Mobile Application Development Overview, Platform Development Environment, Characteristics of mobile applications, Different tools for mobile app development, Benefits of

development, Languages for mobile application development, Mobile application architecture, Introduction to C#.

Introduction to two of the bigger names platforms: Android, Windows Phone, Factors in Developing Mobile Applications, Code Sharing Techniques, Accessing the Network, Storing Data by using C#, Location and Mapping Capabilities Of both Platforms Using C#, Introduction


de, Supporting Views, Responding to View , Breaking Out of the Snapped


Mobile Application Development: Mobile User Interface Design, Understanding mobile



Silverlight vs. Windows Phone 7 Phone gap, Logitech Squeezebox, Controller MonoTouch and

Mono for Android, Why MonoTouch/Mono for Android?

Widows Store App Development: Setting Up the development environment, Configuring the project, The modern UI, Design inspiration, Governing Principles, Windows Storearchitecture, Deployment and the Windows Store, Multipass layout— measuring and arranging, UIElement layout properties, Panels, Brushes, graphics, styles, and resources, Displaying

beautiful text, The app bar, App settings and suspend/resume, Deploying and selling your App.

PROFFESIONAL MOBILE APPLICATION DEVELOPMENT (Jeff McWherter, Scott

Mobile Development with C# (Gregg Shackles) O’REILLY

Windows8 App Revealed Using XAML and C# (Adam Freeman) Apress Publications

Windows Store APP Development (Pete Brown) MANNING SHELTER ISLAND

Professional Windows8 Programming (Nick Lecrenski, Doug Holland, Kevin Ashley) Willey

BHOPAL


Mobile Application Development Overview, Platform Development Environment, Characteristics of mobile applications, Different tools for mobile app development, Benefits of

development, Languages for mobile application development, Mobile

Introduction to two of the bigger names platforms: Android, Windows Phone, Factors in iques, Accessing the Network, Storing

Data by using C#, Location and Mapping Capabilities Of both Platforms Using C#, Introduction


de, Supporting Views, Responding to View , Breaking Out of the Snapped


derstanding mobile



eezebox, Controller MonoTouch and

Setting Up the development environment, Configuring the project, The modern UI, Design inspiration, Governing Principles, Windows Store app system

measuring and arranging, UIElement layout properties, Panels, Brushes, graphics, styles, and resources, Displaying

eploying and selling your App.

PROFFESIONAL MOBILE APPLICATION DEVELOPMENT (Jeff McWherter, Scott

Apress Publications

Windows Store APP Development (Pete Brown) MANNING SHELTER ISLAND

Professional Windows8 Programming (Nick Lecrenski, Doug Holland, Kevin Ashley) Willey


CS 707 NETWORK SIMULATOR

NS - 2 is a very popular discrete event Netw

wired, Wireless an satellite networks across both academia and industry as a way of designing

testing and evaluating new and existing protocols and architectures, and has also proven a very

useful tool for teaching purpose.

NS - 2 Comes fully equipped of protocols, models, algorithms and accessory tools. NS

2 is an open source network simulator which is freely available for academic research purpose.

Therefore, in terms of scientific acceptance, number

a sort of ideal choice.

Note : Network simulation required a basic understanding of programming.

Full Syllabus :

Introduction on network simulation.

Introduction to network simulator (NS2/NS3)

Components and Tools of NS.

Front and back end analysis.

TCL/OTCL programming.

NS installation in Linux / window.

Creating a wired scenario and enhancing the NAM output.

Generation of node - movement an traffic

Wired - Wireless scenario.

Wireless sensor network.

Mobile Ad - hoc network.

Graph generation using AWK Script & Trace file analysis.

Project Allocation.


CS 707 NETWORK SIMULATOR

2 is a very popular discrete event Network simulator which is used in the research field of



or teaching purpose.

2 Comes fully equipped of protocols, models, algorithms and accessory tools. NS


Therefore, in terms of scientific acceptance, number of tools / modules and cost, NS

required a basic understanding of programming.

Introduction on network simulation.

Introduction to network simulator (NS2/NS3)

NS installation in Linux / window.

Creating a wired scenario and enhancing the NAM output.

movement an traffic - connection for wireless scenarios.

Graph generation using AWK Script & Trace file analysis.

BHOPAL

ork simulator which is used in the research field of



2 Comes fully equipped of protocols, models, algorithms and accessory tools. NS -


of tools / modules and cost, NS - 2 would be

required a basic understanding of programming.


CS 708 ENTERPRISE RESOURCE PLANNING

UNIT I

ERP AND TECHNOLOGY: Introduction

Commerce and EBusiness– Business Process Reengineering

– OLAP – Product life Cycle management

UNIT II

ERP IMPLEMENTATION :

implementation Tasks – Requirements Definition

Teams – Process Definitions – Vendors and Consultants

– Post Implementation Activities.

UNIT III

ERP IN ACTION & BUSINESS MODULES

Maximizing the ERP System

Resources – Plant maintenance

Sales, Distribution and service.

UNIT IV

ERP MARKET :Marketplace –

QAD Inc –SSA Global – Lawson Software

UNIT V

Enterprise Application Integration Future Directions – Trends in ERP.

REFERENCES

1. Alexis Leon, “ERP DEMYSTIFIED”, Tata McGraw Hill, Second Edition, 20082. Mary Sumner, “Enterprise Resource Planning”, Pearson Education, 2007.3. Jim Mazzullo,”SAP R/3 for Everyone”, Pearson,2007.

4. Jose Antonio Fernandz, “ The SAP R /3 Handbook”, Tata McGraw Hill, 1998.

5. Biao Fu, “SAP BW: A Step-by


CS 708 ENTERPRISE RESOURCE PLANNING

Introduction – Related Technologies – Business Intelligence

Business Process Reengineering – Data Warehousing

Product life Cycle management – SCM – CRM

: Implementation Challenges – Strategies – Life Cycle

Requirements Definition – Methodologies – Package selection

Vendors and Consultants – Data Migration – Project management

Post Implementation Activities.

BUSINESS MODULES: Operation and Maintenance

Maximizing the ERP System – Business Modules – Finance – Manufacturing

Plant maintenance – Materials Management – Quality management

– Dynamics – SAP AG – Oracle – PeopleSoft

Lawson Software – Epicor – Intutive.

Enterprise Application Integration – ERP and E-Business – ERP II – Total quality management Trends in ERP.

Alexis Leon, “ERP DEMYSTIFIED”, Tata McGraw Hill, Second Edition, 2008Mary Sumner, “Enterprise Resource Planning”, Pearson Education, 2007. Jim Mazzullo,”SAP R/3 for Everyone”, Pearson,2007.

z, “ The SAP R /3 Handbook”, Tata McGraw Hill, 1998.

by-Step Guide”, First Edition, Pearson Education, 200UNIT III

BHOPAL

Business Intelligence – E-

Data Warehousing – Data Mining

Life Cycle – Pre-

Package selection – Project

Project management

Operation and Maintenance – Performance –

Manufacturing – Human

Quality management – Marketing –

PeopleSoft – JD Edwards –

Total quality management –

Alexis Leon, “ERP DEMYSTIFIED”, Tata McGraw Hill, Second Edition, 2008

z, “ The SAP R /3 Handbook”, Tata McGraw Hill, 1998.

Step Guide”, First Edition, Pearson Education, 200UNIT III


CS 801 ENGINEERING PROJECT (MAJOR)

PURPOSE

To simulate real life situations related to the program and impart confidence to face and tackle any problem in the field is developed.


To guide the students such a way that the they carry out a comprehensive work on the chosen topic which will stand them in good stead aschosen by the student shall culminate in gaining of major design experience in the related area of specialization.

MAJOR PROJECT

A student is encouraged to take an industrial project with reputed organizby the institute. In such cases the student will stay with the firm and carry out the project. The

project will be guided by the faculty member and the concerned officer in the industry. All the requirements spelt out under ‘MAJOR PR

also. However reviews will be conducted in the institute which the student shall attend.


CS 801 ENGINEERING PROJECT (MAJOR)

To simulate real life situations related to the program and impart adequate training so that confidence to face and tackle any problem in the field is developed.


To guide the students such a way that the they carry out a comprehensive work on the chosen topic which will stand them in good stead as they face real life situations. The project work so chosen by the student shall culminate in gaining of major design experience in the related area of

A student is encouraged to take an industrial project with reputed organizations or firms chosen by the institute. In such cases the student will stay with the firm and carry out the project. The

project will be guided by the faculty member and the concerned officer in the industry. All the requirements spelt out under ‘MAJOR PROJECT’ above, shall be incorporated under this work

However reviews will be conducted in the institute which the student shall attend.

BHOPAL

adequate training so that

To guide the students such a way that the they carry out a comprehensive work on the chosen they face real life situations. The project work so

chosen by the student shall culminate in gaining of major design experience in the related area of

ations or firms chosen by the institute. In such cases the student will stay with the firm and carry out the project. The

project will be guided by the faculty member and the concerned officer in the industry. All the OJECT’ above, shall be incorporated under this work

However reviews will be conducted in the institute which the student shall attend.


Group Discussion

Group Discussion (GD) is a methodology used by institutes to gauge whether thecertain personality traits and skills required in education. Group of candidates is given a topic or a situation, given a few minutes to think about the same, and then asked to discuss it among them.

Seminar

This one credit course is meant to give students practice speaking in front of an audience and to

explore topics of their own choosing in detail. Students will research topics and organize presentations for faculty and other students. The topics may be any aspect of the technical topic

and must be approved by the instructor in advance. To help students improve as speakers, each student will receive feedback from the fellow students and the instructor.

Expectations

Students will submit a detailed outline of their presentation and also a brtheir presentation).

Guidelines for a Proposal Seminar

You may give a proposal seminar once during your M.S. program.

Proposal Seminar Format

· Give an introduction and background information on your topic. What relevant research hasperformed previously?

· State the problem(s) that remain unanswered.

· Clearly state your objectives and give the specific hypotheses you wish to test.

· Describe the methodology you will use to test your hypotheses. Be sure you fully understand your chosen methods. Give reasons why you chose these methods over other approaches.

· Present any data you have collected thus far.

· Describe what remains to be done, and what you expect to find.

· Explain the significance of your findings (or potential future findings)


CS 803 GD/SEMINAR

Group Discussion (GD) is a methodology used by institutes to gauge whether thecertain personality traits and skills required in education. Group of candidates is given a topic or a situation, given a few minutes to think about the same, and then asked to discuss it among

to give students practice speaking in front of an audience and to


nd must be approved by the instructor in advance. To help students improve as speakers, each student will receive feedback from the fellow students and the instructor.

Students will submit a detailed outline of their presentation and also a brief abstract (describing

Guidelines for a Proposal Seminar

You may give a proposal seminar once during your M.S. program.

Give an introduction and background information on your topic. What relevant research has

State the problem(s) that remain unanswered.

Clearly state your objectives and give the specific hypotheses you wish to test.

Describe the methodology you will use to test your hypotheses. Be sure you fully understand n methods. Give reasons why you chose these methods over other approaches.

Present any data you have collected thus far.

Describe what remains to be done, and what you expect to find.

Explain the significance of your findings (or potential future findings).

BHOPAL

Group Discussion (GD) is a methodology used by institutes to gauge whether the candidate has certain personality traits and skills required in education. Group of candidates is given a topic or a situation, given a few minutes to think about the same, and then asked to discuss it among

to give students practice speaking in front of an audience and to


nd must be approved by the instructor in advance. To help students improve as speakers, each

ief abstract (describing

Give an introduction and background information on your topic. What relevant research has been

Describe the methodology you will use to test your hypotheses. Be sure you fully understand n methods. Give reasons why you chose these methods over other approaches.

SARVEPALLI RADHAKRISHNAN UNIVERSITY, …srku.edu.in/pdf/BE(CSE) III-VIII SEM(REG 2016 BATCH ON...

Documents

Transcript of SARVEPALLI RADHAKRISHNAN UNIVERSITY, …srku.edu.in/pdf/BE(CSE) III-VIII SEM(REG 2016 BATCH ON...