B. V. V.

Sangha’ s
Basaveshwar Engineering College (Autonomous), Bagalkot
Department of Computer Science and Engineering

Scheme of Syllabus for 5th Semester

(2015-2016 to 2017-2018 Admitted Batches)

Sl. Subject Hrs/Week *SE

Subjects C CIE Total
No Code L T P E
Analysis and Design of
1 UCS521C 3 0 2# 4 50 50 100
Algorithms
2 UCS512C System Software 3 0 0 3 50 50 100
3 UCS523C Data Communications 4 0 0 4 50 50 100
4 UCS524C Software Engineering 4 0 0 4 50 50 100
5 UCS064E Elective – 1 (FAFL) 3 0 0 3 50 50 100
6 UCS065E Elective - 2 (PYTHON) 3 0 0 3 50 50 100
7 UCS525L System Software Lab 0 1 3 2 50 50 100
8 UCS526L Operating Systems Lab 0 2 2 2 50 50 100
Total 20 3 7 25 400 400 800

L: Lecturer Hours per Week T: Tutorial hours per week

P: Practical Hours per Week C: Credit points
*CIE: Continuous Internal Evaluation *SEE: Semester End Examination

# Lab is to be evaluated for 20 marks in CIE only, theory is to be evaluated for 30 marks in CIE and
50
marks in SEE and the same scheme is applicable to elective courses on programming languages.
 ANALYSIS AND DESIGN OF ALGORITHMS
Sub Code : UCS521C Credits : 04
Hours/Week : Theory: 03, Practical: 2 CIE MARKS : 50 (30 theory, 20 lab)
Total Hours : 40 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

1. Explain different problem types, data structures and efficiency classes such as
best, worst and
average class efficiencies with the asymptotic notations employed for analysis
of algorithms.
2. Devise algorithms using divide and conquer, decrease and conquer strategies
and explain the
difference between them. Also exhibit the understanding of trasform and
conquer techniques.
3. Write the algorithm for solving problems employing space anf tradeoff
technique, greedy strategy and dynamic programming.
4. Explain the concepts of tractability and intractability of problems using
backtracking and branch and bound methods and also notions of polynomial
time and NP-completeness.
5. Implement the algorithms using a suitable programming language.

UNIT I (10 Hours)

Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving,

Important Problem Types, Fundamental Data Structures.
Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework,
Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non-
recursive and Recursive Algorithms, Example – Fibonacci Numbers.
Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force
String Matching, Exhaustive Search.

UNIT II (10 Hours)

Divide and Conquer: Mergesort, Quicksort, Binary Search, Binary tree traversals and
related properties, Multiplication of large integers and Stressen’s Matrix
Multiplication.
Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search,
Topological Sorting, Algorithms for Generating Combinatorial Objects.

UNIT III (10 Hours)

Transform and Conquer: Presorting, Balanced Search Trees, Heaps and Heapsort,
Problem Reduction Space and Time Tradeoffs: Sorting by Counting, Input
Enhancement in String Matching , Hashing, B-Trees Dynamic Programming:
Computing a Binomial Coefficient, Warshall’s and Floyd’s Algorithms, Optimal Binary
Search Trees. The Knapsack Problem and Memory Functions.
 UNIT IV (10 Hours)

Greedy Technique: Prim’s Algorithm,Kruskal’s Algorithm, Dijkstra’s Algorithm,

Huffman Trees.
Limitations of Algorithm Power: Lower-Bound Arguments, Decision Trees,
Problems
Coping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound,

Text Books:

1. Anany Levitin, 2007,’Introduction to The Design & Analysis of Algorithms’, 2nd

Edition, Pearson Education.

Reference Books

1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein,

2006,’Introduction to Algorithms’, 2nd Edition, PHI.
2. Horowitz E., Sahni S., Rajasekaran S.,Galgotia Publications, 2001, ’Computer
Algorithms’ .

Note: It also includes laboratory (3 Hours Theory and 2 Hours Practical/Week)

 SYSTEMS SOFTWARE
Sub Code : UCS512C Credits : 03
CIE
Hours/Week : 03 : 50
MARKS
Total Hours : 40 SEE Marks : 50

COURSE OUTCOMES

At the end of the course student should be able to:

1. List and define features/concepts of machine architectures and system softwares.
2. Explain characteristics/concepts/basic operations of machines architectures, system
softwares and Lex and Yacc tools.
3. Write programs to implement simple assembler, loader, linker, macroprocessor,
lexical analyzer and syntactic analyzer.
4. Compare and contrast types of softwares, machine architectures, system softwares
and Lexical and syntactic analyzer.
5. Analyze, Design and implement system softwares for different architectures.

UNIT I (10 Hours)

Machine Architecture: Introduction, System Software and Machine Architecture,

Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE
Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines -
VAX Architecture, RISC Machines - Ultra SP ARC Architecture. Assemblers: Basic
Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data
Structures, Machine Dependent Assembler Features - Instruction Formats &
Addressing Modes, Program Relocation, Machine Independent Assembler Features -
Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections
and Programming Linking.

UNIT II (10 Hours)

Loaders And Linkers: Basic Loader Functions - Design of an Absolute loader, A

Simple Bootstrap Loader, Machine-Dependent Loader Features - Relocation, Program
Linking, Algorithm and Data Structures for a Linking Loader, Machine-Independent
Loader Features - Automatic Library Search, Loader Options, Loader Design Options -
Linkage Editor, Dynamic Linkage, Bootstrap Loaders.

UNIT III (10 Hours)

Compilers: Basic Compiler Function - Grammars, Lexical Analysis, Syntactic

Analysis, Code Generation, Machine Dependent Compiler Features Intermediate Form
of the Program. Machine-Dependent Code Optimization, Machine Independent
Compiler Features - Structured Variables, Machine Independent Code Optimization,
Storage Allocation, Block Structured Languages.
 UNIT IV (10 Hours)

Macro Processor: Basic Macro Processor Functions - Macro Definitions and

Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent
Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique
Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor
Design Options - Recursive Macro Expansion, General-Purpose Macro Processors,
Macro Processing Within Language Translators. Lex And Yacc: Lex and Yacc - The
Simplest Lex Program, Recognizing Words with LEX, Grammars, Parser-Lexer
Communication, A Y ACC Parser, The Rules Section, Running LEX and Y ACC, LEX
and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular
Expressions, A Word Counting Program, Using Y ACC - Grammars, Recursive Rules,
Shift/Reduce Parsing, What Y ACC Cannot Parse, A Y ACC Parser - The Definition
Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and
Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed
Tokens.

TEXT BOOKS:

1) Leyland.L.Beck, 1997, System Software, 3rd Edition, Addison-Wesley.

2) John.R.Levine, 1999, Tony Mason and Doug Brown, Lex and Yacc, O’Reilly, SPD.

REFERENCE BOOK:

1) D.M.Dhamdhere, 1999, System Programming and Operating Systems, 2nd Edition, TMH.
 DATA COMMUNICATIONS

Sub Code : UCS523C Credits : 04

CIE
Hours/Week : 04 : 50
MARKS
Total Hours : 48 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

 Explain the importance of data communications and the Internet in supporting

business communications and daily activities
 Explain how communication works in data networks and the Internet
 Recognize the different internetworking devices and their functions
 Explain the role of protocols in networking
 Analyze the services and features of the various layers of data networks
 Design, calculate, and apply subnet masks and addresses to fulfill networking
requirements
 Analyze the features and operations of various application layer protocols such as
Http, DNS, and SMTP

UNIT – I (12 Hours)

Introduction: Data Communications; Networks; the Internet; Protocols and

Standards.
Network Models: Layered tasks; The OSI Model, Layers in the OSI model; TCP / IP
Protocol Suite, Addressing.
Data and Signals: Analog and digital signals; Periodic Analog Signals, Digital
Signals, Transmission impairment; Data rate limits; Performance.

UNIT – II (12 Hours)

Digital Transmission, Analog Transmission and Multiplexing: Digital-to-Digital

conversion; Analog-to-Digital conversion: PCM; Transmission modes, Digital - to -
Analog conversion; Analog - to - Analog conversion; Multiplexing.
Transmission Media: Guided media, unguided media: Wireless.

UNIT – III (12 Hours)

Error Detection and Correction:

Introduction to Error Detection and Correction; Block Coding; Linear Block Codes;
Cyclic codes, Checksum.
Data Link Control: Framing; Flow and Error control; Protocols; Noiseless channels;
Noisy channels; HDLC; Point-to-point Protocol.
Multiple Accesses: Random Access; Controlled Access; Channelization.
 UNIT – IV (12 Hours)

Ethernet: EEE standards; Standard Ethernet and changes in the standard; Fast
Ethernet; Gigabit Ethernet.
Wireless LANs and Connection of LANs: IEEE 802.11; Bluetooth. Connecting
devices; Backbone Networks; Virtual LANs.
Other Technologies: Cellular telephony; SONET / SDH: Architecture, Layers,
Frames; STS multiplexing.

TEXT BOOK:

1) Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data

Communications and Networking.

REFERENCE BOOKS:

1) Alberto Leon, Garcia and Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004,
Communication Networks: Fundamental Concepts and Key Architectures.
2) William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer
Communication.
 SOFTWARE ENGINEERING

Sub Code : UCS524C Credits : 04

CIE
Hours/Week : 04 : 50
MARKS
Total Hours : 48 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

 Understand the current theories, models and techniques that provide a basis for
software product development.
 Write software requirement specification based on the formal specifications for
software systems.
 Design and develop different components of the software product using standard
models.
 Verify and Validate the individual components and the whole software product
using different testing tools.
 Demonstrate the necessary understanding of methods and techniques for software
management and also to use these in various development situations.

UNIT – I (12 Hours)

OVERVIEW: Introduction: FAQ's about software engineering, Professional and

ethical responsibility. Socio-Technical systems: Emergent system properties; Systems
engineering; Organizations, people and computer systems; Legacy systems.
CRITICAL SYSTEMS, SOFTWARE PROCESSES: Critical Systems: A simple
safety-critical system; System dependability; Availability and reliability. Software
Processes: Models, Process iteration, Process activities; The Rational Unified Process;
Computer-Aided Software Engineering.

UNIT – II (12 Hours)

REQUIREMENTS: Software Requirements: Functional and Non-functional

requirements; User requirements; System requirements; Interface specification; The
software requirements document. Requirements Engineering Processes: Feasibility
studies; Requirements elicitation and analysis; Requirements validation; Requirements
management.
SYSTEM MODELS, PROJECT MANAGEMENT: System Models: Context
models; Behavioral models; Data models; Object models; Structured methods. Project
Management: Management activities; Project planning; Project scheduling; Risk
management.
 UNIT – III (12 Hours)

SOFTWARE DESIGN: Architectural Design: Architectural design decisions; System

organization; Modular decomposition styles; Control styles. Object-Oriented design:
Objects and Object Classes; An Object- Oriented design process; Design evolution.
DEVELOPMENT: Rapid Software Development: Agile methods; Extreme
programming; Rapid application development. Software Evolution: Program evolution
dynamics; Software maintenance; Evolution processes; Legacy system evolution.

UNIT – IV (12 Hours)

VERIFICATION AND VALIDATION: Verification and Validation: Planning;

Software inspections; Automated static analysis; Verification and formal methods.
Software testing: System testing; Component testing; Test case design; Test
automation.
MANAGEMENT: Managing People: Selecting staff; Motivating people; Managing
people; The People Capability Maturity Model. Software Cost Estimation:
Productivity;
DESIGNING AND DOCUMENTING SOFTWARE ARCHITECTURE:
Architecture in the life cycle; Designing the architecture; Forming the team structure;
Creating a skeletal system.

TEXT BOOK:

1) Ian Somerville, 8th Edition, Pearson Education, 2007, Software Engineering.

2) Len Bass, Paul Clements, Rick Kazman, Pearson Education, 2003. Software
Architecture in Practice , 2nd Edition,

REFERENCE BOOKS:

1) Roger S. Pressman, 7th Edition, McGraw-Hill, 2007, Software Engineering: A

