SYLLABUS FOR

BACHELOR OF ENGINEERING (COMPUTER SC. & ENGG.)

SEVENTH SEMESTER

Paper Title: COMPILER DESIGN

Paper Code: CSE701 Max. Marks (Final Exam): 100 Time: 3 Hours
L T P: 3 1 0 Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: This course will provide the in-depth knowledge of different concepts involved while designing a compiler.

SECTION – A
Introduction: Compilers and Translators; The phases of the compiler – Lexical Analysis, Syntax Analysis,
Intermediate Code Generation, Optimization, Code generation, Bookkeeping, Error handling. (5)

Lexical Analysis: The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering, Specifications of a (5)
token, Recognition of a tokens, Finite automata: Regular expressions, NFA, DFA.Design of a lexical analyzer
generator.

Syntax Analysis: The role of a parser, Context free grammars, Writing a grammar, Top down Parsing: Recursive
decent parser, Predictive parser, Bottom up Parsing: Handles, Viable prefixes, Operator precedence parsing, LR (12)
parsers: SLR, LALR, CLR. Parser generator (YACC).Error Recovery techniques for different parsers.

SECTION – B
Syntax directed translation: Syntax directed definitions, Synthesized and inherited attributes, Construction of (4)
syntax trees.

Run time environments: Source language issues (Activation trees, Control stack, scope of declaration, Binding of (6)
names), Storage organization (Subdivision of run-time memory, Activation records), Storage allocation strategies,
Symbol tables: storage, data structures used.

Intermediate code generation: Intermediate languages, Graphical representation, Three-address code, (3)
Implementation of three address statements (Quadruples, Triples, Indirect triples).

Code optimization and code generation: Introduction, Basic blocks & flow graphs, DAG, principle sources of (10)
optimization: loop optimization, eliminating induction variable, eliminating common sub-expression, loop unrolling,
loop jamming etc. Peephole optimization, Issues in the design of code generator, a simple code generator, Register
allocation & assignment.

Text Book:
1. Aho, Ullman : Principles of Compiler Design. Narosa Publication.

References:
1. Dhamdhere : Compiler Construction- Principles and Practice Macmillan,
India 198
2. Holub : Compiler Design in C, PHI.

Paper Title: COMPILER DESIGN (PRACTICAL)

Paper Code: CSE751 Max. Marks(Final):75
L T P: 0 0 3 Max.Marks(Sessional):75
Note: Students have to perform the below-mentioned experiments using any language or tool available.

1. Implementation of lexical analyzer for a hypothetical language.

2. Implementation of LL parser.

3. Implementation of SLR parser.

4. Implementation of CLR parser.

5. Implementation of LALR parser.

Paper Title: MULTIMEDIA SYSTEM DESIGN

Paper Code: CSE702 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Objectives: This Course introduces the multimedia systems and their applications to students. This course covers the
different compression standards used in multimedia, some current technology and related issues.

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

SECTION – A
Introduction:
Multimedia and its types, Introduction to Hypermedia, Hyper Text, Multimedia Systems and their Characteristics, (4)
Challenges, Desirable Features, Components and Applications, Trends in Multimedia

Multimedia Technology:
Multimedia Systems Technology , Multimedia Hardware devices, Multimedia software development tools, (6)
Multimedia Authoring Tools, Multimedia Standards for Document Architecture, SGML, ODA, Multimedia
Standards for Document interchange, MHEG, Multimedia Software for different media.

Storage Media :
Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards, DVD and its standards, (4)
Multimedia Servers

Audio:
Basics of Digital Audio, Application of Digital Audio, Digitization of Sound, Sample Rates and Bit Size, Nyquist's (7)
Sampling Theorem Typical Audio Formats Delivering Audio over a Network , Introduction to MIDI (Musical
Instrument Digital Interface), Components of a MIDI System Hardware Aspects of MIDI ,MIDI Messages.

SECTION – B
Image,Graphics and Video:
Graphic/Image File Formats, Graphic/Image Data, Colour in Image and Video, Colour Image and Video (6)
Representations, Basics of Video ,Types of Colour Video Signals, Analog Video, Digital Video, TV standards

Video and Audio Compression :

