RAYAT BAHRA UNIVERSITY

School of Computer Science & Engineering

UGC CBCS: School
B.Tech. (CSE) III Year – VI Sem
Elective
Theory Course Offered by: School: CSE Dept: Computer Science & Engineering
1 Course Code CSS102
2 Course Title Simulation & Modelling
3 Credits 2-1-0 (3)
4 Contact Hours 2-1-0 (3)
(L-T-P)
5 Course Objectives The objectives of this course are to:
1. To make student learn about the simulation and modeling techniques
2. To Provide student with opportunities to develop basic simulation and modeling
skills with respect to carrying out research projects using any simulation method on
the computer
6 Course Outcome After the completion of the course students will be able to
1. Define basic concepts in modelling and simulation (M&S)
2. Classify various simulation models and give practical examples for each category
3. Construct a model for a given set of data and motivate its validity
4. Generate and test random number variants and apply them to develop simulation
models
5. Analyze output data produced by a model and test validity of the model
6. Distinguish parallel and distributed simulation methods.

7 Outline syllabus: 40 Lecture Hours

7.01 Unit A Introduction
CSS102
Unit A Topic 1
CSS102 Introduction- When simulation is appropriate and when not, advantages and
7.02 disadvantages of simulation, application areas in communication, computer and
software design
Unit A Topic 2
CSS102 Systems and systems environment, components of a system, discrete and continuous
7.03 systems, model of a system, types of models, discrete-event simulation, steps in a
simulation study
Unit A Topic 3
7.04 CSS102 Concept of a system, stochastic activities, continuous and discrete system, principals
used in simulation and modelling for various applications.
7.05 Unit B Techniques of simulation
CSS102
Unit B Topic 1 Monte Carlo method, type of system simulations, real time simulation
7.06 CSS102 stochastic variables, discrete probability function
Unit B Topic 2 Generation of random number, Poisson arrival pattern, exponential distribution,
7.07 CSS102 service time, normal distribution, queuing and discipline, measures of queues
Unit B Topic 3 Simulation Software- Integrated environments. Examples and review of some
7.08 CSS102 existing software popular and useful in the industry.

7.09 CSS102 Unit C Statistical Models in Simulation