Practitioners Approach.
2) Shari Lawrence Pfleeger, Joanne M. Atlee, 3rd Edition, Pearson Education, 2006,
Software Engineering Theory and Practice.
3) Waman S Jawadekar, Tata McGraw Hill, 2004, Software Engineering Principles
and Practice.
 SYSTEMS SOFTWARE LABORATORY

Sub Code : UCS525L Credits : 02

CIE
Hours/Week : 04 : 50
MARKS
Exam Hours : 03 SEE Marks : 50

COURSE OUTCOMES

At the end of the semester student should be able to:

1. Implement the system softwares such as assembler, loader and linker etc using C or
C++.
2. Design and write Lex program to implement lexical analyzer for given problem
statement.
3. Design and write Yacc program to implement parser for the given structure
recognition.
4. Modify the existing design of the algorithm of system softwares to enhance the
efficiency.

Part I

1. Write a C program to implement pass one of two pass assembler.

2. Write a C program to implement absolute loader.
3. Write a C program to implement pass one of two pass macroprocessor.
4. Write a C program to implement pass two of two pass macroprocessor
5. Write a C program to generate a lexical analyzer to identify the C keywords
6. Design recursive descent parser for parsing pascal read & write statements.

Part II

Design lexical analysers using Lex tool to accomplish the following.

1. Design Lexical analyzer to count the no of occurrences of the words from a given
text file.The program should accept the text file and list of words as input.
2. Design Lexical analyzer to count no of positive numbers and negative numbers
from the input given.
3. Design Lexical analyzer to count number of printf and scanf statements and
replace them by sprintf and sscanf respectively.
4. Design Lexical analyzer to count number of integers , float, double,char variable
from C declaration statements
5. Design Lexical analyzer to count number of blank spaces lines, characters, words
from a given text file.
6. Design Lexical analyzer to check whether a given simple arithmetic operation is
valid or not. If valid print number of positive, negative, multiplication and division
operators separately
Part III

Design parsers using Yacc tool to accomplish the following.

1. Design parser using Yacc tool to test the validity of a simple expression involving
operators ‘+’,’-‘,’/’,’*’.
2. Design parser using Yacc tool to evaluate the given arithmetic expression
involving operators ‘+’,’-‘,’/’,’*’.
3. Design parser using Yacc tool to recognize a valid variable which starts with a
letter followed by any number of letters and digits.The length of the identifier
should not exceed 15.
4. Design parser using Yacc tool to recognize the grammar an b where n>=10.
5. Design parser using Yacc tool to recognize the validity of nested if statements and
also display the number of levels of nesting

Note:

Continuous Internal Evaluation (50 marks) :

Marks are based on execution of assignments and lab internal test. The marks are
distributed as below;
1. 30 marks for lab assignment execution.
2. 20 marks for lab internal test.

Semester End Examination (50 marks):

In semester end examination two questions will be given. One from Part-I and Part-III
respectively.
 OPERATING SYSTEM LABORATORY

Sub Code : UCS526L Credits : 02

CIE
Hours/Week : 04 : 50
MARKS
Exam Hours : 03 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

 At the end of the course the student should be able to

 Design and implement simple, but efficient, concurrent process and thread based
application.
 Implementing various memory allocation strategies and analysing their
performance.
 Analyse the performance of various scheduling algorithms by implementing them.
 Analysing the performance of various page replacement policies by implementing
them.
 Analyse and Implement the solution for various synchronization problems.
 Analysing and implementing various Deadlock handling strategies.
 Know where to look for platform specific programming information and be
familiar with reading and using man page information as well as other standard
reference materials
 Write correct and well documented advanced C code using low level Unix/Linux
system calls.
 Add new system calls to Kernel.
 Able to explain about File system.

PART A

1. Write a C program to sort the given set of numbers. Let the parent process sort the
first half of the list and child process sort the second half of the list. Finally let the
parent process merge the two sorted sublists and display the result.
2. Write a C program to sort the given set of numbers. Let the parent sort the first half
of the list and child thread sort the second half of the list. Finally let the parent
thread merge the two sorted sublists and display the result.
3. Write a C program to implement Shortest Request Next Scheduling Policy (Non-
Preemptive).
4. Write a C program to implement the following memory allocation schemes by
considering the problem of external fragmentation.
a. Best Fit
b. Worst Fit
5. Write a C program to implement FIFO page replacement technique,also check
Beladays anomaly.
6. Write a C program to implement LRU page replacement technique.
7. Write a C program to implement Producer-Consumer problem using Dekkers
 algorithm
8. Write a C program to implement Bankers Algorithm.

PART B

1. Write a C program to implement the following functions using File APIs

1. a.displayfile(filename)
2. b.readfrom(filename,position,buff,size)
2. Write a C program to print the type of file for each command line argument.
3. Write a C program to display environment variables of the parent process,then
create a child process and execute a new program with new environment(Use
apprpriate exec system call)
4. Write a C program to display process times.
5. 5. Write a C program to generate SIGINT and SIGSTOP signals using signal()
API,Count number of CTRL_C pressings of user and display the CTRL_C
pressing count when user presses CTRL_Z.
6. Write a C program to handle signal generated during arithemetic operations.
7. Write a C program to demonstrate interprocess communication using pipes. A
parent process reads data from a file and writes it to a pipe wheres as the child
process reads data from the pipe and displays it on screen.
8. Write a C program to implement the solution for producer-Consumer problem
using Semaphores.

Part C (Not for SEE)

Adding system calls to the kernel.
 FINITE AUTOMATA AND FORMAL LANGUAGES
Sub Code : UCS064E Credits : 03
CIE
Hours/Week : 03 : 50
MARKS
Total Hours : 40 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

After completion of this course student should be acquainted with theoretical aspects
of Formal Languages and Finite Automata machines.
 Able to construct finite state machines and the equivalent regular expressions.
 Able to prove the equivalence of languages described by finite state machines and
regular expressions.
 Able to construct pushdown automata and the equivalent context free grammars.
 Able to prove the equivalence of languages described by pushdown automata and
context free grammars.
 Able to construct Turing machine.

UNIT – I (10 Hours)

Introduction To Theory of Computation: Three basic concepts; some applications.

Finite Automata: Deterministic Finite Accepters; Nondeterministic Finite Accepters;
Equivalence of deterministic and Nondeterministic Finite Accepters; Reduction of the
number of states in Finite Automata.

UNIT – II (10 Hours)

Regular Languages and Regular Grammars: Regular expressions; Connection

between Regular Expression and Regular Languages; Regular Grammars.
Properties of Regular Languages: Closure Properties of Regular Languages;
Elementary Questions about Regular Languages; Identifying Nonregular Languages.

UNIT – III (10 Hours)

Context-Free Languages: Context-Free Grammars; Parsing and Ambiguity; Context-

Free Grammars and Programming Languages.
Simplification of Context-Free Grammars and Normal Forms: Methods of
Transforming Grammars; Two Important Normal Forms.

UNIT – IV (10 Hours)

Pushdown Automata: Nondeterministic Pushdown Automata; Pushdown Automata

and Context-Free Languages; Deterministic Pushdown Automata and Deterministic
Context-Free Languages.
Properties of Context-Free Languages: Two Pumping Lemmas; Closure Properties
and Decision Algorithms for Context Free Languages.
Turing Machines: The Standard Turing Machine.

TEXT BOOK:

1. An Introduction to Formal Languages and Automata, Peter Linz, Norosa

Publication, 4th Edition, 5th printing, 2007.

REFERENCE BOOK:

1. Introduction to Languages and Automata Theory, John C Martin, 3rd Edition,

Tata McGraw-Hill, 2007.
2. Introduction to Automata Therory, Langages and Computation, John E
Hopcroft, Rajeev Motwani, Jeffery D. Ullman, 3 rd C Edition, Person Education,
2007
 Python Programming

Sub Code : UCS065E Credits : 03

CIE
Hours/Week : 03 : 50
MARKS
Total Hours : 40 SEE Marks : 50

Course Outcomes: At the end of the course, students are able to:
1. Explain syntax and semantics of different statements and functions in Python.
2. Demonstrate the use of strings, files, lists, dictionaries and tuples in simple
applications.
3. Write simple applications using regular expressions, multiple threads, different
data types.
4. Build simple database applications with GUI.
5. Analyze the given problem and select appropriate data types and modules to
develop the solution.

Unit – I (10-Hours)
Variables, Expressions and statements, Conditional execution, Functions, Iterations,
Strings

Unit – II (10-Hours)
Files, Lists, Dictionaries, Tuples, Regular expressions

Unit – III (10-Hours)

Networked programs, Object Oriented Programming

Unit – IV (10-Hours)

GUI Programming, Multi-threaded programming, Using Databases and SQL

Text Books:

1. Charles R. Severance, “Python for Everybody: Exploring Data Using Python

3”, 1st Edition, CreateSpace Independent Publishing Platform, 2016.
(http://do1.drchuck.com/pythonlearn/EN_us/pythonlearn.pdf ) (Chapters 1 –
13, 15)
2. Wesley J. Chun, “Core Python Applications Programming”, Third Edition,
Pearson Education India, 2015.
Reference Books:
1) Charles Dierbach, "Introduction to Computer Science Using Python", 1st
Edition, Wiley India Pvt Ltd.
2) Mark Lutz, “Programming Python”, 4th Edition, O’Reilly Media, 2011.ISBN-
13: 978-9350232873
3) Roberto Tamassia, Michael H Goldwasser, Michael T Goodrich, “Data
Structures and Algorithms in Python”, 1st Edition, Wiley India Pvt. Ltd, 2016.
ISBN-13: 978- 8126562176
4) Reema Thareja, “Python Programming using problem solving approach”, Oxford
university press, 2017
5) https://www.python.org/
 B. V. V. Sangha’ s
Basaveshwar Engineering College (Autonomous), Bagalkot
Department of Computer Science and Engineering

Scheme of Syllabus for 6th Semester

(2015-2016 to 2017-2018 Admitted Batches)

Sl. Subject Hrs/Week

Subjects C CIE *SEE Total
No Code L T P
1 UCS611C Computer Networks 4 0 0 4 50 50 100
Advanced Computer
2 UCS612C 3 0 2# 4 50 50 100
Architectures
Computer Graphics and
3 UCS613C 4 0 0 4 50 50 100
Visualization
4 - Elective - 3 3 0 0 3 50 50 100
5 - Elective -4 3 0 0 3 50 50 100
6 - Elective -5 3 0 0 3 50 50 100
7 UCS614L Computer Graphics Lab 0 0 3 1.5 50 50 100
8 UCS615L Computer Networks Lab 0 0 3 1.5 50 50 100
9 UCS616S Seminar 2 1 50 50 100
Total 20 0 6 25 400 400 800

L: Lecturer Hours per Week T: Tutorial hours per week

P: Practical Hours per Week C: Credit points
*CIE: Continuous Internal Evaluation *SEE: Semester End Examination

# Lab is to be evaluated for 20 marks in CIE only, theory is to be evaluated for 30 marks in CIE and
50 marks in SEE and the same scheme is applicable to elective courses on programming
languages.
 COMPUTER NETWORKS

Sub Code : UCS611C Credits : 04

CIE
Hours/Week : 04 : 50
MARKS
Total Hours : 48 SEE Marks : 50

COURSE OUTCOMES

1 To build an understanding of the fundamental concepts of Computer

Networks.
2 To analyze and explain different protocols & security aspects of
Computer Networks.
3 To apply techniques like addressing, mapping, routing, error
controlling, security etc. for efficient handling of Computer
Networks.
4 Design and implement a secured and manageable network.

UNIT – I (12 Hours)

Network Layer: Logical Addressing: IPv4 Addresses, IPv6 Addresses. Internet

Protocol: Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6. Address
Mapping, Error Reporting & Multicasting: Address Mapping, ICMP, and IGMP.
Delivery, Forwarding & Routing: Delivery, Forwarding, Unicast Routing Protocols.

UNIT – II (12 Hours)

Transport Layer: Peer-to-Peer Delivery: UDP, TCP, and SCTP. Congestion Control
and Quality of Service: Data traffic, Congestion, Congestion Control, Two Examples,
Quality of Service, Techniques to improve QoS, Integrated Services, QoS in Switched
Networks.

UNIT – III (12 Hours)