Classifying Compression Algorithms, Lossless Compression Algorithms, Entropy Encoding, Run-length Encoding, (12)
Pattern Substitution, Basics of Information theory, Huffman Coding, Huffman Coding of Images, Adaptive
Huffman Coding, Arithmetic Coding, Lempel-Ziv-Welch (LZW) Algorithm, Source Coding Techniques ,
Transform Coding, Frequency Domain Methods, Differential Encoding, Vector Quantisation, JPEG Compression,
Video Compression, H. 261 Compression, Intra Frame Coding, Inter-frame (P-frame) Coding, MPEG Compression,
MPEG Video, The MPEG Video Bitstream , Decoding MPEG Video in Software , Audio Compression, Simple
Audio Compression Methods, Psychoacoustics ,MPEG Audio Compression

Multimedia Communication: (6)

Building Communication network, Application Subsystem, Transport Subsystem, QOS, Resource Management,
Distributed Multimedia Systems

Text Book:
1. Ralf Steinmetz amd Klara Nahrstedt : Multimedia Computing Communications and Applications
By Pearson Educations

References:

1. Prabhat K. Andleigh, Kran Thakkar : Multimedia System Design, PHI, Latest Edition
2. Li, Drew : Multimedia Computing, Pearson Education, Latest Edition
3. Fred Halsall Multimedia Communications, Pearson Education, Latest
Edition

Paper Title: SOFTWARE TESTING AND QUALITY ASSURANCE

Max. Marks (Final Exam): 100 Time: 3 Hours
Paper Code: CSE703 Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner will set eight questions covering four questions from each section. Candidates will be required to attempt
five questions, selecting at least two from each section.

Objectives: This course offers a good understanding of the concepts, methods and techniques of software testing and
quality assurance and prepares students to be in a position to develop error free and quality software.

SECTION – A
Introduction:
Software Process, Characteristics of a Software Process, Process Models, Project Management Process and its (07)
Phases, Software Measurements, Metrics, Scheduling, Estimation.

Software Quality Assurance Concepts and Standards :

Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software Reviews, Formal Technical (08)
Reviews, Review Guidelines, Software Reliability, Software Safety, Quality Assurance Standards, ISO 9000, ISO
9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six Sigma, SPICE, Software Quality Assurance Metrics.

Risk Management and Change Management:

Software Risks, Risk Identification, Risk Projection, Risk Refinement, The RMMM Plan, Software Configuration (07)
Management, Baselines, Software Configuration Items, SCM Process: Version Control, Change Control,
Configuration Audit, Configuration Management for Web Engineering.

SECTION – B
Software Testing:
Testing, Verification and Validation, Test Strategies for Conventional and Object Oriented Software, Unit Testing, (07)
Integration Testing, Validation Testing, Alpha and Beta Testing, System Testing, Recovery Testing, Security
Testing, Stress Testing, Performance Testing, Metrics for Source Code, Metrics for Testing, Debugging Process,
Debugging Strategies.

Testing Techniques:
Software Testing Fundamentals, Black Box and White Box Testing, Basis Path Testing, Flow Graph Notation, (08)
Independent Program Paths, Graph Matrices, Control Structure Testing, Condition Testing, Data Flow Testing,
Loop Testing, Graph Based Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Object Oriented
Testing Methods: Applicability of Conventional Test Case Design Methods, Fault-Based Testing, Scenario-Based
Testing, Random Testing and Partition Testing for Classes, InterClass Test Case Design.

Testing Process:
Test Plan Development, Requirement Phase, Design Phase and Program Phase Testing, Testing Client/Server (08)
Systems, Testing Web based Systems, Testing Off-the-Shelf Software, Testing in Multiplatform Environment,
Testing for Real Time Systems, Testing Security.
 Text Book:
1. Ian Sommerville : Software Engineering, Seventh Edition, Pearson Education.
2. R.S. Pressman : Software Engineering: A Practitioner's Approach, Sixth
Edition, Tata McGraw-Hill.
3. William E. Perry : Effective Methods for Software Testing, Second Edition,
John Wiley & Sons.

References:
1. S.L. Pfleeger, J.M. Atlee : Software Engineering: Theory and Practice, Second
Edition, Pearson Education.
2. K.K. Aggarwal, Yogesh Singh : Software Engineering, Second Edition, New Age
International.
3. Pankaj Jalote : An Integrated Approach to Software Engineering, Second
Edition, Narosa.
4. Nina S Godbole : Software Quality Assurance – Principles and Practice,
Narosa.
5. Boris Beizer : Software Testing Techniques, Second Edition, Dreamtech.

Paper Title: SOFTWARE TESTING AND QUALITY ASSURANCE (Practical)