Unit C Topic 1 Terms and concepts, Statistical Models, Review of discrete and continuous
7.10 CSS102 distributions
Unit C Topic 2 Elementary Queuing Theory- Basic Structure of Queuing Models, Input Source
7.11 CSS102 Calling Population, Queue, Queue Discipline, Service Mechanisms
Unit C Topic 3 Representation of time, generation of arrival pattern, Discrete simulation
7.12 CSS102 languages queuing and inventory control
7.13 Unit D Simulation of Computer Systems
CSS102
Unit D Topic 1 Simulation Tools: Process Orientation and Event Orientation, Model Input:
7.14 CSS102 Modulated Poisson Process
7.15 Unit D Topic 2 Virtual-Memory Referencing, High-Level Simulation
CSS102
Unit E CPU and Memory Simulations
CSS102
Unit E Topic 1 Simulation of Computer Networks- Traffic Modelling, Media Access Control
CSS102
Unit E Topic 2 Token-Passing Protocols and Ethernet, Data Link Layer, Transmission Control
CSS102 Protocol (TCP) Model Construction
8 Course Evaluation: 100 Marks
8.1 Internal
40% ( Student Seminar, Assignments, Extempore/Presentation, Quiz/surprise test)
Assessment
8.11 Student Seminar
10 % (1/syndicate (8-10 student)
(syndicate)
8.12 Assignments 10 % (8 Mandatory Assignments)
8.13 Extempore/
10% (1/student)
Presentation
8.14 Quiz/surprise test 10% (2 times)
8.2 MTE (Theory) 20% ( 1 MTEs)
8.3 ETE (Theory) 40 %
References
9
Text book 1. K.S. Trivedi, “Probability and Statistics with Reliability, Queuing and Computer Science
9.1 Application, P.H. is Engleuood Cliff.
2. Subramanian, K.R.V and Sundaresan R. Kadayam, System Simulation : Introduction to GPSS,
CBS, New Delhi, 1993.
Supplementary 1. Gordon, G., System Simulation, 2nd ed. 198., Prentice Hall of India Pvt. Limited.
9.2 Reference(s) 2. Deo, Narsingh, System Simulation with Digital Computers, PHI, New Delhi, 1993.
3. Averill M. Law, W. David Kelton, Simulation modeling and analysis, McGraw Hill, 2000.
4. Walter J. Karplus, George A. Bekey, Boris Yakob Kogan, Modeling and simulation: theory and
practice, Springer, 2003
Related Free
9.3 MATLAB
Software
Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task.
10 Methods

11. Mapping of Outcomes vs. Topics

Course Name: Simulation & Modelling Course Code: CSS102
Outcome No. 1 2 3 4 5 6
Syllabus Topic
CSS102.A

CSS102.A1 X
CSS102.A2 X
CSS102.A3 X
CSS102.A4 X
CSS102.A5 X X
CSS102.B
CSS102.B1 X
CSS102.B2 X
CSS102.B3 X
CSS102.B4 X
CSS102.B5 X
CSS102.C
CSS102.C1 X
CSS102.C2 X
CSS102.C3 X
CSS102.C4 X
CSS102.C5 X
CSS102.D
 CSS102.D1 X
CSS102.D2 X X
CSS102.E
CSS102.E1 X X
CSS102.E2 X X

Department of Computer Science & Engineering
B.Tech
Theory Course Offered by:
1 Course Code
2 Course Title
3 Credits
4 Contact Hours (L-T-P)
5 Course Objectives
6 Course Outcomes
7 Outline Syllabus: 26 Lecture Hours
7.01 CSG151.A
RAYAT-BAHRA UNIVERSITY
University School of Engineering & Technology
UGC-CBCS
III Year - VI Sem
Dept. Core
School: USET Deptt: CSE
CSG151
Relation Database Management System
3-0-1(4)
3-0-2(5)
The objectives of this course are to:
1. To make student learn the basic concepts of database management system.
2. To provide students with understanding of traditional file system and
Compare it with the database system.
3. To make student aware about the various commands used in relational
database management system
4. To make student learn about the integrity constraints applied on relational
database management system
On successful completion of this course, students will be able to
1. Differentiate between the File systems and DBMS and will be able to realize
its use.
2. Elaborate the architecture of DBMS and Data models.
3. Distinguish the different data modelling and entity relationship model
4. An understanding of the principles and practice of Database and so as to
construct robust, maintainable databases which satisfy their requirements;
5. Use the SQL language to define, query and manipulate a relational database;
6. Apply conceptual database modelling methods such as entity-relationship
model to design a relational database
7. Evaluate critically the different forms of DBMS architecture.
8. Implement the Skills for devising data models and query languages
9. Learning storage and indexing of data
10. Learning transaction processing and database recovery
11. Understand the role of recovery tools to deal with database failures.
12. Understand transaction design issues that affect performance.
Introduction to Database Systems
Unit A

CSG151.A1 File systems versus Database management System (DBMS),

7.02 Unit A Topic 1 characteristics of Database management System (DBMS)
approach.
Advantages and Disadvantages of Database management System
7.03 CSG151.A2 Unit A Topic 2
(DBMS) approach, Database language and Interfaces
 Attributes and keys ,relationship types, roles
7.11 CSG151.B4 Unit B Topic 4
Structural constraints , Class hierarchies ,
Unit B Topic 5
7.12 CSG151.B5 Conceptual Database Design with ER model, Naming conventions
and design issues.
7.13 ET-BT-PB-10.C Unit C
The Relational Model
Unit C Topic 1
7.14 CSG151.C1 Introduction, Entity Relationship (ER) to Relational model
conversion
7.15 CSG151.C2 Unit C Topic 2
Integrity constraints over Relations , Relation database schema,
Unit C Topic 3
7.16 CSG151.C3 Update operations and dealing with constraints violations
,Enforcing integrity constraints
7.17 CSG151.C4 Unit C Topic 4
Basic relational algebra operations
7.18 CSG151.C5 Unit C Topic 5
Querying relational data, relational calculus
7.19 CSG151.D Unit D
Relational Query languages and Database Design
Unit D Topic 1
Basic Structured Query Language (SQL) query, Creating tables and
7.20 CSG151.D1 view, Structured Query Language (SQL) as Data Manipulation
Language (DML)
Unit D Topic 2
Data Definition Language (DDL) and Data Control Language (DCL),
7.21 CSG151.D2 Structured Query Language (SQL) Algebraic operations ,nested
query
Unit D Topic 3
7.22 CSG151.D3 Aggregate operations, Integrity constraints in Structured Query
Language (SQL), Basic query optimization strategies
Unit D Topic 4
7.23 CSG151.D4 Algebraic manipulation and Equivalence, functional dependencies
,normal form anomalies , Schemas refinement
Unit D Topic 5
First ,second ,third normal forms , BCNF , multi valued , join
7.24 CSG151.D5 dependencies, fourth and fifth normal forms ,domain key normal
forms ,decomposition
7.25 CSG151.E Unit E
Transaction Management and Recovery
Unit E Topic 1
Transaction and system concepts , ACID (atomicity, consistency,
7.26 CSG151.E1 isolation and durability) properties , Serialization of schedules
,Two -phase commit protocol
Unit E Topic 2
Concurrency control, Lock management, Granularity of data items
7.27 CSG151.E2 and Multiple Granularity locking, Lost update problem,
Inconsistent read problem.
Unit E Topic 3
Read –write locks , Deadlock handling , 2PL (Two Phase Locking)
7.28 CSG151.E3 protocol ,Recovery concepts , Recovery techniques, Shadow
paging
LAB EXPERIMENTS
7.29 CSG151.L
(Minimum of 7 Experiments Mandatory)

7.30 CSG151.L1 Lab Exp 1 Introduction to Structured Query Language (SQL) and installation
of Structured Query Language (SQL) Server / Oracle.

Lab Exp 2 Data Types, Creating Tables, Retrieval of Rows using Select
7.31 CSG151.L2 Statement, Conditional Retrieval of Rows, Alter and Drop
Statements.

Lab Exp 3 Working with Null Values, Matching a Pattern from a Table,
7.32 CSG151.L3 Ordering the Result of a Query, Aggregate Functions, Grouping the
Result of a Query, Update and Delete Statements.
7.33 CSG151.L4 Lab Exp 4 Set Operators, Nested Queries, Joins, and Sequences.
7.34 CSG151.L5
 Lab Exp 5 Views, Indexes, Database Security and Privileges: Grant and
Revoke Commands, Commit and Rollback Commands.

Lab Exp 6 PL/SQL (Procedural Language extension to Structured Query

Language) Architecture, Assignments and Expressions, Writing
7.35 CSG151.L6 PL/SQL ( Procedural Language extension to Structured Query
Language) Code, Referencing Non-SQL( Structured Query
Language) parameters.
7.36 CSG151.L7 Lab Exp 7 Stored Procedures and Exception Handling.

7.37 CSG151.L8 Lab Exp 8 Triggers and Cursor Management in PL/SQL (Procedural Language
extension to Structured Query Language).
8 Course Evaluation: 100 Marks
Internal
8.1 40% (Class Teacher)
Assessment
8.2 Attendance 5%(75-80% 1 mark, 81-85% 2 marks, 86-90% 3 marks, 91-95% 4 marks, 96-100% 5 marks)

8.3 Homework 5% (5 Mandatory Assignments)

8.4 Quiz 5% 1 (Better of 2 Quiz or other Suitable Means)
Laboratory 25% (Lab Attendance - 5 marks, Lab File - 5 Marks, Lab Performance - 5 Marks, Lab Viva
8.5 Component Voce - 5 Marks, Lab Exam - 5 Marks); Lab Exam & Viva-Voce by Dept. Panel; No Separate
ETE for Lab Component
8.6 Any Other Non-Credit Work by Teacher
8.7 MTE 20% (Better of 2 MTEs)
8.8 ETE: 40%
9 References
1. Ramez Elmasri, Shamkant Navathe, Fundamentals of Database Systems, Fifth
9.1 Text book
Edition, Pearson Education, 2007.
1. C.J. Date , An Introduction to Database Systems, Eighth Edition, Pearson Education
2. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts,
Supplementary
9.2 Tata McGraw-Hill.
Reference(s)
3. Alexis Leon, Mathews Leon, Database Management Systems, Leon Press.S. K. Singh,
Database Systems Concepts, Design and Applications, Pearson Education.
9.3 Free Software SQL 10 G
Pedagogical
10 Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task
Methods
11. Mapping of Outcomes vs. Topics
Course Name: RDBMS Course Code: CSG151

Outcome No. 1 2 3 4 5 6 7 8 9 10 11 12
Syllabus Topic
CSG151.A

CSG151.A1 X
CSG151.A2 X
CSG151.A3 X
CSG151.A4 X
CSG151.A5 X
CSG151.B
CSG151.B1 X
CSG151.B2 X
CSG151.B3 X
CSG151.B4 X
CSG151.B5 X
CSG151.C
CSG151.C1 X
CSG151.C2 X
CSG151.C3 X X
CSG151.C4 X
CSG151.C5 X
CSG151.D
CSG151.D1 X
CSG151.D2 X X
CSG151.D3 X
CSG151.D4 X
CSG151.D5 X
CSG151.E
CSG151.E1 X
CSG151.E2 X
CSG151.E3 X

CSG151.L1 X
CSG151.L2 X
CSG151.L3 X
CSG151.L4 X
CSG151.L5 X
CSG151.L6 X
CSG151.L7 X
CSG151.L8 X

RAYAT-BAHRA UNIVERSITY
University School of Engineering and Technology
0 CSG201.B3
7.1 Unit B Topic 4 Anti-aliasing lines & area boundaries
CSG201.B4
1
7.1 Unit C
CSG201.C Transformations & Clipping
2
7.1 Unit C Topic 1 2 Dimensional & 3 Dimensional Scaling, Translation, rotation, shearing & reflection.
CSG201.C1
3
7.1 Unit C Topic 2
CSG201.C2 Composite transformation, Window to View port transformation.
4
7.1 Unit C Topic 3
CSG201.C3 Cohen Sutherland, Liang Barsky,
5
7.1 Unit C Topic 4
CSG201.C4 Nicholl Lee Nicholl Line clipping algorithms,
6
7.1 Unit C Topic 5 Sutherland Hodgeman, Weiler Atherton Polygon clipping algorithm, Clipping in 3
CSG201.C5
7 Dimensional.
7.1 Unit D
CSG201.D Projection and Three-dimensional Concepts , Curved, liens & Surfaces
8
7.1 Unit D Topic 1 Modelling transformations, Interactive Picture construction techniques
CSG201.D1
9
7.2 Unit D Topic 2 Parallel &Perspective projection
CSG201.D2
0
7.2 Unit D Topic 3 Curved lines & Surfaces : Spline representations, Spline
CSG201.D3
1
7.2 Unit D Topic 4 Specifications, Bezier Curves & surfaces, B-spline curves & surfaces
CSG201.D4
2
7.2 Unit D Topic 5 Rational splines, Displaying Spline curves & surfaces.
CSG201.D5
3
7.2 Visible Surface Détermination and Hidden Lines and Surfaces
CSG201.E Unit E
4
7.2 Unit E Topic 1
CSG201.E1 Back Face Detection algorithm, Depth buffer method, A buffer method, Scan line
5 method
7.2 Unit E Topic 2
CSG201.E2 Basic illumination models, Ambient light, Diffuse reflection
6
7.2 Unit E Topic 3
CSG201.E3 Specular reflection and Phong model, Combined approach, Warn model
7
7.2 Unit E Topic 4
CSG201.E4 Intensity Attenuation, Color consideration, Transparency and Shadows
8
8 LAB EXPERIMENTS (Minimum of 7 Experiments Mandatory)

8.1 CSG201.L01 Lab Expt.1 To implement Digital Differential Analyzer (DDA) algorithms for line and circle.
8.11 Lab Expt.2
CSG201.L02 To implement Bresenham’s algorithms for line, circle and ellipse drawing.
Lab Expt.3
CSG201.L03 To implement Mid Point Circle algorithm using C.
8.12 Lab Expt.4
CSG201.L04 To implement Mid Point Ellipse algorithm using C.
Lab Expt.5
8.13 CSG201.L05 To perform 2 Dimensional Transformations such as translation, rotation, scaling,
reflection and sharing.
Lab Expt.6
8.14 CSG201.L06 To implement Cohen Sutherland 2 Dimensional clipping and window viewport
mapping.
Lab Expt.7
8.15 CSG201.L07 To implement Liang Barsky Line Clipping Algorithm

8.16 CSG201.L08 Lab Expt 8 To perform 3 Dimensional Transformations such as translation, rotation and scaling.
8.17 CSG201.L09 Lab Expt 9 To convert between color models.
8.18 CSG201.L10 Lab Expt 10 To perform animation using any Animation software.
8.19 CSG201.L11
Lab Expt 11 To perform basic operations on image using any image editing software.
8.20 CSG201.L12 Lab Expt 12 To draw different shapes such as hut, face, kite, fish etc.

9 Course Evaluation : 100 Marks

Internal
9.1 40% (Class Teacher and Dept or School Panel)
Assessment
Attendance
9.2 5% (75-80% 1 marks, 81-85% 2 marks, 86-90% 3 marks, 91-95% 4marks, 96-100% 5marks)
(Theory)
9.3
Homework
5% (5 Mandatory Assignments)
(Theory)
Quiz(Theory
9.4 5% 1( Better of 2 Quiz or other Suitable Means)
)
Laboratory 25%(Lab Attendance -5 marks, Performance-5 marks Lab viva voice-5Marks, Lab Exam-5Marks);Lab
9.5
Component Exam& Viva-voce by Dept. Panel; No Separate ETE for Lab Component
9.6 Any Other Non-Credit Work By Teacher
MTE(Theory
9.7 20% (Better of 2 MTEs)
Component)
9.8 ETE: (Theory Component): 40%
10 References :
10.1 Text book D.Hearn&P.Baker, Computer Graphics, Pearson Education Asia
1. Foley, Van Dam, Feiner, Hughes, Computer Graphics, Pearson Education Asia.
Supplementary
10.2 2. Amrendra N Sinha and Arun D Udai,” Computer Graphics”,Tata McGraw Hill.Rogers, Adams,
Reference(s)
Mathematical Elements for Computer Graphics, Tata Mcgraw Hill
10.3 Free Software
Pedagogical
11 White/Black Board/ Seminars/ PPT/Lab Experiments & Demonstrations.
Methods

12. Mapping of Outcomes vs. Topics

Course Name : Computer Graphics Course Code: CSG201

OUTCOME NO  1 2 3 4 5 6 7 8 9
SYLLABUS TOPIC ↓

CSG201.A
X
CSG201.A1
X X
CSG201.A2
X
CSG201.A3
X X
CSG201.A4
X
CSG201.A5
CSG201.B
X
CSG201.B1
X X
CSG201.B2
X
CSG201.B3
X
CSG201.B4
CSG201.C
X
CSG201.C1
X X
CSG201.C2
X
CSG201.C3
 CSG201.C4 X X

X
CSG201.C5
CSG201.D
X
CSG201.D1
X X
CSG201.D2
X X
CSG201.D3
X X
CSG201.D4
X X
CSG201.D5
CSG201.E
X
CSG201.E1
X
CSG201.E2
X X
CSG201.E3
X
CSG201.E4

RAYAT BAHRA UNIVERSITY

School of Computer Science & Engineering
B.Tech. (CSE) UGC CBCS: Dept Core III Year – VI Sem

Theory Course Offered by: School: CSE Dept: Computer Science & Engineering
1 Course Code CSG401
2 Course Title Network Security and Cryptography
3 Credits 4-0-0(4)
4 Contact Hours 4-0-0(4)
(L-T-P)
5 Course Objectives The objectives of this course are to:
1. To understand the Information Technology products
2. To understand the concept of an acute awareness to protect networks, information, data
and messages.
3. To use fidelity of communication, timely availability of information at destination,
4. To use the source and information authenticity, corruption of information
5. To understand the concept of constitute information security.
6 Course Outcome
After studying this subject student will learn the following things:
1. Define information security and outline its major components
2. Identify the major types of threats to information security and the associated attacks.
3. Develop strategies to protect organization information assets from common attacks.
4. Understand how security policies, standards and practices are developed.
5. Understand firewalls and packet filtering.
6. Understand the role of cryptography in information security.
7. Describe the major types of cryptographic algorithms and typical applications.
8. Understand authentication protocols and processes.
9. Understand how digital signatures are performed and the role of digital certificates.
10. Understand the special requirements and aspects of Web, E-mail and System Security

7 Outline syllabus: 40 Lecture Hours

7.01 Unit A
CSG401 Computer Security Concepts
Unit A Topic 1
7.02 CSG401 Security attacks, services and mechanisms. Model for Network Security. Introduction
to cryptography.
7.03 Unit A Topic 2
 CSG401 Conventional Encryption: Conventional encryption model, classical encryption
techniques- substitution ciphers and transposition ciphers
7.04 Unit A Topic 3
CSG401 Cryptanalysis, Stenography, stream and block ciphers, Basics of Stenography
7.05 Unit B Modern Block Ciphers and Number Theory
CSG401
Unit B Topic 1 Block ciphers principals, Shannon’s theory of confusion and diffusion, fiestal
7.06 CSG401 structure, data encryption standard (DES), strength of data encryption standard
(DES), Overview of Advanced Encryption Standard (AES)
7.07 Unit B Topic 2 Introduction to prime and relative prime numbers, modular arithmetic
CSG401
Unit B Topic 3 Fermat’s and Euler’s theorem, primarily testing, Euclid’s Algorithm, Chinese
7.08 CSG401 Remainder theorem.
7.09 CSG401 Unit C Principals of public key crypto systems
Unit C Topic 1 Principles of Public-key cryptosystems, Diffie-Hellman key exchange
7.10 CSG401 algorithm.
Unit C Topic 2 Authentication requirements, Applications of Cryptographic Hash functions,
7.11 CSG401 Overview of Secure Hash Algorithms and SHA(Secure Hash Algorithm) Family
Unit C Topic 3 Security of hash functions and MAC (Message Authentication Control) , MD5
7.12 CSG401 (Message Digest) algorithm
7.13 Unit D Digital Signatures and Authentication Applications
CSG401
Unit D Topic 1 Authentication protocols, digital signature standards (DSS), Digital Signature
7.14 CSG401 Algorithm
7.15 Unit D Topic 2 Kerberos system, E-mail Architecture, E-Mail Security- Pretty Good Privacy
CSG401
7.16 CSG401 Unit E Internet and IP (Information Protocol) Security
Unit E Topic 1 IPSec Architecture, IPSec Services, IPSec Protocols – Authentication Header,
7.17 CSG401 Encapsulating Security Payloads, Internet Key Exchange
Unit E Topic 2 Web security, Transport Security, SSH (Secure Socket Shell), System Security:
7.18 CSG401 Intruders, Viruses and related threats, Firewalls architecture and types.
8 Course Evaluation: 100 Marks
8.1 Internal
40 ( Student Seminar, Assignments, Extempore/Presentation, Quiz/surprise test)
Assessment
8.11 Student Seminar
10 (1/syndicate (8-10 student)
(syndicate)
8.12 Assignments 10 (8 Mandatory Assignments)
8.13 Extempore/
10(1/student)
Presentation
8.14 Quiz/surprise test 10 (2 times)
8.2 MTE (Theory) 20 ( 1 MTEs)
8.21 MTE-I 20
8.3 ETE (Theory) 40
References
9
Text book 1. Cryptography and Network Security, Principles & Practice by William Stallings, Pearson
9.1 Education
Supplementary 1. Cryptography and Network Security, Behrouz A. Forouzan, Debdeep Mukhopadhyay, Tata
9.2 Reference(s) McGraw Hill.
2. Cryptography and Network Security, Atul Kahate, McGraw Hill Education.
3. Discrete Mathematics and its Applications, Kenneth H. Rosen, Tata Mc-Graw Hill.
4. J.F. Kurose & K.W. Ross,” Computer Networking- A top down approach featuring the internet”,
Pearson, 2nd edition, 2003.
Related Free 1. TrueCrypt
9.3 Software 2. Encryption tools:http://sectools.org/tag/crypto/
Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task.
10 Methods
11. Mapping of Outcomes vs. Topics
Course Name : Network security and cryptography Course Code:CSG401

OUTCOME NO  1 2 3 4 5 6 7 8 9 10
SYLLABUS TOPIC ↓
 CSG401.A X
X
CSG401.A1
X X
CSG401.A2
X
CSG401.A3
X X
CSG401.B
X
CSG401.B1
X
CSG401.B2
X
CSG401.B3
X X
CSG401.C
X
CSG401.C1
X
CSG401.C2
X
CSG401.C3
X X
CSG401.D
X X
CSG401.D1
X X
CSG401.D2
X X
CSG401.E
X X X
CSG401.E1
X
CSG401.E2

RAYAT BAHRA UNIVERSITY

School of Computer Science & Engineering
B.Tech. (CSE) UGC CBCS: Dept Core III Year – VI Sem

Theory Course Offered by:
1 Course Code
2 Course Title
3 Credits
4 Contact Hours
(L-T-P)
5 Course Objectives
6 Course Outcome
7 Outline syllabus: 40 Lecture Hours
School: CSE Dept: Computer Science & Engineering
CSG451
Mobile Application Development
3-0-0(3)
3-0-0(3)
The objectives of this course are to:
1. The course harnesses the skills of students in developing mobile application development
using the Android platform
2. To understand the concepts of intent object, intent filters
3. To understand the concepts of Shared preferences, File Handling, managing data
using SQL(Structural Query Language) Lite database
4. To understand the concepts of Android network programming Telephony services
After studying this subject student will learn the following things:
1. Understanding Mobile Application development features and trends
2. Understand the basics of Android devices and Platform.
3. Impart knowledge on basic building blocks of Android programming
Activities, Services, Broadcast Receivers and Content providers
4. Understanding persistence Data storage in Android
5. Understanding advanced application concepts like networking, cloud interface and
Google Maps services etc.
6. Enable Students to develop and publish Android applications in to
Android Market
7.01 CSG451 Unit A Introduction to Mobile Application Development
Unit A Topic 1
CSG451 Introduction, trends, introduction to various platforms, introduction to smart phones,
7.02 introduction to development environment, Android platform features and architecture,
versions, android market
Unit A Topic 2
CSG451 Android development setup – Eclipse, ADT(Abstract Data Type), android sdk
7.03 (Software Development kit), tools. Android application anatomy, emulator setup,
application framework basics-, resources-layout, values
Unit A Topic 3
7.04 CSG451 XML(Extensible Markup Language) representation and generated R.Java file,
Android manifest file. Creating a simple application.
7.05 Unit B Introduction to activities and Intent
CSG451
7.06 Unit B Topic 1 Introduction to activities, activities life-cycle, User Interface
CSG451
Unit B Topic 2 Intent – intent object, intent filters – adding categories, linking activities,
7.07 CSG451 user interface design components-Fragments, basic views, list views, picker
views, adapter views, Menu, Action Bar etc
Unit B Topic 3 Basics of screen design, registering listeners and different event Listeners.
7.08 CSG451 Creating application using multiple activities.
7.09 CSG451 Unit C Data Persistence
Unit C Topic 1 Shared preferences, File Handling, managing data using SQL(Structural Query
7.10 CSG451 Language) Lite database
Unit C Topic 2 Content providers – user content provider, android provided content providers.
7.11 CSG451 .
Unit C Topic 3 Creating a simple example using content provider and persisting
7.12 CSG451 data into database
7.13 Unit D Back Ground Running Process, Networking and Telephony Services
CSG451
Unit D Topic 1 Services - introduction to services – local service, remote service and binding
7.14 CSG451 the service, the communication between service and activity, Handlers, Multi
Threading and Asynchronous Task
Unit D Topic 2 Android network programming Telephony services- SMS and telephony
7.15 CSG451 applications, Broadcast Receivers–Introduction to receivers, pending intent
7.16 CSG451 Unit E Advanced Applications
Unit E Topic 1 Location based services-Google maps services using Google API(Application
7.17 CSG451 Programming Interface), Overview on Twined animations, Property animations-
android media
Unit E Topic 2 Google App engine and connecting Android apps-Cloud Storage. Android application
7.18 CSG451 development guidelines,-publishing android applications
8 Course Evaluation: 100 Marks
8.1 Internal
40 ( Student Seminar, Assignments, Extempore/Presentation, Quiz/surprise test)
Assessment
8.11 Student Seminar
10 (1/syndicate (8-10 student)
(syndicate)
8.12 Assignments 10 (8 Mandatory Assignments)
8.13 Extempore/
10(1/student)
Presentation
8.14 Quiz/surprise test 10 (2 times)
8.2 MTE (Theory) 20 ( 1 MTEs)
8.21 MTE-I 20
8.3 ETE (Theory) 40
References
9
Text book 1.
9.1 Wei-Meng Lee, Beginning Android 4 Application Development Wrox Publications 2012
Supplementary
9.2 Reference(s) 1. Paul Deital and Harvey Deital Android How to Program,Detial associates 2013
2. ZigurdMednieks, Laird Dornin, G. Blake Meike, Masumi Nakamura Programming Android Java
Programming for the New Generation of Mobile Devices O'Reilly Media Released: July 2011
3. Android application development for java programmers. By James C. Sheusi. Publisher: Cengage
Learning, 2013.
Related Free
9.3 http://developer.android.com
Software
Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task.
10 Methods

11. Mapping of Outcomes vs. Topics

Course Name : Mobile Application Development Course Code: CSG451
Out come No. 1 2 3 4 5 6
Syllabus Topic
CSG451.A
CSG451.A1 X
CSG451.A2 X
CSG451.A3 X
CSG451.B X
CSG451.B1 X X
CSG451.B2
CSG451.B3 X
CSG451.C X
CSG451.C1 X
CSG451.C2 X
CSG451.C3 X
CSG451.D
CSG451.D1 X
CSG451.D2 X
CSG451.E X
CSG451.E1 X
CSG451.E2 X

RAYAT BAHRA UNIVERSITY

School of Computer Science & Engineering
B.Tech. (CSE) UGC CBCS: Dept Elective III Year – VI Sem

Theory Course Offered by:
1 Course Code
2 Course Title
3 Credits
4 Contact Hours
(L-T-P)
5 Course Objectives
6 Course Outcome
School: CSE Dept: Computer Science & Engineering
CSE140
Software Testing & Quality Assurance
3-0-0(3)
3-0-0(3)
The objectives of this course are to:
1. Provide an introduction to the software engineering testing process
2. Describe the quality assurance process and its role in software development.
3. The student will be instructed in a variety of testing techniques, methods, and tools.
4. To understand the state of the practice verification and validation techniques.
5. The impact of ISO (International Standard Organization) 9000 and the capability
maturity model on software quality and testing will be addressed.
After studying this subject student will learn the following things:
 1. Develop methods and procedures for software development that can scale up for large
systems and that can be used to consistently produce high-quality software at low cost
and with a small cycle time
2. Student learn systematic approach to the development, operation, maintenance, and
retirement of software
3. Student learn how to use available resources to develop software, reduce cost of software
and how to maintain quality of software
4. Methods and tools of testing and maintenance of software’s.
5. Create test strategies and plans, design test cases, prioritize and execute them.
6. Manage incidents and risks within a project.
7. Contribute to efficient delivery of software solutions and implement improvements in the
software development processes.
8. To gain expertise in designing, implementation and development of computer based
systems and IT processes.
7 Outline syllabus: 40 Lecture Hours
7.01 Unit A
CSE140 Introduction to Testing
Unit A Topic 1
7.02 CSE140 Objective and Need for testing, Psychology of testing, Impracticality of Testing All
data; Impracticality of Testing All Paths
Unit A Topic 2
7.03 CSE140 No Absolute Proof of Correctness, Defect, Difference between defect and bug, Life
cycle of defect
Unit A Topic 3
7.04 CSE140 Testing economics - White box, Black box, Grey box testing, SDLC and Testing -
Verification & Validation, Software Technical Reviews
7.05 Unit B Testing Techniques
CSE140
Unit B Topic 1 White box testing techniques, Statement coverage, Branch Coverage, Condition
7.06 CSE140 coverage
Unit B Topic 2 Decision/Condition coverage, Multiple condition coverage, Dataflow coverage,
7.07 CSE140 Mutation testing, Automated code coverage analysis
Unit B Topic 3 Black box testing techniques, Boundary value analysis, Robustness testing,
7.08 CSE140 Equivalence partitioning, Syntax testing, Finite state testing
7.09 CSE140 Unit C Levels of testing and Traceability
Unit C Topic 1 Software Testing: Levels of Testing, Regression Testing, Requirements
7.10 CSE140 Tracing, Requirement Traceability Matrix, Verification And Validation (V &
V) Standards.
Unit C Topic 2 Identification of Verification And Validation (V & V) Goals and Techniques:
7.11 CSE140 Requirements, Specifications, Designs,
Unit C Topic 3 Implementations, Changes, Organizational Responsibilities Test Automation,
7.12 CSE140 Testing Standards
7.13 Unit D Software Quality Assurance
CSE140
Unit D Topic 1 Software Quality Assurance, test optimization, Eleven Step Testing Process,
CSE140 Assess Project Management Development Estimate and Status, Develop Test
7.14
Plan, Requirements Phase Testing, Design Phase Testing, Program Phase
Testing
Unit D Topic 2 Execute Test and Record Results, Acceptance Test, Report test results, testing
7.15 CSE140 software installation, Test software changes, Evaluate Test Effectiveness,
Testing Security.
7.16 CSE140 Unit E Software Metrics and Class Testing
Unit E Topic 1 Software Reusability, Software Metrics, Software Testing Tools, Defect Tracking
7.17 CSE140 Tools, Defect Management Tools, Challenges
Unit E Topic 2 Error-Oriented Testing and Analysis, Simulation and Prototyping, Class testing
7.18 CSE140 strategies, Class Modality, Message Sequence Specification
8 Course Evaluation: 100 Marks
8.1 Internal
40 ( Student Seminar, Assignments, Extempore/Presentation, Quiz/surprise test)
Assessment
8.11 Student Seminar
10 (1/syndicate (8-10 student)
(syndicate)
8.12 Assignments 10 (8 Mandatory Assignments)
8.13 Extempore/
10(1/student)
Presentation
8.14 Quiz/surprise test 10 (2 times)
8.2 MTE (Theory) 20 ( 1MTEs)
8.21 MTE-I 20
8.3 ETE (Theory) 40
References
9
Text book 1. William Perry, “Effective Methods for Software Testing”, John Wiley & Sons, New York, 1995.
9.1 2. Louise Tamres, “Software Testing”, Pearson Education Asia, 2002
Supplementary 1. CemKaner, Jack Falk, Nguyen Quoc, “Testing Computer Software”, Second Edition, Van
9.2 Reference(s) Nostrand Reinhold, New York, 1993.
2. K.K. Aggarwal&Yogesh Singh, “Software Engineering”, 2nd Ed., New Age International
Publishers, New Delhi, 2005
3. Boris Beizer, “Software Testing Techniques”, Second Edition, Wiley-Dreamtech India, New
Delhi, 2003
4. Boris Beizer, “Black-Box Testing – Techniques for Functional Testing of Software and
Systems”, John Wiley & Sons Inc., New York, 1995.
5. Robert V. Binder, “Testing Object-Oriented Systems-Models, Patterns and Tools”, Addison
Wesley, 1999
Related Free 1. www.telerik.com/teststudio
9.3 Software 2. WebLOAD
3. LoadUI NG Pro
4. Apica LoadTest
Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task.
10 Methods
11. Mapping of Outcomes vs. Topics
Course Name : Software testing and quality assurance Course Code:CSE140

OUTCOME NO  1 2 3 4 5 6 7 8
SYLLABUS TOPIC ↓
X
CSE140.A
X
CSE140.A1
X X
CSE140.A2
X
CSE140.A3
X X
CSE140.B
X
CSE140.B1
CSE140.B2
X
CSE140.B3
X X
CSE140.C
X
CSE140.C1
X
CSE140.C2
CSE140.C3
X
CSE140.D
X X
CSE140.D1
X
CSE140.D2
X X
CSE140.E
X
CSE140.E1
X
CSE140.E2
 RAYAT-BAHRA UNIVERSITY
University School of Engineering & Technology (USET)
Department of Computer Science& Engineering
Department Core (DSC-II)
B. Tech. (CSE) UGC CBCS: Department Specific III Year 6th Sem
Core
Theory Offered by: School: USET Dept: Computer Science & Engineering
1 Course Code CSE139
2 Course Title Unified Modeling Language
3 Credits 3-0-0 (3)
Contact Hours
4 3-0-0 (3)
(L-T-P)
1. To make the student understand model the software architecture using different UML
5 Course Objectives diagrams.
2. To make the Student learn the object oriented system
On successful completion of this course, students will be able to
1. Describe orthogonal views of software .
2. Demonstrate the Object Oriented Systems Development.
3. Illustrate the need of object oriented concepts to develop a model
4. Describe the conceptual model of UML
5. Design Basic & Advanced Structural Modeling.
6. Design class Diagrams and object Diagrams .
6 Course Outcomes 7. Demonstrate Basic & Advanced Behavioural.
8. Discuss roles packages interfaces
9. Demonstrate interaction diagrams and use case diagrams
10. Design Activity Diagrams for various problems
11. Comparison of Deployment Diagram with Component Diagram
12. Design Architectural Modeling
13. Design a software architecture by using various models
7 Outline Syllabus: 40 Lecture Hours;
7.01 CSP201.A Unit A An Overview Of Object Oriented Systems Development
7.02 CSP201.A1 Unit A Topic 1 Introduction, Two Orthogonal Views Of The Software
7.03 CSP201.A2 Unit A Topic 2 Object Oriented Systems Development Methodology

7.04 CSP201.A3 Unit A Topic 3 Need for Object Orientation

7.05 CSP201.B Unit B Object Oriented Modeling and UML

7.06 CSP201.B1 Unit B Topic 1 Object Oriented Modelling: The Importance Of Modelling
7.07 CSP201.B2 Unit B Topic 2 Principles Of Modelling, Object Oriented Modelling
An Overview Of The UML, A Conceptual Model Of The UML
7.08 CSP201.B3 Unit B Topic 3

7.09 CSP201.C Unit C Basic Structural Modeling

Class diagrams Advanced Structural Modeling: Advanced classes, advanced
7.10 CSP201.C1 Unit C Topic 1
relationships, Interfaces
7.11 CSP201.C2 Unit C Topic 2 Classes, Relationships, Common Mechanisms, and diagrams
Types and Roles, Packages, Object diagrams .
7.12 CSP201.C3 Unit C Topic 3

7.13 CSP201.D Unit D Basic Behavioral Modeling

7.14 CSP201.D1 Unit D Topic 1 Interactions, Interaction Diagrams, Use Cases, Use Case Diagrams,.
7.15 CSP201.D2 Unit D Topic 2 Advanced Behavioral Modeling: Events And Signals
7.16 CSP201.D3 Unit D Topic 3 Processes And Threads
7.17 CSP201.E Unit E Architectural Modeling
Component, deployment, component diagrams and deployment diagrams,
7.18 CSP201.E1 Unit E Topic 1
Architectural modeling
7.19 CSP201.E2 Unit E Topic 2 Patterns and frameworks, collaborations, systems and models .
7.20 CSP201.E3 Unit E Topic 3 Case Study: Bank ATM Application, Railway Reservation System.
8 Course Evaluation: 100 Marks
Internal
8.1 40% (Class Teacher and Dept or School Panel)
Assessment
Attendance
8.11 5% (75-80% 1 mark, 81-85% 2 marks, 86-90% 3 marks, 91-95% 4 marks, 96-100% 5 marks)
(Theory)
8.12 Homework (Theory) 5%(5 Mandatory Assignments)
8.13 Quiz (Theory) 5%1 (Better of 2 Quiz or other Suitable Means)
Class
8.14 Presentation/Report 10%
Faculty Discretion or
8.15 other suitable 5%
means
8.16 Any other Non-Credit Work by Teacher
8.2 MTE (Theory) 20% (Better of 2 MTEs)
8.3 ETE (Theory): 40%
9 References
Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, 2nd
9
.
1Text book Edition, Pearson Education, 2007.

1. Meilir Page-Jones, “Fundamentals of Object Oriented Design in UML”, 1st Edition, Pearson
Education, 2006.
2. Pascal Roques, “Modeling Software Systems Using UML2”, 1st Edition, WILEY Dreamtech, 2007.
Supplementary
9
.
2 3. Atul Kahate, “Object Oriented Analysis & Design”, 1stEdition, TMH, 2007.
Reference(s)
4. Mark Priestley, “Practical Object-Oriented Design with UML”, 2nd Edition, TMH, 2005.
5. Craig Larman, “Appling UML and Patterns: An introduction to Object”, Oriented Analysis and
Design and Unified Process, 3rd Edition, Pearson Education, 2007.
1Pedagogical White/Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task/ Lab Experiments &
0
Methods Demonstrations
11. Mapping of Outcomes vs. Topics
Course Name : Object Oriented Analysis and Design Course Code: CSP201
Outcome No. → 1 2 3 4 5 6 7 8 9 10 11 12 13
Syllabus Topic↓
CSP201.A X X X
CSP201.A1 X
CSP201.A2 X
CSP201.A3 X
CSP201.B X X X
CSP201.B1 X
CSP201.B2 X
CSP201.B3 X
CSP201.C X X X
CSP201.C1 X
CSP201.C2 X
CSP201.C3 X
CSP201.D X X X X
CSP201.D1 X X
CSP201.D2 X
CSP201.D3 X X
CSP201.E X X X
CSP201.E1 X
CSP201.E2 X
CSP201.E3 X

B.Tech
Theory Course Offered by:
1 Course Code
2 Course Title
3 Credits
4 Contact Hours (L-T-P)
5 Course Objectives
6 Course Outcomes
RAYAT-BAHRA UNIVERSITY
University School of Engineering
Department Elective
DSE-VIII
UGC-CBCS III Year - VI Sem
Department Specific
Elective
School: USET Dept: CSE
CSE142
Big Data Analytics
3-1-0 (4)
3-1-0 (4)
1.To provide an overview of an exciting growing field of Big Data analytics.
2. To discuss the challenges traditional data mining algorithms face when analyzing Big Data.
3. To introduce the tools required to manage and analyze big data like Hadoop, NoSql
MapReduce.
4. To teach the fundamental techniques and principles in achieving big data analytics with
scalability and streaming capability.
5. To introduce to the students several types of big data like social media, web graphs and data
streams.
6. To enable students to have skills that will help them to solve complex real world problems in for
decision support.
22GHJKHTOTORGHJGKLKKKKJLK2TTTT
On successful completion of this course, Students will be able to
1. Explain the motivation for big data systems and identify the main sources of Big Data in the
real world.
2. Demonstrate an ability to use frameworks like Hadoop,NOSQL to efficiently store retrieve and
process Big Data for Analytics.
3. Implement several Data Intensive tasks using the Map Reduce Paradigm
4. Apply several newer algorithms for Clustering Classifying and finding associations in Big Data
5. Design algorithms to analyze Big data like streams, Web Graphs and Social Media data.
6. Implement HADOOP and Map Reduce technologies associated with big data analytics
7.Design and implement successful Recommendation engines for enterprises.

7 Outline Syllabus: 26 Lecture Hours;

7.01 CSE142.A Unit A Introduction to Big Data
Introduction to Big Data Platform – Challenges of
Conventional Systems - Intelligent data analysis – Nature of
CSE142.A Unit A Topic
Data - Analytic Processes and Tools - Analysis vs Reporting
Modern Data Analytic Tools - Statistical Concepts:
Sampling Distributions - Re-Sampling- Statistical Inference
- Prediction Error
7.02 CSE142.B Unit B Modern Data Analytic Tools
CSE142 B Unit B Topic
Statistical Concepts: Sampling Distributions - Re-Sampling-
Statistical Inference - Prediction Error.
7.03 CSE142.C Unit C Mining Data Streams
CSE142 .C Unit C Topic
Introduction To Streams Concepts – Stream Data Model and
Architecture – Stream Computing - Sampling Data in a
Stream – Filtering Streams – Counting Distinct Elements in
 a Stream – Estimating Moments – Counting Oneness in a
Window –Decaying Window - Real time Analytics
Platform(RTAP) Applications - Case Studies -Real Time
Sentiment Analysis, Stock Market Predictions..

7.04 CSE142.D Unit D HADOOP

History of Hadoop- The Hadoop Distributed File System –
Components of Hadoop-Analyzing the Data with Hadoop-
Scaling Out- Hadoop Streaming- Design of HDFS-Java
interfaces to HDFS Basics- Developing a Map Reduce
CSE142.D Unit D Topic
Application-How Map Reduce Works-Anatomy of a Map
Reduce Job run-Failures-Job Scheduling-Shuffle and Sort –
Task execution - Map Reduce Types and Formats- Map
Reduce Features
7.05 CSE142.E Unit E HADOOP ENVIRONMENT
Setting up a Hadoop Cluster - Cluster specification - Cluster
Setup and Installation –Hadoop Configuration-Security in
CSE142.E1 Unit E Topic 1 Hadoop - Administering Hadoop – HDFS – Monitoring-
Maintenance-Hadoop benchmarks- Hadoop in the cloud.

7.06 CSE142.F Unit F Frameworks and Visualizations

Applications on Big Data Using Pig and Hive – Data

CSE142.F1 Unit E Topic 1
processing operators in Pig – Hive services – HiveQL –
Querying Data in Hive - fundamentals of HBase and
ZooKeeper -IBM InfoSphereBigInsights and Streams.
Visual data analysis techniques, interaction techniques;
CSE142.F2 Unit E Topic 2
Systems and applications
8 Course Evaluation: 100 Marks
8.1 Internal Assessment 40% (Class Teacher)
8.11 Attendance 10% (75-80% 2 marks, 81-85% 4 marks, 86-90% 6 marks, 91-95% 8 marks, 96-100% 10 marks)

8.12 Homework 10% (5 Mandatory Assignments)

Quiz/ Presentations/
8.13 20% (2 Better of 3 Quiz or other Suitable Means)
Activities
8.2 MTE 20% (Better of 2 MTEs)
8.3 ETE: 40%
9 References
9.1 Text book 1. Tom White “Hadoop: The Definitive Guide” Third Edition, O’reilly Media
9.2 Supplementary 1. Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques”, Second Edition,
Reference(s) Elsevier, Reprinted 2008.
2. Da Ruan, Guoquing Chen, Etienne E. Kerre, Geert Wets, Intelligent Data
Mining,Springer,2007
3. Paul Zikopoulos ,Dirk deRoos , Krishnan Parasuraman , Thomas Deutsch , James Giles ,
David Corrigan , Harness the Power of Big Data The IBM Big Data Platform, TataMcGraw
Hill Publications, 2012
4. Michael Minelli (Author), Michele Chambers (Author), Ambiga Dhiraj (Author) , Big Data,
 Big Analytics: Emerging Business Intelligence and Analytic Trends for Today's Businesses,
Wiley Publications,2013

9.3 Free Software WEKA

10 Pedagogical Methods White/Black Board/ Scenarios/ PPT/ Video Lecture/ Role Play/ Group Discussion and Task

11. Mapping of Outcomes vs. Topics

Course Name : Big Data Analytics Course Code: CSE142

OUTCOME NO  1 2 3 4 5 6 7
SYLLABUS TOPIC ↓
CSE142.A X
CSE142.B X
CSE142.C X
CSE142.D X
CSE142.E X
CSE142.F1 X
CSE142.F2 X
 RAYAT-BAHRA UNIVERSITY
University School of Engineering & Technology (USET)
Department of Computer Science & Engineering

Department Elective (DSE-III) III Year - VI Sem

B.Tech. (CSE)
UGC CBCS: Department Specific Elective

Dept: Computer Science &

Theory & Lab Course Offered by: School: USET Engineering
1 Course Code CSE121
2 Course Title Image Processing
3 Credits 3-0-0 (3)
4 Contact Hours
3-0-0 (3)
(L-T-P)
The objective of this course is to provide an introduction to the theory and applications of digital image
5 Course processing.

Objectives
On successful completion of this course, students will be able to:
6 Course 1. Understand image formation and
the role human visual system plays in perception of gray and color image data.
Outcome
2. Analyze image sampling and quantization requirements and implications .
 3. Get broad exposure to and understanding of various applications of image processing in industry,
medicine, and defense.
4. Learn the signal processing algorithms and techniques in image enhancement and
image
restoration.
5. Apply histogram equalization for image enhancement.
6. Use and implement order-statistics image enhancement methods .
7. Design and implement two-dimensional spatial filters for image enhanceme nt.
8. Perform Gray level transformations for Image enhancement.
9. Acquire an appreciation for the image processing issues and techniques and be able to apply these
techniques to real world problems .
10. Model the image restoration problem in both time an d frequency domains .
11. Be able to conduct independent study and analysis of image processing problems
and techniques .
12. Explain the representation of colors in digital color images .

7 Outline Syllabus: 40 Lecture Hours; 26 Lab Hours;

7.01 CSE211.A Unit A Digital Image Fundamentals And Transform
7.02 CSE211.A1 Unit A Topic 1 Elements of visual perception, Image sampling and quantization

7.03 CSE211.A2 Unit A Topic 2 Basic relationship between pixels

7.04 CSE211.A3 Unit A Topic 3 Basic geometric transformations

7.05 CSE211.B Unit B Introduction to Fourier Transform and DFT

Properties of 2D Fourier Transform – FFT – Separable Image
7.06 CSE211.B1 Unit B Topic 1 Transforms
7.07 CSE211.B2 Unit B Topic 2 Walsh – Hadamard
7.08 CSE211.B3 Unit B Topic 3 Discrete Cosine Transform

7.09 CSE211.C Unit C Image Enhancement Techniques

Spatial Domain methods: Basic grey level transformation –
7.10 CSE211.C1 Unit C Topic 1 Histogram equalization

7.11 CSE211.C2 Unit C Topic 2 Image subtraction – Image averaging –Spatial filtering: Smoothing
sharpening filters – Laplacian filters – Frequency domain filters:
7.12 CSE211.C3 Unit C Topic 3 Smoothing

7.13 CSE211.D Unit D Image Restoration and Image Compression

Model of Image Degradation/restoration process – Noise models
7.14 CSE211.D1 Unit D Topic 1 – Inverse filtering
-Least mean square filtering – Constrained leas t mean square filtering
 Lossless compression: Variable length coding – LZW coding – Bit
7.15 CSE211.D2 Unit D Topic 2 plane coding-

predictive coding-DPCM. Lossy Compression: Transform coding – Wavelet coding

7.16 CSE211.D3 Unit D Topic 3 Basics of Image compression standards: JPEG, MPEG

7.17 CSE211.E Unit E Image Segmentation and Image Representation

7.18 CSE211.E1 Unit E Topic 1 Edge detection – Thresholding - Region Based segmentation
7.19 CSE211.E2 Unit E Topic 2 Boundary representation: chair codes - Polygonal approximation – Boundary
segments
7.20 CSE211.E3 Unit E Topic 3 Boundary descriptors: Simple descriptors-Fourier descriptors

8 Course Evaluation: 200 Marks

Internal
8.1 40% (Class Teacher and Dept or School Panel)
Assessment
8.2 10% (75-80% 2 marks, 81-85% 4 marks, 86-90% 6 marks,
Attendance
Attendance 91-95% 8 marks, 96-100% 10 marks)

8.3 Homework 5% (5 Mandatory Assignments)

8.4 Quiz 10% (2 Better of 3 Quiz or other Suitable Means)

8.5 Presentation/ Report 10%

8.6 Faculty Discretion 5%

8.2 MTE 20% (Better of 2 MTEs)

8.3 ETE (Theory Component):40%
9 References
9.1 Text book Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson Education 2003.
Supplementay
9.2 Reference(s) William K Pratt, Digital Image Processing John Willey (2001)
9.3 Related Free Matlab
Software

10 Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task
Methods
 11. Mapping of Outcome vs. Topics

Outcome No. → 1 2 3 4 5 6 7 8 9 10 11 12
Syllabus Topic↓

CSE211.A X X X
CSE211.A1 X X
CSE211.A2 X
CSE211.A3 X
CSE211.B X
CSE211.B1 X
CSE211.B2 X
CSE211.B3 X
CSE211.C X X X X
CSE211.C1 X X
CSE211.C2 X
CSE211.C3 X
CSE211.D X X X
CSE211.D1 X X X
CSE211.D2 X X
CSE211.D3 X X
CSE211.E X X
CSE211.E1 X X
CSE211.E2 X X
CSE211.E3 X X

[Type text]
 RAYAT BAHRA UNIVERSITY
School of Computer Science & Engineering
B.Tech. (CSE) UGC CBCS: Dept Elective III Year – VI Sem

Theory Course Offered by: School: CSE Dept: Computer Science & Engineering
1 Course Code CSE118
2 Course Title Data Mining
3 Credits 3-0-0(3)
4 Contact Hours 3-0-0(3)
(L-T-P)
5 Course Objectives The objectives of this course are to:

1. To understand the concepts of Data warehousing, Multi-dimensional data model,

Warehouse schema.
2. To use Query tools and Applications
3. To understand the concepts of Online Analytical Processing, Data Mining and
Knowledge Discovery
4. To understand the concepts of Mining Frequent Patterns, Associations and
Correlations
6 Course Outcome
After studying this subject student will learn the following things:
1. Provide efficient distribution of information and easy access to data and user friendly
reporting environment.
2. Understand the various tools of Data Warehousing
3. Elaborate the various types of Data Marts and how to load a data mart
4. Implement various query tools for business Analysis
5. Illustrate the various data Mining Rules and associations.
6. Describe the use and applications of Online Analytical Processing
7. Illustrate the unseen pattern in large volumes of historical data that helps to manage an
organization efficiently.
8. Understand the concepts of various data mining Techniques
9. Compare and analyse various applications of data mining
7 Outline syllabus: 40 Lecture Hours
7.01 Unit A
CSE118 Introduction of Data Warehousing
Unit A Topic 1
7.02 CSE118 Data warehousing – definitions and characteristics, Multi-dimensional data model,
Warehouse schema.
Unit A Topic 2
CSE118 Developing a Data Warehousing: Building of a Data Warehousing, Architectural
7.03 strategies & organizational issues, design considerations, data content, distribution of
data, Tools for Data Warehousing
Unit A Topic 3
CSE118 Data Marts: Data marts, types of data marts, loading a data mart, metadata, data
7.04 model, nature of data, software components; external data, reference data,
performance issues, monitoring requirements and security in a data mart
7.05 Unit B Business Analysis
CSE118
Unit B Topic 1 Reporting and Query tools and Applications – Tool Categories – The Need for
7.06 CSE118 Applications.
Unit B Topic 2 Online Analytical Processing (OLAP) – Need – Multidimensional Data Model –
7.07 CSE118 Online Analytical Processing (OLAP) Guidelines – Multidimensional versus
Multi-relational Online Analytical Processing (OLAP)
Unit B Topic 3 Online Transport Processing (OLTP) Versus Online Analytical Processing
7.08 CSE118 (OLAP) systems, Data Modelling, Categories of Tools – Online Analytical
Processing (OLAP) Tools
7.09 CSE118 Unit C Data Mining and Knowledge Discovery
Unit C Topic 1 Introduction – Data – Types of Data – Data Mining Functionalities –
7.10 CSE118 Interestingness of Patterns – Classification of Data Mining Systems
Unit C Topic 2 Data Mining Task Primitives – Integration of a Data Mining System with a Data
7.11 CSE118 Warehouse – Issues –Data Pre-processing
Unit C Topic 3 KDD (Knowledge Discovery database) versus Data Mining; DBMS(Database
7.12 CSE118 Management System) versus Data Mining, Data Mining Techniques; Issues and
challenges
7.13 Unit D Association Rule Mining And Classification
CSE118
7.14 Unit D Topic 1 Mining Frequent Patterns, Associations and Correlations – Mining Methods –
CSE118 Mining various Kinds of Association Rules, Association Rules : A priori

[Type text]
 algorithm, Partition algorithm
7.15 Unit D Topic 2 Classification and Prediction - Basic Concepts - Decision Tree Induction
CSE118
7.16 CSE118 Unit E Clustering and Web Mining
Unit E Topic 1 Cluster Analysis - Types of Data – Categorization of Major Clustering Methods –
7.17 CSE118 Partitioning Methods – Hierarchical Methods - Density-Based Methods
7.18 Unit E Topic 2 Web content Mining, Web structure Mining, Web usage Mining, Text Mining
CSE118
8 Course Evaluation: 100 Marks
8.1 Internal
40 ( Student Seminar, Assignments, Extempore/Presentation, Quiz/surprise test)
Assessment
8.11 Student Seminar
10 (1/syndicate (8-10 student)
(syndicate)
8.12 Assignments 10 (8 Mandatory Assignments)
8.13 Extempore/
10(1/student)
Presentation
8.14 Quiz/surprise test 10 (2 times)
8.2 MTE (Theory) 20 ( 1 MTEs)
8.21 MTE-I 20
8.3 ETE (Theory) 40
References
9
Text book 1. Alex Berson and Stephen J. Smith, ― Data Warehousing, Data Mining & OLAPǁ, Tata McGraw –
9.1 Hill Edition, Thirteenth Reprint 2008.
2. 2. Jiawei Han and MichelineKamber, ―Data Mining Concepts and Techniquesǁ, Third Edition,
Elsevier, 2012.
Supplementary 1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, ― Introduction To Data Miningǁ, Person
9.2 Reference(s) Education, 2007.
2. 2. K.P. Soman, ShyamDiwakar and V. Ajay ―, Insight into Data mining Theory and Practiceǁ, Easter
Economy Edition, Prentice Hall of India, 2006.
3. 3. G. K. Gupta, ― Introduction to Data Mining with Case Studiesǁ, Easter Economy Edition, Prentice
Hall of India, 2006.
4. 4. Daniel T.Larose, ―Data Mining Methods and Modelsǁ, Wiley-Interscience, 2006
Related Free 1. www.rdatamining.com/resources/tools
9.3 Software 2. http://www.kdnuggets.com/software/suites.html
3. R-Programming
4. NLTK
Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task.
10 Methods

[Type text]
11. Mapping of Outcomes vs. Topics
Course Name: Data Mining Course Code: CSE118

OUTCOME NO  1 2 3 4 5 6 7 8 9
SYLLABUS TOPIC ↓

CSG401.A
X
CSG401.A1
X X
CSG401.A2
X
CSG401.A3
CSG401.B
X
CSG401.B1
X
CSG401.B2
X
CSG401.B3
CSG401.C
X
CSG401.C1
X
CSG401.C2
X
CSG401.C3
CSG401.D
X
CSG401.D1
X X
CSG401.D2
CSG401.E
X
CSG401.E1
X
CSG401.E2

[Type text]
 RAYAT BAHRA UNIVERSITY
School of Computer Science & Engineering
B.Tech. (CSE) UGC CBCS: Dept Elective III Year – VI Sem

Theory Course Offered by: School: CSE Dept: Computer Science & Engineering
1 Course Code CSE135
2 Course Title Soft Computing
3 Credits 3-0-0(3)
4 Contact Hours 3-0-0(3)
(L-T-P)
5 Course Objectives The objectives of this course are to:

1. To make student familiarize with soft computing concepts.

2. To make student introduce the ideas of neural networks, fuzzy logic and use of heuristics
based on human experience.
3. To make student understand the concepts of Genetic algorithm and its applications to soft
computing using some applications.
6 Course Outcome
After studying this subject student will learn the following things:
1.Understand the basic concept of Soft Computing
2.Illustrate the various learning methods in Artificial Neural Networks.
3. Implement and maintain reliable, scalable, distributed systems with Apache Hadoop.
4.Elaborate about fuzzy sets and its various properties
5.Describe the working principle of Genetic Problems
6.Apply Hadoop ecosystem components.
7.Design, implement, and evaluate the core algorithms underlying an end-to-end data
science workflow, including the experimental design, data collection, mining, analysis,
and presentation of information derived from large datasets.
8. Evaluate the use of data from acquisition through cleansing, warehousing, analytics, and
visualization to the ultimate business decision
9. Execute real-time analytical methods on streaming datasets to react quickly to customer
needs.
10. Compare the various applications of Computational Intelligence
7 Outline syllabus: 40 Lecture Hours
7.01 Unit A
CSE135 Introduction to Soft Computing
Unit A Topic 1
7.02 CSE135 Introduction to Soft Computing & Neural Computing, Fundamentals of Artificial
Neural Network (ANN), Models of Artificial Neural Network (ANN)
Unit A Topic 2
CSE135 Architectures of Artificial Neural Network (ANN), Feed Forward, Feed backward and
7.03 Recurrent Network, Learning Methods in Artificial Neural Network (ANN),
Taxonomy of Artificial Neural Network (ANN) System.
Unit A Topic 3
CSE135 Introduction to Error Back Propagation Network (EBPN), Back Propagation Learning,
7.04 Error Back Propagation Learning Algorithm, Associative Memory, Auto Associative
Memory, Bidirectional Hetro Associative Memory
7.05 Unit B Fuzzy Set Theory
CSE135
Unit B Topic 1 Introduction to Fuzzy Sets & Crisp Sets, Fuzzy Membership and Fuzzy
7.06 CSE135 Operations, Properties of Fuzzy Sets
Unit B Topic 2 Crisp Relations and Fuzzy Relations, Fuzzy If-Then Rules, Fuzzy System, Crisp
7.07 CSE135 Logic, Propositional Logic and its Laws, Inference in Propositional Logic
Unit B Topic 3 Fuzzy Rule Based System, Fuzzy fictions & Defuzzi fictions, Applications of
7.08 CSE135 Fuzzy Logic
7.09 CSE135 Unit C Genetic Algorithm
Unit C Topic 1 Difference between Traditional Algorithms and Genetic Algorithms, The basic
7.10 CSE135 operators, Schema theorem, applications in search and optimization.
7.11 Unit C Topic 2 Working Principles of Genetic Algorithms, Flow Chart of Genetic Programming
CSE135
Unit C Topic 3 Operators of Genetic Algorithms, Encoding, Fitness Function, Reproduction,
7.12 CSE135 Cross Over, Mutation.
7.13 Unit D Machine Learning
CSE135
Unit D Topic 1 Learning form Examples - Inductive Concept Learning, Sequence Prediction,
7.14 CSE135 and Effect of Noise in Input. Learning by Analogy, Concept formation,
Derivational Analogy

[Type text]
 CSE135 Unit D Topic 2 Learning by Observation and Discovery, Search for Regularity, Conceptual
7.15
Clustering, Computational Learning Theory.
7.16 CSE135 Unit E Applications Of Computational Intelligence
Unit E Topic 1 Shortest Path Algorithm, Printed Character Recognition, Inverse Kinematics Problems
7.17 CSE135 , Automobile Fuel Efficiency Prediction
7.18 Unit E Topic 2 Soft Computing for Color Recipe Prediction, Stock Marker Forecasting
CSE135
8 Course Evaluation: 100 Marks
8.1 Internal
40 (Student Seminar, Assignments, Extempore/Presentation, Quiz/surprise test)
Assessment
8.11 Student Seminar
10 (1/syndicate (8-10 student)
(syndicate)
8.12 Assignments 10 (8 Mandatory Assignments)
8.13 Extempore/
10(1/student)
Presentation
8.14 Quiz/surprise test 10 (2 times)
8.2 MTE (Theory) 20 ( 1 MTEs)
8.21 MTE-I 20
8.3 ETE (Theory) 40
References
9
Text book 1. S. Rajsekaran & G.A. Vijayalakshmi Pai(2003), “Neural Networks, Fuzzy Logic and
9.1 GeneticAlgorithm: Synthesis and Applications”, 4th Edition, Prentice Hall of India.
Supplementary 1. Timothy J Ross (2009), "Fuzzy Logic with Engineering Applications", 3rd Edition, John Wiley and
9.2 Reference(s) Sons.
2. David E. Goldberg (2009), "Genetic Algorithm in Search Optimization and Machine Learning
",Adission-Wesley.
3. Karray (2009), “Soft Computing and Intelligent Systems Design: Theory, Tools and Applications”, 1st
Edition, Pearson Education.
Related Free 1. Apache Spark MLlib
9.3 Software 2. GraphLab
3. WSO2 Machine Learner
4. https://www.tensorflow.org/
Pedagogical Black Board/ Scenarios/ PPT/ Video Lecture/ Group Discussion and Task.
10 Methods

[Type text]
11. Mapping of Outcomes vs. Topics
Course Name: Soft Computing Course Code: CSE135

OUTCOME NO  1 2 3 4 5 6 7 8 9 10
SYLLABUS TOPIC ↓

CSG401.A
X
CSG401.A1
X X
CSG401.A2
X
CSG401.A3
CSG401.B
X
CSG401.B1
X
CSG401.B2
X
CSG401.B3
CSG401.C
X
CSG401.C1
X
CSG401.C2
X
CSG401.C3
CSG401.D
X X
CSG401.D1
X X
CSG401.D2
CSG401.E
X X
CSG401.E1
X X
CSG401.E2

[Type text]