Application Layer: Domain Name System: Name Space, Domain Name Space,
Distribution of Name Space, DNS In The Internet, Resolution, DNS Messages, Types
of records, Registrars, Dynamic Domain Name System, Encapsulation. Remote
Logging, Electronic Mail, File Transfer. WWW and HTTP: Architecture, Web
Documents, HTTP.

UNIT – IV (12 Hours)

Network Management: Network Management System, SNMP. Multimedia:

Digitizing Audio and Video, Audio and Video Compression, Streaming Stored
Audio/Video, Streaming Live Audio/Video, Real-Time Interactive Audio/Video, RTP,
RTCP, Voice Over IP. Cryptography: Introduction, Symmetric-Key Cryptography,
Asymmetric-key Cryptography, Network Security services.
TEXT BOOK:

1. Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data

Communications and Networking.

REFERENCE BOOKS:

1. James F. Kurose, Keith W. Ross, Third Edition, Pearson Education, 2008,

Computer Networking-A top-down approach featuring the Internet.
2. William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer
Communication.
3. Larry L. Peterson and Bruce S. David – 4th Edition, Elsevier, 2007, Computer
Networks A Systems Approach.
4. Wayne Tomasi, Pearson Education, 2005, Introduction to Data
Communications and Networking.
UCS612C ADVANCED COMPUTER ARCHITECTURES 4 CREDITS
Hours/Week: 03 Hrs Theory+2 Hrs lab CIE Marks: 50
Total Hours: 48 SEE Marks:50
Course Outcomes:
At the end of the course students are able to
1. Explain the basic concepts of high performance computers.

2. Compare the relationship between different computer architectures and

their corresponding instruction sets.

3. Calculate and analyze the performance of various computer

architectures.

4. Design interconnection networks for various architectures with given

specification.

5. Design and develop simple parallel programs.

UNIT – I 10hrs

Parallel Computer Models : The State of Computing, Computer Development

Milestones, Elements of Modem Computers, Evolution of Computer Architecture,
System Attributes to Performance, Multiprocessors and Multicomputers, Shared
-Memory Multiprocessors, Distributed -Memory Multiprocessors, A Taxonomy of
MIMD Computers, Multivector and SIMD computers, Vector Supercomputers, SIMD
Supercomputers, Program and Network Properties, Conditions of Parallelism, Data
and Resource Dependencies, Hardware and Software Parallelism, Program flow
Mechanisms, Control Flow Versus Data Flow , Demand-Driven Mechanisms,
Comparisons of Flow Mechanisms. PARALLEL PROGRAMMING: Message passing
Programming, Shared memory programming, open MP Libraries.

UNIT-II 10hrs

System Interconnect Architecture: Network properties and Routing, Static Connection

Networks, Dynamic Connection Networks, Processor and Memory Technologies,
Advanced Processor Technology, Instruction Pipelines, Processors and Co-processors,
Instruction-Set Architectures,CISC Scalar Processor, RISC Scalar Processors,
Superscalar and Vector Processor, Superscalar Processors, VLIW Architecture

Backplane Bus System, Backplane Bus Specification, Addressing and Timing

Protocols, Arbitration, Transaction and Interrupt, IEEE Futurebus+ Standards, Shared-
Memory, Organizations, Interleaved Memory Organization, Bandwidth and fault
Tolerance, Memory Allocation Schemes.
 UNIT – III 10 hrs

Pipelining and Superscalar Techniques: Linear Pipeline Processors, Asynchronous and

Synchronous Models, Clocking and Timing control, Speed up, Efficiency and
Throughput, Non-linear Pipeline Processors, Reservation and Latency Analysis,
Collision-Free Scheduling, Instruction Pipeline Design, Instruction Execution Phases,
Mechanism for Instruction, Pipelining, Dynamic Instruction Scheduling, Branch
Handling Techniques, Arithmetic Pipeline Design, Computer Arithmetic Principles,
Static Arithmetic Pipeline, Multifunctional Arithmetic

UNIT-IV 10hrs

Multiprocessors and Multi-computers: Multiprocessor System Interconnects,

Hierarchical Bus Systems: Crossbar Switch and Multiport Memory, Multistage and
Combing Networks, Cache Coherence and Synchronization Mechanisms, The Cache
Coherence Problem, Snoopy Bus Protocol, Directory-based protocols, Single core and
Multicore architecture: Architectural Design space, Introduction to heterogeneous
computing , GPU architecture and OpenCL

TEXT BOOKS:

1. Kai Hwang, 1993, “Advanced Computer Architecture- Parallelism, Scalability,

Programmability”, McGraw Hill (Chapter 1.1-1.3, 2.1-204, 4. 1 (only specified
topics), 4.2.1, 4.2.2, 5.1, 5.3, 6.1, 604, 7.1, 7.2, 704.1, 704.2, 704.3)
2. V Rajararnan, C Siva Ram Murthy, 2000,”Parallel Computers - Architecture
andProgramming “, PHI
3. Benedict R. Gaster, Lee Howes, David R, Perhaad Mistry, Dana Schaa,
“Heterogeneous Computing with OpenCL” Morgan Kaufmann, 2012.

REFERENCE BOOKS:

1. David E Culler, J P Singh, Anoop Gupta, Harcourt Asia and Morgan Kaufmann
1999, “Parallel Computer Architecture”,
2. John P Hayes, 1998, “Computer Architecture and Organization”, 3rd Edition,
McGraw-Hill
3. Michael Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata
McGraw Hill, 2011.

Note: It also includes laboratory (3hrs theory and 2hrs practical/week).

CS613C COMPUTER GRAPHICS AND VISUALIZATION 4 CREDITS

Hours/Week: 04 CIE Marks: 50

Total Hours: 48 SEE Marks: 50

Course Outcomes

At the end of the course students are able to:

1. Explain fundamental concepts of computer graphics and visualization

2. Apply algorithms to solve graphics problem

3. Able to develop interactive 2D and 3D graphics applications

4. Illustrate the animations of graphics models using geometric transformation

functions

5. Construct the graphical model with lighting and shading patterns

UNIT – I 12 Hrs

Overview of Graphics Systems: Video Display Devices, Raster-Scan Displays,

GraphicsWorkstations and Viewing Systems, Introduction to OpenGL, Graphics
Output Primitives : Coordinate Reference Frames, Specifying A Two-Dimensional
World-Coordinate Reference Frame in OpenGL, OpenGL Point Functions, OpenGL
Line Functions, Line drawing algorithms: Bresenham’s Line-Drawing Algorithm,
OpenGL Curve Functions, Circle generating Algorithms: Midpoint Circle Algorithm,
Fill-Area primitives, OpenGL Polygon Fill-Area Functions, OpenGL Vertex Arrays,
Pixel-Array Primitives, OpenGL Pixel-Array Functions, Character Primitives,
OpenGL Character Functions, OpenGL Display Lists, OpenGL Display-Window
Reshape Function, Attributes of Graphics Primitives: OpenGL State Variables,
Color and Grayscale, OpenGL Color Functions, OpenGL Point-Attribute Functions,
OpenGL Line-Attribute Functions

UNIT– II 12 Hrs

Interactive Input Methods and Graphical User Interfaces:

Graphical Input Data, Logical Classification of Input Devices, Input Functions for
Graphical Data, Interactive Picture-Construction Techniques, OpenGL Interactive
Input-Device Functions , OpenGL Menu Functions, Designing a Graphical User
Interface
Geometric Transformations-1: Basic Two-Dimensional Geometric Transformations,
Matrix Representations and Homogeneous Coordinates, Inverse Transformations,
Two-Dimensional Composite Transformations, Other Two-Dimensional
Transformations, Raster Methods for Geometric Transformations, OpenGL Raster
Transformations, Transformations between Two-Dimensional Coordinate Systems

UNIT – III 12 Hrs

Geometric Transformations-2:Geometric Transformations in Three-Dimensional

Space, Three-Dimensional Translation, Three-Dimensional Rotation, Three-
Dimensional Scaling, Composite Three Dimensional Transformations, Other Three
Dimensional Transformations, Transformations between Three Dimensional
Coordinate Systems, Affine Tranformations, OpenGL Geometric Transformations
Functions

Two-Dimensional Viewing: The Two-Dimensional Viewing Pipeline, The clipping

Window, Normalization and Viewport Transformations, OpenGL Two-Dimensional
Viewing Functions, Clipping Algorithms, Two-Dimensional Point Clipping, Two-
Dimensional Line Clipping: Cohen-Sutherland line Clipping, Polygon Fill-Area
Clipping: Sutherlan-Hodgman Polygon Clipping, Curve Clipping, Text Clipping

UNIT-IV 12 Hrs

Three-Dimensional Viewing: Overview of Three-Dimensional Viewing Concepts, The

Three-Dimensional Viewing Pipeline, Three-Dimensional Viewing-Coordinate
Parameters, Transformation from World to Viewing Coordinates, Projection
Transformations, Orthogonal Projections, Oblique Parallel Projections, Perspective
Projections, The Viewport Transformation and Three- Dimensional Screen
Coordinates, OpenGL Three-dimensional Viewing Functions, Three-Dimensional
Clipping Algorithms, OpenGL Optional Clipping Planes

Illumination Models and Surface-Rendering Methods: Light Sources, Surface Lighting

Effects, Basic Illumination Models, Transparent Surfaces, Atmospheric effects,
Shadows, Camera Parameters, Displaying Light Intensities, Polygon Rendering
Methods, Ray-Tracing methods, Radiocity Lighting Models, OpenGL Illumination and
Surface-Rendering Functions, OpenGL Texture Functions

Text Books:

1. Donald Hearn and Pauline Baker, 3rd Edition ,Pearson Education, 2004,
Computer Graphics with OpenGL

References:
1. Edvard Angel, 5th Edition, Addison-Wesley, 2008, Interactive Computer
Graphics A Top-Down Approach with openGL
2. F.S.Hill Jr.2nd Edition, Pearson Education, 2001, Computer Graphics using
OpenGL
3. James D. Foley, Andries Van Dam, Steven K Feiner, John F. Hughes, Addison-
wesley 19997, Computer Graphics
 COMPUTER GRAPHICS LABORATORY

Sub Code : UCS614L Credits : 1.5

Hours/Week : 03 CIE MARKS : 50
Exam Hours : 03 SEE Marks : 50

Course Outcomes
At the end of the course students are able to:
1. Draw the basic geometrical using OpenGL built in functions
2. Execute the program to implement fundamental graphics algorithms
3. Develop the programs to create animation of objects using graphics
functions
4. Develop graphics applications using OpenGL programming tool.
Part-A
1. Write OpenGL program to implement Bresenham’s line drawing algorithm.
2. Write OpenGL program to implement midpoint circle drawing algorithm.
3. Implement OpenGL program to draw bar chart and pie chart.
4. Write the following interactive OpenGL program
i) Draw a house using mouse to select two end point positions for straight line
ii) Display string “WEL TO BEC” on display window accepted from keyboard
5. Implement interactive animation programs.
 Kite flying
 Rotating wheel
 Moving car
6. Program to recursively subdivide a triangle to form 2D Sierpinski gasket. The
number of recursive steps is to be specified by the user.
7. Program to draw a cube and spin it using OpenGL transformation matrices.
8. Program to create a house like figure and rotate it about a given fixed point using
OpenGL functions.
9. Program to implement the Cohen- Sutherland line-clipping algorithm.
10. Program to create a cylinder and a parallelepiped by extruding a circle and
quadrilateral respectively. Allow the user to specify the circle and the quadrilateral
Part- B
Develop a suitable graphics package to implement the skills learnt in the theory and
the exercises indicated in Part A. Use the OpenGL.

Lab Assessment:
1. Each laboratory subject is evaluated for 100 marks (50 CIE and 50 SEE)
2. Allocation of 50 marks for CIE
1. Marks for each experiment = 20 marks/No. Of proposed experiments
2. 10 marks for graphics package
3. one practical test for 20 marks(25% write up ,50% conduction, calculation,
25% results)
3. Allocation of 50 marks for SEE
 30 marks for evaluating program (25% write up ,50% conduction, calculation,
25% results)
 20 marks for evaluating graphics package.
 Machine Learning

Sub Code : UCS044E Credits : 3