Paper Code: CSE753 Max. Marks: 75

Note: This practical will enable students use and design software quality assurance and testing tools.

1. Study of different quality assurance and software testing tools.

2. Write programs to perform different types of testing.

3. Use of a software testing tool.

4. Use of a quality assurance tool.

5. Design and Implementation of a quality assurance / software testing tool.

Paper Title: INFORMATION SECURITY

Paper Code: CSE704 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: Upon completion of this course, participants will have gained knowledge of information security concepts and
the following: Understanding of Information Security (InfoSec) principles and approaches
 Understanding of the basic components of InfoSec
 Understanding of basic InfoSec applications
 Ability to remain current with InfoSec literature
 Ability to progress to independent work in the field

SECTION – A
Introduction:
Introduction to Computer Security and Assurance, Information at Risk: Threats, Security Objectives, and Security
Measures; Protection in general purpose operating systems , Data base security, The Fundamental Information (4)
Security Problems; Applications of Cryptography in Information Security; Network Security; Encryption at Different
OSI-Layers; Firewalls- Intrusion detection systems. ; Modern Applications; Electronic Commerce; Political Aspects,
Cryptographic vs. Information-Theoretic Security
Cryptography and Key Management: Basic Concepts and Terminology:
Types and Models of Cryptographic Systems; Some History: One-Way Functions and Hash Functions; Secrecy,
Authenticity, and Their Duality and Independence; A Basic Calculus of Channel Security Properties; Symmetric (8)
Cryptography: Block Ciphers, Stream Ciphers, MACs; Randomness and Pseudo-Randomness; Randomness Testing;
Computational vs. Unconditional (or Information-Theoretic) Security; Cryptanalytic Attacks, Assumptions, and
Different Security Definitions; Public-Key Cryptosystems; Trapdoor Functions; Digital Signatures; Public-Key
Certificates; Key Management

Ciphers: Design and Cryptanalysis:

General Design Framework for Block Ciphers; Substitution; Transposition; Product and Iterative Ciphers; Examples:
DES, IDEA, Rijndael (AES); Modes of Operation; Discussion of Key Sizes; Multiple Encryption; Triple-DES; (8)
Cryptanalysis, Stream Ciphers: Design; Correlation Attacks on Stream Ciphers, Self-Synchronizing Stream
Ciphers

Hash Functions: Design and Cryptanalysis:

Security Definitions; Collision Attacks; Birthday Paradox; Random Oracle Model and its Limitations; Hash Function (4)
Design Principles; Examples: MD5, Secure Hash Algorithm (SHA-1), etc.; Hashing with Block Ciphers; MACs from
Hash Functions
SECTION – B
Public-Key Cryptography and Digital Signatures:
Fast Exponentiation; Square-and-Multiply Algorithm; Diffie-Hellman Key Agreement Protocol, Status of Security;
Rivest-Shamir-Adleman (RSA) System, Status of Security; Homomorphic Property; Security of LSB; Iterated (12)
Encryption Attack; Elliptic Curves (EC): Basics and Applications; Factoring Algorithms: Overview of QS, NFS, (p-
1) and EC-Factoring; Discrete Logarithm Algorithms: Overview and Concrete Algorithms; Digital Signatures Based
on Discrete Logarithms

IP Security and Security Protocols:

IP Security Overview, IP Security Architecture, Authentication Header, Web Security, Zero-Knowledge Proofs,
Subliminal Channels, Digital , Signature Schemes, Bit Commitment, Digital Cas (4)

Firewalls:
Firewall Characteristics, Types of Firewalls, Firewall Configuration (4)

Text Book:
1. William Stallings : Network Security Essentials, Applications and Standards
Pearson Education.

References:
1. William Stallings : Cryptography and Network Security Principles and
practice. 2/e,Pearson Education.
2. Bishop, Matt : Introduction to Computer Security. Addison-Wesley,
Pearson Education, Inc. ISBN: 0-321-24744-2. (2005)
3. Michael. E. Whitman and Herbert J. Mattord  : Principles of Information Security

Paper Title: COMPUTER ARCHITECTURE AND PARALLEL PROCESSING

Paper Code: CSE705 (Elective I) Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions by selecting at least two from each section.

Objectives: This course offers a good understanding of computer architecture and parallel programming concepts and
prepares the students to be in a position to design a basic parallel computer system.

