Bachelor of Technology (Computer Science & Engineering)

Scheme of Studies/Examination
Semester VII
S. Course No. Subject L:T:P Hours/ Examination Schedule Duration
No. Week of Exam
(Hrs.)
Major Minor Practical Total
Test Test
1 CSE 401N Unix & 4:0:0 4 75 25 0 100 3
Linux
Program-
ming
2 CSE 403N Computer 4:0:0 4 75 25 0 100 3
Graphics
and
Animation
3 PE-I Elective* – I 3:0:0 3 75 25 0 100 3
4 PE-II Elective* – 3:0:0 3 75 25 0 100 3
II
5 CSE 405N Computer 0:0:2 2 0 40 60 100 3
Graphics
Lab
6 CSE 407N Project-I** 0:0:9 9 0 100 100 200 3
7 CSE 409N Unix & 0:0:2 2 0 40 60 100 3
Linux
Program-
ming Lab
8 CSE 411N Seminar 0:0:2 2 0 100 0 100
9 CSE 413N Industrial 100 0 100
Training
(Viva-
Voce)***
Total 29 300 480 220 1000

Code PE-I Code PE-II

CSE-415N Object Oriented Software Engineering CSE-421N Agile Software Engineering
CSE-417N Cyber Security CSE-423N Big Data and Analytics
CSE-419N Cryptography & Information Security CSE-425N Expert Systems

Note:
*The students will choose any two departmental electives courses out of the given elective list in 7 thSemester.
**Project should be initiated in the beginning of 7thsemester, and should be completed by the end of 8thsemester with
good Report and power-point Presentation etc.
***4-6 weeks hand on training completed after 6 thSemester Exams.
 CSE-401N Unix & Linux Programming

Lecture Tutorial Practical Major Test Minor Test Total Time

4 0 0 75 25 100 3 Hrs.
Purpose Introduces commands and numerous programming concepts and application domains to
cover important topics for implementation of the Unix programming concepts.

Course Outcomes (CO)

CO1 To learn basic and advanced Unix Commands.
CO2 Expose the role of filters and file compression techniques.
CO3 To explore knowledge of programming language development tools.
CO4 To expand knowledge of Unix/Linux system administration and networking.

Unit I: Basic Command Usage

Linux Startup: User accounts, accessing Linux - starting and shutting processes, Logging in andLogging out,
Unix commands like zip, unzip, pack, unpack, compress, uncompress, Shell Programming, Unix file system:
Linux/Unix files, i-nodes and structure, file systemrelated commands, Shell as command processor, shell
variables, creating command substitution, scripts, functions, conditionals, loops, customizing environment

Unit II: Filters and File Compression

Regular Expressions and Filters: Introducing regular expressions patterns, syntax, character classes,
quantifiers, introduction to grep, egrep, sed, programming with awk and perl, File Compression Techniques:
data redundancy elimination using fingerprint generation deduplication and data similarities removal using
delta techniques for data reduction storage, parallel compression with Xdelta utility.

Unit III: Program Development Tools

The C Environment: C compiler, vi editor, compiler options, managing projects, memory management, use of
makefile, cmake, dependency calculations, memory management – static and dynamic memory, static and
dynamic libraries, dynamic loader, debugging tools like gdb, fixed-size and variable-size blocks of data files
chunks divisor chunking techniques like Frequency Based Chunking and Content Defined Chunking Unix
based open source coding.

Unit IV: Process Control

Processes in Linux: Processes, starting and stopping processes, initialization processes, rc and init files, job
control - at, batch, cron, time, network files, security, privileges, authentication,password administration,
archiving, Signals and signal handlers, Threading, Linux I/O system, Networking tools like ping, telnet, ftp,
route, Firewalls, Backup and Restore tar, cpio, dd.
Case Study: PCOMPRESS open source free software

Text Books:
1. John Goerzen: Linux Programming Bible, IDG Books, New Delhi, 2014.
2. Sumitabha Das: Unix – Concept and Applications, Fourth Edition TMH, 2015.
3. Neil Matthew, Richard Stones: Beginning Linux Programming, 4 th. Edition, Wrox-Shroff, 2011.
4. Welsh & Kaufmann: Running Linux, O'Reiley & Associates, 2013.

Reference Book:
1. B.M. Harwani, Unix and Shell Programming, Oxford University Press, 2013.
 CSE-403N Computer Graphics and Animation
Lecture Tutorial Practical Major Test Minor Test Total Time
4 0 0 75 25 100 03 Hrs.
Purpose Introduces Computer Graphics that help in designing different kinds of static and movable
objects.
Course Outcomes (CO)
CO1 Explore the background and standard line and circle drawing algorithms.
CO2 Exposure of various transformation approaches and its comparative analysis.
CO3 Illustrate Projection and clipping with explore different techniques.
CO4 Apply design principles to create different curves and explore hidden lines and surface
techniques.