Hours/Week : 03 CIE MARKS : 50
Toatal Hours : 40 SEE Marks : 50

Course Objectives:
1. Introduce the fundamental concepts in machine learning and popular machine
learning problems.
2. Apply various supervised learning algorithms
3. Introduce various clustering and dimensionality reduction algorithms
Course Outcome:
1. Define machine learning and types of learning algorithms
2. Explain various machine learning algorithms
3. Apply machine learning algorithm to solve problems of moderate complexity
4. Analyze performance of algorithms by varying some parameters
5. To formulate machine learning model for the simple problems

UNIT-I (10-Hours)
Introduction: What is Machine Learning? Examples of Machine Learning
Applications. Well posed learning problems, Designing Learning System, Perspectives
and issues in Machine Learning.
Decision Tree Learning: Introduction, Decision tree representation, Appropriate
problems for decision tree learning, the basic decision tree learning algorithm,
Hypothesis space search in decision tree learning, Inductive Bias in decision tree
learning, Issues in decision tree learning

UNIT-II (10-Hours)
Artificial Neural Networks (ANN): Introduction, Neural Network Representations,
Appropriate Problems For Neural Network Learning, Perceptron, Multilayer Networks
And The Back propagation Algorithm, Remarks On The Back propagation Algorithm,
An Illustrative Example: Face Recognition.
Kernel Machines: Introduction, Optimal Separation Hyper plane, the non separable
case: soft margin hyper plane, V-SVM, Kernel Trick, Vectorial Kernels, Defining
kernel, Multiple kernel learning, Multiclass kernel machines, kernel machine for
regression, One class kernel machine

UNIT-III (10-Hours)
Bayesian learning: Introduction, Bay’s theorem, Maximum likelihood and least
squared hypothesis, Maximum likelihood hypothesis for predicting probabilities,
Minimum Description length principle, Bay’s optimal classifier, Gibbs algorithm,
Naive Bay’s Classifier. An Example: Classify Text. Bayesian Belief networks, EM
Algorithm
Instance Based Learning: Introduction, k-Nearest Neighbor Learning, Locally
Weighted Regression, Radial Basis function, and case based reasoning
 UNIT-IV (10-Hours)
Dimensionality Reduction: Introduction, Subset Selection, Principal Components
Analysis, Factor Analysis, Multi dimensional scaling, Linear descreminant analysis,
isomap, Locally Linear Embedding
Clustering: Introduction, Mixture Densities, K-means Clustering, Expectation
Maximization Algorithm, Mixture Latent Variable models, Supervised learning after
clustering, Hierarchical clustering, Choosing the number of clusters

Text Books:

1. “Machine Learning”, Tom Mitchell. First Edition, McGraw- Hill, 2013.

2. “Introduction to Machine Learning”, Edition 2, by Ethem Alpaydin.

Reference Books:
1. “Elements of Statistical Learning”, 2nd Edition, Trevor Hastie, Robert
Tipeshirani, Jerome Fredman.
2. “Introduction to Machine Learning” ,NPTEL Course Material, Dr. Sudheshna
Sarkar IIT Kharakpur.
3. “Building Machine Learning Systems with Python”, 2nd edition, Luis Pedro
Coelho and Willi Richart, PACKT Publication.
 Java and J2EE

Sub Code : UCS038E Credits : 3

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course Outcomes

At the end of this course, students will be able to

i) Explain the concepts of Java and J2EE.
ii) Apply object oriented programming concepts in problem solving.
iii) Develop the database application using JDBC drivers.
iv) Illustrate the concepts of JavaBeans and RMI
v) Develop web application for real life problems using JSP, JAVA servlet
Technologies.

UNIT – I
10 Hours
INTRODUCTION TO JAVA: Java and Java applications; Java Development Kit
(JDK); Java is interpreted, Byte Code, JVM; Object oriented programming; Simple
Java programs. Operators and expressions: Arithmetic Operators, Relational operators,
The? Operator; Logical expression; Type casting; Strings, Control Statements:
Selection statements, iteration statements, Jump Statements. CLASSES,
PACKAGES, EXCEPTIONS Classes: Defining Class, Constructors, Inheritance,
Overriding, Final classes, Interfaces, Implementing Interfaces, Packages: Creating
Packages, Adding a class to a Package, Hiding classes, Exceptions: Types of Errors,
Syntax of Exception handling, Multiple Catch Statement.

UNIT – II
10 Hours
MULTI THREADED PROGRAMMING: Creating Threads, Extending Thread
Class, Stopping and blocking thread, Thread exceptions, Thread priority,
Synchronization, Implementing runnable interface Managing I/O Files in java
Stream classes, Character stream classes, other I/o Classes, Input/output Exceptions,
Reading/ writing characters, Reading/writing Bytes, Random access files

UNIT – III
10 Hours
JAVA 2 ENTERPRISE EDITION OVERVIEW, DATABASE ACCESS: Overview
of J2EE and J2SE. The Concept of JDBC; JDBC Driver Types; JDBC Packages; A
Brief Overview of the JDBC process; Database Connection; Associating the
JDBC/ODBC Bridge with the Database; Statement Objects; ResultSet; Transaction
Processing; SERVLETS: Background; The Life Cycle of a Servlet; Using Tomcat for
Servlet Development; A simple Servlet; The Servlet API; The Javax. servlet Package;
Reading Servlet Parameter; The Javax.servlet.http package; Handling HTTP Requests
and Responses; Using Cookies; Session Tracking.
 UNIT – IV
10 Hours
JSP, RMI: Java Server Pages (JSP): JSP, JSP Tags, Tomcat, Request String, User
Sessions, Cookies, Session Objects. Java Remote Method Invocation: Remote Method
Invocation concept; Server side, Client side. ENTERPRISE JAVA BEANS:
Enterprise java Beans; Deployment Descriptors; Session Java Bean.

TEXT BOOKS:

1. E. Balaguruswamy, 2007, Programming with Java ,3rd Edition, Tata McGraw

Hill.
2. Jim Keogh , 2007, J2EE - The Complete Reference , Tata McGraw Hill.

REFERENCE BOOKS:

1. Y. Daniel Liang, 2007, Introduction to JAVA Programming ,6th Edition, Pearson

Education.
2. The J2EE Tutorial – Stephanie Bodoff et al, 2nd Edition, Pearson Education, 2004.
 Artificial Intelligence and Expert Systems

Sub Code : UCS041E Credits : 3

Hours/Week : 03 CIE MARKS : 50
Total Hours : 42 SEE Marks : 50

Course Outcomes:

At the end of the course, the students will be able to

1. Identify problems that are amenable to solution by AI methods and identify
appropriate
methods to solve a given problem.
2. Illustrate the representation of knowledge and inference using logic.
3. Analyze various control strategies and solve problems using search techniques
4. Apply reasoning under inconsistency and uncertainties.
5. Demonstrate the knowledge of expert systems and intelligent planning.

Unit – I

1. What is AI? The AI Problems, Underlying assumptions, AI technique, Level of the

model, Criteria for success (1.1 to 1.5 from Rich and Knight) 4 Hours
2. Problems, problem spaces and search Problem as a state space search, Production
systems, Problem characteristics, Production system characteristics, Issues in the
design of search problems, additional problems (2.1 to 2.6 from Rich and Knight)
6 Hours

Unit – II

3. Knowledge representation issues Representation and mappings, approaches to

knowledge representation, issues in knowledge representation, the frame problem (4.1
to 4.4 from Rich and Knight) 5 Hours
4. Using predicate logic Representing simple facts in logic, representing instance and
is-a relationships, computable functions and predicates, resolution, natural deduction
(5.1 to 5.5 from Rich and Knight) 5 Hours

Unit – III

5. Search and control strategies Introduction, preliminary concepts, examples of

search problems, uniformed or blind search, Informed search, Searching And-Or
graphs (9.1 to 9.6 from D. W. Patterson)
4 Hours
6. Dealing with inconsistencies and uncertainties Introduction, Truth maintenance
systems, Default reasoning and the closed world assumption, Predicate completion and
circumscription, Modal and temporal logics, Fuzzy logic and natural language
computation (5.1 to 5.6 from D. W. Patterson)
4 Hours
7. Probabilistic reasoning Introduction, Bayesian probabilistic inference, possible
world representation, Dempster-Shafer theory, Ad-hoc methods, heuristic reasoning
methods (6.1 to 6.6 from D. W. Patterson)
4 Hours

Unit - IV

8. Expert system architectures Introduction, Rule-based system architectures, Non-

production system architectures, Dealing with uncertainty, Knowledge acquisition and
validation, Knowledge system building tools (15.1 to 15.6 from D. W. Patterson)
4 Hours
9. Planning Overview, an example domain: The Blocks world, Components of a
planning system, goal stack planning, non-linear planning using constraint posting,
hierarchical planning, reactive systems, other planning techniques (13.1 to 13.8 from
Rich and Knight)
6 Hours

Text books:

1. Elaine Rich, Kevin Knight and Shivashankar B. Nair, Artificial Intelligence,

3rd Edition, TMH Education (P) Ltd., New Delhi, 2010
2. Dan W. Patterson, Artificial Intelligence and Expert Systems, PHI Learning (P)
Ltd., New Delhi, 2008

Reference books:

1. Stuart Russell and Peter Norvig, Artificial Intelligence: A modern approach,

3rd edition,Pearson, 2016
2. Nilson N. J., Principles of Artificial Intelligence, Springer Verlag, 1980
3. Eugene Charniak and Drew McDermot, Introduction to Artificial Intelligence,
Addison-Wesley, 1998
4. Peter Jackson, “Introduction To Expert Systems”, 3rd Edition, Pearson
Education, 2007
5. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education
 COMPUTER NETWORK LABORATORY

Sub Code : UCS615L Credits : 1.5

Hours/Week : 03 CIE MARKS : 50
Exam Hours : 03 SEE Marks : 50

COURSE OUTCOMES

 Create topology. Demonstrate the use of TCP/UDP commands.

 Analyze the performance of the network in terms of bandwidth, packet drop and
throughput.
 Demonstrate how error detection and correction methods work. analyze routing
algorithm to find the suitable path for transmission. Analyze and demonstrate the
control of flow rate.
 Demonstrate the client-server communication using TCP/IP sockets ,explain how
inter-process communication established using different methods.
 Demonstrate reliability of data flow; demonstrate how data can be secured.

PART – A

Simulation Exercises

Introduction Part
Introduce students to network simulation through the Network simulation Package,
Create a simple network model with multiple scenarios, Collect statistics on network
performance through the use of simulator tools, Analyze and draw conclusion on
network performance

1. Simulate two nodes point-to-point network and study the impact of bit error rate on
packet error rate and investigate the impact of error of a simple hub based CSMA /
CD network.
2. Simulate four nodes point-to-point network and study how the loss, utilization and
transmission of wireless LAN (IEEE 802.11b) network varies as the distance
between access point and wireless nodes.
3. Simulate point-to-point network which consists of 4 to 6 nodes and study network
performance analysis of different scheduling technique like First In Out (FIFO),
Priority, Round Robin, Weight Fair Queue (WFQ) using NetSim.
4. Simulate and study the throughputs of slow start, Congestion avoidance (also
known as Old Tahoe) and First Retransmit (also known as Tahoe), Congestion
Control Algorithms during client-server TCP downloads.
5. Create a network topology which consists six nodes, simulate and study the
working and routing table formation of Interior Routing Protocol i.e. Routing
Information Protocol (RIP) and Open Shortest Path First (OSPF).
6. Simulate seven cells GSM network and study and compare the effect of dynamic
channel allocation (DCA) and fixed channel allocation (FCA) using NetSim.
7. Simulate seven cells GSM network and study how call blocking probability varies
as the load on a GSM network is continuously increased.
PART – B

Implement the following in C/C++:

1. Write a program for error detecting code using CRC-CCITT (16- bits).
2. Write a program for Hamming code generation for error detection and correction.
3. Write a program for even / odd parity checking on binary data.
4. Write a program to perform stuffing and destuffing on given information.
5. Write a program for distance vector algorithm to find suitable path for
transmission.
6. Write a program for congestion control using leaky bucket algorithm
7. Using TCP/IP sockets, write a client – server program to make the client send the
file name and to make the server send back the contents of the requested file if
present.
8. Implement the program 7 using the message queues IPC channels.
9. Implement the program 7 using the FIFO IPC channels:
10. Write a program for simple RSA algorithm to encrypt and decrypt the data.