SECTION – A
Introduction to Parallel Processing:
Evolution of Computer Systems, Parallelism in Uniprocessor Systems, Parallel Computer Structures, Architectural (06)
Classification Schemes, Parallel Processing Applications.

Memory and Input Output Subsystems: (08)

Hierarchical Memory Structure, Virtual Memory System, Memory Allocation and Management, Cache Memories
and Management, Input-Output Subsystems.

Principles of Pipelining and Vector Processing: (08)

Pipelining: An overlapped parallelism, Instruction and Arithmetic Pipelines, Principles of designing pipelined
processors, Vector Processing and its characteristics.

SECTION – B

Structures and Algorithms for Array Processors: (08)

SIMD Array Processors, SIMD Interconnection Networks, Parallel Algorithms for Array Processors, Associative
Array Processing.

Multiprocessor Architecture: (07)

Functional Structures, Interconnection Networks, Parallel Memory Organizations, Multiprocessor operating
systems.

Multiprocessing Control and Algorithms: (08)

Interprocess Communication Mechanisms, System Deadlocks and Protection, Multiprocessor Scheduling Strategies,
Parallel Algorithms for Multiprocessors.

Text Book:
1. Kai Hwang : Computer Architecture and Parallel Processing, McGraw-
Hill International Edition, Computer Science Series.

References:
1. Dezso Sima, Terence Fountain Peter Karsuk : Advance Computer Architectures: A Design Space
Approach, Pearson Education.
2. John L. Hennessy and David A. Patterson : Computer Architecture-A Quantitative Approach, Morgan
Kaufmann.
3. Kai Hwang : Advanced Computer Architecture: Parallelism, Scalability,
Programmability, Tata McGraw-Hill Edition.

Paper Title: MOBILE COMPUTING

Paper Code: CSE706 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: To impart knowledge of mobile and wireless computing systems and techniques.

SECTION – A
Mobility:
Issues, challenges, and benefits; Review of mobile and cellular communication technology; Review of 6
distributed/network operating systems, ubiquitous computing.

Global System for Mobile Communication (GSM) System Overview:

GSM Architecture, Mobility Management, Network Signaling. 4

General Packet Radio Service (GPRS):

GPRS Architecture, GPRS network nodes. 4
Mobile Computing: 6
Physical mobility, challenges, limits and connectivity, mobile IP and cellular IP in mobile computing.

SECTION – B
Wireless LANs:
Introduction to IEEE 802.11, Bluetooth technologies and standards. 3

Mobile Adhoc Networks:

Hidden and exposed terminal problems; Routing protocols: DSDV, DSR, AODV. 6

Handheld Devices and OS:

Palm, HP; PalmOS, WindowsCE, Windows Mobile. 6

Mobile Internet and WAP:

WWW programming model, WAP programming model, gateways. 5

Mobile agents: 5
Aglets, Tcl, PMADE.

Text Book:
1. Jochen Schiller : Mobile Communication, Pearson Education.
2. U. Hansman and L. Merck. : Principles of Mobile Computing”, 2nd Ed., Springer

References:
1. A. S. Tanenbaum. : Computer Networks, 4th Ed., Pearson Education.
2. D. Milojicic, F. Douglis. : Mobility Processes, Computers and Agents”, Addison
Wesley
3. D.B. Lange and M. Oshima : Programming and Deploying Java Mobile Agents with
Aglets, Addison Wesley.
 SYLLABUS FOR
BACHELOR OF ENGINEERING (COMPUTER SC. & ENGG.)

EIGHTH SEMESTER

Paper Title: ADVANCED DATABASE SYSTEMS

Paper Code: CSE801 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner will set eight questions covering four questions from each section. Candidates will be required to attempt
five questions, selecting at least two from each section.

Objectives: This course offers a good understanding of advanced database concepts and technologies. It prepares the student
to be in a position to use and design databases for a variety of applications.

SECTION – A
Introduction to Database Systems:
Database System Concepts and Architecture, Data Models, Data Independence, SQL: DDL, DML, DCL, (06)
Normalization: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF.

Query Processing and Optimization:

Query Processing, Syntax Analyzer, Query Decomposition, Query Optimization, Heuristic Query Optimization, Cost (06)
Estimation, Cost Functions for Select, Join, Query Evaluation Plans.

Transaction Processing and Concurrency Control:

Transaction Processing Concepts, Concurrency Control Techniques: Two-phase Locking, Timestamp Ordering, (05)
Multiversion, Validation, Multiple Granularity Locking.