Unit-I
Computer Graphics applications, Display Devices, Point & Positioning Devices, Plotting Techniques for
point and Line, Line drawing algorithms: DDA, Bresenhams’s Circle drawing algorithms, Filled area
algorithms: Scan line, Polygon filling algorithms, Boundary filled algorithms.

Unit-II
Window to view port transformation, Window to view port mapping, Two Dimensional transformation:
translation, scaling, rotation, reflection and Shear, Homogeneous Coordinate system.
3-D transformation: Rotation, Shear, translation, Numerical Problems of transformation viewing pipeline.

Unit-III
Clipping: Point & Line clipping algorithm, 4-bit code algorithm, Cohen-Sutherland Line clipping algorithms,
Liang-Barsky line clipping algorithms. Polygon clipping: Sutherland-Hodgeman Polygon clipping algorithm.
Curve clipping, Text clipping.
Projection: Parallel, Perspective, Vanishing Points.

Unit-IV
Representation of 3-D Curves and Surfaces: interpolation and approximation alpines, parametric conditions,
Geometric continuity conditions, Beizer curves and surfaces: properties of beizer curves, beizer surfaces.
Hidden Surfaces removal: Hidden surface elimination, depth buffer algorithm, scan line coherence and area
coherence algorithm, priority algorithm

Text Books
1. Donald Hearn & M.Pauline Baker, Computer Graphics, 2nd Edition, Pearson Education.
2. William M. Newmann & Robert F. Sproull, Principles of Interactive Computer Graphics, Tata
McGraw-Hill Second Edition, New Delhi, India.
3. Zhigang Xiang & Roy A Plastock , Computer Graphics, Second Edition, Schaum’s Outline, Tata
McGraw Hill Education Private Limited, New Delhi, India.
Reference Book
1. Foley, van Dam, Feiner, and Hughes. Computer Graphics: Principles and Practice, 3rd edition in C.
 CSE-415N Object Oriented Software Engineering
Lecture Tutorial Practical Major Test Minor Test Total Time
3 0 0 75 25 100 3 Hrs.
Purpose To provide the thorough knowledge to use the concepts and their design attributes for
Object Oriented Software Engineering approaches and platforms to solve real time
problems.
Course Outcomes (CO)
CO1 To learn the basic concepts of object oriented systems and software engineering.
CO2 To get exposure of various object modeling methodologies, tools for analyzing and
designing software based systems using UML.
CO3 To explore problems using Use Cases, analyzing relations, responsibilities and
collaborations among classes and their behavior in problem domain.
CO4 To evaluate object oriented design processes using models, design patterns, interfaces
designs and communication mechanisms for performing required tasks.

Unit - I
An Overview of Object-Oriented system Development, Objects Basis, Class Hierarchy, Inheritance,
Polymorphism, Object Relationships and Associations, Aggregations and Object Containment, Object
Persistence, Meta-Classes, Object Oriented Systems Development Life Cycle: Software Development
Process, Object Oriented Systems Development: A Use-Case Driven Approach.

Unit - II
Object Oriented Methodologies:Rumbaugh Methodology, Jacobson Methodology, BoochMethodology,
Patterns, Frameworks, The Unified approach, Unified Modeling Language (UML)
Unit - III
Object Oriented Analysis Process, Use Case Driven Object Oriented Analysis, Use Case Model,Object
Analysis: Classification, Classification Theory, Approaches for identifying classes, Responsibilities and
Collaborators, Identifying Object Relationships, Attributes and Methods: Associations, Super-Sub Class
relationships, A-Part-of-Relationships-Aggregation, Class Responsibilities, Object Responsibilities.
Unit - IV
Object Oriented Design process and Design Axioms, Corollaries, Design Patterns, Designing Classes: Object
Oriented Design Philosophy, UML Object Constraint Language, Designing Classes: The Process, Class
Visibility, Refining Attributes, Designing Methods and Protocols, Packages and Managing classes, View
Layer: Designing Interface objects,Designing View layer Classes, Macro and Micro Level Interface Design
Process.

Text Books:
1. Ali Bahrami, Object Oriented Systems Development, McGraw Hill Publishing Company Limited,
New Delhi, 2013.
2. Rumbaugh et al., Object Oriented Modeling and Design, PHI, 2006.
3. Robert Laganière and Timothy C. Lethbridge, Object-Oriented Software Engineering: Practical
Software Development, McGraw-Hill Publishing Company Limited, New Delhi, Sixth Print 2008.
Reference Books:
1. Ivar Jacobson, MagnosChristerson, Patrick Jonsson, Gunnar Overgaard, Object-oriented Software
Engineering: A Use Case Driven Approach, Pearson Education, New Delhi, Seventh Edition Reprint,
2009.
2. David C. Kung, Object-Oriented Software Engineering: An Agile Unified Methodology, McGraw-
Hill Publishing Company Limited, New Delhi, 2013.
3. Bernd Bruegge, Allen H. Dutoit, Object-Oriented Software Engineering Using UML, Patterns, and
Java: Pearson New International, Third Edition, 2013.
 CSE-425N Expert Systems