Note:
Student is required to solve one problem from PART-A and one problem from PART-
B. The questions are allotted based on lots. Both questions carry equal marks.
 B. V. V. Sangha’ s
Basaveshwar Engineering College (Autonomous), Bagalkot
Department of Computer Science and Engineering

Scheme of Syllabus for 7th Semester

(2015-2016 to 2017-2018 Admitted Batches)

Subject Hrs/Week
Sl.No Subjects C CIE *SEE Total
Code L T P
Object Oriented Modeling and
1 UCS711C 3 0 0 3 50 50 100
Design
2 UCS712C Web Technologies 3 0 0 3 50 50 100
Business communication &
3 UCS713H 3 0 0 3 50 50 100
Technical Writing
UCS714C Mobile Computing Systems 3 0 0 3
4 Elective – 6 3 0 0 3 50 50 100
5 Elective-7 3 0 0 3 50 50 100
7 UCS714L Web Programming Laboratory 0 0 3 1.5 50 50 100
Object Oriented Modeling and
8 UCS715L 0 0 3 1.5 50 50 100
Design Laboratory
9 UCS716P Project Phase-I 0 0 4 4 50 50 100
Total 18 0 8 25 450 450 900

L: Lecturer Hours per Week T: Tutorial hours per week

P: Practical Hours per Week C: Credit points
*CIE: Continuous Internal Evaluation *SEE: Semester End Examination
 OBJECT ORIENTED MODELING AND DESIGN

Sub Code : UCS711C Credits : 03

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course Outcomes:
At the end of the course the student should be able to
1. Explain the concepts of Object Oriented Modeling and Design.
2. Analyze user requirements for an application.
3. Design various models using Unified Modeling Language.
4. Comprehend the nature of design patterns by understanding small number of
examples from different categories.
5. Develop an application of Object Oriented Modeling and Design practices
from software project management perspectives.
.

UNIT – I (10 Hours)

INTRODUCTION, MODELING CONCEPTS, CLASS MODELING: What is Object

Orientation? What is OO development? OO themes; Evidence for usefulness of OO
development; OO modeling history. Modeling as Design Technique: Modeling;
abstraction; The three models. Class Modeling: Object and class concepts; Link and
associations concepts; Generalization and inheritance; A sample class model;
Navigation of class models; Practical tips.
ADVANCED CLASS MODELING, STATE MODELING: Advanced object and class
concepts; Association ends; N-ary associations; Aggregation; Abstract classes;
Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages;
Practical tips.State Modeling: Events, States, Transitions and Conditions; State
diagrams; State diagram behavior; Practical tips.

UNIT – II (10 Hours)

ADVANCED STATE MODELING, INTERACTION MODELING: Advanced State Modeling:

Nested state diagrams; Nested states; Signal generalization; Concurrency; A sample
state model; Relation of class and state models; Practical tips. Interaction Modeling:
Use case models; Sequence models; Activity models. Use case relationships;
Procedural sequence models; Special constructs for activity models.
PROCESS OVERVIEW, SYSTEM CONCEPTION, DOMAIN ANALYSIS: Process Overview:
Development stages; Development life cycle. System Conception: Devising a system
concept; Elaborating a concept; Preparing a problem statement. Domain Analysis:
Overview of analysis; Domain class model; Domain state model; Domain interaction
model; Iterating the analysis.

UNIT – III (10 Hours)

APPLICATION ANALYSIS, SYSTEM DESIGN: Application Analysis: Application
interaction model; Application class model; Application state model; Adding
operations. Overview of system design; Estimating performance; Making a reuse plan;
Breaking a system in to sub-systems; Identifying concurrency; Allocation of sub-
systems; Management of data storage; Handling global resources; Choosing a software
control strategy; Handling boundary conditions; Setting the trade-off priorities;
Common architectural styles; Architecture of the ATM system as the example.

CLASS DESIGN, IMPLEMENTATION MODELING, LEGACY SYSTEMS: Class Design:

Overview of class design; Bridging the gap; Realizing use cases; Designing
algorithms; Recursing downwards, Refactoring; Design optimization; Reification of
behavior; Adjustment of inheritance; Organizing a class design; ATM example.
Implementation Modeling: Overview of implementation; Fine-tuning classes; Fine-
tuning generalizations; Realizing associations; Testing. Legacy Systems: Reverse
engineering; Building the class models; Building the interaction model; Building the
state model; Reverse engineering tips; Wrapping; Maintenance.

UNIT – IV (10 Hours)

DESIGN PATTERNS – 1: What is a pattern and what makes a pattern? Pattern

categories; Relationships between patterns; Pattern description.
Communication Patterns: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-
Subscriber.
DESIGN PATTERNS – 2, IDIOMS: Management Patterns: Command processor; View
handler. Idioms: Introduction; What can idioms provide? Idioms and style; Where to
find idioms; Counted Pointer example.

TEXT BOOKS:

1. Object-Oriented Modeling and Design with UML – Michael Blaha, James

nd
Rumbaugh, 2 Edition, Pearson Education, 2005.
2. Pattern-Oriented Software Architecture: A System of Patterns - Volume 1 – Frank
Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal, John
Wiley and Sons, 2006.

REFERENCE BOOKS:

rd
1. Object-Oriented Analysis and Design with Applications – Grady Booch et al, 3
Edition, Pearson Education, 2007.
2. Object-Oriented Design with UML and JAVA – K. Barclay, J. Savage, Elsevier,
2008.
3. The Unified Modeling Language User Guide – Booch, G., Rumbaugh, J., and
nd
Jacobson I, 2 Edition, Pearson, 2005.
4. Design Patterns: Elements of Reusable Object-Oriented Software – E. Gamma,
R. Helm, R. Johnson, J. Vlissides, Addison-Wesley, 1995.
 WEB TECHNOLOGIES

Sub Code : UCS712C Credits : 03

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course Outcome:
1. Understand the basic concepts and tools used in web programming.
2. Apply web programming concepts to develop web pages.
3. Analyze the given requirement specification to develop any business
applications.
4. Design and implement real time web applications.

UNIT-I (10 Hours)

Fundamentals of Web, XHTML : Internet, WWW, Web Browsers, and Web Servers;
URLs; MIME; HTTP; Security; The Web Programmers Toolbox. XHTML: Origins
and evolution of HTML and XHTML; Basic syntax; Standard XHTML document
structure; Basic text markup. XHTML : Images; Hypertext Links; Lists; Tables;
Forms; Frames; Syntactic differences between HTML and XHTML. CSS:
Introduction; Levels of style sheets; Style specification formats; Selector forms;
Property value forms; CSS: Font properties; List properties; Color; Alignment of text;
The Box model; Background images; The <span> and <div> tags; Conflict resolution.

UNIT-II (10 Hours)

JAVASCRIPT: Overview of Javascript; Object orientation and Javascript; General

syntactic characteristics; Primitives, operations, and expressions; Screen output and
keyboard input; Control statements; Object creation and modification; Arrays;
Functions; Constructor; Pattern matching using regular expressions; Errors in scripts;
Examples. JAVASCRIPT AND HTML DOCUMENTS: The Javascript execution
environment; The Document Object Model; Element access in Javascript; Events and
event handling; Handling events from the Body elements, Button elements, Text box
and Password elements; DYNAMIC DOCUMENTS WITH JAVASCRIPT:
Introduction to dynamic documents; Positioning elements; Moving elements; Element
visibility; Changing colors and fonts; Dynamic content; Stacking elements;

UNIT-III (10 Hours)

XML: Introduction; Syntax; Document structure; Document Type definitions;

Namespaces; XML schemas; Displaying raw XML documents; Displaying XML
documents with CSS; ASP.NET;JSP: Architecture of JSP Page, JSP Page life cycle,
JSP elements, JSP expression language, Debugging with JSP Debug, JSP Tag
extensions: elements of Tag extensions, Tag extension API, Classic tag Handlers,
Simple tag Handlers, JSP Fragments, JSP Slandered tag library: Introducing JSTL,
Working with the core Tag library, working with XML Tag, Working with SQL Tag
library, Working with Function Tag library.
 UNIT-IV (10 Hours)

EJB: EJB Fundamentals, Classifying EJB, Session Bean, Implementing Session

Beans, message – Driven Bean, Implementing message Driven Bean, managing
transactions in java EE applications, EJB Timer services, Implementing EJB Timer
services.
Hibernate: Introduction to Hibernate, Architecture of Hibernate, Hibernate Query
Language, Hibernate O/R Mapping, Example on Hibernate, Implementing O/R
Mapping with Hibernate, Basics of Jquery, Traversing DOM, DOM manipulation with
Jquery.

Text Books:

1. Programming the World Wide Web – Robert W. Sebesta, 4th Edition, Pearson
Education, 2008.
2. “Java Server Programming Java EE5” Black Book, Dreamtech Press.
3. Jack Franklin “Beginning Jquery” Apress.
4. References:
5. Andrew Trolsen, 2007, ―C# and the .NET platform”, Second Edition, Dream tech
Press,
6. M. Deitel, P.J. Deitel, A. B. Goldberg, ―2004, India Internet & World Wide Web
How to program ―, 3rd Edition, Pearson Education / PHI
7. Chris Bates, 2006, ―Web Programming Building Internet Applications‖,3rd
edition, Wiley India
8. Xue Bai et al, Thomson, 2003,‖The Web Warrior Guide to Web Programming”
 BUSINESS COMMUNICATION AND TECHNICAL
WRITING

Sub Code : UCS713H Credits : 03

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course learning Objectives:

At the end of the course student will learn/practice/ think/experience/appreciate:

1. Design and implement of system softwares using C or C++.
2. Design and implement of scanners using Lex tool.
3. Design and implement of parser using Yacc tool.

Course outcomes:

At the end of the semester student should be able to:

1. Implement the system softwares such as assembler, loader and linker etc using C
or C++.
2. Design and write Lex program to implement lexical analyzer for given problem
statement.
3. Design and write Yacc program to implement parser for the given structure
recognition.
4. Modify the existing design of the algorithm of system softwares to enhance the
efficiency.

UNIT I (10 Hours)

Communication In The Workplace Role of Communication in Business,

characteristics of communication, elements and Process of Communication, principles
of communication, Objectives of Communications, Methods of Communication
(verbal and Non-Verbal), Media and Mode of Communication, Channels of
Communication, Barriers to communication, Exercises.

UNIT II (10 Hours)

Writing For The Effect:

Business Etiquette and need for effect, Conversational Style, You view, Point, Positive,
Language, Courtesy
Listening:
Introduction, meaning of listening, poor listening habits, types of listening, Effective
and ineffective listening skills, Strategies for effective listening, payoffs of effective
listening, barriers of effective listening, active and passive listening, role of listening in
Leadership style.
Business Presentation and Public Speaking:
Presentations and Speeches, Exercises
 UNIT III (10 Hours)

Constituents of Effective writing:

Sentence Construction, Paragraph development, The art of condensation, Exercises
Written forms of communication:
Letters: Business letters, memos, Emails, Reports: Objectives, Characteristics of a
report, Types of reports, importance of reports, Formats, Prewriting, Structure of
reports, Writing the reports, Revising, editing and proof reading. Exercises
Technical proposals: Definition, Purposes, types, Characteristics, Elements of
structure, Evaluation, Exercises

UNIT IV (10 Hours)

Research paper, Dissertation and Thesis

Instruction manuals and technical description: Instruction manuals, types of
instructions, Writing instructions, user’s manuals, Technical description, Process
description, Exercises.

Text Books:

1. Urmila Rai nad S,M Rai ,Business Communication, Himalaya Publishing House.
(chapters 1-7)
2. Lesikar and Fatley , Basics Business communication Skills for Empowering the
Internet Generation 10 th edition, Tata McGraw Hill edition,ISBN:
780070599758.(Chapter 4)
3. Meenakshi Raman and Sangeeta Sharma “Technical Communication Principles
and practices”, Oxford University Press, ISBN13 9780195668049. (Chapters: 9-
11, 13-17)
4. Meenakshi Raman and Prakash Singh “Business Communication”, Oxford
University Press, ISBN13: 9780195676952. ( Chapter s 3-4)
 MOBILE COMPUTING SYSTEMS