Object Oriented and Object Relational Databases:

Object Oriented Concepts, Object Oriented Data Model, Object Definition Language, Object Query Language, (05)
Object Relational Systems, SQL3, ORDBMS Design.

SECTION – B
Distributed Databases:
Distributed Database Concepts, Advantages and Disadvantages, Types of Distributed Database Systems, Data (06)
Fragmentation, Replication and Allocation Techniques for Distributed Database Design, Five Level Schema
Architecture, Query Processing, Concurrency Control and Recovery in Distributed Databases.

Backup and Recovery:

Types of Database Failures, Types of Database Recovery, Recovery Techniques: Deferred Update, Immediate (05)
Update, Shadow Paging, Checkpoints, Buffer Management.

Introduction to Data Warehousing and Data Mining:

Introduction to OLAP, OLTP, Data Warehouse, Data Marts, Data Mining, Data Mining Process. (05)

Commercial Databases:
Commercial Database Products, Familiarity with IBM DB2 Universal Database, Oracle, Microsoft SQL Server, (07)
MySQL, their features.

Text Book:
1. Ramez Elmasri, Shamkant Navathe : Fundamentals of Database Systems, Fifth Edition, Pearson
Education, 2007.

References:

1. Raghu Ramakrishnan, Johannes Gehrke : Database Management Systems, Tata McGraw-Hill.

2. C.J. Date : An Introduction to Database Systems, Eighth Edition,
Pearson Education.
3. Alexis Leon, Mathews Leon : Database Management Systems, Leon Press.
4. Abraham Silberschatz, Henry F. Korth, S. : Database System Concepts, Tata McGraw-Hill.
Sudarshan
5. S. K. Singh Database Systems Concepts, Design and Applications,
: Pearson Education.

Paper Title: DIGITAL IMAGE PROCESSING & COMPUTER VISION

Paper Code: CSE802 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: To introduce the various image processing techniques and their applications in different domains. To get
students acquainted with computer vision.

SECTION – A
Introduction to Image Processing:
Digital Image representation, Sampling & Quantization, Steps in image Processing, Image acquisition, color image (4)
representation, color models
Image Transformation & spatial Filtering:
Intensity transform functions, histogram processing, Spatial filtering, fourier transforms and its properties, Walsh (6)
transform, Hotelling transforms, Haar and slant transforms, Hadamard transforms, frequency domain filters,
Homomorphic Filtering, Pseudo coloring, color transforms

Image Restoration:
Image degradation and restoration process, Noise Models, Noise Filters, degradation function, Inverse Filtering (4)

SECTION – B
Image Compression:
Coding redundancy, Interpixel redundancy, Psychovisual redundancy, Huffman Coding, Arithmetic coding, Lossy (6)
compression techniques, JPEG Compression
Image Segmentation & Representation:
Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough transforms, Region Based (12)
Segmentation, Boundary representation, Boundary Descriptors, Regional Descriptors

Computer Vision:
The role of Computer Vision, applications, Exemplars: Face Recognition, Medical Image Analysis, Recognizing (6)
man-made objects, representing knowledge of expected image contents. Matching models to image data

Text Book:
Digital Image Processing ISDN 0-201-600- 781, Addison
1. Gonzalez and Woods : Wesley 1992.
2. Boyle and Thomas : Computer Vision - A First Gurse 2nd Edition, ISBN 0-632-
028-67X, Blackwell Science 1995

References:
Introductory Techniques for 3-D Computer Vision,
1. Trucco & Verri : Prentice Hall, Latest Edition
Introductory Computer Vision and Image Processing,
2. Low : McGraw-Hill 1991, ISBN 0-07-707403-3
3. Jain, Kasturi and Schunk : Machine Vision, McGraw-HiII. 1995 ISBN 0070320187.
4. Sonka, Hlavac, Boyle Image -Processing, Analysis and Machine Vision 2nd ed.
: ISBN 0-534-95393-X, PWS Publishing,1999
Paper Title: DIGITAL IMAGE PROCESSING & COMPUTER VISION (Practical)
Paper Code: CSE852 MM (External):50
MM (Internal): 50
Note: Students are required to complete all the practical by implementing them in any of the programming language such as
Java, C/C++, C#, MATLAB

1. Reading and displaying images in different formats using different color models.

2. Converting color images into monochrome images.

3. Understanding brightness, contrast and intensity concept of images

