Beruflich Dokumente
Kultur Dokumente
Code
UMA-201
Course Title
Numerical Analysis and Computer
Programming
L T P
Cr.
3 1 0 3.5
Prerequisites:
Nil
Objective:
To equip students with adequate knowledge of mathematics that will enable
them in formulating problems and solving problems analytically.
Course Description:
Module 1: Infinite Series:
o Convergence, divergence and oscillation of an infinite series
o comparison test, p-series
o DAlemberts ratio test
o logarithmic, integral test(all test without proof) for series of
positive terms.
o Numerical analysis.
Preferred Reading:
Numerical Methods in Engg. & Sciences by B.S.Grewal.
Numerical methods for Scientific & Engg. Computations by M.K.Jain,
S.R.K.Iyengar & R.K.Jain
Web Resources:
http://books.google.co.in/books/about/The_Pearson_Guide_To_Objective_
Mathemati.html?id=2v-f9x7-FlsC
http://www.utem.edu.my/fkekk/index2.php?option=com_docman&task=doc_
view&gid=152&Itemid=91
http://www.tcd.ie/Engineering/undergraduate/baiyear1/modules/1E2.PDF
Course
Code
UMA 201
Course Title
L T
Cr
.
1.
0
Prerequisites:
Nil
Objective:
The aim of this tutorial is to introduce you to the software MATLAB for numerical
computations and in particular familiarizing yourself with the Matlab Desktop, basic
commands through the Command window and output through the Graph window
Course Description:
iteration method.
o To solve the system of linear equations using Gauss-Jordan
method.
o To solve integral equation numerically using Trapezoidal rule.
o To solve integral equation numerically using Simpsons rule.
o To find numerical solution of ordinary differential equations by
Eulers method.
o To find numerical solution of ordinary differential equations by
Runga-Kutta method.
o To solve a given problem using Newtons forward interpolation
formula.
Learning Outcomes:
Assessment Model:
Total Marks alloted-30 marks
Lab record-10 marks
Lab work-10 marks
Viva-10 marks
Preferred Reading:
Web Resources:
http://www.ucl.ac.uk/EarthSci/people/sammonds/2%20Using%20MATLAB.p
df
http://www.mathworks.in/help/optim/ug/writing-objective-functions.html
Course
Course Title
Cr.
Code
UEC-201
DIGITAL ELECTRONICS
3
1
0
3.5
Prerequisites:
Principles of Electronics engineering
Objective:
to impart to you a formalism of logic enabling you to analyse logical processes
to enable you to implement simple logical operations using combinational logic
circuits
to enable you to understand common forms of number representation in digital
electronic circuits and to be able to convert between different representations
Course Description:
Module 1:
o Binary, octal & Hexadecimal number systems and their inter
conversion
o Binary arithmetic (Addition & Subtraction, Multiplication &
Division)
o 1s & 2s complements, 9s & 10s complement, BCD code,
BCD
Addition
o Gray Code, Error Detection and Correction , Hamming code.
Module 2:
o Logic functions (OR, AND, NOT, NAND, NOR, XOR)
o Elements of Boolean Algebra (Theorems truth tables and
relations)
o Negative & Positive logic, Saturated & non saturated logic
o fan in, fan-out, Logic ICs, de Morgans Theorem, minterms
and
maxterms.
o Karnaugh mapping, K-map representation of logical function
for 2,
4,5 & 6 variable, simplification of Boolean equations with the
help
of K-map,
o Various minimization techniques, Quines method and Quines
McCluskey method
o Half adder, full adder, half subtractor, full subtractor, serial and
parallel binary adder.
Module 3:
o Introduction and performance criteria for logic families
Module 4:
o
o
o
o
o
out,
o Ring
counters,
asynchronous
counters,
synchronous
counters.
o D/A Converter, A/D Converter, Multiplexers and Demultiplexer
o Encoder and Decoder & their applications
Learning Outcomes:
this course will provide a knowledge of fundamental digital design and
systematic methods of analysis and design of digital systems and provide
basic knowledge of how digital building blocks are described in a hardware
description language VHDL.
Assessment Model:
Preferred Reading:
Web Resources:
http://www.kth.se/student/kurser/kurs/HE1026?l=en
http://www.catc.ac.tz/Presentation/dig_elone.php
http://www.ee.ic.ac.uk/pcheung/teaching/ee1_digital/Lecture1-overview.pdf
Course
Code
UEC-201
Course Title
DIGITAL ELECTRONICS LAB
L
0
T
0
P
2
Cr.
1.0
Prerequisites: Nil
Objective:
to impart to you a formalism of logic enabling you to analyse logical processes
to enable you to implement simple logical operations using combinational logic
circuits
to enable you to understand common forms of number representation in digital
electronic circuits and to be able to convert between different representations
Course Description:
ADDITIONAL EXERCISES:
o Construct bounce less switch.
o Construct a pulser of 1 Hz and 10 Hz, 1k Hz and manual.
o Construct logic state detector.
Preferred Reading:
Digital Principles & Applications by Malvino and Leach
Digital Integrated Electronics by Taub and Schilling
Modern Digital Electronics by R.P. Jain.
Web Resources:
http://www.kth.se/student/kurser/kurs/HE1026?l=en
http://www.catc.ac.tz/Presentation/dig_elone.php
http://www.ee.ic.ac.uk/pcheung/teaching/ee1_digital/Lecture1-overview.pdf
Course
Code
UCS-200
Course Title
DATA STRUCTURE & ALGORITHMS
WITH C
L
3
T
1
P
0
Cr.
3.5
Prerequisites:
Programming in C
Objective:
Assess how the choice of data structures and algorithm design methods
impacts the performance of programs.
Choose the appropriate data structure and algorithm design method for a
specified application.
Write programs using object-oriented design principles.
Solve problems using data structures such as linear lists, stacks, queues,
hash tables, binary trees, heaps, tournament trees, binary search trees, and
graphs and writing programs for these solutions.
Course Description:
Module 1: Introduction:
o Definition, Classification, Operations on data structures
o mathematical notation and functions, Abstract Data Types
(ADT)
o Algorithm, Efficiency of an Algorithm, Asymptotic notations
o Time-Space trade-off.
Arrays:
o Definition, Single and Multidimensional Arrays
o Representation of Arrays: Row and Column Major Order
o Operations on arrays: Insertion, Traversal, Searching,
Deletion
o Application of arrays, Sparse Matrices.
Linked Lists:
o Need of dynamic data structures, Implementation of lists
o Operations on lists: Insertion, Deletion, Searching
o Doubly linked lists, Operations on Doubly Linked Lists:
Insertion, Deletion, circular & header Linked Lists
Module 2: Stacks:
o Introduction, Sequential & Linked implementation of stacks
o Operations: Insertion, Deletion & Traversal, Applications:
o Evaluation of postfix expression, Converting Infix expression
to
Postfix expression, Recursion.
Queues:
o Definition, Sequential & Linked implementation of linear
queues,
o Operations: Insertion, Deletion & Traversal. Circular queue,
Module 3: Trees:
o Definition, Basic terminology, Binary tree,
o Implementation of a binary tree, Operations on binary trees
o Binary tree traversals, Representation of infix, postfix and
prefix expressions using trees,
Tables:
o Definition, Hash Functions, Implementation & Applications
Module 4: Graphs:
o Definition of undirected & Directed Graphs & Networks,
o Basic terminology, Representation of graphs, Graph
traversals,
o minimum-spanning trees,
o Shortest path Algorithm Warshalls & Dijkstras Algorithm,
o Typological Sorting.
Search:
o Linear Search, Binary Search.
Sort:
o Selection sort, Insertion Sort, Bubble Sort,
o Merge Sort, Quick Sort, Radix and Heap sort
Learning Outcomes:
Assessment Model:
Preferred Reading:
Web Resources:
http://setur.fo/fileadmin/user_upload/documents/Undirvisingartilfar/NVD/Qin
X/Algorithms/A_2n.pdf
http://comp.mq.edu.au/units/comp225/outline.html
Course
Code
UCS-200
Course Title
DATA STRUCTURE & ALGORITHMS
WITH C LAB
L
0
T
0
P
2
Cr.
1.0
Prerequisites:
Programming in c
Objective:
Assess how the choice of data structures and algorithm design methods
impacts the performance of programs.
Choose the appropriate data structure and algorithm design method for a
specified application.
Write programs using object-oriented design principles.
Course Description:
Module 1:
LIST OF EXPERIMENTS
10. Write a program to perform insertion & deletion operation on Binary Search
trees.
11. Write a program for implementation of a file and performing operations such
as insert, delete and update a record in a file.
12. Write a program to create a linked list & display elements of a linked list.
13. Create a linked list and perform the following operation on it
a) Add a node
b) Delete a node
c) Count no. of nodes
14. Write a program to implement breadth first search on a graph.
15. Write a program to implement depth first search on a graph.
16. Sorting
a) Bubble sort
b) Merge sort
c) Insertion sort
d) Selection sort
e) Radix Sort
f) Quick Sort
Learning Outcomes:
Assessment Model:
Total Marks alloted-30 marks
Lab record-10 marks
Lab work-10 marks
Viva-10 marks
Preferred Reading:
Data structures by Seymour Lipschutz
Data structures and algorithms by A.V. Aho, J.E. Hopcroft and T.D. Ullman
Data Structures using C by A. M. Tenenbaum
Web Resources:
http://setur.fo/fileadmin/user_upload/documents/Undirvisingartilfar/NVD/Qin
X/Algorithms/A_2n.pdf
http://comp.mq.edu.au/units/comp225/outline.html
Course
Code
UCS-201
Course Title
COMPUTER ARCHITECTURE &
ORGANIZATION
L
3
T
1
P
0
Cr.
3.5
Prerequisites: Nil
Objective:
To have a thorough understanding of the basic structure and operation of a
digital computer.
To discuss in detail the operation of the arithmetic unit including the algorithms &
implementation of fixed-point and floating-point addition, subtraction,
multiplication & division.
To study the different ways of communicating with I/O devices and standard I/O
interfaces
Course Description:
Memory Organization:
o Memory hierarchy, Main memory, Auxiliary memory
o Associative memory, Cache memory, virtual memory,
o Memory management H/W.
Learning Outcomes:
Assessment Model:
Preferred Reading:
Web Resources:
http://www.sci.tamucc.edu/~sking/Courses/COSC5351/syllabus.php
http://www.sci.tamucc.edu/~sking/Courses/COSC5351/syllabus.php
https://sites.google.com/site/uopcog/
Course
Code
UIT-202
Course Title
PRINCIPLES OF PROGRAMMING
LANGUAGE
L
3
T
1
P
0
Cr.
3.5
Prerequisites:
NIL
Objective:
Improve the background for choosing appropriate programming languages
for certain classes of programming problems
Be able in principle to program in an imperative (or procedural),an objectoriented, a functional, and a logical programming language
Understand the significance of an implementation of programming language
in a compiler or interpreter
Course Description:
Module 1: Introduction:
o A brief history, Characteristics of a good programming
language,
o Programming language translators compiler & interpreters ,
o Elementary data types data objects, variable & constants,
data
types, Specification & implementation of elementary data
types,
o Declarations ,type checking & type conversions ,
o Assignment & initialization, Numeric data types,
o enumerations, Booleans & characters,
o Syntax & Semantics.
Learning Outcomes:
1. Interpret and evaluate requirements for program projects
2. Develop detailed design specifications and test strategies
3. Identify and articulate physical requirements for systems implementation
Assessment Model:
Preferred Reading:
Web Resources:
http://seattlecentral.edu/programs/programming/learningoutcomes.php
http://www.cse.ohio-state.edu/~neelam/abet/CGRs/semConvPLRpt.html
Course
Course Title
L
T
P
Cr.
Code
UIT-203
E-COMMERCE & ERP
3
1
0
3.5
Prerequisites:
NIL
Objective:
understand the basic concepts and technologies of ERP systems;
be familiar with the basic usage of ERP systems, such as SAP;
be able to analyze important issues in implementing an ERP system in a firm;
develop ability and confidence in exploiting benefits from ERP systems and/or
other
information technology for business
Course Description:
Security Technologies:
o Insecurity Internet; A brief introduction to Cryptography;
o Public key solution; Key distribution and certification;
o prominent cryptographic applications.
servers;
o open market.
Digital Currencies:
o Optional process of Digicash, Ecash Trail; Using Ecash;
Smart cards,
o Electronic Data Interchange; Its basics;
o EDI versus Internet and EDI over Internet.
Module 3: ERP
o An Enterprise Perspective; Production Finance,
o Personnel disciplines and their relationship, Transiting
environment,
o MIS Integration for disciplines, Case Study, Information /
Workflow,
o Network Structure, Client Server Integrator System, Virtual
Enterprise. ERP
o Resource Management Perspective; Functional and Process
of
Resource. Management,
o Basic Modules of ERP System-HRD, Personnel Management,
o Training and Development, Skill Inventory,
o Material Planning and Control, Inventory, Forecasting,
Manufacturing,
o Production Planning, Production Scheduling,
o Production Control, Sales and Distribution,
o Finance, Resource Management in global scenario,
o dynamic data management in complex global scenario.
Implementation Issues
Learning Outcomes:
To demonstrate a clear and relevant understanding of the definitions,
importance, potential business values, and relevant technologies of ERP
systems;
To demonstrate the ability in learning the applications of ERP and using the
up-to-date ERP systems (such as SAP) for business.
Preferred Reading:
Frontiers of Electronics Commerce by Ravi lalakota, Andrew Whinston
Enterprise Resource Planning Concepts and practice by K. Garg and
N.K. Venkita Krishna
The SAP/3 Handbook by John Antonio, Fernandz
Web Resources:
http://www.practicalecommerce.com/articles/3264-12-Sites-for-EbookPublishing
http://www.ebooksdownloadfree.com/eCommerce/Free-eCommerce-BooksCI49P0.html
http://blog.publishingtechnology.com/online/ebooks-ecommerce/
Course
Code
UMA-251
Course Title
Discrete Mathematics & Logic Design
T
3
P
1
Cr.
0 3.5
Prerequisites: Nil
Objective: Introduce Mathematical Logic, especially First Order Logic to students, proof
techniques such as Mathematical Induction and Contradiction. These techniques will
come in handy for courses such as Analysis of Algorithms and Automata Theory.
Develop an understanding of counting, functions and relations. The general objective is
to give basic knowledge in Discrete Mathematics, especially in the solution of
combinatorial problems, the knowledge of some important algebraic structures and basic
knowledge of graph theory.
Course Description:
Module 1: Set theory
Introduction to set theory
set operation
Algebra of set
combination of sets
Duality
Classes of sets
Partitions
Power Sets
Multi Sets
Venn Diagrams.
Relations
Cartesian product
Representation of relation
Types of relations
Inverse Relations
Composition of Relations
Propositions
Tautologies
contradictions.
Counting Techniques
o
Basic Counting Principles
o
Permutations with and without repetition
o
Combination
o
Pigeonhole Principle.
partial fractions
linear recurrence relation with constant coefficients
Homogeneous solutions
Particular solutions
Planar graphs
Spanning trees
Course
Code
UIT-250
Course Title
Cr.
4.5
PROGRAMMING
Prerequisites: Nil
Objective: The course will cover a review of basic C programming concepts, such as
variables, variable types, and simple C input/output instructions. It will also introduce
students to C++ I/O specifics, and to the cin and cout objects. It will also give a review of
decision structures, looping structures, functions, arrays and pointers, already familiar
from C, while emphasizing the
Differences, where they apply, that appears in C++.
Course Description:
Module 1: Introduction to OOP
Programming Paradigms
Basic Concepts of OOP
o Class & Objects
o Data Abstraction
o Encapsulation
o Information Hiding
o Inheritance
o Polymorphism
o Message Passing
o Dynamic Binding
o Benefits of OOPs.
Introduction to C++
o C++ Program Structure
o I/O Statements
o Keywords and Various Data Types
o Variable Declaration
Operator
o Scope Resolution Operator
o
Manipulators
Expressions
o Control Structures
Functions
Preprocessor Directives
Module 2: Classes and Objects
Class Declaration
Access Specifiers
Module 3: Overloading
Function Overloading
Operator Overloading
Virtual Functions
Dynamic Binding
Exception Handling
o Try
o Throw
o
Catch Block
LIST OF PRACTICALS
1.
Raising a number n to a power of p is the same as multiplying n by itself p times.
Write a function called power( ) that takes a double value for an int value for p
and returns the result as double value . Use a default argument of 2 of p, so that if
this argument is omitted, the number will be squared. Write a main ( ) function that
gets values from the user to test this function.
2.
coordinate and a Y coordinate. For example (4,5) represents point 4 unit to the
right of origin along the X axis and 5 units up the y-axis . The sum of the two
points can be defined as new point whose X and Y coordinates. Write a program
that uses a structure called point to model a point . Define three points and have
the user input values to two of them. Than set the third point equal to the sum of
the other two. And display the value of new points. Interaction with the program
might look like this.
Enter Coordinate of P1:
3
4
Enter Coordinate of P2:
5
7
Coordinates of P1+P2 are :
8
11
3.
Create the equivalent of four function calculator . The program should request the
to user to enter a number , an operator and another number . It should carry out
the specified arithmetical operation: adding, subtracting, multiplying ,or dividing
the two numbers. (it should use a switch statement to select the operation ) finally
it should be display the result.
When it finishes the calculation , the program should ask if the user want to do
another calculation. The response can be Y or N . Some sample interaction
with the program might look like this.
Enter first number ,operators and second number 12+100
Answer =112
Do another (Y/N)?N
4. A phone no. such as (212)767-8900 , can be thought of as having three parts area
code(212), the exchange (767) and the number (8900). Write a program that
uses a structure to store these three parts of phone no. separately. Call the
structure phone . create two structure Enter your area code Exchange and
number : 415 555 1212
My number is (415)555-1212
5.
Create two classes DM and DB which stores the value of distances DM stores
distance in meters and centimeters and DB in feet and inches . Write a program
that can read value for the classes objects and add one object of DM with another
object DB.
6. Use a friend function to carry out the addition operation .The object that stores the
result may be a Dm object or DB object depending on the units in which result are
required .The display should be in the format of feet and inches or meters and
centimeters depending on the object on display.
7. To find the roots of quadratic equation using oop technique.
Consider the following class definition class father {
Protected : int age;
Public:
Father (int x){age = x;}
Virtual void iam ()
{
cout <<I AM THE FATHER , my age is ,<<age<<endl;}
};
Derive the two classes son and daughter from the above classes and for each
define iam() to write our similar but appropriate message .You should also define
suitable constructors for these classes
Now write a main ( ) that creates objects of three classes and then call iam( )
them .Declare pointer to father , successively assign addresses of object of the
two derived classes to this pointer and in each case , call iam( ) through the
pointer to demonstrate polymorphism in action.
8.
Imagine a tollbooth with a class called Toll booth .The two data item are a type
unsigned into to hold the total number of cars and type double to hold the total
amount of money collected . A constructor initializes both these to 0. A member
function called nopaycar( ). Increments the car total and adds 0.50 to the cash total.
Another function, called nopaycar(), increment the car total but adds nothing to the
cash total. Finally , a member function called display the two totals . Include a
program to test this class . This program should allow the user to push one key to
count paying a car ,and another to count a non paying car. Pushing the ESC key
should cause the program to print out the total cars and total cash and then exit
9.
Write a function called reverse it ( ) that reverses a string( an array of char ) use a
for loop that swap the first and last characters, then the second and next to last
character and so on . the string should be passed to reversesit ( ), and print out the
result. Use an input method that allows embedded blanks. Test the program with
Napoleons famous phrase , Able was ere I saw Elba.
10. To overload a binary operator using friend function.
Learning Outcomes:
On completion of this module, students will be able to:
Write programs in C++
Create console applications in C++
Use value type variables and user-defined variables
Use different types of control statements
Explain how features like overloading, inheritence, polymorphism as well as virutal
functions are implemented in C++
Assessment Model:
Best three of two quizzes and two assignments- 20%
Course
Course Title
Code
UCS-251
Operating System
Prerequisites: Nil
Cr.
4.5
Objective: The course aims to introduce Operating System Concepts with emphasis on
foundations & design principles. It comprises of the evolutionary history of Operating
Systems and introduces concepts of Batch processing, Multiprogramming &
Timesharing. Different components of operating system like Process Management,
Concurrency mechanisms, Deadlock handling, Memory Management techniques, Virtual
Memory, File System and Secondary Storage Management, Security & protection .Case
study of UNIX & WINDOWS Operating Systems
Course Description:
Module 1: Introduction
Multitasking
Multiprogramming
Time sharing
Buffering
Spooling
Semaphores
monitors,
Classical IPC problem and solutions.
Deadlocks
o Characterization
o
Detection
o
Recovery
o avoidance and prevention
File Management
o
File Concept
o
Access methods
o
Directory Structure
o
File Protection
o
File System Structure
o
Allocation methods
o
Free Space Management
Memory partitioning
swapping,
Paging
Segmentation
Virtual memory
o
Concepts
o
Overlays
o
Demand paging
o
Performance of demand
o
Paging
o
Thrashing
o
Page replacement algorithm
Module 4: /O Systems
I/O hardware
I/O channels,
Goals
interrupt handlers
device drivers
Protection
o
Goals of protection
o
Domain of protection
o
Access matrix
o
Implementation of access matrix
o
Revocation of access rights
Security
o The security problem
o
Authentication
o
one-time passwords
o
program threats
o
System threats
o
Threat monitoring
o
Encryption
o
Computer-security classifications
LIST OF PRACTICALS
1. Simulation of the CPU scheduling algorithms a) Round Robin b) SJF c) FCFS d)
Priority
Preferred Reading:
Operating Systems by Achiest S. God bole, Tmh
Operating Systems by D. M. Dhamdhare, Tmh
Understanding Operating System by Flynn & Mtiers Thomsan
Operating Systems Design & Implementation by Andrew Dagenham, Albert S.
Wood Hull Pearson
Operating System Concepts by Silberschatz & Galvin, Wiley
Operating System (5th) Internals & Design Principles by William Stallings
,Prentice Hall Of India
Web Resources:
en.wikipedia.org/wiki/Operating_system
www.webopedia.com/operating_system.html
www.ask.com/List+Of+Operating+System
Course
Course Title
L
T
P Cr.
Code
UCS-252
Software Engineering
3
1
0 3.5
Prerequisites: Nil
Objective: To define software engineering and explain its importance. To discuss the
concepts of software products and software processes. To explain the importance of
process visibility. To introduce the notion of professional responsibility
Course Description:
Module 1: Introduction
Definition
areas of applications
size metrics
testing principles
Testability
cyclomatic complexity
graph matrices
equalization partitioning,
comparison testing
categories of maintenance
program understanding
ripple effect
maintenance models
o Quick fix model
o iterative enhancement model
o reuse oriented model
o Boehms model estimation of maintenance cost
o Beladay and Lehman model
o Boehm model
o Configuration management activities
o software version
o Change control process
Software Reuse
o Issue in Software Reuse
Learning Outcomes:
On completion of this module, students will be able to:
solve specific problems alone or in teams
manage a project from beginning to end
work independently as well as in teams
define, formulate and analyse a problem
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Software Engineering- A practitioners Approach by RogerS. Pressmen,
TMH
Software Engineering by K.K. Aggarwal&Yogesh , Nova Science
Web Resources:
en.wikipedia.org/wiki/Software_Engineering_Notes
www.onesmartclick.com/engineering/software-engineering.html
www.bernstein-plus-sons.com/.dowling/.../SE_Introduction.html
forum.jntuworld.com ... Materials & Discussions Materials
Course
Code
Course Title
UMG-250
L T P Cr
.
Definitions
Management By Objectives
Routing
Scheduling
QUALITY MANAGEMENT
o Statistical Quality Control
o
Introduction Control Charts
o
X Charts
o
R Charts
o Control Charts for C (N. of defects per unit)
o
Control chart for P ( Fraction Defective), Advantages &
Limitations of SQC
Quality Circles
o Structure
o Functions & Limitations.
Learning Outcomes:
It teaches us many interesting and instructive factors about man's behavior
when he is engaged in economic activity.
Economics brains the minds, Economic reasoning trains our mind.
It helps in understanding the economic system which is in functioning today.
It is very useful in any professions. It is helpful in banking, marketing,
agriculture, and in industry. In other words who knows economics, he can
achieve success in his field, economics he can achieve success in his field.
It is useful in solving the problems of poverty.
It is helpful to house holders and labor leaders.
It is also useful for good citizenship.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Business Organisation & Management by B.P.Singh, T.N.Chabra,
Dhanpat Rai &
Sons
Modern Economic Theory by K .K. Dewett, S.Chand & Co
Marketing Management by Philip Kotler, Prentice Hall of India
Financial Management by I.M. Pandey, Vikas Publishin g House
Indian Economic by Ruddar Dutt, K. P. M. Sundaram, S.Chand & Co
Advanced Economic Theory by H.L.Ahuja, S.Chand & Co
Production Operation Management by Dr. B.S. Goel, Pragati Prakash an
Statistical Quality Control by Grant, Leaven worth, Tata Mc. Graw Hill
Personnel Management by, Edwin B.Flippo, Tata Mc. Graw Hll
Management A Global Perespective by Grant, Leaven worth ,TMH
Web Resources:
en.wikipedia.org/wiki/Principles_of_Economics_(Marshall)
www.managementstudyguide.com/principles-managerial-economics..
Course
Course Title
Code
UIT-253
Internet Fundamentals & Web Designing
Prerequisites: Nil
Cr.
4.5
Objective: This course provides a fundamental overview of these technologies that are
relevant to the Internet operation and development: IP addressing, Routing, DNS, and
Internet security.
Course Description:
Module 1: Electronic Mail and Internet
Introduction
advantages and disadvantages
E-mail inner workings
E-mail management
Newsgroups
mailing lists
Chat rooms.
Introduction to networks and internet
o Working of Internet
o Modes of Connecting to Internet
o Internet Service Providers(ISPs)
o Internet address
o standard address
o domain name
o DNS.
World Wide Web
o Introduction
o Web Browser details
o Search engines
o Web crawler
o Gopher
o Telnet and FTP
Module 2: Static Web Pages
HTML
different tags
Sections
image & pictures
Listings
Tables
Frame
Frameset
form
Dynamic Web Pages and XML
o The need of dynamic web pages
o an overview of DHTML
o cascading style sheet (css)
o XML
Module 3: PHP
What is PHP
History of web programming
6. Use the align attribute of image tag to align another image or text.
7. Create a webpage to demonstrate various types of linking.
8. Create a resume using HTML tag.
9. Create a web page which displays the map of our country. Link each city or state
on the image map such that the respective html page of the city or state is
displayed when user selects an area.
10. Create a table of contents in which each menu item or content should load a web
page.
11. To create a web page of your organization (college) using html tags and frames.
12. Write a simple PHP program that displays a welcome message.
13. Write a PHP program using the string comparison operators
14. Write a XHTML form for gathering user input in PHP
15. Write a PHP program obtaining user input through forms.
16. Write a PHP program using PHP's arithmetic operators
Learning Outcomes:
Upon completion of this course, the student will be able to:
Demonstrate basic competency in Web development and programming.
Explain the basic concepts of the Internet, client-server architecture, features,
and tools.
Explain technological features of client-server interaction including the HTTP
protocol.
Develop a basic Web site and set of Web pages using a modern Web
development tool.
Explain and apply basic Web design and usability principles.
Develop and incorporate software capabilities in Web pages using the JavaScript
programming language.
Assessment Model:
Best three of two quizzes and two assignments- 20%
One best out of TWO Mid-Terms (100 Marks) 30%
End-Term (100 Marks) 50%
Total Assessment (Out of 100 Marks) 100%
Preferred Reading:
Fundamentals of the Internet and the World Wide Web by Raymond Greenlaw
and Ellen Hepp, TMH
Internet & World Wide Programming by Deitel,Deitel & Nieto, Pearson
Education
Complete idiots guide to java script by Aron Weiss, QUE, 199
Web Resources:
www.theinternetteacher.com/.../InterFundamentalsFacultyWorkshop
www.rcc.ryerson.ca/profdev/handson/internet/basics.html
www.usabilitymatrix.com/Usability_fund.pdf
Course
Code
UCS-301
Course Title
Cr.
3.5
Prerequisites: Nil
Objective:
A study of formal languages and their power and present the theory of finite automata,
as the first step towards learning advance topics. Such as compiler design.
Course Description:
Module 1: Finite Automata and Regular Expression
Finite State System
Basic Definitions
o Non-Deterministic finite Automata (NDFA)
o Deterministic finite Automata(DFA)
Equivalence of DFA and NDFA Finite Automata with
o E-moves
o Regular expression
Equivalence of finite Automata and expression
Regular expression conversion and vice versa.
Module 3: Grammars
Definition
Context Free and context sensitive grammar
Ambiguity
Regular grammar
Reduced forms
Removal of useless Symbols and unit production
Chomsky Normal Form(CNF)
Griebach Normal Form(GNF).
Pushdown Automata
o Introduction to push-down machines
o Application of pushdown machines.
Design of T.M
Halting problem of T.M.
PCP problem.
Chomsky Hierarchy
o Chomsky hierarchies of grammars
o Unrestricted grammar
o Context sensitive Language
o Relation between language of classes.
Computability
o Basic Concepts
o Primitive Recursive Functions.
Learning Outcomes:
Better understanding of finite automata and regular expressions.
Acquiring knowledge for analysis of algorithms.
Understand the equivalence between Non-deterministic Finite State
Automata and Deterministic Finite State Automata.
Appreciate the power of the Turing Machine, as an abstract automaton, that
describes computation, effectively and efficiently
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Hopcroaft & O.D.Ullman, R.Motwani: Introduction to Automata Theory,
languages & computations
K.L.P.Mishra & N.Chandershekaran: Theory of Computer Sc. (Automata,
Language & Computation)
Peter Linz: Introduction to formal language & Automata
John C. Martin: Introduction to Languages and the Theory of Computation
Web Resources:
en.wikipedia.org/wiki/Algorithm
en.wikipedia.org/wiki/List_of_algorithms
http://www.ugrad.cs.jhu.edu/~cs271/
http://infolab.stanford.edu/~ullman/ialc.html
Course
Code
UEC-300
Course Title
L T
3 1
P Cr
.
2 4.
5
Prerequisites: Nil
Objective:
To study basic processor, Understanding 8085 microprocessor concepts, its
internal architecture, programming and interfacing. Impart Programming
knowledge based on the 8085 microprocessors instructions.
Course Description:
Unit 1: Introduction:
Evolution of microprocessor
General Architecture of microprocessor
Registers
ALU
System buses
Instruction cycle
Fetch cycle
Execute cycle
Machine cycle
T states
Architecture of 8085
Block diagram
Pin diagram
Instruction formats
Addressing Modes
Timing diagrams.
Unit 2: Instruction Set & Programming:
Iinstructions set of 8085
Data manipulation
Data transfer
Arithmetic &logical instructions
Status management instructions
Development of Assembly language program.
Web Resources:
www.pesonum.yasar.edu.tr/lectures/nilgun_morali/01.ppt
www.nptel.iitm.ac.in/.../Microprocessors%20and%20Microcontrollers/.../L...
www.baapkamaal.com/ad/studymaterialfor8085microprocessor1865/
Course
Course Title
L T P Cr.
Code
UEC-300
MICROPROCESSOR LAB
0
0 2 1.0
Prerequisites: 8085 Microprocessor trainer kit
Objective:
To understand the structure and operating instruction of the microprocessor
Trainer kit & implementation of assembly language programs on kit.
Course Description:
Study of 8085 Microprocessor Trainer kit.
Write a program using 8085 for
Two 8 bit numbers addition.
Two 16 bit numbers addition
Write a program using 8085 for
Two 8 bit numbers subtraction
Two 16 bit numbers subtraction
Write a program for multiplication of two 8 bit numbers using 8085.
Write a program for division of two 8 bit numbers division using 8085
Write a program for sorting a list of numbers in ascending &
descending order.
Code conversion-Binary to Gray & Gray to binary.
Program for finding square of a number using look up table & its
verification
Write a program for temp control using 8085 & 8255 PPI
Write a program for water level control using 8085 & 8255 PPI
Generate different waveforms using DAC interfacing it with a
microprocessor kit using 8255 PPI port.
Learning Outcomes:
To introduce students to microprocessors & their operation in electronic
circuits.
Gain a thorough understanding of the concepts of programming.
Develop the skills & techniques required to write programs of some
complexity.
Provides access to electronic technology for all levels of students.
Assessment Model:
Total Assessment 100%
Preferred Reading:
Course Notes by the Instructor
Lab manual provided by MARS Solutions
Course
Code
UCS-302
Course Title
COMPUTER NETWORKS
Cr.
4.5
Prerequisites: Nil
Objective:
Develop Knowledge of networking and networking components. Provides learning to
design, build and maintain computer networks capable of supporting local and global
organizations.
Course Description:
Module 1: Introduction
Design Issues
Virtual Circuits and Datagrams
Routing Algorithms
Optimality principle
Shortest path routing
o Dijkstra
o Bellman-Ford and Floyd-Warshall Algorithms
o Flooding and Broadcasting
Distance Vector Routing
o Link Stat Routing
o Flow Based Routing
Multicasting Routing
o Flow and Congestion Control
General Principles
Window Flow Control
o Packet Discarding
o Isarithmic Control
Traffic Shaping
Choke packets
RSVP
Dead Locks and their Avoidance
Network Layer in ATM
Interworking
o Bridges
o Routers and Gateways
o Internet Architecture and Addressing.
Electronic Mail
World Wide Web.
Introduction to Novell netware
o history, the rise of netware
o Netware 286 2.x
o Netware 3.x
o Netware 4.x
o Strategic Mistakes
o Netware 5.x
o Netware 6.0
o Netware 6.5
o Current Netware Situation and Performance.
LIST OF EXPERIMENTS
To configure a HUB/Switch
Learning Outcomes:
Understand how computers communicate with each other and the methods
employed to assure that the communication is reliable
Provide confidence to work independently to setup and maintain computer and
networking systems.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Andrew S. Athenaeum: Computer Networks Third Edition
S. Keshav: An Engineering Approach to Computer Networks
FOROUZAN: Data Communication and Networking
Web Resources:
http://ninjacraze.hubpages.com/hub/What-is-Computer-Network
http://en.wikipedia.org/wiki/Computer_network
http://www.cse.iitk.ac.in/users/dheeraj/cs425/
http://www.cs.rutgers.edu/~badri/552dir/notes.html
Course Code
Course Title
UIT-303
Information Storage and Management
Prerequisites: Nil
L
3
T
1
P
0
Cr.
3.5
Objective:
To ground learners with modern techniques and skills in information storage and retrieval.
Ensuring information management and information technology investments and mandates
meet the organizations needs. Promoting information effectiveness through the transformation
to interoperability.
Course Description:
Module 1: Introduction to Information Storage and Management
Data
o
Types of Data
Information Storage
o Evolution of Storage Technology and Architecture
Data Center Infrastructure- Core Elements
Key Requirements for Data Center Elements
Managing Storage Infrastructure
Key Challenges in Managing Information
Information Life Cycle
Storage System Environment:
o Components of SSE
o Host
o Connectivity
o Storage
Disk Drive Components
Performance
Fundamental Laws Governing Disk Performance
Logical Components of Host
o OS
o Device Driver
o Volume Manager
o File System
o Application
Data Protection
o RAID
o RAID Array Components
o RAID Levels
o RAID Comparison
o RAID Impact on Disk Performance
o Hot Spares
Intelligent Storage System
o Components
o Evolution
o Interfaces
o Architecture and Addressing
o SCSI Command Model
Storage Area Networks
o Fibre Channel
o SAN and its evolution
o Components of SAN
o FC Connectivity
o FC Ports
o FC Architecture
o Zoning
o FC Login Types
o FC Topologies.
Network-Attached Storage
o General Purpose Servers Vs. NAS Devices
o Benefits NAS File I/O
o Components of NAS NAS File Sharing Protocols
o Performance and availability
o iSCSI and FCIP (overview)
Content-Addressed Storage
o Features & Benefits of CAS
o CAS Architecture
o Storage & Retrieval.
Storage Virtualizations
o Forms
o SNIA SV Taxonomy
o SV Configurations and Challenges
Learning Outcomes:
Better understanding of, how proper information management programs and
systems can provide security and accountability.
Explain the concepts and historical developments of information retrieval;
Explain the types of information storage and retrieval systems
Discuss the structure of an information storage and retrieval system
Demonstrate ability to develop and implement an information storage and retrieval
system
Evaluate an information storage and retrieval system
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
G. Somasundaram and Alok Shrivastava Information Storage and Management
Web Resources:
https://education.emc.com/guest/campaign/InformationStorageandManagement.as
px
https://education.emc.com/guest/certification/framework/stf/stf.aspx
https://education.emc.com/guest/training/learning_paths/stf.aspx
Course Code
Course Title
UCS-304
Database Management System
Prerequisites: Nil
L
3
T
1
P
0
Cr.
3.5
Objective:
Elaborates the application of DBMS with its definition and the use in various applications.
Provides the knowledge about the constraints and controversies associated with relational
database model. Know the rules guiding transaction ACID.
Course Description:
Module 1: Introduction
Overview of DBMS
Components of DBMS
o Users
o Language
o Structure
o data-dictionary
o data manager
o DBA
File processing versus Data Management
File Oriented approach versus Database Oriented approach
SPARC 3-level architecture.
o A brief overview of three traditional models
o hierarchical mode
o network model and relational model
Module 2: ER-Models
Entity-Relationalship model as a tool for conceptual design
o Entities attributes and relationships
ER-Diagram
Converting ER-Model into relational schema.
Relational Model
o Properties of relational model { Codds 12 rules (integrity rules (
concept of keys))}
Relational algebra
o Select
o Project
o cross product
joins
o theta-join
o equi-join
o natural-join
o outer join
Tuple relational calculus
Domain relational calculus
Module 3: Query Languages
Functional Dependencies
Multi-valued Dependencies
Normalization (up to 5th level)
Structured Query language (with special reference of SQL of Oracle)
o INSERT
o DELETE
o UPDATE
o VIEW
Definitions and use of Temporary tables
Nested queries
o Correlated nested queries
o integrity constraints
o not null
o unique check
o primary key
o foreign key references
File Organization
o Sequential file
o index sequential files
o Direct files
o Hashing
o B-trees
o index files
Learning Outcomes:
Assessment Model:
Preferred Reading:
Course Notes by the Instructor.
C.J. Date An introduction to data base System
Naveen Prakash Introduction to Database management systems
Bipin C desai An introduction to database management system
Abraham Silberschataz, Henry F. Korth S. Sudershan Database System Concepts
Web Resources:
http://en.wikipedia.org/wiki/Database_management_system
http://www.d.umn.edu/~rmaclin/cs4611/notes/Ch01_Intro.pdf
http://cs.ulb.ac.be/public/_media/teaching/infoh303/dbmsnotes.pdf
http://dbmsmic.blogspot.in/
http://trainindia.wordpress.com/2010/03/13/lecture-notes-on-databasemanagement-systems/
Course Code
Course Title
UCS-305
Analysis & Design of Algorithms
Prerequisites: Nil
L
3
T
1
P
0
Cr.
3.5
Objective:
The objective of this course is to study paradigms and approaches used to analyze and design
algorithms and to appreciate the impact of algorithm design in practice. It also ensures that
students understand how the worst-case time complexity of an algorithm is defined, how
asymptotic notation is used to provide a rough classification of algorithms, how a number of
algorithms for fundamental problems in computer science and engineering work and compare
with one another, and how there are still some problems for which it is unknown whether there
exist Efficient algorithms and how to design efficient algorithms.
Course Description:
Module 1: Introductory Concepts
The notation of algorithm
fundamentals of algorithmic problem solving
analyzing algorithms
Review of fundamental data structures
o Arrays, Stacks
o Queue
o Linked list
Fundamentals of analysis of algorithms efficiency
o Asymptotic notation and standard efficiency classes
o mathematical analysis of recursive and non-recursive algorithms
Divide and Conquer
o General Method
o Merge sort
o Quick sort
o Selection sort
Sorting in Linear time
o Counting sort
o Radix sort and Bucket sort.
Search
o Linear Search
o Binary search
Module 2: Graphs
Review of Graphs
Representation of Graphs
o Breadth-first search
o Depth-first Search
Topological Sort
Strongly connected Components
Trees
o Review of Trees
o Minimum spanning tree
o Kruskal and Prims algorithm
o Single source shortest paths
o Bellaman-Ford algorithm
o Single source shortest path in directed acyclic graphs
o Dijkstras algorithm
o All pairs shortest paths
o Shortest paths and matrix multiplication
o Floyd-Warshall algorithm
o Johnsons algorithm
Learning Outcomes:
Design and analyze the complexity of algorithms.
Be familiar with mathematical and scientific principles relevant to computer science.
Be familiar with fundamental data structure and techniques for designing algorithms.
Be familiar with advanced and modern topics in computer science.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Course Code
Course Title
UCS-310
DBMS Lab
Prerequisites: Nil
L
0
T
0
P
2
Cr.
1.0
Objective:
To introduce the basic knowledge of database management systems. How to Create, Plan &
Manage Databases How to Backup & Recover Databases and perform tuning.
LIST OF PRACTICALS
Creation, altering and droping of tables and inserting rows into a table (use
Preferred Reading:
Course Notes by the Instructor
Benjamin Rosenzweig, Elena Silvestrova ORACLE PL/SQL by example
SCOTT URMAN ORACLE DATA BASE LOG PL/SQL Programming
Dr.P.S. Deshpande SQL & PL/SQL for Oracle 10g
Web Resources:
http://education.oracle.com/pls/web_prod-plq-dad/db_pages.getpage?page_id=42
http://ilearning.oracle.com/ilearn/en/learner/jsp
http://www.oracle.com/technetwork/tutorials/index.html
Course
Course Title
L
T
P Cr.
Code
UCS-350
Compiler Design
3
1
0 3.5
Prerequisites:
Students must have the prerequisite knowledge on the following topics:
i) Formal Languages ii) system programming
Objective:
Is to Describe the steps and algorithms used by language translators. Recognize the
underlying formal models such as finite state automata, push-down automata and their
connection to language definition
Through regular expressions and grammars. Discuss the effectiveness of optimization.
Explain the impact of a separate compilation facility and the existence of program
libraries on the compilation process.
Course Description:
Module 1: Introduction
Assembler
Linker
Loader
Preprocessors
Compiler and Translators
Structure of Compiler
Different Phases of Compiler
Bookkeeping, Error Handling
Compiler Writing Tools
Bootstrapping
Lexical Analysis
o Role of Lexical Analyser
o Design of Lexical Analyser
o Language for Specifying Lexical analyzer
o Implementation of lexical Analyser
LIST OF PRACTICALS
Editing image using dodge, blur and sponge tool text and notes
tools.
Introduction to flash and how to move any object from one end to
other.
Learning Outcomes:
Students will demonstrate an understanding of contemporary graphics
hardware.
Students will create interactive graphics applications in C++ using one or
more graphics application programming interfaces.
Students will write program functions to implement graphics primitives.
Students will write programs that demonstrate geometrical transformations.
Students will demonstrate an understanding of the use of object hierarchy in
graphics applications.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
David F Rogers Procedural Elements for Computer Graphics
Foley, Vandam, Feiner & Huges Computer Graphics Principles and Practice
Donald Hearn and M Pauline Baker Computer Graphics C Version
Buford J. K Multimedia Systems
Z. Xiang, R. Plastock Schaums outlines Computer Graphics
Web Resources:
http://www.graphics.rwth-aachen.de/courses/
http://college.yukondude.com/2009_01_cpsc100/wpcontent/uploads/2009/02/computer-graphics-and-multimedia.pdf
http://www.cs.csustan.edu/~rsc/CS3600F00/Notes.pdf
http://www.dgp.toronto.edu/~hertzman/418notes.pdf
Course
Course Title
Code
UIT-351
Computer Graphics and Multimedia
Prerequisites: Nil
Cr.
4.5
Objective:
Computer graphics and multimedia is used in diverse applications from the visualization
of complex scientific data to the special effects in movies and the animated characters in
computer games. The objective of this course is to introduce the programming principles
of computer graphics, including fundamental data-structures and algorithms for
rendering and modeling.
Course Description:
Module 1: Introduction to computer graphics & graphics systems
Introduction to Computer Graphics
Computer Graphics Applications
Computer Graphics Hardware and software
Video Display Devices
o Refresh cathode- ray tube
o raster scan displays
o random scan displays
o color CRT-monitors
o direct view storage tube
o flat-panel display
o 3D viewing devices
raster scan systems
random scan systems
graphics monitors and workstations.
Two dimensional Graphics Primitives
o Points and Lines
o Line drawing algorithms
o DDA, Bresenhams
o Circle drawing algorithms
o Using polar coordinates
o Bresenhams circle drawing
o mid point circle drawing algorithm
Filled area algorithms
o Scanline
o Polygon filling algorithm
o boundary filled algorithm
o Sutherland-cohen algorithm
Polygon clipping algorithm
o Sutherland-Hodgeman polygon clipping algorithm
Two dimensional transformations
o Transformations
o Translation
o Scaling
o Rotation
o Reflection
o composite transformation
Three dimensional transformations
o Three dimensional graphics concept
o Matrix representation of 3-D Transformations
o Composition of 3-D transformation
Viewing in 3D
o Projections
o types of projections
o the mathematics of planner geometric projections
Module 3: Curves
Curve representation
o surfaces
o designs
o Bezier curves
o B-spline curves
o End conditions for periodic B-spline curves
o rational B-spline curves
Hidden surfaces
o Depth comparison
o Z-buffer algorithm
o Back face detection
o BSP tree method
o the Painters algorithm
o scan-line algorithm
o Hidden line elimination
o wire frame methods
o fractal - geometry
Color & shading models
o Illumination
o Shading
o image manipulation
o Illumination models
o shading models for polygons
o shadows
o transparency
Module 4: Multimedia
Introduction to Multimedia
uses of multimedia
hypertext and hypermedia
Image
video and audio standards
Audio
o digital audio
o MIDI
o processing sound
o sampling
o compression.
Video
o MPEG compression standards
o compression through spatial and temporal redundancy
o inter-frame and intraframe compression
o overview of other image file formats GIF, TIFF, BMP, PNG etc.
Animation
o Types
o Techniques
o key frame animation
o utility
o morphing
o Virtual Reality concepts
Learning Outcomes:
Understand how the design of a compiler requires most of the knowledge
acquired during their study
Develop a firm and enlightened grasp of concepts learned earlier in their
study like higher level programming, assemblers, automata theory, and
formal languages, languages, languages specifications, data structure and
algorithms, operating systems.
Apply the ideas, the techniques, and the knowledge acquired for the
purpose of other software design
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman- CompilersPrinciples, Techniques and Tools, 2nd edition, Addison-Wesley.
D.M.Dhamdhere- System Programming and Operating Systems, 2nd revised
edition, Tata McGraw Hill.
Charles N. Fischer, Richard J. leBlanc, Jr.- Crafting a Compiler with C,
Pearson Education.
Andrew W Apple- Modern Compiler Implementation in C, Cambridge
University Press.
Web Resources:
http://www.slideshare.net/guest251d9a/compiler-designnanthu-notes
http://web.cecs.pdx.edu/~sheard/course/Cs321/notes/index.html
http://www.jntuhub.com/forum/e-books/
http://www.cs.cmu.edu/~fp/courses/15411-f09/lectures/01-overview.pdf
Course
Course Title
Code
UMG-350
Management Information System
Prerequisites: Nil
Cr.
3.5
Objective:
The course provides students a fundamental understanding of management information
systems concepts and their role in contemporary business. At the end of this course
students should be able to participate in information systems development as an
informed person.
Course Description:
Module 1: Introduction
Overview of MIS
Structure of MIS
Survey of information system technology
o H/W and S/W communication technology
o storage and data retrieval
o transaction processing
o office automation and information processing control functions
Design theories which are relevant to the adoption and use of strategic,
management information systems for competitive advantage Distinguish
between different types of IS systems and recognize enterprise-wide,
innovative methods of reducing costs and improving service through
management information systems
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
G.B.Davis and M.H. Olson Management Information System
R.J.Murdick, Ross and Clagget Information System for modern
management
Uma G . Gupta Management Information System
Kenneth C. Laudon Management Information System Organisation and
Technology
Web Resources:
http://en.wikipedia.org/wiki/Management_information_system
http://www.csus.edu/indiv/t/tsain/mis214.html
http://www.slideshare.net/SonamJain4/mis-notes
http://www.gurukpo.com/admin/bookpdf/55.pdf
Course Code
UEC-356
Prerequisites: NIL
Course Title
Digital Communication
Cr.
4.5
Objective:
Course Description:
UNIT 1:
Analog to Digital Conversion: Noisy communication channels, the
sampling theorem, low pass signals and band pass signals, pulse amplitude
modulation, channels bandwidth for a PAM signal. Pulse amplitude
modulation, sampling, signal recovery an holding, Quantization of signal,
Quantization error, pulse code modulation (PCM), Delta modulation,
adaptive data modulation
UNIT 2 :
Random Variables and Distribution Functions: Digital Modulation
Techniques: Binary Phase shift keying, Differential Phase shift keying,
Differential encoded PSK, quadrature PSK, Quadrature Amplitude shift
keying (QSK) Binary frequency shift keying.
Data Transmission: A baseband signal receiver, probability of error, the
optimum filter, white noise- the matched filter, probability of error of the
matched filter, coherent reception: correlation, correlation receiver for
Q.PSK.
UNIT 3:
Noise in Pulse Code and Delta Modulation system: PCM transmission,
Calculation of Quantization noise, the O/P signal power, the effect of
thermal noise, O/P signal to noise ratio in PCM, Delta modulation,
Quantization noise in Delta modulation, the O/P signal to quantization noise
ratio in delta modulation, O/P signal to noise ratio in delta modulation.
UNIT 4:
Computer Communication System: Introduction, types of networks,
Design features of computer communication network, Examples of Digital
communication: ISDN, LAN, pocket radio and satellite, ATM, etc.
List of Experiments
To represent basic signals (Unit step, unit impulse, ramp, exponential, sine
and cosine)
To develop program for discrete convolution.
To develop program for discrete correlation.
To understand stability test.
To understand sampling theorem.
To design analog filter (low-pass, band-pass, band-stop).
To design digital IIR filters (low-pass, high pass, band-pass, band-stop )
To design FIR filter using windows technique.
To design a program to compare direct realization values of IIR digital filter.
To develop a program for computing parallel realization values of IIR digital
filter.
To develop a program for computing cascade realization values of IIR
digital filter.
To develop a program for computing inverse Z-transform of a rational
transfer Function
Learning Outcomes:
Assessment Model:
Preferred Reading:
Web Resources:
http://www.scribd.com/doc/17247639/digital-communication-notes
http://www.cse.yorku.ca/course_archive/201011/F/3213/CSE3213_07_ShiftKeying_F2010.pdf
http://en.wikipedia.org/wiki/Phase-shift_keying
feihu.eng.ua.edu/NSF_TUES/Modulation.ppt
Course Code
Course Title
L
T
P
Cr.
UCS-353
Computer Peripherals and Interfaces
3
1
2
4.5
Prerequisites:
Microprocessor and Assembly Language Programming.
Objective:
To learn the functional details of various peripheral devices. To introduce students to basic
computer peripherals and interfaces, their interaction with PC (ways of connection, means of
control etc.), as well as future trends in this area.
Course Description:
Module 1: SYSTEM RESOURCES
Interrupt
DMA Channel
I/O Port Addresses and resolving and resolving the conflict of resources
I/O buses
o ISA
o EISA
o Local bus
o VESA Local bus
o PCI bus
o PCI Express
o Accelerated graphics port bus
IDE & SCSI Interfaces
o IDE origin
o IDE Interface ATA standards ATA1 to ATA7
o ATA feature
o ATA RAID and SCSI RAID
o SCSI Cable and pin Connector pin outs
o SCSI V/s IDE Advantages and limitation.
Learning Outcomes:
Explain the basic concept of computer and its structure
Understand basic computer organization and its advantages
Know different types of computer software application
Give overview of the components of computer system
Explicate various computer generations
Elucidate on different business software packages
Assessment Model:
Preferred Reading:
Course Notes by the Instructor
P. Pal Chandhari Computer Organization and design
Del Corso, H.Kirrman, JD Nicond Microcomputer buses & links
Mark Mines Complete PC upgrade & maintenance guide
Craig Zacker & John Rouske PC Hardware: The complete reference
Scott Mueller Upgrading and Repairing PCs
Web Resources:
http://hasanpoet.weebly.com/uploads/3/4/9/6/3496531/cpi.pdf
http://www.iitg.ernet.in/asahu/cs421/Lects/Lec01.IntroMotiv2PeriPheral.pdf
http://www.sgbau.ac.in/computer-application-in-management.pdf
http://ptucse.loremate.com/cpi/node/2
http://ptucse.loremate.com/cpi/node/8
Course Code
UMA-351
Prerequisites: NIL
Course Title
Statistical Methods
Cr.
3.5
Objective:
An understanding of statistics and its uses and limitations is one of the most
important skills you can acquire for modern life and the modern workplace,
so we hope you take full advantage of this opportunity to master the early
stages.
Course Description:
UNIT 1:
Introduction: Theory of probability, probability concepts, random
experiment and events, Mathematical Notion, probability function, law of
addition of probability, extension of general law of addition of probabilities,
multiplication law of probability and conditional probability, extension of
multiplication law of probability, probability of occurrence of n independent
events, independent events, conditions for mutual independence of n
events, Bayes theorem.
UNIT 2:
Random Variables and Distribution Functions: Random variable,
distribution function, discrete random variable, probability mass function,
discrete distribution function, continuous random variable, probability
density function, various measures of central tendency, dispersion,
skewness and kurtosis for continuous distribution, continuous distribution
function
UNIT 3:
Discrete Distribution, Bernoulli Distribution, binomial distribution, fitting of
binomial distribution, Poisson distribution, the Poisson process, probability
generating function of Poisson distribution, fitting of Poisson distribution,
Normal distribution as a limit of binomial
Inferential statistics: Sampling, Sampling distribution, theory of estimation,
hypothesis testing, z-test, student t - test, f- test, chi square test.
UNIT 4:
Measures of Central Tendency: Central tendency, arithmetic mean,
median & mode.
Measures of Dispersion: Meaning of dispersion, range, mean deviation,
standard derivation, quartile derivation, measures of relative dispersion
Learning Outcomes:
After successfully completing this subject
Students will understand basic probability theory, including rules for finding
probabilities of complex events, conditional probability, and probabilities for
repeated independent and dependent trials.
Students will understand the concepts of sampling, including the use of
random number tables to select samples.
Students will understand the probability distributions of discrete random
variables.
Assessment Model:
en.wikipedia.org/wiki/Statistics
www.springer.com Home Statistics
www.thefreedictionary.com/statistical+method
www.iarc.fr/en/publications/pdfs-online/stat/index.php
www.consort-statement.org/...methods/item12a_statistical-methods
T
3
P
1
Cr.
2 4.5
Module 1: Introduction
Object oriented programming
Two paradigms
Abstraction
Advantages of Java
method overriding
dynamic method dispatch
Abstract Classes
Using final with inheritance
Module 2 : Package
Defining packages
Package access protection
importing packages
Interfaces
o Defining and Implementing Interfaces
o Multiple Inheritances through Interfaces.
Exception handling
o Exception handling fundamentals
o Exception types
o Uncaught Exceptions Using try and catch
o multiple catch clauses
o nested try statements throw, finally
o User defined exceptions.
Multithreaded Programming
The Java thread model
the main thread
creating thread, multiple thread,
using is alive() and join ()
Thread priorities
synchronization
Inter thread communications.
Applet architecture,
HTML applet tag
Display Methods
Parameter passing
Event Handling
o Event handling mechanism
o Event classes (Action Event, Mouse Event, Key Event)
o Event Listener Interfaces (ActionListener, KeyListener,
Mouselistener)
o Adapter classes
Window Fundamentals
o Component
o Container
o Panel
o Window & Frame,
o Working with Graphics, colors, Fonts
o AWT Controls
o Layout Manager & Menus.
Module 4: Swing:
Difference between AWT and Swing
Swing components
classes
o buttons
o boxes
o panes
o Tables, fields and trees.
JDBC
o Java as a database front end
o Database Client/Server methodology
o Two-and three-tier
Database design
Operations
o Insertion
o Deletion
o selection
o updating a database
Servlets
Introduction
Life cycle
Simple Programs
Handling Http request and response
Handling cookies
Session tracking
LIST OF PRACTICALS
1
2
Data Members:
1. Name of the depositor
2. Account number
3. Type of Account
4 Balance amount in account
Methods:
1. To assign initial values
2. To deposit an amount
3. To withdraw an amount after checking the balance
To display the name and balance
11 Create a string buffer object to illustrate how to
a. Display capacity and length of string buffer
b. Insert character at the beginning.
c. Append & Reverse the string.
12. Write a programme to access data from database using JDBC and modify data in
the
Database.
13. Write a programme to implement frame, panels through different layout managers in
Applets and swings.
14. Write a programme that shows a solid circle that moves from left to right. Across the
applet
diplay area. The flicker effect should be noticeable.
15. Write a programme to implement Applet that displays a different Images based on the
days
Of week. The Applet should accept seven parameters that Identify the Image file.
16. Write an application that execute two threads one after another, Create threads by
I
Implementing.
(a) Thread Class
(b) Runnable Interface.
17. Write an application that defines sphere class with three constructors first from
accepts no arguments. It assumes that sphere is centered at origin & has radius of one
unit. The record from accept one double value and represents radius and centered at
origin, third from accepts four double arguments and specify radius and origin.
18. Write down a programme to implement polymorphism using
(a) Overloading
(b) Overriding
19. Write a program to implement run time polymorphism.
Learning Outcomes:
Upon successful completion of this course, students will be able to:
Basics of C, C++ and Java
Introduction to classes, methodologies, methods and classes.
Basics of Packages, Interfaces and Exception Handling.
Details of JDBC, Servelets, Swings
Assessment Model:
Preferred Reading:
The Complete Reference by Patrick Naughton, Herbert Schildt
Programming with Java by E. Balagurusamy, Tata McGraw Hill
Programming with JAVA by John R. Hubbard, Schaums Outline Series, McGraw
Hill
Core Java-I & II by Horstmann, Addison Wesley
Web Resources:
www.advancedlinuxprogramming.com
www.cs.tau.ac.il/~efif/presentations/LCSD_05/lcsd_final.pdf
www.amazon.com ... Programming APIs & Operating Environments
Course
Code
UCS-401
Course Title
Cr.
3.5
Prerequisites: Nil
Objective: The course will cover a review to protect network and data transmission over
wireless network. Data Security is the main aspect of secure data transmission over
unreliable network. Data Security is a challenging issue of data communications today
that touches many areas including secure communication channel, strong data
encryption technique and trusted third party to maintain the database. The conventional
methods of encryption can only maintain the data security. The information could be
accessed by the unauthorized user for malicious purpose. Therefore, it is necessary to
apply effective encryption/decryption methods to enhance data security.
Course Description:
Module 1 : Introduction
OSI Security Architecture
Cipher Principles
Data Encryption Standard
Block Cipher Design Principles
Modes of Operation
Evaluation criteria for AES
AES Cipher
Triple DES
Traffic Confidentiality.
Module 2: Key Management
Diffie-Hellman key Exchange
Elliptic Curve Architecture and Cryptography
RSA
Module 3 : Authentication And Hash Function
Authentication requirement
Authentication functions
Message Authentication Codes
o Hash Functions
o Security of Hash Functions and MACs
o MD5 message Digest algorithm
o Secure Hash Algorithm
o RIPEMD ,
o HMAC Digital Signatures
o Authentication Protocols
o Digital Signature Standard.
Preferred Reading:
Principles of Information Security by Michael EWhitman & Herbert J. Mattord,
Vikash Publishing House.
Cryptography and Network Security by William Stalling, Pearson Education
Security in Computing by Charles P. Pfleeger , PRENTICE HALL OF INDIA
Inside Internet Security by Jeff Crume, Addison Wesley
Web Resources:
www.cs.iit.edu/~cs549/lectures/CNS-1.pdf
www.cse.iitk.ac.in/users/braman/cs425/slides/security-overview.pdf
williamstallings.com/Cryptography/
Course
Course Title
Code
UIT-402
Unix Linux Administration
Prerequisites: Nil
Cr.
4.5
Module 1 : Introduction
Introduction to Multi-user System
Emergency and history of Unix
Inter-process Communication
o I/O Sub system
o terminal drives
o disk drive
o messages
o shared memory
o semaphores
o memory management
o Swapping
o demand paging
System Calls and Unix -C Interface
File handling calls like - access (), open(), create(), read(), write(), close(),
fseek()
Process control system calls like kill(), exec(), fork(), wait(), signal(), exit()
Comparing stdio library and calls
LIST OF PRACTICALS
1. Session -1
a. Log into the system
b. Use vi editor to create a file called myfile.txt which contains some text.
c. Correct typing errors during creation.
d. Save the file
Session-2
Log into the system
Open the file created in session 1
Add some text
Change some text
Delete some text
Save the Changes
Logout of the system
3. a) Use the cat command to create a file containing the following data. Call it mytable
use tabs to separate the fields.
1425 Ravi 15.65
4320 Ramu 26.27
6830 Sita 36.15
1450 Raju 21.86
b) Use the cat command to display the file, mytable.
c) Use the vi command to correct any errors in the file, mytable.
d) Use the sort command to sort the file mytable according to the first field. Call the
sorted file
my table (same name)
e) Print the file mytable
f) Use the cut and paste commands to swap fields 2 and 3 of mytable. Call it my table
g) Print the new file, mytable
i) Logout of the system.
4 a) Login to the system
b) Use the appropriate command to determine your login shell
c) Use the /etc/passwd file to verify the result of step b.
d) Use the who command and redirect the result to a file called myfile1. Use the more
command to see the contents of myfile1.
e) Use the date and who commands in sequence (in one line) such that the output of
date will
display on the screen and the output of who will be redirected to a file called myfile2.
Use
the more command to check the contents of myfile2.
5 a) Write a sed command that deletes the first character in each line in a file.
b) Write a sed command that deletes the character before the last character in each
line in a
file.
c) Write a sed command that swaps the first and second words in each line in a file.
6 a) Pipe your /etc/passwd file to awk, and print out the home directory of each user.
b) Develop an interactive grep script that asks for a word and a file name and then tells
how
many lines contain that word.
c)Repeat
Learning Outcomes:
Better equipped with the understanding of UNIX and LINUX operating system
concepts.
Introduction to shell and shell programming
Acquiring know how for various commands in UNIX and LINUX.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Design of Unix Operating System by Maurice Bach
Advanced Unix by Stephan Prata
The Unix Programming Environment by Kennighan and Pike
Unix Programmers Guide by P. P. Selvester
Introduction to Unix System by Rachell Morgan
Web Resources:
www.admin.com/
www.amazon.com ... Operating Systems Unix Administration
www.pce.uw.edu/.../unix-linux-administration.html - United States
Course
Course Title
Code
UCS-403
Artificial Intelligence & Expert System
Prerequisites: Nil
Cr.
4.5
Module 1: Introduction to AI
Definition of Artificial Intelligence (AI)
Problems
Techniques
Architecture of AI machines
logic family
Classification of logic
Introduction to LISP
o List manipulations
o Functions
o Predicates
o Conditionals
o Input, output local variables
o Iteration
o recursion
o Lists
o Arrays.
Problems Spaces & Search
Defining a problem as a space
Search
Production systems and its Architecture
Problem characteristics
Production system characteristics
SLD resolution
SLD tree
Flow of satisfaction
Expert System
o Component of an expert system
o Categories of an Expert System
o Stages in development of Expert System
o Expert System Development Tools
o Expert System Architecture
LIST OF PRACTICALS
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
Study of PROLOG/LISP.
Write a program to find a factorial of a number.
Write a program to the maximum of two numbers.
Write a program to illustrate the use of predicate not/fail.
To find the various relationships of a family.
Write a program to illustrate the procedural meaning of Prolog.
Medical diagnosis of Patient.
Write a program to solve 8 queens problem.
Solve any problem using breadth first search.
Solve any problem using depth first search.
Solve any problem using best first search.
Solve 8-puzzle problem using best first search.
Solve travelling salesman problem.
Learning Outcomes:
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Web Resources:
www.uic.edu/classes/idsc/ids422/aiIntro-ch10.ppt
www.pes.edu/mcnc/AI/data/presentation/Turban.../ch10.ppt
www.wtec.org/loyola/kb/c1_s1.htm
Course
Course Title
Code
UCS-406
EMBEDDED SYSTEM DESIGN
Prerequisites: Nil
Cr.
4.0
Course Description:
Module 4:
Cost Compiler and cross assembly for embedded
systems
Why we need cross compiler / Assembler
Embedded software development take chain
Software development tool chain
Compiler linker
Locators
Cross assembles
GCC compiler.
Communication Protocols with reference to ES
o Introduction to protocol
o Why we need in ES,
o Overview TCP (IP)
o UDD wings protocols
o IrDA
o Blue Box
o IEEE 8811
Learning Outcomes:
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Embedded System Design by Frank Vahid, Tony Givargis , John Wiley & Sons,
Inc
Building Embedded Linux Systems by Karim Yaghmour, Oreilly
Programming Embedded Systems by Michael Barr , Oreilly
Web Resources:
Course
Code
Course Title
Cr.
UCS-407
4.0
Prerequisites: Nil
Objective: In computer science, real-time computing (RTC), or reactive computing, is
the study of hardware and software systems that are subject to a "real-time constraint"
e.g. operational deadlines from event to system response. Real-time programs must
guarantee response within strict time constraints.
Course Description:
Module 1 : Introduction
Definition
Typical Real Time Applications
o Digital Control
o High Level Controls
o Signal Processing etc
o Release Times
o Deadlines
o Timing Constraints
o Hard Real Time Systems
o Soft Real Time Systems,
Reference Models for Real Time Systems
Processors and Resources
Temporal Parameters of Real Time Workload
Periodic Task Model
Precedence Constraints
Data Dependency
Driven Systems
Learning Outcomes:
Better equipped with the understanding of Real Time Scheduling and itsCommon
Approaches to Real Time Scheduling
Introduction to Resources Access Control and Real Time Communication.
Acquiring know how of Multiprocessor System Environment.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Web Resources:
en.wikipedia.org/wiki/Real-time_computing
www.ece.cmu.edu/~koopman/des_s99/real_time/index.html
www.le.ac.uk/eg/fss1/real%20time.htm
Course
Course Title
Code
UCS-408
GRID COMPUTING
Prerequisites: Nil
Cr.
4.0
Module 1 : Introduction
Grid Computing
Benefits of Grid Computing
Virtual Organizations
Grid Architecture and its relationship to other distributed technologies
Grid Application Areas,
o OGSA
o OGSI
o Introduction to Semantic Grids.
Building Blocks for Grid Systems
o XML
o SOAP
o UDDI
o Service Oriented Architecture
o Web Services
o Web Services Architecture
o WSRF
o Relationship between Grid and Web Services
o Grid and Web Services Invocation.
Module 3 : Security
Security Issues in Grids
Authentication Issues
Trust and Privacy related Issues
Authorization Issues
Grid Security Frameworks
Standards
Web Services Security Specifications.
Monitoring and Discovery Services:
o Index Services
o Resource Discovery
o UDDI
o Introduction to MDS in GT4
Learning Outcomes:
Better equipped with the understanding of Grid Architecture and its relationship to
other
Distributed technologies.
Introduction to Grid Resource Management Systems.
Acquiring know how of Security Issues in Grids and Grid Middleware and
Programming
Model.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Grid Computing, First Edition by Joshy Joseph, Craig Fellenstein , Pearson
Education
The Grid 2: Blueprint for a New Computing Infrastructure, Second Edition, by Ian
Foster, Carl Kesselman , Morgan Kaufman
Introduction to Grid Computing, First Edition by Bart Jacob, Michael Brown,
Kentaro Fukul, Nihar Trivedi , IBM Red Books
Grid Resource Management - State of the Art and Future Trends by Zarek
Nabrzyski, Jennifer M. Schopf, Jan Weglarz , Kluwer Academic Publishers
Grid Computing Security by Anirban Chakrabarti , Springer
Web Resources:
en.wikipedia.org/wiki/Grid_computing
www.gridcomputing.com/
www.webopedia.com/grid_computing.html
Course
Course Title
Code
UCS-409
INFORMATION RETRIEVAL
Prerequisites: Nil
Cr.
4.0
Course Description:
Module 1: Introduction
Introduction to Information Retrieval
Inverted indices
Boolean queries
Query optimization
Nature of unstructured and semi-structured text.
The term vocabulary and postings lists
Text encoding
o Tokenization
o Stemming
o Emmatization
o Stop words
o Phrases
o Optimizing indices with skip lists
o Proximity and phrase queries
o Positional indices.
Real-world issues
Module 3: Scoring
Term weighting and the vector space model
Parametric or fielded search
Document zones
The vector space retrieval model.
o tf.idf weighting
The cosine measure
Scoring documents.
Computing scores in a complete search system
o Components of an IR system
o Efficient vector space scoring
o Nearest neighbor techniques
o Reduced dimensionality approximations
o Random projection.
Module 4 : Classification:
Naive Bayes model
Spam filtering
K Nearest Neighbors
Decision Trees
Support vector machine classifiers.
Web Crawling
o What makes the web different?
o Web search overview
o Web structure,
o The user,
o Paid placement
o Search engine optimization
o Web size measurement
o Crawling and web indexes
o Near-duplicate detection,
o Link analysis
o Learning to rank
o Focused web crawler and its different architectures
Learning Outcomes:
Better equipped with the understanding of Query optimization and Dictionary data
Structures.
Introduction to Dictionaries and tolerant retrieval.
Acquiring know how of Naive Bayes model and Web Crawling.
Assessment Model:
Preferred Reading:
Web Resources:
en.wikipedia.org/wiki/Information_retrieval
www.dcs.gla.ac.uk/Keith/Preface.html
www.irsi.res.in/
Course
Course Title
Code
UCS-411
OBJECT ORIENTED SOFTWARE ENGINEERING
Prerequisites: Nil
Cr.
4.0
Rumbaugh methodology
Jocobson methodology
Booch Methodology
Patterns
Frameworks,
The unified approach
Unified modeling language (UML).
o
o
o
o
Methods
Super sub class relationships
A part of relationships aggregation class responsibilities
Object responsibilities
Learning Outcomes:
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Web Resources:
en.wikipedia.org/wiki/Object-oriented_software_engineering
www.lloseng.com/
www.site.uottawa.ca:4321/oose/
Course
Course Title
Code
UCS-412
RELATIONAL DATABASE MANAGEMENT SYSTEM
Prerequisites: Nil
L T P Cr.
4 0 0 4.0
Shadow Paging
Recovery in Multi database Transaction
Database Security and Authorization
o Introduction to Database Security Issues
o Discretionary Access Control Based on Privileges
o Mandatory Access Control for Multilevel Security
o Statistical Database Security.
Advanced Data Modeling Concepts
Enhanced ER (ERR)-to-Relational Mapping
Data Abstraction
Knowledge Representation Concepts
Integrity Constraints in data modeling,
EER Update Operation
Transaction Specification
Interpretation of Rules
Basic interference Mechanism for Logic Programs and their
evaluation
The LDL System
Other Deductive Database Systems
Emerging Database Technologies and applications
o Progression of Database Technology
o Emerging Database Applications,
o Next Generation of Databases and Database Management
Systems
o Interfaces with other Technologies.
o
Learning Outcomes:
Assessment Model:
Preferred Reading:
Web Resources:
en.wikipedia.org/wiki/Relational_database_management_system
en.wikipedia.org/wiki/Relational_database
www.msdis.missouri.edu/resources/gis_advanced/pdf/Relational.pdf
Course
Course Title
Code
UCS-405
NATURAL LANGUAGE PROCESSOR
Prerequisites: Nil
Cr.
4.0
Module 1 : Introduction
Introduction to natural language understanding systems
Evaluating language understanding systems
Components of natural language processing
o Lexicography
o Syntax
o Semantics
o Pragmatics
o Discourse
o Organization of Natural Language Understanding Systems
Word level representation of natural languages
Prosody & natural languages
Module 4 : Semantics
Selectional Restrictions
Semantic Filtering
Semantic networks
Semantic Grammars
Template Matching
Knowledge representation
Logic and Natural language,
Prolog for natural language semantic.
Application of NLP
o Intelligent word processors
o Machine translation
o User interfaces
o Man- Machine interfaces
o Natural language querying
o Tutoring and authoring systems
o Speech Recognitions commercial use of NLP.
Learning Outcomes:
Better equipped with the understanding of Components of natural language
processing
Introduction to Formal languages and grammars and Computation linguistics
Acquiring know how of Recognition and parsing of natural language structures.
Assessment Model:
Preferred Reading:
Web Resources:
en.wikipedia.org/wiki/Natural_language_processing
www.autonomy.com/content/Functionality/idol...nlp/index.en.html
www.thefreedictionary.com/natural+language+processor
Course Code
UIT-450
Course Title
DATA WAREHOUSING & DATA MINING
L
3
T
1
P
0
Cr.
3.5
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of data ware housing and data
mining. The course develops an insight towards the architecture and need of dataware
housing. It gives the introduction to OLAP and its operations and the various data mining
tasks and the rules associated with data mining and its applications.
Course Description:
Module 1: Introduction to Data Warehousing
Data Warehousing
o Definition and characteristics
o Need for data warehousing
o DBMS vs. data warehouse
OLAP
o Overall Architecture
Data Warehouse Database
Sourcing
Acquisition
Cleanup and Transformation Tools
Metadata Access Tools, Data Marts
Introduction to Data Mining
Data mining
o Data mining functionalities
o Kinds of patterns can be mined
o Classification
o Major issues
o Functionalities
o Classification data mining systems
Multidimensional data model
o Data cubes
o Schemas for multidimensional databases
OLAP operations
Metadata
Module 2: Data Pre-Processing
Data cleaning
Data Integration and Transformation
Data Reduction, Discretization and concept hierarchy generation
Data mining primitives
o Data mining Task
o A data mining query language
o Architecture of Data mining systems
o Characterization and comparison
Concept Description
Data mining techniques
o Concept description attribute oriented induction
o Analytical characterization
o Mining class comparisons
Commercial Importance of DW
Applications of data mining
o data mining in business process
o embedded data mining
Learning Outcomes:
Better understanding of dataware housing and data mining.
Acquiring knowledge for rules associated with data mining.
Preparedness for skills used in various methodologies and the case studies in
building data mining.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Course
Code
UCS-451
Course Title
Cr.
Distributed Systems
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of distributed systems. The
course develops an insight towards client server model and the various processes used
in distributed systems.It also deals with the synchronization and the distributed file
systems. The course also gives the clear understanding of the various case studies
related to distributed systems.
Course Description:
Module 1: Introduction to Distributed System
Distributed System
o Goals
o Hardware concepts
o Software concepts
o Client-Server model
o Examples of distributed systems
Communication
o Layered protocols
o Remote procedures call
o Remote object invocation
o Message oriented communication
o Stream-oriented communication
Processes
o Threads
o Clients, Servers
o Code Migration
o Software agent
Module 2: Naming
o Naming entities
o Locating mobile entities
o Removing un-referenced entities
Synchronization
o Clock synchronization
o Logical clocks
o Global state
Election algorithms
Mutual exclusion
Distributed transactions
Module 3: Consistency and Replication
Introduction
o Data centric consistency models
o Client centric consistency models
Distribution protocols
Consistency protocols
Security
Introduction
o Secure channels
o Access control
o Security management
Module 4: Distributed File System
Sun network file system
Learning Outcomes:
Better understanding of distributed file systems.
Acquiring knowledge for the various case studies.
Preparedness for skills used in various synchronization and processes used
in distributed systems.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
G. Coulouris, J. Dollimore, and T. Kindberg: Distributed Systems: Concepts
and Design
Taunenbaum: Distributed Systems: Principles and Paradigms
M. Singhal & N. Shivaratri: Advanced Concepts in Operating Systems
Web Resources:
http://en.wikipedia.org/wiki/Distributed_computing
http://code.google.com/edu/parallel/index.html
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?reload=true
Course
Code
UIT-305
Course Title
Cr.
Software Maintenance
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of software maintainance. The
course develops an insight towards various maintenance models and the concept of
reverse engineering. It helps us in giving the various methods involve for maintainance
tools and measures and gives us introduction of the configuration management
Course Description:
Module 1: Fundamentals
Meaning of software maintenance
o Software change
o Ongoing support
Economic implications of modifying software
The nomenclature and image problem
Software maintenance framework
Potential solutions to maintenance problem
Maintenance Process models
Definitions
o Critical appraisal of traditional process models
o Maintenance process models
Definitions
o Critical appraisal of traditional process models
o Maintenance process models
Program understanding
Aims of program comprehension
Maintainers and their information needs
Comprehension process models
o Mental models
Program comprehension strategies
Maintenance measures
Definitions
Objectives of software maintenance
o Example measures
o Guidelines for selecting maintenance measures
Module 3: Configuration management
Definitions
Configuration management
o Change control
o Documentation
Management and organizational issues
o Management responsibilities
o Enhancing maintenance productivity
o Maintenance teams
o Personnel education and training
o Organizational modes
Module 4: Building and sustaining maintainability
Quality assurance
Fourth generation languages
Object-oriented paradigms
Maintenance tools
o Criteria for selecting tools
o Taxonomy of tools
o Program understanding and reverse engineering
o Testing, configuration management, other tasks
Course Code
UIT-455
Course Title
Mobile Databases
L
4
T
0
P
0
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of mobile databases. The course develops
an insight towards various fundamentals of database technology. It gives the clear mechanism of
concurrency control and deals with the transaction management in mobile database systems.
Course Description:
Module 1: Mobile Database
Introduction
Fully Connected Information Space
Types of Mobility
Fundamentals of Database Technology
Conventional Database,
o Architecture, Database Processing
o Serialization of Transaction
o Advanced Transaction Model
Module 2: Concurrency Control Mechanism
Introduction,
o ways of locking data items.
The Phantom Problem,
Multigranularity locking,
Heuristics approach in locking scheme,
Non locking based schemes.
Data Processing and Mobility
Introduction
Learning Outcomes:
Better understanding of concurrency control mechanism.
Acquiring knowledge for transaction management in mobile databases.
Preparedness for skills used in mobile database recovery.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Kumar Vijay: Mobile Database Systems
Web Resources:
http://en.wikipedia.org/wiki/Mobile_database
http://webserver.ignou.ac.in/virtualcampus/adit/course/cst302/block2/cst302-bl2-u1.htm
http://www.ibm.com/developerworks/downloads/ibm/mobiledatabase/index.html
http://www.raima.com/products/rdm-mobile/
Course
Code
UIT-456
Course Title
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of software project
management.. The course develops an insight towards the evolution of software
economics and the various life cycle phases.The course deals with the project control
and process instrumentation and the various case studies linked with it.
Course Description:
Module 1: Conventional Software Management
The waterfall model
conventional software Management performance.
Evolution of Software Economics
Software Economics
Transitioningtoaniterativeprocess
Life cycle phases
Engineering and production stages
inception
Elaboration
construction
transitionphases
Artifacts of the process
The artifact sets
o Management artifacts
o Engineering artifacts
o programmatic artifacts
Module 3: Model based software architectures
A Management perspective and technical perspective
Work Flows of the process
o Software process workflows
o Iteration workflows
Management indicators
quality indicators
life cycle expectations
pragmatic Software Metrics
Metrics automation.
Tailoring the Process
Process discriminants
Future Software Project Management
Modern Project Profiles
Next generation Software economics
modern process transitions
Case Study
The command Center Processing and Display systemReplacement (CCPDS-R)
Learning Outcomes:
Better understanding of the life cycle phases.
Acquiring knowledge for process automation
Preparedness for skills used in iterative process planning.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Walker Royce: Software Project Management
Bob Hughes and Mike Cotterell: Software Project Management
Joel Henry: Software Project Management
Pankaj Jalote: Software Project Management in practice
Web Resources:
http://en.wikipedia.org/wiki/Software_project_management
https://www.comp.glam.ac.uk/staff/dwfarthi/projman.htm
http://www.linkedin.com/skills/skill/Software_Project_Management
Course
Code
UIT-457
Course Title
Cr.
Soft Computing
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of soft computing. The course
develops an insight towards the classification of artificial neural networks and the various
algorithms perceptions.The course gives the detail introduction to fuzzy logic,the various
fuzzy arithmetic and fuzzy relations.
Course Description:
Module 1: Introduction to Artificial Neural Networks
Introduction to Artificial Neural Network
o Artificial Neuron
o Classification of Artificial Neural Network
o Architecture of a Artificial Neural Network
o Activation Function
o Training an Artificial Neural Network
o Application of Artificial Neural Network.
o
o
o
o
o
o
o
o
o
o
o
o
Fuzzy Database
Fuzzy Intelligent System
Fuzzy Vs Crisp set
Linguistic variables
membership functions
operations of fuzzy sets
fuzzy IF-THEN rules
variable inference techniques
de-fuzzification techniques
basic fuzzy inference algorithm
Applications of fuzzy system
useful tools supporting design.
Learning Outcomes:
Better understanding of fuzzy logic.
Acquiring knowledge for de-fuzzification techniques.
Preparedness for skills used in genetics algorithms
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
G.J.Klir & T.A. Folyger: Fuzzy Sets, Uncertainty & Information
G.J.Klir & B.Yuan: Fuzzy sets & Fuzzy logic
Jang, Sun, Mizutani: Neuro-Fuzzy and Soft computing
Haykin: Neural networks: a comprehensive foundation
Goldberg: Genetic Algorithms
Sivanandam, Deepa: Principles of Soft Computing
Timothy J. Ross: Fuzzy Logic with Engineering Applications
Web Resources:
http://en.wikipedia.org/wiki/Soft_computing
http://modo.ugr.es/en/soft_computing
http://www.myreaders.info/html/soft_computing.html
http://www.journals.elsevier.com/applied-soft-computing/
Course Code
UCS-458
Course Title
Software Verification, Validation & Testing
L
4
T
0
P
0
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of software verification and testing.. The
course develops an insight towardsthe software testing and the graph theory . It gives the clear
understanding to how to reduce the number of test casesand gives the complete understanding of
testing tools.
Course Description:
Module 1: Introduction
What is software testing and why it is so hard?
o Error, Fault, Failure
o Incident
o Test Cases
o Testing Process
o Limitations of Testing
o No absolute proof of correctness
Overview of Graph Theory & Discrete Mathematics
Module 2: Functional Testing
Boundary Value Analysis
Testing Tools
o Static Testing Tools
o Dynamic Testing Tools
o Characteristics of Modern Tools.
Learning Outcomes:
Better understanding of functional and object oriented testing.
Acquiring knowledge for how to reduce the number of test cases.
Preparedness for skills used in various graph theory.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
William Perry: Effective Methods for Software Testing
Cem Kaner, Jack Falk, Nguyen Quoc: Testing Computer Software
Boris Beizer: Software Testing Techniques
Louise Tamres,: Software Testing
Boris Beizer: Black-Box Testing Techniques for Functional Testing of Software and
Systems,
Web Resources:
http://softwaretestingfundamentals.com/verification-vs-validation/
https://www.cs.drexel.edu/~jhk39/teaching/cs576su06/week1Readings/adrion.pdf
http://www.mathworks.in/verification-validation/
http://www.softwaretestingmentor.com/vv/verification-vs-validation.php
Course
Code
UIT-459
Course Title
Cr.
E-Governance
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of E-governance. The course
develops an insight towards the need and evolution of E-governance.It deals with the
various models of E-governance and the various strategies and infrastructure involved in
E-governance. It also gives the brief introduction of dataware housing and data mining .
Course Description:
Module 1: Introduction
E-Governance
o Needs of E-Governance
o Issues in E-Governance applications
o The Digital Divide
Evolution of E-Governance
o Its scope and content
o Present global trends of growth in E-Governance
o Other issues.
Module 2: Models of E-Governance
Introduction
Model of Digital Governance
o Broadcasting/ Wilder Dissemination Model
o Critical Flow Model
o Comparative Analysis Model
o Mobilization and Lobbying Model
o Interactive-service
o Model/Government-to-Citizen-to-Government Model (G2C2G)
o Evolution in E-Governance and Maturity Models
o Five Maturity Levels
o Characteristics of Maturity Levels
o Key areas
o Towards Good Governance through E-Governance Models
Module 3: E-Governance Infrastructure and Strategies
E-readiness
Digital System Infrastructure
o Legal Infrastructural Preparedness
o Institutional Infrastructural Preparedness
o Human Infrastructural Preparedness
o Technological Infrastructural Preparedness
o Evolutionary Stages in E-Governance
Module 4: Data Warehousing and Data Mining in Government
Introduction
National Data Warehouses
o Census Data
o Prices of Essential Commodities
Other areas for Data Warehousing and Data Mining
o Agriculture
o
o
o
o
o
Rural Development
Health, Planning
Education
Commerce and Trade
Other Sectors
Learning Outcomes:
Better understanding of E-governance, its needs and evolution.
Acquiring knowledge for data ware housing and data mining.
Preparedness for skills used in various methodology of E-governance
infrastructure and strategies.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
C.S.R. Prabhu: E-Governance: Concepts and Case Studies
Backus, Michiel:
Web Resources:
http://en.wikipedia.org/wiki/E-Governance
http://www.it.iitb.ac.in/~prathabk/egovernance/egov.html
http://timesofindia.indiatimes.com/topic/e-governance
Course
Code
UIT-461
Course Title
Cr.
Bioinformatics
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of bioinformatics. The course
gives the outline to proteins and the various molecular models. It tells us the importance
and dealing with the bioinformatics tools and gives the clear understanding of genomics.
Course Description:
Module 1: Introduction to Bioinformatics
Introduction
outline of proteins
o primary structure
o the 20 amino acids
o chemical structure & properties; chirality
o different types of side chain
o relevance to mutation
o size
o aliphatic/aromatic
o polarity
o charge
o hydrophobicity
disulphide bonds
molecular models
polypeptide geometry
o the folding chain
o nomenclature
o molecular graphics
o Structure evolution and mutation genetic information
o the triplet code
o DNA structure Synthesis of proteins
o cell biology background
o transcription
o RNA polymerase
o Introns
o Exons
o splicing translation
o ribosomes
o strat/stop codons,
o post-translational processing
Module 2: Computing evolution
Phylogenetic Analysis Sequence
based taxonomy
overview and assumptions from Multiple Alignment to phylogeny
NeighborJoining
Maximum Likelyhood Vs. Parsimony
o The molecular Clock, Computer Tools for patterns
o mapping and phylogenetic analysis
EMBL Database
SEQNET
Gen Bank
NLM ,Etc.
Sequence Databases and Sequence Analysis
Genomic
microarrays, proteomics
Pharmacogenomics
Development using computer tools for sequencing
o Projects
o PCR and restriction mapping practical
o theoretical problems in sequencing
o The challenges of whole genome sequencing
o web based tools for restriction mapping
o new technologies and new bioinformatics tools
Learning Outcomes:
Better understanding of bioinformatics tools.
Acquiring knowledge for genomics.
Computing evolution related to bioinformatics.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course
Code
UCS-462
Course Title
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of digital image processing. The
course develops an insight towards the image enhancement,color image
processing,image segmentation and compression. It deals with the object recognisition
,its representation and description
.
Course Description:
Module 1: Fundamentals
Introduction
o origin,
o areas of image processing
o steps in digital image processing
o Components of image processing system
o image sensing
o sampling and quantization
o Neighbouring Of pixels.
Image Enhancement and Restoration Enhancement
Spatial Filtering
Introduction to Fourier Transformation
Restoration
o A model of the Image Degradation/Restoration Process.
Module 2: Color Image Processing
Color fundamentals,models,
transformation and segmentation
Object Recognition
Preferred Reading:
Course Notes by the Instructor
Rafael C. Gonzalez, Richard E. Woods: Digital Image Processing
Web Resources:
http://en.wikipedia.org/wiki/Digital_image_processing
http://www.imageprocessingplace.com/DIP-3E/dip3e_main_page.htm
http://www.wolfram.com/solutions/industry/image-processing/
http://freevideolectures.com/Course/2316/Digital-Image-Processing-IITKharagpur
Course Code
UCS-463
Course Title
Distributed Operating System
L
4
T
0
P
0
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of distributed operating systems. The
course develops an insight towards the communication in distributed systems,synchronization
and process in distributed systems.It gives the complete overview regarding the distributed file
systems and the various case studies related to it.
Course Description:
Module 1: Introduction:
Introduction to Distributed System
Design issues
Communication in distributed system
Election algorithm
the Bully algorithm,
a Ring algorithm, Atomic Transactions
Learning Outcomes:
Better understanding of MACH and communication in MACH.
Acquiring knowledge for communication in distributed systems.
Preparedness for skills used in various methodology of distributed file systems.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Andrew S.Tanenbaum: Distributed Operating System
P.K. Sinha: Distributed operating system
Web Resources:
http://en.wikipedia.org/wiki/Distributed_operating_system
http://www.amazon.com/Distributed-Operating-Systems-AndrewTanenbaum/dp/0132199084
http://books.google.co.in/books/about/Distributed_Operating_Systems.htm
Course Code
UCS-464.
Course Title
Mobile Computing
L
4
T
0
P
0
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of mobile computing. The course
develops an insight towards the cellular architecture and the evolution of mobile systems.
It gives the complete overview of ad-hoc routing protocols and mobile transaction and
commerce.
Course Description:
Module 1: Introduction
Challenges in mobile computing
o coping with uncertainties
o resource poorness
o Bandwidth etc
Cellular architecture
co-channel interference
o frequency reuse
o capacity increase by the cell splitting.
Evolution of mobile system
Cellular architecture
o co-channel interference
Mobility
Handoff
o types of handoffs
location management
HLR-VLR
hierarchical scheme
broadcast disks
Preferred Reading:
Course Notes by the Instructor
Dejan Milojicic, Frederick Douglis, Richard Wheeler: Mobility: Processes,
computers and Agents
Ivan Stojmenovic: Handbook of Wireless networks & Mobile Computing
Web Resources:
http://en.wikipedia.org/wiki/Mobile_computing
http://domino.research.ibm.com/comm/research.nsf/pages/r.mobile.htm
http://bnrg.eecs.berkeley.edu/~randy/Courses/CS294.S96/CS294-7.S96.html
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=7755
Course Code
UCS-465
Course Title
Graph Theory & Combinations
L
4
T
0
P
0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of graph theory . The course
develops an insight towards the basic and advanced features of graphs, the various
algorithms related to graph theory. It gives in detail the concept of Combinatorics.
Course Description:
Module 1: Introduction
Graphs
o Sub graphs
o some basic properties
o various example of graphs & their sub graphs
o walks, path & circuits
o connected graphs
o disconnected graphs and component
o Euler graphs
o various operation on graphs
o Hamiltonian paths and circuits
o the traveling sales man problem
edge coloring
planar and non- planar graphs
Module 4: Combinatorics
Basic combination numbers
Cr.
4.0
recurrence relations
generating functions
Multimonial
counting principals
Polyas theorem
inclusion and exclusion principle
block design and error correcting codes
Hadamard matrices,
finite geometry.
Learning Outcomes:
Better understanding of graph theory and combinations.
Acquiring knowledge for graph algorithms.
Preparedness for skills used in various basic and advanced features of graph
theory.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Deo N: Graph theory and applications
D.B West: Introduction of graph theory
S.A. Choudum A: First course in Graph Theory
Web Resources:
http://en.wikipedia.org/wiki/Combinatorics
http://www.broadinstitute.org/chembio/lab_schreiber/pubs/pdffiles/342.pdf
http://cltquestionpaper4u.blogspot.in/2011/09/graph-theory-and-combinations
http://math.stackexchange.com/questions/30892/network-flow-as-a-linearcombination
Course Code
UCS-466
Course Title
Advanced Database System
L
4
T
0
P
0
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of advanced database systems.The
course develops an insight towards the distributed database,query optimization. It gives in detail
the various mechanism for concurrency control ,authorization and protection.
Course Description:
Module 1: Distributed databases features
Distributed database management systems
o Review of Databases and computer networks
o Levels of distribution transparency
o reference Architecture
o types of data fragmentation
o distributed transparency for read only
o Applications and update applications
o distributed database access primitives
o integrity constraints
Module 2: Distributed database design
A frame work for distributed database design
distributed deadlocks
Learning Outcomes:
Better understanding of query optimization.
Acquiring knowledge for reliability and protection of database.
Preparedness for skills used in various methodology of distributed database design.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Ceri and Pelagatti: Distributed databases principles and systems
Raghuramakrishnan: Database management system
Web Resources:
http://books.google.co.in/books/about/Advanced_Database_Systems.html?id=
http://www.vrissue.com/portfolio/pdf/Advanced_Database_Systems.pdf
http://www.cs.cornell.edu/courses/cs632/2001sp/
http://www.database-systems.com/
Course
Code
UCS-467
Course Title
Cr.
Parallel Computing
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of parallel computing.. The
course develops an insight towards the scalability and the parallel programming ,the
various processes ,issues in parallelism.It also gives the complete overview regarding
the interconnection networks,cache coherence protocols.
Course Description:
Module 1: SCALABILITY AND CLUSTERING
Evolution of Computer Architecture
Dimensions of Scalability
SharedMemoryProgramming.
MESSAGE PASSING PROGRAMMING:
Message Passing Paradigm
ParallelVirtualMachine.
Learning Outcomes:
Better understanding of parallelism and the interconnection networks.
Acquiring knowledge for parallel programming.
Preparedness for skills used in various methodology of system interconnects
and the enabling technologies.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Kai Hwang and Zhi.Wei Xu: Scalable Parallel Computing
Michael J. Quinn: Parallel Computing Theory and Practice
Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar: Introduction to
Parallel Computing
Web Resources:
http://en.wikipedia.org/wiki/Parallel_computing
http://www.journals.elsevier.com/parallel-computing/
http://www.springer.com/computer/swe/book/978-3-642-04817-3
http://www-users.cs.umn.edu/~karypis/parbook/
Course
Code
UIT-352
Course Title
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of modeling and simulation. The
course develops an insight towards the simulation of Queuing systems.It gives the
complete overview regarding the simulation languages and the simulation processes
related to it.
Course Description:
Module 1: Definition of systems
Types of system
continuous and discrete modeling process and definition of a model.
Common type of mathematical models used for engineering and nonengineering system (such as differential and partial differential equation
models.
Use of data base & AI techniques in the area of modeling and simulation.
Learning Outcomes:
Better understanding of simulation language.
Acquiring knowledge for simulation processes.
Preparedness for skills used in various design and validation of simulation
experiments.
Assessment Model:
Best three of two quizzes and two assignments- 20%
Preferred Reading:
Course Notes by the Instructor
Deo, Narsing: System Simulation with Digital Computers
Shridhar Bhai Trivedi, Kishore: Probability & Statistics with reliability Queuing,
Computer science Application
Payer, T.A: Introduction to System Simulation
Web Resources:
http://en.wikipedia.org/wiki/Modeling_and_simulation
http://home.ubalt.edu/ntsbarsh/simulation/sim.htm
http://www.systems-thinking.org/modsim/modsim.htm
http://www.intechopen.com/books/modelling_and_simulation
Course
Code
UCS-469
Course Title
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of mobile ad hoc networks .The
course develops an insight towards the MANET ,various applications of MANET. It deals
with the link reversal routing and the dynamic source routing protocols and mobile IP.
Course Description:
Module 1: Introductory concepts
Different models of operation
mobile IP
Multicast routing with DSR.
Module 3: Ad Hoc On-Demand Distance-Vector protocol
Properties
unicast route establishment
Broadcast.
Optimizations
Enhancements
Module 4: Link Reversal Routing
Gafni-Bertsekas algorithm
Preferred Reading:
Course Notes by the Instructor
Dejan Milojicic, Frederick Douglis, Richard Wheeler: Mobility: Processes,
computers and Agents
Ivan Stojmenovic: Handbook of Wireless networks & Mobile Computing
Yi-Bing Lin & Imrich Chlamtac: Wireless and Mobile Networks architectures
Web Resources:
http://en.wikipedia.org/wiki/Mobile_ad_hoc_network
http://www.antd.nist.gov/wahn_mahn.shtml
http://www.cse.iitb.ac.in/~sri/talks/manet.pdf
http://www.intechopen.com/books/mobile-ad-hoc-networks-applications
Course Code
UCS-470
Course Title
Professional Issues in IT
L
4
T
0
P
0
Cr.
4.0
Prerequisites: Nil
Objective:
The intent of the course is to build upon understanding of professional issues in IT.. The course
develops an insight towards the legal,ethical and social issues. It deals with the multimedia
,protection of databases. It gives the complete overview regarding the copyrights and the patents,
cyber crimes and the other professional issues.
Course Description:
Module 1: Legal Issues
Introduction to legal concepts
Basic outline of Criminal and Civil Laws
o Concepts relating to laws and Contract and Commercial Law
o Substantive legal issues
o Intellectual property issues
Cyber crime, Data protection principles
Maintenance Agreements
legislative action.
Module 3: Other Professional issues
Duties of a professional
o Duties to client
o Duties to Employer
o Duties to Profession
o Duties to society
o Accountability for quality
implications arising from the Draft Computer Crimes Act under the Unit-IV.
Module 4: Profession
Characteristics of Professions,
o Integrity and Honesty
o Competence, Professional development
o Judgment
o knowledge of law
o relations, standards, independence
o Acting with responsibility, Professional skill
o comply with law
o Confidentiality
o due care
o Contribute towards advancements of human welfare
o Public interest
o Public awareness
o Basic Human rights
o Ethics, and the Internet
o Netiquette and Policy approaches
o Professional relationships
o Are computer professionals Professionals, Conflicting responsibilities and
misconduct
o Codes of Ethics.
Learning Outcomes:
Better understanding of legal ,social, ethical issues.
Acquiring knowledge for copyrights, patents ,trademarks and industrial property.
Assessment Model:
Best three of two quizzes and two assignments- 20%