Sub Code : UCS718C Credits : 03

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

Student should able to

 Know the architecture of PCS Architecture with mobility support in wireless
networks.
 Explore the functions of GSM and GPRS Architecture
 Know the details of Third Generation mobile services and Mobile IP
 Explore Mobile Internet and Wireless Web issues
 Explore Mobile agents and process migration

UNIT – I (10 Hours)

Introduction :PCS Architecture, Cellular Telephony, cordless telehony and Low-ties

PCS. Mobility management: Handoff, Rooming management. Rooming management
under SS7. GSM system overview: GSM Architecture, Location tracking and call set
up, Data services, GSM mobility managenent : GSM Location update , Mobility
databases, Failure Restoration, VLR Identification algorithm, VRL Overflow control.

UNIT – II (10 Hours)

General packet radio services (GPRS): GPRS functional Groups, Architecture, GPRS
network nodes, GPRS interfaces, GPRS procedures, Billing , Wireless application
Protocol (WAP): WAP Gateway, WAP protocols, WAP UAprof and caching. Third
Generation mobile services: W-CDMA and CDMA 2000. Improvements on core
network, QoS in 3G, Wireless OS for 3G Handset, Third generation systems.

UNIT – III (10 Hours)

Cellular communication : In 3G, 3.5G, 4G. Wireless Networks: WLAN standards ,

Bluetouth, Hiper LAN, Wimax, Logical Mobility : Migrating processes, Physical
mobility: Requirements for physical Mobility, Overview of IP4 and IPV6 , Mobile IP,
Cellular IP, TCP for mobility, mobile data bases, Mobile handheld devices:
Characteristics of PDAS, Palm OS, Windows CE, Nokia handhelds, Symbian OS.
 UNIT – IV (10 Hours)

Mobile Internet and Wireless Web: Web programming model, WAP programming
model, WAP protocol stack, WAP gateway, Mobile Agents, Characterstics of mobile
agents, Requirements for mobile agent systems, Mobile agents plateforms : Aglet
,Aglet Tcl, PMADE, security issuess in mobile
Computing: Security threats to wireless networks, IEEE 802.11 security through WEP.
TEXTBOOKS:

1. Yi-Bing Lin, Imrich chlamtac “Wireless and mobile network architectures” Wiley
2. Kumkum harg “Mobile computing : Theory & Practice” pearson Education India.

REFERENCES:

1. Dr. Ashok Talukder, Ms Roopa Yavagal, Mr. Hasan Ahmed: “ Mobile Computing,
Technology, Applications and Service Creation” 2d Edition, Tata McGraw Hill,
2010
2. Martyn Mallik: “Mobile and Wireless Design Essentials” Wiley, 2003
3. Raj kamal: Mobile Computing, Oxford University Press, 2007.
4. Iti Saha Misra: Wireless Communications and Networks, 3G and Beyond, Tata
McGraw Hill, 2009.
 Computer Networks Security

Sub Code : UCS003E Credits : 03

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course outcomes
At the end of the course, the students will be able to
1) Identity and analyze the existing security vulnerabilities, services and
mechanisms in a computer network and develop a security model to prevent,
detect and recover from the attacks.
2) Illustrate the basic concept of encryption and decryption for secure data
transmission and apply them
3) Analyze and compare various cryptography techniques, authentication and key
management protocols
4) Explain the services and mechanisms employed at the different layers of the
OSI to provide security.
5) Evaluate the existing computing systems and propose new strategies to secure
data communication.

UNIT- I (10 Hours)

Symmetric Ciphers: Overview: Services, Mechanisms and Attacks, The OSI Security
Architecture, A Model of Network Security. Classical Encryption Techniques:
Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor
Machines, Steganography. Block Cipher and the Data Encryption Standard: Simplified
DES, Block Cipher Principles.

UNIT- II (10 Hours)

The Data Encryption Standard: The Strength of DES, Differential and Linear
Cryptanalysis. Symmetric Ciphers: Triple DES, Blowfish. Confidentiality Using
Conventional Encryption: Placement of Encryption Function, Traffic Confidentiality,
Key Distribution, Random Number Generation. Public-Key Encryption, Digital
signatures and Authentication Protocols: Number Theory: Prime Numbers, Format’s
and Euler's Theorems, Testing for Primality. Public-Key Cryptography and RSA:
Principles of Public Key Cryptosystems, The RSA Algorithm, Key Management,
Diffie Hellman Key Exchange.

UNIT- III (10 Hours)

Message Authentication: Authentication Requirements, Authentication Functions,
Message Authentication Codes, MDS Message Digest Algorithm. Digital Signatures
and Authentication Protocols: Digital Signatures, Authentication Protocols, Digital
Signature Standard. Network Security: Authentication Applications: Kerberos, XS09
Directory Authentication Service. Electronic Mail Security: Pretty Good Privacy.
 UNIT – IV (10 Hours)
IP Security: Overview, IP Security Architecture, Authentication Header, Encapsulation
Security Payload. Web Security: Web Security Requirements, Secure Sockets Layer
and Transport Layer Security, Secure Electronic Transaction.

Text book:

1. William Stallings, Cryptography and Network Security

 Advance Database Management Systems

Sub Code : UCS048E Credits : 03

Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course Objectives: The objective of the course is

1. Explain the concepts of OLTP applications.
2. Demonstrate the basic concepts of data storage, file data structures and query
optimization.
3. Analyze the performance of tree structured indexing and hash based indexing.
4. Evaluate given query using suitable algorithms.
5. Illustrate various methods to evaluate relational operations.

UNIT-I (9 Hours)

Storage and Indexing, Disks and Files:

Data on external storage, File organizations and indexing, Index data structures,
Comparison of file organizations, Indexes and performance tuning, RAID, Disk space
management, Buffer manager, Files of records, Page formats and record formats.

UNIT-II (10 Hours)

Tree Structured and Hash Based Indexing:

Intuition for tree indexes, Indexed sequential access method (ISAM), B+ trees, Search,
Insert, Delete, Duplicates, B+ trees in practice, Static hashing: Extendible hashing,
Linear hashing, comparisons.

UNIT-III (10 Hours)

Query Evaluation and External Sorting:

The system catalog, Introduction to operator evaluation, Algorithms for relational
Operations, Introduction to query optimization, Alternative plans, motivating example,
what a typical optimizer does, when does a DBMS sort data? A simple two-way merge
sort, External merge sort.
Evaluating Relational Operators
The Selection operation, General selection conditions, The Projection operation, The
Join operation, The Set operations, Aggregate operations, The impact of buffering

UNIT-I (11 Hours)

A Typical Relational Query Optimizer:

Translating SQL queries in to Relational Algebra, Estimating the cost of a plan,
Relational algebra equivalences, Enumeration of alternative plans, Nested sub-queries,
other approaches to query optimization.
Transaction Processing Concepts : Characterizing schedules based on recoverability,
Characterizing schedules based on serializability, Concurrency control: Two Phase
Locking Techniques, Based on Time Stamp Ordering, Granularity of Data items and
Multiple Granularity Locking, Recovery Technique: ARIES Recovery Algorithm,
Recovery in MultidataBase Systems, DataBase Backup and Recovery from
Catastrophic failures.
.
Text Books:

1. Raghu Ramakrishnan and Johannes Gehrke, 2003, “ Database Management

Systems”, 3rd Edition, McGraw-Hill (Chapters 8, 9, 10, 11, 12, 13.1 to 13.3,
14, 15) Elmasri and Navathe, Addison- Wesley, 2007 Fundamentals of
Database Systems, 5th Edition, (Chapter 17, 18, 19, 30)

REFERENCE BOOKS:

1. Connolly and Begg, 2002. Database Systems, 3rd Edition, Pearson

Publications,
 WEB PROGRAMMING LABORATORY

Sub Code : UCS714L Credits : 01

Hours/Week : 02 CIE MARKS : 50
Exam Hours : 03 SEE Marks : 50

Course Outcome:
1. Implement static web pages using basic concepts of web programming
2. Implement dynamic web pages using basic concepts of web programming
3. Demonstrate 2-tier dynamic web pages using mysql and jstl,jsp
4. Design and implement real time web applications.

LAB ASSIGNMENT LIST

1. Develop a XHTML document to create bio-data using external style sheet, ordered
list, table, borders, padding, color and the <span> tag.

2. A) Develop a XHTML file that includes JavaScript for the following problems:
Input: percentage marks of the student Output: Display result.

B) Develop and demonstrate, using JavaScript, a XHTML document that collects

the USN ( the valid format is: A digit from 1 to 4 followed by two upper-case
characters followed by two digits followed by two upper-case characters followed
by three digits; no embedded spaces allowed) of the user. Event handler must be
included for the form element that collects this information to validate the input.
Messages in the alert dialog box must be produced when errors are detected.

3. Write a XHTML form for Employee information like Emp_id, Name, Department
Name, Phone, Email check the validation for each fields(the first character of
Emp_id is followed by number ,name should accept 20 characters, Phone max 8
digits, email) using event handler in JavaScript.

4. Develop and demonstrate, using JavaScript, a XHTML document that contains

three short paragraphs of text, stacked on top of each other, with only enough of
each showing so that the mouse cursor can be placed over some part of them.
When the cursor is placed over the exposed part of any paragraph, it should rise to
the top to become completely visible.

5. Develop and demonstrate, using JavaScript, a XHTML that changes the content of
XHTML elements by assisting to a user filling out a form associated with text area,
called a help box. The content of help box can change, depending on the placement
of the mouse cursor. When a cursor is placed over particular input field, the help
box can display advice on how field is to be filled.
6. Write an XML file which will display the student information whichincludes
the following:
a. USN
b. Name of student
c. Banch
d. CGPA
Make up sample data for 3 students. Write a Document Type Definition (DTD)
to validate the above XML file. Display the XML file as follows. The contents
should be displayed in a table. Use XML and CSS for the above purpose.

7. Write program using XSLT and XML for displaying student details based on
ranking of CGPA

8. Create a XHTML document which allows user to select the course. Once user
selects course, it should display course id,course name,course description
information using jsp and javabean.

9. Create a form with Name, USN, three test marks text fields. On submitting,
store the values in database table along with total marks scored. Retrieve and
display the database (Using Java Server Program). . Event handler must be
included for the form element that collects every information to validate the
input. Messages in the alert dialog box must be produced when errors are
detected.

10. Write dynamic XHTML document to list student names from database and
search for a particular student details using JSP.

11. Write a program to demonstrate EJB.

 OBJECT ORIENTED MODELING AND DESIGN
LABORATORY

Sub Code : UCS715L Credits : 1.5

Hours/Week : 02 CIE MARKS : 50
Exam Hours : 03 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

1. Design the models for real world applications using UML diagrams.
2. Implement the applications using JAVA programming language.
3. Trace the behavior and analyze how various scenarios play out.
4. Describe a set of object oriented concepts and language independent graphical
notation that can be used to analyze problem requirements.
5. Use UML as communication and modeling tool.

ASSIGNMENTS

Analyze and design the following Systems with all specifications using the UML
diagrams
1. Class Diagram ii) Usecase Diagram iii) Sequence diagram
2. State Chart Diagram v) Activity Diagram

Note: Make appropriate assumptions wherever required.

1. PASSPORT AUTOMATION SYSTEM PROBLEM STATEMENT:

Passport Automation System is used in the effective dispatch of passport to all of the
applicants. This system adopts a comprehensive approach to minimize the manual
work and schedule resources, time in a cogent manner. The core of the system is to get
the online registration form (with details such as name, address etc.,) filled by the
applicant whose testament is verified for its genuineness by the Passport Automation
System with respect to the already existing information in the database. This forms the
first and foremost step in the processing of passport application. After the first round
of verification done by the system, the information is in turn forwarded to the regional
administrator's (Ministry of External Affairs) office. The application is then processed
manually based on the report given by the system, and any forfeiting identified can
make the applicant liable to penalty as per the law. The system also provides the
applicant the list of available dates for appointment to 'document verification' in the
administrator's office, from which they can select one. The system forwards the
necessary details to the police for its separate verification whose report is then
presented to the administrator. The administrator will be provided with an option to
display the current status of application to the applicant, which they can view in their
online interface. After all the necessary criteria have been met, the original information
is added to the database and the passport is sent to the applicant.