4. Images enhancements using grey level transformations

5. Image enhancements using spatial filters

6. Image enhancements in frequency domain

7. Homomorphic Filtering

8. Image Noise removal and inverse filtering of images

9. Image color enhancements using pseudo coloring techniques

10. Point, Line, Edge and Boundary Detections in images

11. Histogram Matching and specification on images

12. Boundary Linking techniques on images

13. Thresholding of Images

14. Magnification of Images

15. Image representation and Description techniques

Paper Title: NETWORK PROGRAMMING

Paper Code: CSE803 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: To familiarize students with advanced concepts of networks, network programming in UNIX environment.
SECTION – A
1. OSI model, client server model, TCP/IP protocols, Introduction to Unix; Process, groups, job control and non-job 6
control shells, reliable and unreliable signals, shell Programming.

2. Inter process communication in Unix, pipes, half duplex and full duplex pipes, FIFOs, properties of pipes and 10
FIFOs, POSIX message queues, system V message queues, semaphores, shared memory, mmap function and its
use, RPC, authentication, timeout and retransmission, call semantics, XDR.

3. Communication Protocol – Introduction, TCP, IP, XNS, SNA, NetBIOS, OSI protocols, comparisons. 5

SECTION – B
4. Introduction to Berkeley sockets, socket addressing, TCP and UDP socket functions, sockets and Unix signals, 10
socket implementation, client and server examples for TCP and UDP and their behavior under abnormal
conditions.

5. Socket options, IPv4, IPv6, TCP, I/O multiplexing, Unix I/O models, select and poll functions 5

6. System V Transport Layer, interface – Introduction Transport End Point address, TLI. 5

4
7. Overview of Ping – Routines, FTP, Remote Login

Text Book:
1. W. R., Stevens, B. Fenner and A. M., Rudoff : Unix Network Programming, Vol. I, 3rd Ed., Pearson
Education

References:
1. W. R., Stevens : Unix Network Programming, Vol. II, 2nd Ed., Pearson
Education
2. W. R., Stevens : Advanced Programming in Unix Environment, Pearson
Education

Paper Title: NETWORK PROGRAMMING (Practical)

Paper Code: CSE853 Max. Marks: 75
Sessional Marks: 75
Note: Students will learn to implement programs in UNIX.

1. To study and implement various network commands like telnet, ftp, etc.

2. To study various system calls.

3. Programs related to interprocess communication

4. Programs related to message queues

5. Programs related to pipes

6. Programs related to file handling

7. Programs related to process control

8. Programs using Socket Programming

Paper Title: VISUAL PROGRAMMING

Paper Code: CSE804 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner will set eight questions covering four questions from each section. Candidates will be required to attempt
five questions, selecting at least two from each section.

Objectives: This course offers a good understanding of Visual Programming concepts and prepares students to be in a
position to write GUI applications.

SECTION – A
Introduction:
Introduction to Programming: Variables, Functions, Visual Programming, Object Oriented Concepts: Abstraction, (08)
Inheritance, Polymorphism, Classes, Collections, Debugging.

Graphical User Interface Concepts - I:

Windows Forms, Control Properties and Layout, Using Common Dialogs, Event Handling: Mouse and Keyboard, (05)
Labels, Textboxes, Buttons, GroupBoxes, Panels, CheckBoxes and RadioButtons, PictureBoxes, ToolTips.

Graphical User Interface Concepts - II:

Menus, Controls: MonthCalendar, DateTimePicker, LinkLabel, ListBox, CheckedListBox, ComboBox, TreeView, (04)
ListView, Datagrid, Gridview, TabControl, Multiple Document Interface (MDI) Windows.

Multithreading and Exception Handling:

Thread States, Lifecycle of a Thread, Thread Priorities and Scheduling, Creating and Executing Threads, Thread (05)
Synchronization and Class Monitor, Exception Handling.

SECTION – B
Graphics and Multimedia:
Drawing Classes and the Coordinate System, Graphics Contexts and Graphics Objects, Color and Font Control, (05)
Drawing Lines, Rectangles, Ovals, Arcs, Loading, Displaying and Scaling Images, Animating a Series of Images.

File Processing and Streams:

Data Hierarchy, Files and Streams, Classes File and Directory, Reading and Writing Sequential Access Files, (05)
Serialization.

Data Access:
Data Access Techniques, XML, LINQ, SQL, ADO.NET Object Model, LINQ to SQL, ADO.NET and LINQ, LINQ (08)
to XML.