Lecture Tutorial Practical Major Test Minor Test Total Time
3 0 0 75 25 100 3 Hrs.
In this course the student will learn the methodologies used to transfer the knowledge of a
Purpose
human expert into an intelligent program that can be used to solve real-time problems.
Course Outcomes(CO)
CO1 Examining the fundamentals and terminologies of expert system.
To facilitate students to implement various knowledge representation techniques for
CO2
acquisition and validate various structures in experts system domain.
CO3 Signifying AI techniques to solve social, industrial and environmental problems.
Application of professional aspects in multi-disciplinary approach to meet global standards
CO4
towards design, realizing and manufacturing.

Unit-I
Introduction to AI programming languages, Blind search strategies, Breadth first – Depth first – Heuristic
search techniques Hill Climbing – Best first – A Algorithms AO* algorithm – game tress, Min-max
algorithms, game playing – Alpha beta pruning.
Knowledge representation issues predicate logic – logic programming Semantic nets- frames and inheritance,
constraint propagation; Representing Knowledge using rules, Rules based deduction systems.
Unit-II
Introduction to Expert Systems, Architecture of expert system, Representation and organization of
knowledge, Basics characteristics, and types of problems handled by expert systems.
Expert System Tools: Techniques of knowledge representations in expert systems, knowledge
engineering, System-building aids, support facilities, stages in the development of expert
systems.
Unit-III
Building an Expert System: Expert system development, Selection of tool, Acquiring
Knowledge, Building process.
Unit-IV
Problems with Expert Systems: Difficulties, common pitfalls in planning, dealing with domain
expert, difficulties during development.

Text Books
1. Elain Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill, New Delhi, 2008.
2. Waterman D.A., “A Guide to Expert Systems”, Addison Wesley Longman, 1985.

Reference Books
1. Staurt Russel and other Peter Norvig, “Artificial Intelligence – A Modern Approach”, Prentice Hall,
1995.
2. Patrick Henry Winston, “Artificial Intelligence”, Addison Wesley, 1979.
3. Patterson, Artificial Intelligence & Expert System, Prentice Hall India,1999.
4. Hayes-Roth, Lenat and Waterman: Building Expert Systems, Addison Wesley, 1983.
5. Weiss S.M. and Kulikowski C.A., “A Practical Guide to Designing Expert Systems”, Rowman
&Allanheld, New Jersey, 2011.
 CSE-405N Computer Graphics Lab
Lecture Tutorial Practical Minor Test Practical Total Time
0 0 2 40 60 100 3Hrs.
Purpose To Design and implement various Line and Circle Drawing Algorithms.
Course Outcomes (CO)
CO1 To Implement basic algorithms related to Line & Circle Drawing.
CO2 Implement various Line & Circle Drawing Algorithms.
CO3 Hands on experiments on 2-D transformations.
CO4 Conceptual implementation of Clipping and other drawing algorithms..

List of Practicals:

1. Write a program to implement DDA line drawing algorithm.

2. Write a program to implement Bresenham’s line drawing algorithm.
3. Implement the Bresenham’s circle drawing algorithm.
4. Write a program to draw a decagon whose all vertices are connected with every other vertex using
lines.
5. Write a program to move an object using the concepts of 2-D transformations.
6. Write a program to implement the midpoint circle drawing algorithmany Object Oriented
Programming Languagelike Python, C++,Java.
7. Implement the line clipping algorithm using any Object Oriented Programming Language like
Python, C++, Java.
8. Implement boundary fill algorithm using any Object Oriented Programming Language like Python,
C++, Java.
9. Implement the depth buffer algorithm using any Object oriented language like Python, C++,Java.
10. Perform the Polygon Clipping Algorithm using any Object oriented language like Python, C++,Java.
11. Draw a Rectangle using Bresenham’s and DDA Algorithm using any Object oriented language like
Python, C++,Java.

Note: At least 5 to 10 more exercises are to be given by the teacher concerned.

 CSE-409N Unix & Linux Programming Lab
Lecture Tutorial Practical Minor Test Practical Total Time
0 0 2 40 60 100 3 Hrs.
Purpose To provide experimental knowledge of Unix & Linux Programs
Course Outcomes (CO)
CO Exploring knowledge by implementation of programs using UNIX/LINUX.
List of Practicals
1. Familiarize with Unix/Linux logging/logout and simple commands.
2. Familiarize with vi editor.
3. Using Bash shell develops simple shell programs.
4. Develop advanced shell programs using grep, fgrep&egrep.
5. Compile and debug various C programs using different options.
Content defined chunking, frequency based chunking, delta/Xdelta, Rabin Fingerprint
Generator, Parallel Compression compress.
6. Learning of installation and upgradation of Linux operating system.
7. Install Linux on a PC having some other previously installed operating system. All operating systems
should be usable.
8. As supervisor create and maintain user accounts, learn package installation, taking backups,
creation of scripts for file and user management, creation of startup and shutdown scripts using at,
cron etc.
Note: At least 5 to 10 more exercises are to be given by the teacher concerned.