2. HOSPITAL MANAGEMENT SYSTEM PROBLEM STATEMENT:

In hospital, there are many departments like Orthopedic, Pathology, Emergency,
Dental, Gynecology, Anesthetics, I.C.U., Blood Bank, Operation Theater, Laboratory,
M.R.I., Neurology, Cardiology, Cancer Department, Corpse, etc. There is an OPD
where patients come and get a card (that is, entry card of the patient) for check up from
the concerned doctor. After making entry in the card, they go to the concerned doctor’s
room and the doctor checks up their ailments. According to the ailments, the doctor
either prescribes medicine or admits the patient in the concerned department. The
patient may choose either private or general room according to his/her need. But
before getting admission in the hospital, the patient has to fullfill certain formalities of
the hospital like room charges, etc. After the treatment is completed, the doctor
discharges the patient. Before discharging from the hospital, the patient again has to
complete certain formalities of the hospital like balance charges, test charges,
operation charges (if any), blood charges, doctors’ charges, etc. Next we talk about the
doctors of the hospital. There are two types of the doctors in the hospital, namely,
regular doctors and call on doctors. Regular doctors are those doctors who come to the
hospital daily. Calls on doctors are those doctors who are called by the hospital if the
concerned doctor is not available.

3. AIR TRANSPORTATION SYSTEM PROBLEM STATEMENT:

Consider the air transportation system. Many flights land and depart from city’s
airport. Some of the big cities may have more than one airports. Every flight belongs
to specific airline. The planes may have many flights to different airports. Each plane
is identified with serial number and model. There are specific pilots for each airline
and they fly many flights. Each flight is identified by flight number and date on which
flight is scheduled. The passenger reserves a seat for a flight. The seat is identified by
a location.

4. RAILWAY MANAGEMENT SYSTEM PROBLEM STATEMENT:

Passengers can book their tickets for the train in which seats are available. For this,
passenger has to provide the desired train number and the date for which ticket is to be
booked. Before booking a ticket for a passenger, the validity of train number and
booking date is checked. Once the train number and booking date are validated, it is
checked whether the seat is available. If yes, the ticket is booked with confirm status
and corresponding ticket ID is generated which is stored along with other details of the
passenger. After all the available tickets are booked, certain numbers of tickets are
booked with waiting status. If waiting lot is also finished, then tickets are not booked
and a message of non‐availability of seats is displayed. The ticket once booked can be
cancelled at any time. For this, the passenger has to provide the ticket ID (the unique
key). The ticket ID is searched and the corresponding record is deleted. With this, the
first ticket with waiting status also gets confirmed.

5. BANK MANAGEMENT SYSTEM PROBLEM STATEMENT:

Bank has many branches, each of which has an address and a branch number. A
customer opens accounts at a branch. Each account is uniquely identified by an
account number, it has a balance and a credit or overdraft limit. There are many types
of accounts including acurrent account and savings account. Bank provides services
which include taking deposit from their customers, issuing current and savings account
to the individuals and business. Extending loans to individuals and business, cashing
cheque. Facilitating money Transactions such as withdraw and deposit.
6. HOTEL MANAGEMENT SYSTEM PROBLEM STATEMENT:
In the Hotel, booking for rooms is done through phone calls or through visit to the
hotel booking office. The guest’s personal details such as Name, Age, Nationality, and
Duration of stay, are input during booking in. The booking office orders for
preparation of the guest’s room before his/ her check in date. The documents are
transferred manually to the filling department for compilation of the guest’s file. On
the reporting date the file is transferred to the reception. On checking in the guest is
given the key to his allocated room, he also specify if he needs room service. The
receptionist hands over the guest’s file to the accountant on the next table. Here the
guest pays accommodation and meals fee. The guest’s file is updated on daily basis of
his expenditure costs. The accounts department generates the bills on daily basis and
delivered to the guests in their rooms at dusk by the service maids. The guest pays at
the accounts desk, where the receipts are generated. For a one meal customer the bill is
generated immediately after ordering and he pays at the accountant desk before
leaving. During checking out of guests, their expenditure outlines are generated a day
before check out date. The guests receive their outlines at the accounts desk as they
check out, where they pay for bills balances if any.

7. CINEMA THEATRE MANAGEMENT SYSTEM PROBLEM STATEMENT:

An administrator of theatre provides number of tickets to each theatre. Each ticket has
ticket number, price. The Administrator manages the operations of the entire theatre.
Each theatre has number of seats, theatre id, theatre name, theatre location and staff.
Every seat has a seat id and seat name. Customer buys the tickets for a movie (which
has details like movie id, movie name, release date, language, director and actor) from
the ticket counter. Each movie has different shows which have been scheduled
(showid, starttime, endtime) at particular times.

8. BOOK STALL MANAGEMENT SYSTEM PROBLEM STATEMENT:

The book shop contains different types of books of various subjects with various
quality according to the customer’s needs and requirement. The main thing of the book
shop is to maintain lot of records for the daily transactions of the business. It is
necessary for every business to maintain all following records which show the profit
and loss of the business. Following are some of the inputs to the Book Shop.Book
Details, Customer Details, Sales details, employee/Owner Details Following are some
of the outputs of the Book Shop. Customer bill receipt, Sales report, Stock Report and
customer report. Books are represented by, ISBN, Title, Author, Publisher, Edition,
Year of Publication and Price. Customers will request books based on categories.
Customers can buy books and receive the receipt from a shop employee/Owner. The
store has records of number of copies of the books left in stock. Out of stock books
cannot be purchased immediately, but can be ordered. Employee/Owner of the
bookstore can give requisition for buying of books to publishers based on the amount
of stock remaining. For each book the employee/owner maintains a stock which is at
least the number of copies of the book sold over last 3 months. Books ordered by some
customer are immediately requisitioned. Requisitions are recorded. The publishers
inspect the requisition on the 1st of every month and immediately supply the books.
9. SUPERMARKET ADMINISTRATION AND MANAGEMENT SYSTEM
PROBLEM STATEMENT:
Our supermarket management system, a form of grocery store, is a self-service store
offering a wide variety of food and household merchandise, organized into
departments. We have updated Super Market management System Detailed products,
it helps the store keeper to keep records of sold out and intake products details,
advanced feature of bar-coding verifications and billing system to the customers. This
system is based on the sales transaction of items in a supermarket. The first activity is
based on adding the items to the system along with the rate which are present in the
supermarket and the name of the items which the supermarket will agree to sell. This
authority is given only to admin. Any modifications to be done in the item name or in
the rate can be done only by admin. He also has the right to remove any item. As the
customer buys the products and comes to the billing counter, the user is supposed to
enter the item name he purchased and the quantity of the item he wanted to purchase.
The system will display all the items whose name starts with the letter selected by the
user. He can select out of those displayed. Finally a separate bill will be generated for
each customer. Any periodic records can be viewed at any time. If the stock is not
available; the supermarket orders and buys from a prescribed vendor.

10. LIBRARY MANAGEMENT SYSTEM PROBLEM STATEMENT:

The case study titled Library Management System is for the purpose of monitoring and
controlling the transactions in a library. This case study gives us the complete
information about the library and the daily transactions done in a Library. The
following are the brief description on the functions achieved through this case study:
End-Users: •Librarian: To maintain and update the records and also to cater the needs
of the users. •Reader: Need books to read and also places various requests to the
librarian. •Vendor: To provide and meet the requirement of the prescribed books. The
following functionalities are required for library management system:
1. Maintain the record of new books and retrieve the details of books available in the
library.
2. Adding new member, new books.
3. Searching books and members.
4. Issue of books:
• A member should be able to issue books.
• Each member can issue only a single book.
• The Librarian will note the date of issue and calculates the date of return.
• The due date for the return of the book is stamped on the book.
5. Return of books:
• Any person can return the issued books {if they have the member code).
• The due date is verified and fine is calculated if applicable.
 PROJECT PHASE – I

Sub Code : UCS716P Credits : 04

Hours/Week : 4 hours CIE MARKS : 50
Exam Hours : 3 hours SEE Marks : 50

Course Outcomes (COs):

At the end of the course, the students should be able to:
1. Review the current state of Art and trends in their area of interest and identify a
suitable problem in their chosen subject domain with justification.
2. Survey the available research literature/documents for the tools and techniques
to be used.
3. Examine the functional, non-functional, and performance requirements of their
chosen problem definition.

Students are expected to submit the list of group members for the project work with
consent of the guide. The students who are submitting the list without guide consent
for them department will allocate guides. The Phase I include
1. Deciding the broad area for project work
2. Sufficient literature Survey (includes Research papers, technical reports, white
papers, manuals and survey reports).
3. Identification of Issues and defining problem.
4. A report containing summary of survey made covering issues and problem
definition with print outs of all literature documents.
5. Submission and presentation of term paper by project team.
6. A term paper is a research paper written by students over an academic term
or semester which accounts for a large amount of a grade and makes up much
of the course. Term papers are generally intended to describe an event or
concept or argue a point. There is much overlap between the terms "research
paper" and "term paper". The phrase "term paper" was originally used to
describe a paper (usually a research based paper) that was due at the end of the
"term" - either a semester or quarter, depending on which unit of measure a
school used. Common usage has "term paper" and "research paper" as
interchangeable, but this is not completely accurate. Not all term papers
involve academic research, and not all research papers are term papers.

Project Phase I Evaluation:

Survey Report Evaluation : 50 Marks (By Guide)

Term Paper Evaluation : 50 Marks(By Departmental Project Evaluation
Committee
(DPEC) including Guide)
 B. V. V. Sangha’ s
Basaveshwar Engineering College (Autonomous), Bagalkot
Department of Computer Science and Engineering

Scheme of Syllabus for 8th Semester

(2015-2016 to 2017-2018 Admitted Batches)

Hrs/Week
Sl.No Subject Code Subjects C CIE *SEE Total
L T P
1 elective – 8 3 0 0 3 50 50 100

2 elective – 9 3 0 0 3 50 50 100
elective – 10 3 0 0 3 50 50 100

3 UCS812P Project Phase-II 0 5 10 15 50 50 100

4 UCS813S Seminar 0 2 0 1 50 50 100

9 7 10 25 250 250 500

L : Lecturer Hours per Week T : Tutorial hours per week

P : Practical Hours per Week C : Credit points
CIE : Continuous Internal Evaluation
SEE : Semester End Examination
 UCS062E
CLOUD COMPUTING
3 CREDITS
Hours/Weeks: 03 CIE Marks: 50
Total Hours: 40 SEE Marks: 50

Course Outcome:

At the end of the course, the students will be able to

1. Understand the definition of cloud computing, its advantages, characteristics, challenges and
platforms.
2. Describe cloud computing architecture, reference model, types of cloud, service models
with respect to all service models etc.
3. Deploy cloud instances in Aneka cloud computing platform and threading programming of
Aneka.
4. Analyze virtualization technology, Cloud Platforms in Industry and High Throughput and
Data Intensive Computing, etc.
5. Evaluate the security related to multi-tenancy and appraise compliance issues that arise from
cloud computing.

Unit-I(10 Hours)

Introduction: Cloud Computing at a Glance, Historical Development, Characteristics of Cloud

Computing, Building Cloud Computing Environments, Computing Platforms and Technologies.

Cloud Computing Architecture: Introduction, Cloud Reference Model, Types of Clouds, Economics
of Cloud, Open Challenges.

Unit- II(10 Hours)

Aneka: Cloud Application Platform: Framework Overview, Anatomy of the Aneka Container,
Building Aneka Clouds, Cloud Computing and Management.

Concurrent Computing: Thread Programming: Introducing Parallelism for Single Machine

Computation, Programming Application with Threads, Multi Applications with Threads,
Multithreading with Aneka, Programming Applications with Aneka Threads.
 Unit- III(10 Hours)