Additional Techniques:
XML Documentation, Networking, Security, Web Services, Introduction to GDI+. (05)

Text Book:
1. Deitel : Visual C# 2005 How to Program, Second Edition, Deitel.

References:
1. Karli Watson, Christian Nagel, Jacob Hammer, : Beginning Microsoft Visual C# 2008, Wrox.
et al.
2. Christian Nagel, Bill Evjen, Jay Glynn, Morgan : Professional C# 2008, Wrox.
Skinner, Karli Watson

Paper Title: VISUAL PROGRAMMING (Practical)

Paper Code: CSE854 Max. Marks: 75

Note: The practical will enable students to write visual applications in .NET environment.

1. Writing basic C# programs demonstrating the concepts of functions, arrays, classes, inheritance, polymorphism etc.

2. Writing graphical programs demonstrating the concepts of event handling, Labels, Textboxes, Buttons,
GroupBoxes, Panels, CheckBoxes and RadioButtons, PictureBoxes, ToolTips.

3. Writing MDI Applications and demonstration of controls like: MonthCalendar, DateTimePicker, LinkLabel,
ListBox, CheckedListBox, ComboBox, TreeView, ListView, TabControl.

4. Writing programs demonstrating the concepts of Multithreading and Exception Handling.

5. Writing programs demonstrating Graphics and Multimedia concepts.

6. Writing programs for reading and writing text files.

7. Writing programs demonstrating Database Access, Networking and Security.

8. Writing Web Services.

Paper Title: JAVA TECHNOLOGIES

Paper Code: CSE805 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: Objective This course will provide the in-depth knowledge of Java and J2EE technology.

SECTION – A
Java Methods, Classes and Inheritance:
Introduction; classes; methods; constructors; overloading methods; arrays; recursion; passing arrays and objects to 8
methods; Inheritance; method overriding; abstract classes; using final; packages; interfaces.

I/O, Applets and Graphics:

I/O basics; stream classes; byte and character streams; reading and writing files; Applet fundamentals; Applet class; 8
Applet initialization and termination; event handling; keyboard and mouse events; AWT class; Layout managers;
panels; canvases; Frame windows; drawing lines, rectangles, ellipses.

Exceptional Handling and Multithreaded Programming:

Exception handling fundamentals; exception types; uncaught exceptions; try and catch; creating exception classes; 8
throwing exceptions; Java thread model; thread priorities; creating a thread; inter-thread communication; thread
synchronization; suspending, resuming and stopping threads;

SECTION – B
Overview of J2EE and working with JDBC:
What is J2EE, component based architecture of J2EE: Web, Business and Application component, commonly used 7
classes and interfaces of java.sql package, connecting java application to a database, prepared statements.

Servlets and JSP:

Java Servlets, compilation, deployment, and testing a servlet, session management, request dispatching, Java Server 7
Pages, deploying and testing a JSP, using java beans in JSP.

Enterprise Java Beans(EJB):

Architecture of EJB, creating a stateless-session EJB, statefull-session bean, Life Cycle of session beans, Entity 7
beans, life cycle of entity beans.

Text Book:
1. Deitel and Deitel : Java: How to Program, 6th Edition, Pearson Education.
2. Herbert Schildt : The Complete Reference Java2, TMH
3. James Edward Keogh, Jim Keogh : J2EE: The complete Reference, McGraw-Hill

References:
1. Author Name : Book Title, Edition, Publisher (Justified)
2. Author Name : Book Title, Edition, Publisher (Justified)

Paper Title: JAVA TECHNOLOGIES (PRACTICAL)

Paper Code: CSE855 Max. Marks(Final):75

 Max.Marks(Sessional):75
Note: Students have to perform the following experiments

1. Implementation of classes, inheritance, overloading.

2. Implantation of packages and interfaces

3. Implantation of threads.

4. Implementation of Applets, mouse events, and keyboard events.

5. Connecting to Database using JDBC.

6. Deployment of Servlets, JSP and EJB.

Paper Title: SOFT COMPUTING

Paper Code: CSE806 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section. Candidate will be required to attempt
five questions, at least two from each section.

Objectives: : To get basic knowledge of different soft computing techniques. Different problem solving techniques and
their implementations and applications are explained. Intelligent systems and learning techniques are introduced.