Virtualization: Introduction and Characteristics of Virtualized Environments, Taxonomy of

Virtualization Techniques, Virtualization and Cloud Computing. Pros and Cons of Virtualization,
Technology Examples.

Cloud Platforms in Industry: Amazon Web Services, Google AppEngine, Microsoft Azure.

Cloud Applications: Scientific Applications, Business and Consumer Applications.

Unit- IV(10 Hours)

High Throughput Computing: Task Programming: Task Computing, Task-based Application

Models, Aneka Task-Based Programming.

Data Intensive Computing: Map- Reduce Programming: What is Data-Intensive Computing?

Technologies for Data-Intensive Computing, Aneka Map Reduce Programming.

Text Books:

1. Mastering Cloud Computing by Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi,

McGraw Hill Education (India) Private Limited.

Reference Book:

1. Cloud Computing by Barrie Sosinsky, Bible, Wiley India.

2. Cloud Computing by Kumar Saurabh, Second Edition, Wiley India.
 Big Data Analytics
Sub Code : UCS063E Credits : 3
CIE
Hours/Week : 03 : 50
MARKS
Total Hours : 40 SEE Marks : 50

Course Outcomes:
At the end of the course, student should be able to:
1) List the concepts tools and technologies for big data analytics.
2) Explain the big data and analytics concepts and tools and technologies used for it.
3) Apply the MongoDB, Hive and Pig query language to solve the given problems.
4) Investigate the given real time scenario and use suitable techniques to extract insights from
the data.
5) Design a solution for data analytics problems by combining two or more analytics and
techniques to enhance the value of the enterprise by extracting knowledge from the big data.

Unit- I 10 Hours

Types of digital data: Classification of digital data.

Introduction to Big Data: Characteristics of Data, Evolution of Big Data, Definition and challenges
of Big Data, Features and other Characteristics of Big Data, Reason for dealing with Big Data,
Traditional Business Intelligence(BI) versus Big Data, A Typical Data Warehouse Environment, A
Typical Hadoop Environment, Coexistence strategy, Changes in the Realms of Big Data.
Big data analytics: Transformation of data, Definition and Sudden Hype Around Big Data
Analytics, Classification of Analytics, Challenges in Businesses, Top Challenges Facing Big Data,
Importance of Big Data Analytics, Technologies to Meet the Challenges Posed by Big Data, Data
Science, Data Scientist, Terminologies Used in Big Data Environments, Basically Available Soft
State Eventual Consistency (BASE), Few Top Analytics Tools.

Unit- II 10 Hours

The big data technology landscape: NoSQL (Not Only SQL), Hadoop. Introduction to Hadoop:
Introducing Hadoop, significance of Hadoop, RDBMS versus Hadoop, Distributed Computing
Challenges, History of Hadoop, Hadoop Overview, Use Case of Hadoop, Hadoop Distributors,
HDFS (Hadoop Distributed File System), Processing Data with Hadoop, Managing Resources and
Applications with Hadoop YARN (Yet another Resource Negotiator), Interacting with Hadoop
Ecosystem.

Unit- III 10 Hours

Introduction to MongoDB: Definition and Features of MongoDB, Terms Used in RDBMS and
MongoDB, Data Types in MongoDB, MongoDB Query Language.
 Unit- IV 10 Hours

Hive: Definition and features of Hive, Hive Architecture, Hive Data Types, Hive File Format, Hive
Query Language (HQL), RCFile Implementation, SerDe, User-Defined Function (UDF). Pig: Pig
and its features, The Anatomy of Pig, Pig on Hadoop, Pig Philosophy, Use Case for Pig: ETL
Processing, Pig Latin Overview, Data Types in Pig, Running Pig, Execution Modes of Pig, HDFS
Commands, Relational Operators, Eval Function, Complex Data Types, Piggy Bank, User-Defined
Functions (UDF), Parameter Substitution, Diagnostic Operator, Word Count Example using Pig,
uses of Pig, Pig versus Hive.

Text Book:

1. Big Data and Analytics, Seema Acharya and Subhashini Chellappan – Wiley India, First edition
(rp) 2016.

Reference Books:

1. Frank J. Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley India Pvt.
Ltd., 2012.
2. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.
3. Paul Zikopoulos, Dirk deRoos, Krishnan Parasuraman, Thomas Deutsch , James Giles, David
Corrigan, “Harness the Power of Big data – The big data platform”, McGraw Hill, 2013.
 Internet of Things
Sub Code : UCS066E Credits : 3
Hours/Week : 03 CIE MARKS : 50
Total Hours : 40 SEE Marks : 50

Course outcomes

Having learnt this course learner should be able to

1. Interpret the impact and challenges posed by IoT networks leading to new
architectural models.
2. Compare and contrast the deployment of smart objects and the technologies to connect
them to network.
3. Appraise the role of IoT protocols for efficient network communication. Elaborate the need
for Data Analytics and Security in IoT.
4. Illustrate different sensor technologies for sensing real world entities and identify the
applications of IoT in Industry.
5. Elaborate the need for Data Analytics and Security in IoT.

UNIT-I (10-Hours)

What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact, Convergence of IT and IoT, IoT
Challenges, IoT Network Architecture and Design, Drivers Behind New Network Architectures,
Comparing IoT Architectures, A Simplified IoT Architecture, The Core IoT Functional Stack, IoT
Data Management and Compute Stack. Smart Objects: The “Things” in IoT, Sensors, Actuators,
and Smart Objects, Sensor Networks, Connecting Smart Objects, Communications Criteria, IoT
Access Technologies.

UNIT-II(10-Hours)

IP as the IoT Network Layer, The Business Case for IP, The need for Optimization, Optimizing IP
for IoT, Profiles and Compliances, Application Protocols for IoT, The Transport Layer, IoT
Application Transport Methods. Data and Analytics for IoT, An Introduction to Data Analytics for
IoT, Machine Learning, Big Data Analytics Tools and Technology, Edge Streaming Analytics,
Network Analytics.

UNIT-III(10-Hours)

Securing IoT, A Brief History of OT Security, Common Challenges in OT Security, How IT and OT
Security Practices an d Systems Vary, Formal Risk Analysis Structures: OCTAVE and FAIR, The
Phased Application of Security in an Operational Environment IoT Physical Devices and Endpoints
- Arduino UNO: Introduction to Arduino, Arduino UNO, Installing the Software, Fundamentals of
Arduino Programming. IoT Physical Devices and Endpoints - RaspberryPi: Introduction to
RaspberryPi, About the RaspberryPi Board: Hardware Layout.

UNI- IV(10-Hours)

Operating Systems on RaspberryPi, Configuring RaspberryPi, Programming RaspberryPi with

Python, Wireless Temperature Monitoring System Using Pi, DS18B20 Temperature Sensor,
Connec
ting Raspberry Pi via SSH, Accessing Temperature from DS18B20 sensors, Remote access to
RaspberryPi, Smart and Connected Cities, An IoT Strategy for Smarter Cities, Smart City IoT
Architecture, Smart City Security Architecture, Smart City Use-Case Examples.

Text Books:

1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete,Robert Barton, Jerome Henry, "IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
Things” , Edition, Pearson Education (Cisco Press Indian Reprint). (ISBN:978-9386873743)
2. Srinivasa K G, “ Internet of Things”,CENGAGE Leaning India, 2017

Reference Books:

1. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-on-Approach)”, 1st Edition,

VPT, 2014. (ISBN:978-8173719547)
2. Raj Kamal, “Internet of Things: Architecture and Design Principles”,1 st Edition, McGraw Hill
Education, 2017. (ISBN: 978-9352605224)
UCS043E DATA MINING 3 CREDITS
Hrs/Week: 3 CIE Marks: 50
Total Hrs.: 40 SEE Marks: 50

Course outcomes
At the end of the course, the students will be able to

 Anticipate the issues related to data mining process, different data types and apply the
preprocessing techniques to improve the data quality.
 Apply the data mining techniques of clustering, classification, association finding and
outlier analysis on the real world data

 Display a comprehensive understanding of algorithms for data mining.

 Evaluate the performance of different data-mining algorithms and select an efficient

algorithm for solving complex problems.

 Investigate application areas and current research directions in data mining.

UNIT – I 10 Hours

INTRODUCTION, DATA – 1: What is Data Mining? Motivating Challenges; The origins of data
mining; Data Mining Tasks. Types of Data; Data Quality. DATA – 2: Data Preprocessing; Measures
of Similarity and Dissimilarity

UNIT – II 10 Hours

CLASSIFICATION: Preliminaries; General approach to solving a classification problem; Decision

tree induction; Rule-based classifier; Nearest-neighbor classifier.
ASSOCIATION ANALYSIS – 1: Problem Definition; Frequent Itemset generation; Rule
Generation; Compact representation of frequent itemsets; Alternative methods for generating
frequent itemsets.

UNIT – III 10 Hours

ASSOCIATION ANALYSIS – 2: FP-Growth algorithm, Evaluation of association patterns; Effect

of skewed support distribution; Sequential patterns. CLUSTER ANALYSIS: Overview, K-means,
Agglomerative hierarchical clustering, DBSCAN, Overview of Cluster Evaluation.
 UNIT – IV 10 Hours

FURTHER TOPICS IN DATA MINING: Multidimensional analysis and descriptive mining of

complex data objects; Spatial data mining; Multimedia data mining; Text mining; Mining the
WWW. Outlier analysis. APPLICATIONS: Data mining applications; Data mining system products
and research prototypes; Additional themes on Data mining; Social impact of Data mining; Trends
in Data mining.

TEXT BOOKS:

1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, 2007, Introduction to Data Mining, Pearson
Education,
2. Jiawei Han and Micheline Kamber,2006, Data Mining – Concepts and Techniques, 2nd Edition,
Morgan Kaufmann.

REFERENCE BOOK:

1. K. P. Soman, Shyam Diwakar, V. Ajay, 2006, Insight into Data Mining – Theory and Practice ,
PHI.
 PROJECT PHASE II

Sub Code : UCS812P Credits : 15

CIE
Hours/Week : 10 hours : 50
MARKS
Exam Hours : 3 hours SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

Course Outcomes (COs):
At the end of the course, the students should be able to:
1. Review the current state of Art and trends in their area of interest and identify a suitable
problem in their chosen subject domain with justification.
2. Survey the available research literature/documents for the tools and techniques to be used.
3. Examine the functional, non-functional, and performance requirements of their chosen problem
definition.
4. Design system architecture and different components and develop all the system components
using appropriate tools and techniques.
5. Work effectively in a team and use good project management practices.
6. Defend the project work carried out in teams orally and in writing.

 Developing the project plan

 Implementing the project
 Controlling, monitoring and evaluating the project
 Closing the project and reporting on the findings
 Develop all the project plans (implementation, risk, evaluation);
 Manage the project from implementation through to closure;
 Implement specific project strategies and activities;
 Evaluate the project;
 Collect and analyze project data; and
 Write up the final project report for the funding body.

Continuous Internal Evaluation Scheme:

Mid Semester Presentation /Demonstration : 15 Marks

Final Internal Presentation /Demonstration : 20 Marks
Report Writing : 15 Marks
SEE Evaluation: Presentation and Demonstration : 30 Marks
Report Evaluation : 20 Marks

Note:
1. Demonstration/Presentations are evaluated by the Departmental Project Evaluation Committee
(DPEC) comprising of Guide, HOD and Project Coordinator of the Department and reports are
evaluated by the Guide.
2. In Semester End Examination (SEE) Project Work is evaluated jointly by Internal, External
Examiners and HOD/Nominee.
 Seminar
Sub Code : UCS813S Credits : 1
Hours/Week : 2 hours CIE MARKS : 50
Exam Hours : 3 hours SEE Marks : 50

Seminars are used as course delivery modes to encourage students to gather current trends in
technology, research literature, and self-learn topics of their interest. Seminars require students to
research a technical topic, make presentations and write a detailed document on their findings
individually under the guidance of faculty.

Course outcomes (COs):

The student is expected to:

1. Identify seminar topics based on contemporary technical, societal and environmental issues.
2. Conduct literature survey on complex issues in the selected domain
3. Explore advanced technologies
4. Make good oral and written technical presentations