SECTION – A
Intelligent Agents:
Agents Behavior and Environments, Structure of Agents, Planning Problem, Planning with state Space Search, (9)
Partial order Planning, GRAPHPLAN, Planning in logic, Planning in non-deterministic domains, hierarchical task
planning, Multi agent planning, execution.

Probabilistic Reasoning Fuzzy Logic: (12)

Knowledge representation under uncertainty, Bayesian theorem, Bayesian Networks, Dempster Shafer theory,
Representing vagueness, Fuzzy sets, operation on fuzzy sets, reasoning with fuzzy logic, Fuzzy Automata, Fuzzy
Control methods, Fuzzy decision making, inference in temporal models, Hidden Markov Models, Kalman Filters

SECTION – B
Neural Networks:
Basic concepts, Single layer perception, Multilayer Perception, Supervised and Unsupervised learning - (16)
Backpropagation networks - Kohnen's self organizing networks - Hopfield network.
Introduction to Artificial Neural Systems - Perceptron - Representation - Linear separability - Learning – Training
algorithm -Adaptive networks based Fuzzy interface systems - Classification and Regression Trees - Data clustering
algorithms - Rule based structure identification - Neuro-Fuzzy controls - Simulated annealing

Genetic Algorithms: (8)

Evolutionary computation. Survival of the Fittest - Fitness Computations - Cross over – Mutation, Reproduction -
Rank method - Rank space method.

Text Book:
1. Stuart J.Russel, Norvig : AI: A Modern Approach, Pearson Education, Latest
Edition
2. Michael Negnevitsky : Artificial Intelligence: A Guide to Intelligent Systems, 2/E,
Addison-Wesley, 2005

References:
Neural Networks - Algorithms, Applications &
1. James Freeman A. and David Skapura M : Programming Techniques Addison Wesley,1992.
Artificial Neural Networks, Prentice Hall of India Private
2. Yegnanarayana B : Ltd., New Delhi, 1999.
3. Hagan, M.T., Demuth, Mark Beale : Neural Network Design By Cengage Learning

4. Goldberg, David E. : Genetic algorithms in search, optimization and machine

learning, Latest Edition, Addison Wesley

EMBEDDED SYSTEMS
Paper Code: CSE807 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Total of Eight questions may be set covering the whole syllabus taking four from Part A & four from Part B.
Candidates will be required to attempt any five questions taking at least two from each Part.

Objectives: To get the basic knowledge of all the peripheral device controllers and to work on PIC Microcontroller.

SECTION – A
Introduction Review of Embedded Hardware
Memory – Microprocessors – Buses – Direct Memory Access – Interrupts – Built ins on the Microprocessor. (10)
Conventions used on Schematic, Microprocessor Architecture – Interrupt Basic – Shared Data Problems – Interrupt
Latency.

PIC Micro controller & Interfacing ()

Introduction, CPU Architecture, Register file structure, Instruction Set, Programs, Timers and Interrupts – Interrupt (15)
Service Routine – features of Interrupts – Interrupt vector & Priority, Timing Generation & Measurements,
Compare mode, Capture mode, Event counter, PWM, Frequency Measurement – Interfacing Methods, I/O Interface,
SPI, LCD interfacing, Seven segment interfacing, I2 C Bus, DAC, Serial EEPROM, ADC, UART.

SECTION – B
Software Development & Tools: Software architectures, Round – Robin, Round-Robin with Interrupts, Function (8
Queue Scheduling architecture, Introduction to assembler – Compiler –n Cross compilers and Integrated (8)
Development Environment IDE, Linker/ Locators, Simulators, Getting Embedded software into target System
Debugging Strategies,.

Introduction to Real Time Operating Systems: Task And Task States, Tasks and Data, Semaphores and shared (
data. (5)

Operating System Services: Message queues, Mailboxes and Pipes, Timer Function, Events, Memory
Management, Interrupt Routines in an RTOS Environment, Basic Design Using RTOS. (7)

Text Book:
1. David E. Simon : An Embedded Software Primer, Pearson Education, Latest
Edition.

References:
1. John B. Peatman : PIC Microcontroller, Pearson Education, Latest Edition
2. D. D. Gajski, F. Vahid, S. Narayan, J. Gong : Specification and Design of Embedded Systems, Prentice
Hall.
3. Steve Heath : Embedded systems design, Newnes, 1997.
4. F. Balarin, Chiodo : Hardware Software Co-design of Embedded Systems, et
al., Kluwer Academic Publishers, May 1997