M C A First semester Paper 1

navybeansvietnameseΔίκτυα και Επικοινωνίες

24 Οκτ 2013 (πριν από 3 χρόνια και 9 μήνες)

138 εμφανίσεις

M C A


First semester


Paper 1


Data structures with “C”




Lectures: 4 periods / week






Practicals : 4 periods /
week

One paper : 100 marks / 3 hour duration



Practical + test : 25 marks



1.

Introduction to problem solving :

Flow charts,

Tracing flow charts, problem solving methods, need for computer
languags, sample programs written in C 2.5 lectures.


2.

C Laanguage premilinaries:

C character set, Identifies and keywords, Data Types, Declarati
ons, Expressions,

Statements and symbolic constants.

3.

Input
-
Output :


getchar, putchar, scans, prints, gets, puts, functions.


4.

Pre
-

processor commands :



#include, # define, #idef.


5.

Preparing and running a complete C program.


2+3+4+5 = 2.5.lectures.


6.

Operations and expressions :


Arithmatic, unary, Logical, bitwise, assignment and confidential operators.


7.

Control
statements:

while, do while, for statements, nested loops. If else, switch, break, continue, and
goto statements, comma operators. 6+7 = 5 lectures.


8.

Storage types :


automatic, external and static variables.




9.

Functions :

Defining and accessing, passing arguments, Function prototypes, Recursion, Library
functions, Static Functions. 8+9 = 5 lectures.


10.

Arrays :


Defining and processing, passing arrays to a function, multi
dimensional arrays.


11.

Strings :

Defining and operations on strings. 10+11= 5 lectures


12.

Pointers:


Declarations, passing pointersto a function, operations on pointers, pointer


Arithmetic, pointers and arrays. Arr
ays of pointers. 5 lectures


13.

Structures :


Defining and processing , passing to a function, unions. 7.5 lectures


14.

Linear Data Structures :


Stacks


LIFO Structures, create, pop push, delete stack

5 lectures


Queues


FIFO Structures, priority queues 5 lectures


Lists

Linked Lists, circular lists, header lists, doubly linked list. 7.5 lectures


Term work/ Practicals ; Each candidate will submit a journal in whi
ch at least 10 practicals
assignments based on the above syllabus along with the flow chart, program listing and the
internal test paper. tEst is graded for 10 marks and practicals are graded for 15 marks.


References :


1.

“How to solve it by computer” : Dro
mey, PHI.

2.

“An Introduction to data structures with applications”, Jean Paul Trembly and Paul
Sorenson, (2
nd

edition), 1984.

3.

“Schaum’s outline of Theory and problems of programming with C” : Gottfried.

4.

“The C programming Language”, Kerninghan and Ritchie.

5.


Programming in ANSI C”: Ramkumar Agarwal.

























Paper 2


Computer concepts


Lectures : 4 periods / week Practicals : 4 periods/ week

One paper :100 marks / 3 hour duration

Practical + test : 25 marks.


1. Information concepts & processing:
-



Evolution of information processing,


Data as resource,


Language & Communication,


Range of application like scientific, business etc.


2.
Elements of a computer processing system:
-


hardware & software components like CPU,


I/O

devices,


Storage devices, VDU etc.


Software components like system software, application software.


Basic architecture of a computer system.


3
. Types of computer : Mini, Super, Mainframe, Workstation, Peersonal,


Multimedia, .Super Computer. 1+2+3 = &.5 lectures.


4. Number system : Decimal, Binary, Octal, Hexadecimal , 1’s and 2’s Complements,


floating point representation,


Character Codes


ASCII, EBCDIC,

5. Programming languages:
-


Need of programming language,


Classification of language like high level & low level,


Machine language & assembly language,



Higher level language with examples,


Generations of programming language with examples. 4 + 5 = 5 lectures

6. System software :


Overview of all system software : operating system,


I/O Manager,


Assembler, Compiler,

Linker, Loader. 7.5 lectures


7. Operating system :
-


Overview Different roles played by O.S,


Memory management, I/O management & resource mangement,


Scheduling, Basis O.S. architecture,



Introduction to popular O.S. like windows, Dos & Unix,


Typical commands of each O.S. 7.5 lectures


8. Introduction to networking:
-


Need for networking,


Issues involved in networki
ng,


Different networking models like LAN, WAN, client


server, distributed etc.,
n Internal and internet working with its usage.


9. Introduction to Microprocessor,


Evolution, Archi
tecture,


Memory Structure,


Comparative study of Microprocessor Chips.


10. Office Tools : Word , Excel softwares


Word : Structures of a Document, Common Commands, Styles, Cross Referens.


Excel : Concept of Spreadsheet, u
se of financial and statical functions,sorting and


Searching database, linking workbooks, formula between workbooks 5 lectures


Term work /Practicals : Each candidate will submit a journal in which at least 10

practical assignments based on the a
bove syllabus and the internal test paper. Test is

graded for 10 marks and Practicals are graded for 15 marks.



Books recommended :
-


1.

“Computer fundamentals” Rajaraman v.

2.

“Computer fundamentals” P.K.Sinha.

3.

“Inside P.C” Peter Nortron

4.

“Fundamentals of
Information Technology” Alexis Leon, Mathews Leon, Vikas

Publishing.


Paper 3.


Computer organization and architecture


Lectures: 4 periods/Week Tutorials : 2 periods/ week

One paper : 100 marks / 3 h
our duration Assignment + test: 25 marks


1. Boolean Algebra, K
-

Maps, Combinational circuits, Flip
-
flops ( J
-
K, S_R, D),


Registers (shift, parallel), Counters (ripple, Synchronous), Multiplexers and


Decoders.

7.5 Lectures


2.

Principles of Computer Design


Software, hardware interaction layers in computer architecture, Organisation and


Architecture, Structure & Function. Design Levels


Gate, Register, Processor


Instruction Sets: Characteristics & Functions, Addressing Modes & Formats


Instruction cycle and execution cycle. System Buses, Interconnection Structures


including bus Interconnection.


3.

Grey Code, Excess
-
3 code, Error detecting and correcting codes 2+3=10 lectures


4.

Control unit


Data path and control path design, Microprogramming vs hardwired


control,RISC vs CISC, Pipelining in CPU design, Superscalar processor.


Overview of Parallel Proc
essing





10 lectures


5.

Memory system


Memory Hierachy, Memory technologies
-

Memory array organization, Memory

Device characteristics, Random

access memories, Serial access memories,
SRAM, DRAM.


6.

High Speed memories :
-


Int
erleaving, Cache, Associative memory, Advanced DRAM Organisation


7.

External Memory:


Magnetic Disk, RAID, Optical Memory.


5+6+7 = 10 lectures

8.

Input
-

output devices and characteristics.


Input
-
output processing, I/O Modules, Programmed I/O, Interrupt

Driven I/O,


DMA, I/O channels and Processors.





7.5 lectures

9.

erformance evaluation


SPEC marks, Transaction processing benchmarks.


5 lectures


Term work/Assignment: Each candidate will submit a journal in which at least 10
assignments b
ased on the above syllabus and the internal test paper. Test will be graded
for 10 marks and assignments will be graded for 15 marks.


References books:

1. “Computer Organisation and Architecture”, Stallings, W Prentice Hall of India,


New Delhi


2.

“Computer Organisation and Architecture”, Hayes P.John Mc GrawHill


International Editions.


3.

“Computer System and Architecture”, Mano, M. Prentice Hall of India,

4.

“Computer organization and Design”. Pal Chaudhuri Prentice Hall of India

5.

“Introduction to Digital Computer Design”, Rajaraman V. and Radhakrishnan T


Prentice Hall of India.




Paper 4


Discrete Mathematics


Lectures : 4 periods/week





Tutorial : 2 periods/week

One paper : 100 marks/3 hour duration



Assignments + tes
t: 25 marks



1.

Propositions and logical operations


Notation, Connections, Normal forms, Truth Tables


Equivalence and Implications,


Theory of inference for statement calculus, Predicate calculus


Rules of Logic


Mathematical Induction and Quantifiers




10 lectures


2.

Sets, Relations and Digraphs


Review of set concepts


Relations and digraphs


Properties of relations


Equivalence of relations


Computer representation of relations and digraphs


Manipulation of relations


Partially Ordered Sets (Po sets
)





10 lectures


3.

Graph theory:



Definition, paths, circuits, reachability, connectedness.


Matrix representations of graphs, trees, spanning trees


List structures and graphs, PERT related techniques


Transitive closure, Warshall’s Algorit
hms


Eularian and Hamiltonian graphs


Storage representations and graphs 15 lectures


4.

Groups and applications :


Monoids, semigroups


Products and quotients of algebraic structures


Isomorphism, homomorp
hism, automorphism


Normal subgroups, codes and group codes 7.5 lectures


6

Classification of Language : Overview of Formal Languages:


representation of regular languages and grammars,


finite state machines.

7.5 lectures





Term work/ Assignment: Each candidate will submit a journal in which at least10

Assiggnments based on the above syllabus and the internal test paper. Test will be graded for
10 m
arks and assignments graded for 15 marks.


Books:


1.”Discrete Mathematical Structures”: Tremblay and Manohar, McGraw Hill

2.“Discrete Mathematical Structures”: Kolman,Busby and Ross,


Printice Hall

India, Edition 3.

3.“Elements of Discrete Stru
ctures” : C.L.Liu


Paper5


Accounting and managerial Economics
.


Lectures :4 Periods/week

One paper:100 marks / 3hour duration Assignments + test : 25 marks


1.

.Accounting process and principles, financial, cost and manage
ment accounting 2.5
lectures.


2.

Elements of bookkeeping,Journal,cash and bankbook, Bank reconciliation
statement,Ledger,trial balance, profit and loss accounts, final accounts of Proprietary
and partnership concerns and Balance sheet.

17.5 lectrures


3.

Cost accounting
-

Objectives, elements of cost, understanding of the different methods
of costing.


4.

Budgeting
-

budgets, purpose, budgetary control, preparation of budgets, master budget,
fixed and flexib
le budgeting. 3+4=7.5 lectures


5.

Introduction to Managerial Economics


Nature and Scope of Managerial Economics,
Economic Theory and Managerial Economics, Managerial Economist
-
Role and
Responsibilities.


6.

Demand


law of demand, elasticity of demand , supply function, elasticity of supply,
market equilibrium.


7.

Demand forecasting


survey methods, evaluation of forecast accuracy



5+6+7=12.5 lectures.


8 Cost
-

output relationship. Economies and Diseconomies of scale. Cost control and


cost reduction. Break


even analysis. 5 lectu
res.



9. Market structures


perfect and imperfect competition, Monopoly, Oligopoly,


Monopolistic Competition, Price descrimination, Price and output Decisions under


Different market structures. Government intervention in pricing.

7.5 lectures


Term work/ Assignment Each candidate will submit a journal in which at least assignments
based on the above syllabus and the internal test paper. Test regarded for 10 marks and
assignments graded for 15 marks.



Reference books :


1.

“Manage
rial Economics” Varshney, Maheshwari, Sultan Chand,

2.

“Managerial Eeconomics” Dean Joel, PHI, 2001.

3.

“Managerial Economics” d.n.Dwiwedi Vikas Publishing House

4.

“ Book keeping and Accountancy” Choudhari, Chopde

5.

“Cost Accounting “ Choudhari, Chopde


6.

“Managerial Economics:” Naylor,Vernon, Wertz

7.

“Management Accounting Principals and Practice” : M.. A. Sahaf




















SEMESTER II


Paper 1


Advance
d Data and file Structures


Lectures : 4 periods / week Practicals : 4 periods / week.

One paper : 100 marks / 3 hour duration practical + test = 25 marks


1.

Non

linear data stru
ctures

General Trees, Operations, Trees traversals

Binary Trees, Operations on binary trees,

Conversion of a general tree to binary,

Applications of trees, Heaps

Graphs
-

multilink structures, representations

Graph traversals

Applications of graphs

Spanni
ng trees 7.5 lectures


2. Sorting


Growth of function,
-
‘O’ notation,


Complexity of algorithm, Classificatioin,


Internal sorting


Insertion so
rt


Selection sort


Shell sort


Tree sort


Selection sort


Bubble sort


Quick sort


Heap sort


Distributive


radix sort



External sorting


Multi way merge


External Radix Sort

10 lectures

3. Searching


Sequential search


Binary search



Search trees traversals


Binary trees


Threaded binary search trees



Inserting and deleting n
odes in a binary search tree


Balancing binary search tree


Height balanced(AVL) tree: Concept and construction.


Weight balanced (BB) trees.

Hashing Techniques


Hash function


Address calculation techniques, common hashing functions.



Collision resolution.


Linear probing,Quadratic


Double hashing.


Bucket addressing.


Deletion and rehashing. 12.5 lectures.


4.File Structures


Concept of record.


File

Operations : Create, update and delete


File systems organization :Sequential, Relative, Indexed and Random access mode


Sequential organization and access.


Relative file organization


Addressing techniques


Direct mapping techniques : Absolute, re
lative and indexed sequential files(ISAM)


Concept of index


Levels of index

Overflow Handling. 10 lectures


5. Indexed structures


Binary search trees as indexes


m
-
w
ay search tree: insertion, deletion, performance


B
-
Trees
-
searching, insertion, deletion, performance.


Overview of B*
-

Trees and B+
-
Trees



Random files,


Multi key files Organization, multikey access, inverted file organization.


Alternate key I
SAM.


Comparision and trade
-
off.


File design considerations. 10 lectures


Term work / Practicals : Each canadidate will submit a journal in which at least 10

practical assignments based on the above syllabus along with the flow chart and program
listing will be submitted with the internal test paper. Test graded for 10 marks and
practicals graded for 15 m
arks.


Refrences:

1.”Introduction to data management and file design”
-
R.Kennith Walter,1986

2.”An introduction to data structures with applications”
-
Trembley and Manohar.

3. “Data Structure


A Pseudocode Approach with C “__Richard F. Gilberg, Bechrouz


A. Forouzan (Thomson Learning)

4. “Data Structure using C” AM Tanenbaum, Y Langsam and MJ Augenstein,


Prentice
-

Hall, India, 1991.


5. “Data Structure and Program Design in C”


RL Kruse, BP Leung and CL Tondo,


Prentice Hall, 199
1.

6. “Data Structures and Algorithm Analysis in C”


Weiss, Mark Allen, Addison


Wesley



Paper 2

Operating System


Lectures : 4 periods / week Practicals : 4 periods/ week

One paper : 100 mar
ks / 3 hour duration Practical + test : 25 marks


1. Fundementals of operating systems
-

Os Services and componments, multitasking,


multiprogramming, timesharing, spooling.


2. Process and thread management


concept o
f process and threads, process states,


process management, context switching, interaction between process and OS


multithreading. 1+ 2 = 10 lectures


3. Concurrency control


concu
rrency and race conditions, mutual exclusion


requirements, software and hardware solutions, semaphores, monitors, classical IPC


problems and solutions, deadlocks


chracterization, detection, recovery, avoidance


and prevention. 10 lectures


4. Memory management


memory partitioning, swapping, paging, segmentation,


virtual memory, page replacement algorithms.

10 lectures



5. I/O Systems
-

Principles of I/O Hardware: I/O devices, devices controllers, direct


memory access.


6. Principles of I/O Software: Goals, Interrupt handlers, device drivers, device


indep
endent I/O software.



Disk : Disk hardware, scheduling algorithms. Error handling, track
-

at
-
a
-
time


Caching.



RAM Disks



Clocks : clock hardware, memory mapped terminals, I/O software.


Terminals : Terminal hardware, me
mory mapped terminals, I /O software.


Interrupt handlers, device drivers, device independent software subsystem.


5+6=10 lectures


7. File systems
-
file s
torage, access methods and free space management


8. Security


Need and strategies for security in stand alone and networked systems


concept of access control list and capabilities , password and encryption schemes.


9 Case studies : MS, DOS
, MS WINDOWS, LINUX (UNIX) operating system.


7+8+9 = 110 lectures.


Term work practicals; Each candidate will submit a journal in which at least 10

Practical assign
ments based on the above syllabus along with the flow chart and program
listing will be submitted with the internal test paper. Test graded for 10 marks and
practicals graded for 15 marks.



Relevant Books


1.

Operating Systems Concepts (5
th

Ed) by Siberchatz

and Galvin, Wiley, 2000.

2.

Operating systems(4thEd)


Internals and Design Principles by William Stallings,
Prentice Hall, 2000.

3.

Computer Organization and Architecture (4
th

Ed) by William Stallings, Prentice Hall
India, 1996.

4.

Modern Operating Systems by And
rew S Tanenbaum, Prentice Hall India, 1992.


Paper 3

Systems Analysis, Design and

Implementation


Lectures : 4 periods/week Tutorials: 2 periods/week

One paper : 100 marks/ 3 hour duration

Assignments + test: 25 marks


1.

Overview of System Analysis and design
requirements of a good systems Analyst.


2.5 lect
ures.


2. System Concepts and Models
: SDLC, Prototyping, Iterative Models, Spiral Model,


RAD Model, Formal Methods Model, 4GL Model, their advantages and


Disadvantages.

7.5 lectures


3. System Analysis
: Requirements Determination techniques. Information requirements
Analysis: processing modeling with physical and logical data flow diagrams, data
dictionaries, data modeling with entity relation
ship diagrams; 15 lectures


4. Developing a proposal

: Feasibility study and cost estimation. Identification of list of
deliverables.


5. System Design:

System structure charts, Data structure diagrams, Data Access
diagrams, Warnier
Orr Diagrams, HIPO charts, design of input and control, design of output
and control, file design/database design, process design, user inter face design,

prototyping, software constructions.

Test plans, Structured walk throughs, and design and code rev
iews. 15 lectures


Use of CASE tools in the analysis, Hardware/software selection, Make V/s Buy decision


5 lectures

6. Documentatio
n:

Importance, Types of documentation, Security and disaster planning and
management.








2.5 lectures


Term work/Assignments; Each candidate will submit a journal in which assignments based
on the above syllabus and the internal test paper. Tes
t graded for 10 marks and assignments
graded for 15 marks.


Books:

1.

“Systems Analysis and Design”: Howryskiewycz, PHI

2.

“Analysis and Design of Information Systems”: Senn, TMH

3.

“System Analysis and Design Methods”: Whitten, Bentley

4.

“System An
alysis and Design”: Award

5.

“Analysis and Design of Information Systems”: Rajaraman,PHI

Paper 4

Combinatories and Probability


Lectures : 4 periods/week



Tutorials : 2 periods/week

One paper : 100 marks/3 hour duration Assignme
nts + test: 25 marks


Combinatories:


1.

Recurrence relations, Towers of Hanoi, Iterations, Homogenous linear equations


with constant coefficients, Difference tables and finite order differences, line in a


plane in general position.













10 lectures

2.

Binomial coefficients, Basic identities including Pascal identity and triangle,


binomial theorem, counting objects without and with repetitions, sum of product


of binomial coefficients, factorial expansions
, upper summation, Vander Monde


identies. Applications to sorting.


3. Inclusion


exclusion principals, elementary application to Sieve formulae,


derangments , counting permutations with restricted positions, elementary idea of


ge
nerating functions. 5 lectures.


Probability:


1. Sample space, Events, Axioms, Conditional probability. Bays rule


Random variables : Discrete and continuous. Distribution
and density functions.



Marginal And conditional distributions.



Stochastic independence.














7.5 lectures.

2.

Discrete Distribution: (Bernoulli, Binomial, Poisson, Geometric, Uniform)


Continuous Distributions: (Normal, Exponential, Rect
angular) 10 lectures.

3.

Expectation: Expectation of a function. Conditional expectation and variance


Moment


Generating function. Various applications including hashing


7.5
lectures


Term work/Assignments: Each candidate will submit a journa
l in which assignments based
on the above syllabus and the internal test paper. Test graded for 10 marks and
assignments graded for 15 marks.


References:


1.

“Concrete Mathematics: a foundation for Computer Science”, R.L. Graham, D.E.


Knuth and O. Pa
tashmik, Pearson Education Asian Low Price Asian Edition, 2002.

2.

“Probability and its computer applications”: Kishore Trivedi, PHI,

3.

“Elements of Discrete Mathematics”: Liu C.L.,TMH

4.

“Discete Mathmatics”: Norman L. Biggs, Clarendon Press, Oxford








Paper 5

Principles and Practices of Management


Lectures : 4 periods/week




One paper : 100 marks/3 hour duration Assignments + test: 25 marks


1.

Development of management thought : Contribution of Taylor, Fayol, Elt
on Mayo,


System, Contingency approaches to management. Management functions and


skills, Nature of planning, Mission and objectives, Management by objectives,


Strategic Planning, Strategic choices, Policies, Decision making proces
s.


12.5 lectures

2.

Organizational Structures : Forms of organization structure, Line and


staff, Functional, Pro
duct, Matrix, Flat and vertical structures, Authority


relationships 5 lectures


3.

HRD : Staffing, Employee Recruitment, selection, Staff training and



Developmnent, Job description, performance appraisal, Mortivation, Maslow’s


Herzberg’s Mc Clelland’s theories, Theory x and Y, Incentive system, Situational


Leadersh

ip theories.






10 lectures


4.

Mar
keting: Understanding the concept of marketing mix, Product policy, Now


product development, Product life cycle and new product development, Channels


of distribution, Pricing, Advertising and product promotion policies, Marketing


res
earch









7.5 lectures


5.

Manufacturing: Production planning and control, Types of manufacturing Systems,


Work study, Material management. Concept of Project time calculation through


PERT/CPM. Introduction to the concept of Inventory
management, Introduction to


the concepts of Total Quality management, quality circles standardization.











7.5 lectures

6.

Finance function, Financial control, Understanding about tools of financial

analysis, Cash flow, fund fl
ow analysis Ratio analysis, Understanding the concept of
working capital, Planning of working capital. 5 lectures


7.

International Marketing: Different methods of entering, Global Marketing



strategies, Multinational

companies 2.5 lectures


Term work/Assignments: Each candidate will submit a journal in which assignments based
on the above syllabus and the internal test paper. Test graded for 10 marks and
assignments g
raded for 15 marks.


Books:

1.

“Principles and Practice of Management” : L.M. Prasad

2.

“Marketing Management”: V.S. Ramaswamy, S. Namakumari

3.

“Production operations management”. Dr. BS. Goyal

4.

“Essentials of management”: Koontz O’Dommell, Weihri
ch.

5.

“Financial Management”: Khan and Jain.

6.

“International Marketing”: Francis Cherunilam


SEMESTER III


PAPER I

OBJECT ORIENTED PROGRAMMING WITH C++


Lectures: 3hou
rs/ week






Practicals :3 hours / week

One paper : 100 marks / 3 hour
s duration



Practical + test : 25 marks


1.Introduction

What is object
-
oriented programming? Why Do We Need Object
-
Oriented


Programming Characteristics Of Object
-
Oriented languages.C++ And C


2.C++ Programming Basics
,
Basics Program Construction Ou
tput Using sign cout ,



Directives, Comments, Integer Variables, Character Variables, Input with cin, Floating



P
oint. Type bool. The set

Manipulator variable. Type summary Type Conversions.


Arithmetic Operators, library function.

(1+2=4 Hrs.)


3.Loop and Decisions. Relational Operators, Loop Decisions Logical Operators Others


Control Statements.


4.Structure Structures Enumerations
( 3+4 =3Hrs)


5. Functions


Simple functions. Passing arguments. To Functions, Returning Values from


Fractions, Reference Arguments, Overloaded Functions, Recursion in Line


Functions, Default Arguments, Scope And Storage Class, Return
ing by Reference


(4 Hrs)


6. Object and Classes.


Making sense of core object concepts (Eencapsulation, Abstraction Polymorphism .



Classes Massages. Associations Interfaces )



Implementation of class in C
----

C
----

Objects As physical object C

Objext As Data


Types.


Constructor, Object as Function Arguments. The Defult Copy Constructor


Retuerning Object

from Function Structures And Classes. Classes Object And


Memory. Stale Class Data. Const Data. Const And Classes. (6 Hrs)


7. Arrays and string


Array Fundementals Arry As Class Member Data. Arrays Of Object S
tring. The


Standard of String Class. (3Hrs)


8. Operator Overloading. Binary Operators. Data Conversion Pitfalls Of Operators


Overloading and Conversion. Key

words I:
\

Aplicit and Mutable.



(4 Hrs)

9. Inheritance


Concepts of Inheritance. Derived class and Base Class, Derived Cl
ass Cconstructors


Overiding member functions. Inheritance in the English Distance Class. Class


Hierarchies . Inheritance and Graphics Shapes. Public and Private Inheritance. Levels


Of Inheritanc. Multipe Inheritance. Ambiguity in Multi
ply Inheritance. Aggregation ;


Classes with in Classes. Inheritance and Program Development.



(4 Hrs)

10. Pointers


A
ddresses and pointers. The Address of Operator & Pointers And Arrays. Pointers


And Function. Pointers and C Type String. Memmory Management New and


Delete, Pointers to Objects. Debugging Pointers.

(4Hrs)


11. Virtual Function


Virtual Function Friend Function Static Function. Assignment and Copy


Initialization. The This Pointer. Dynamic Type Information. (4Hrs)


12. Stream And Files


Stream C
lasses. Stream Errors. Disk File I/O With Streams. File Pointers. Error


Handling In File I /O. File I/O with Member Functions. Overloading The


Extraction and Insertion Operators. Memory as a Stream Object. Command line


Argument
s and Printer Out Put. (2 Hrs)


13. Multiple Programs


Reason for Multiple Programs , Programs Crating A Multiple Program. Inter
-
File


Communication. A very Long Number Cl
ass. (2Hrs)


14. Templates and Exceptions


Function Templates Class Templates Exceptions (2Hrs)


15. The Standard Templates Library.


Introduction Alg
orithms, Sequence Containers Iterators. Specialized Iterators


Associative Containers, Storing User
-
Defined Object. Function Objects.



(6 Hrs)


Reference Books


1, Object Oriented Programming in
-
C

By Robert Jafore Techmedia Publication


2. The Complete Reference c
-

-

By Herbert Sehlidt Tata Megraw
-
hill publication



Practical For C ++




Programming exercises and project using C

programming languages to study


various features of the languages. Stress to be laid on writing well structured modular


and readable programs accompanied by good documentation.



The topic wise a
ssignments are as follows.


1. Loop Constructs.


Printing of various kinds of geometric Pattern for eg. Triangle. Mirror Image


of a Triangle Right Angled Triangle.

2.

Use of Control Flow Statements.


Framing Menu Dri
ving Programs.

3. Structures


Card Game Example.

4. Function Blocks


Passing of call by Values to do a required task.


Non
-

Parameterized constructs.


Functions retiring values back to the call
ing procedure.


Passing an array to a function (in dimension array)


Handing default Reference arguments.



Handling Inline and overloaded function

5.
Objects and Classes


Creaming UDT using classes and object.

6. Arrays an
d String.


Insertion, Deletion, Reversal Sorting of elements into a single dimensional array.


Implementing the application of Matrix, Square using multidimensional arrays.


Using simple array of characters as well as c++ str
ing class, try Reversal of


String. Palindrome, Replacement of a sub
-
string with another string. Counting of


words. Line And characters. sorting the string in a String Array.


Create as bank account class which maintains the inf
ormation of joint holders as


array of objects.


7.Operator Overloading


Create class called Date and provide some function like last date. Which should


give one day before the current date.


String concatenations usin
g+’


8. Inheritance


Implement to bring out inheritance and importance of reuse in Company


Organization Bank, Animal Kingdom, Graphic Figures.


9.Pointers


Linked List.


Parsing Example.


10.Virtual Functions


Improvisation of Pars
ing Example.


Draw graphic Figures using user input.


Create a virtual Withdraw Function for Bill Accounts.


11.Streams and Files

Using Files in Different Modes: Reading, Appending, Writing, Binary Moderate.

Using all the string


relate
d function on the file opened for reading and writing.

Copying I file to the other.


12. Multifile Programs

High
-
Rise Elevator Simulation.

13.Templates and Exceptions

Exception Handing

14.The Standard Template Library

Frequency table

creation for new text file.

Make an array and set into a Vector.

Create a multiset, which automatically sorts person object stored by pointers.












PAPER II


DATA BASE MANAGEMENT SYSTEMS


Lectures : 3 hours/week P
ractical:3 Hrs / week

One paper:100 Marks/3 hour duration Practical + test :25 mark


1. Overview: Overview of Database Management Systems: Limitation of Data


Processing environment. Database approach . Data Independence. Three lev
els of


Abstraction. Data models. DBMS Structure. People who with Database.


2.

Entity Relation Model: Entity, attributes, keys, relation. Cardinality, participation,


Weak entities, ER Diagram, Generalization, Specialization and aggregati
on.


Conceptual design with ER Model.
Entity versus Attribute. Entity versus,


Relationship Binary Versus Ternary relationship. Aggregate versus Ternary


relationship. (
4 Hours)


3.

Relational Model: Introduction to relational model, Creating and modifying relations


using SQL . Integrity constraints over relation, Logical database design ER to


relational Introductions to views

(5 Hours)




4. Overview of conventional data Models. Hierarchical. Net work models











2 hours


5. Query languages: Relational Algebra. Overview of Relational Calculus and QBE











5 hours

6.

SQL: Data definition commands. Constra
ints. Views Data Manipulation commands


Queries.


SELECT
-
FROM_WHERE.
Aggregate queries. NULL values. Outer JOINS.
Nested


queries



Correlated queries, Embedded SQL. Dynamic SQL. Triggers Assertions. 6 hours

7. One Database

application development. 3 hours

8 .Overview of storage and Indexing: Storage Hierarchies, Free structured indexing


and Hash based indexing

3 hours

9. Query Evaluation Overview: Overview of Query optimization


Query evaluation


plan. Typical Optimizer estimations. Relational Optimization. Cost of a plan


estimating result sizes

3 hours


10. Transaction processing : Transaction Concurrency control recovery of Transaction


failure. Log based recovery looking techniques. Granularity looks. Time stamping


techni
ques. Time stamping techniques recovery techniques. Two phase looking


system. Database backup and recovery from catastrophic failure. 6 Hrs.


11. Scheme refinement and normal forms. Functional Dependencies. First Second Third



Fourth and Fifth normal form BCNI Camparison of 3 NF and BCM


Closure of


dependencies Minimal. Closure.




4 Hrs.


12. Security and Authorization. Grand and revoke. Permissions Access Control 3 Hrs


Re
ference


1. Database Management Systems. Raghu Ramakrishnan Johanse Gehrke. Third Edition


Megrow Hill.


2. Data base system concepts Korth

Silber Metgrow hill.


3. Fundementals of Data base System

Elmasari and Navathe. Benjamin cummins



.

4.Databa
se Systems design Implementation and management both coronel course


Technologies .



Assignments



1.SQL commands for DDL. Creation of simple data tables with insertion of data create


Table create Index Pkey creation.

2. SQL Comand for mani
pulations. Of Data Using select from where sequencies with


variation.

3. Write enbedded code for getting the data from table embedding using Pro*
-

C /Pro C


Cobol PL /SQL basic idea is to be able to work with cores and record accessing.

4
. Embeded SQL using more constructs.

5. Design and analysis of an application like. Travel Agency. Online Placement Service


Hostal accounting Systems. Library Management systems. Bank front office


Management etc.

6. Creating of the Databa
se.

7. Five Queries for the database created.

8. Five input screen for data output.


Paper III

Data Communication Net works



Lectures 3 hrs/ week Practical : 3 Hrs Week

One paper 100 marks/ 3

hrs duration. Practical test: 25 marks.



1. Fundemental in communication ( 6 hrs)



Data Transmission
-

Consents and Terminology.


Elementary idea of different type of analoge modulation techniques as



amblitude.Frequency and phase and digital modulation such as PAM.


PWM.PCM. Different mode of communication


Simples Half Duples. Different

t
yes of switching techniques. Circuit switching message. Switching and packet


switching
.


2. Introduction (5Hrs)


Uses of computer network
,

LANs MANs. WANs Wireless Network Internetwork.



The OSI different Model
,

The TCP/IP Reference model.


A comparison of the OSI and ICP Reference Models
,
Example Data Communication



servic
es (SMDS.N
-
25 Frame Relay
,

Board land ISDN and ATM)


3. The Physical Layer.



Transmission media Magnetic media Twisted pair Base Band Coastal Cable



Broad Band.
,

Coaxial cable Fiber optics
,
Wireless Transmission. The Electro


Magnetic Spectru
m. Radio Transmission
,

Microwave Transmission. Infrared and


Millimeter Waves. Light Wave Transmission.

4. The
D
ata Link Layer(5Hrs)



Data Link Layer Design Issues



Error Detection and Correction.



Elementary Data Link Protocols



Sliding Window P
rotocols
,


Example

HDFC

5. The Medium Access Sub Layer (8Hrs)



Multiple Access Protocols ALOHA Carrier Sense Multiple Access Protocols



Collision Free Protocols
,

HEE Standard. 802.3, 802.4, 802.6
,

High Speed LANs


FDDI
,


Satellite Networ
k


Polling.ALOHA . FDM CDMA

6. The Network Layer (8Hrs)



Network Layer Design Issues.



Routing Algorithms. The Optimality Principal Shortest Path Routing. Flooding



Distance Vector Routing Broad Cast Routing And Multicast Routing.



Internet Working
,

The Network Layer in the Internet IP Protocol. IP Address Sub net



ICP.Internet
,

Multicasting.IP

7. The Transport Layers (5Hrs)


The Transport Protocols
,
The Internet Transport Protocols. The ICP Services Model.



The ICP Protocol And the ICP Segment Header. CDP

8. The Application layer (2Hrs)



Basic concepts of


N
/W

Security DNS, SNMP, SMTP, FFP ,
DES, RSA

algorithms.



References:


1)


Tancncbaum A .S
-

Computer Network (3
rd
ed )

2)

Stalling William
-

Data Computer
Communications.

3)

Douglas Comer
-

Inter Networking with TCP/IP Vol
-
1.

4)

Douglas Comer


Data Communication.

5)

Black U


Computer Network


Protocols Standards and Interfaces.



Assignments






1)

Getting acquinted with the H/W of the Computer

2)

Implementatio
n of Dikjstra’s routing protocol.

3)

Implementation of Belliman Ford’s Algorithm

4)

Study of Network Performance and Management.

5)

Study of Different Application Standards in the areas of

a) File transfer access.

b) Remote logging and Virtual terminals

c) E
-
mail
systems

d) Directory services

Tutorials

Study of Networking Details


List of Practicals

Implementation of Dikjstra routing protocols.

Implementation of Bellman Ford’s algorithms

Demonstration of Network Management SW.

Paper IV

TECHNICAL WRITING AND ORGAN
ISATIONAL
BEHAVIOUR



Lecture :
-

2 Hrs /week Tutorials : 1 Hour week

One paper: 100 marks/ 3 Hrs. duration Term work +: 25 marks


1.Standards of c
ommunication : The process and components. Guidelines . Language and
principles, media and channel
-
computer as a medium(5Hours)

2.Written technical communication : main features, subject and objectives. language and
style in written communication (12

Hours)

a) Report writing


principles features of a report. types. Short and long reports. Project
report. dissertation and thesis. White paper.

b) Technical description and instruction
-

product and process description. Preparing
instructions. U
se in manuals.

c) Project proposals
-

formal and in formal proposals (feasibility study) Solicited and
unsolicited proposals.

d) Meeting documentation.

e) Writing technical and term papers.

3.Oral communication : Group discussion. Interview and techn
iques. Presentation skills.

Conduct of a meeting.

IEEE standards of communication and Documentation.

IEEE Standards Glossary of Software Engineering Terminology.

IEEE Guide for Developing Software Project Management Plans.

IEEE Guide for Developing
Software Life Cycle Processes.

IEEE Guide for Software Quality Assurance Plans.

IEEE Standard for Software Unit Teasing.

IEEE Standard for Software User Documentation.

IEEE Standard for Software Maintenance.


4.Organizational Behavioral
: Meaning. basic concepts. Scope

5.Human Behavioral Process: Perception and individual decision making attitudes.

Values and personality. Motivation. Personality managerial Personality. Decision making
and Decision style.

Hours

6.Interpersonal Behavior:

Conflict, assertive behavior and transactional analysis hours.

7.Group Dynamics: Groups, Committees, brains Storming, nominal groups, teams hours.

8.Stress management: Causes and symptoms of stress, Stress reduction, counseling Hours.




Tutorials:

Two
case studies should be done.

Recommended Books.

1)Organizational Behavior: Keith Davis and Newsroom.

2)Organizational Behavior: Stephen P Robbins.

3)Organizational Behavior: Ered Lutherans.

4) Organizational Behavior: Mullions


5) Report Writing for Busine
ss Lesikar Raymond.

6) Effective Business Communication: Murphy

7)Organizational Behavior and changes: Joseph Weiss

8) Technical Writing and Professional Communication Mac Graw Hill

9)Technical Communication Paul V. Anderson. Thompson Learning.

Paper V

O
PTIMIZATION TECHNIQUES


1 Lecture : 3 Hours/ Week Tutorial: 1 /hrs/week

One paper : 100 marks/ 3 hour duration Practical Test : 25 marks


Objectives:
Various optimization techniques should be introduced. Sensitivity Analysis
should be emphasized. The relevance of the numbers obtained and their meaning should be
explained in detail formulation of the problem, understanding the scenario should be
explain
ed. The coorelation of the techniques with their possible use in computer field (PERT
CPM) in project Mgmt, Scheduling in Networking. I P as general model etc.


Nature of Operations Research

1)

History

2)

Nature of OR

3)

Impact of OR

4)

Applications areas


Overview
of Modeling approach.

1)

Formulating the problem

2)

Constructing a Mathematical Order

3)

Deriving a solution

4)

Testing the Model and solution.

5)

Establishing Control over the solution ( sensitivity Analysis)

6)

Implementation issues.


Linear Programming

1)

Linear Programming

model

2)

Assumptions of Linear Programming

3)

Formulation of LPP

4)

Graphical Solution to LPP

5)

Graphical sensitivity of analysis( The meaning of these result and their use in decision
making)

6)

The essence of simples method

7)

The Algebra of simples method

8)

The setting
up of tables and solution using tabular method. Primal simples method.

9)

Sensitivity Analysis and the comparison with numbers obtained in graphical method.

10)

The big M method

11)

The two based simples Technique

12)

The revised simple method

13)

The dual simples method

14)

Th
e Duality theory and dual of the LPPI economic interpretation of the Dual

15)

Role of duality in Sensitivity Analysis. Essence of sensitivity Analysis

16)

Parametric programming


Special cases in I. P.


1)

Transportation problem, optimization Techniques for IP (Modi
Method, stepping stone
method. Sensitivity analysis for I P

2)

Assignment Problem Hungarian Method

3)

Travelling salesman problem branch and bound Technique. Hungarian methods

4)

Sequencing Problem(2 machines n jobs ,3 machined n jobs, n jobs, n machines jobs
graph
ical method)

5)

GOM programming Non Preemptive, Preemptive models, solution methods.


Network Analysis including PERT CPM

1)

Terminology of Networks

2)

The shortest path problem

3)

The minimum spanning tree problem.

4)

The maximum flow problem.

5)

The network simplex metho
d drawing of the network.

6)

Definition of various times involved in PERT network

7)

Calculation of slacks , critical path variances and standard deviation

8)

Times associated with CPM network, floats critical path

9)

Updating the network

10)

Crashing the network

11)

Resourc
e leveling and resource loading.


Inter Programming


1)

Formulation of IP

2)

Situations when IP is important

3)

Types of solving the problem.

4)

Branch and bound technique

5)

Gomory’s cutting plane algorithm

6)

Zero one IPP.



Replacement Theory


1)

Replacement models

2)

The sol
utions to single item replacement groupreplacement.


Dynamic Programming

1)

Characteristics of DPP

2)

Deterministic of DPP


Game Theory.

1)

Formulation of two person. Zero sum games.

2)

Solving simple games

3)

Graphical solution pl procedure

4)

Solving of Linear Program
ming.


Books:


1)

Introduction of operations research : laha

2)

Operations Research : Hira Gupta.


Reference:


1)

Introduction to Operations Research Hillet Fiberman IMI

2)

Operations Research: S.D. Sharma.


SEMESTER IV


Paper 1.


INTRODUCTION TO JAVA AND WEB TECHNO
LOGIES



Lecture : 3 Hours week Practicals: 3 Hrs/week

One Paper: 100 marks / 3Hours duration. Practical Test : 25 marks.


1.


Introduction to web and HTMI




a) Introduction

to web programming




b) Creating

WEB Pages




c) Frameset




d) Forms.




e) HTML controls.




f) Cascading style sheets.




g) Introduction to DHTML.

4 Lectures

2. Introduction to java script :




a) Advantages of using java script on elient side.




b) Creating objects in java script.




c) Operators.




d) Control and looping statements.




e) Functions.


2 Lectures

3.

Introduction to core java.




a) Java language and its features.




b) How java differs from c++




c)Java language syntax features.




d)Classes in java.




e) Constructers finalize instance data and methods. The NEW
operator.




f)Methods overloading
and parameter passing. Objects as parameters.




g)Memory management and garbage collection.




h)The THIS facility static data and methods.




I) JDK and its usage.




j)The first java program.


3 Le
ctures

4)


Aception handling.





a) Exception as objects.




b) Exception hierarchy.




c) Try catch and Finally.




d) Different Exception c
lasses.

2 Lectures

5)

Perfaces and Packages.




a) Inner class
es abstract classes and Wrapper classes




b) Interfaces.




c) Packages.




d) Access Control Rules.


3 Lectures

6)


Altithreaded programming in java.




a) Multithreading advantages and issues.




b
) Thread class and thread group.




c) Runnable interface.




d) Thread Synchronization.




e) Inter
-

Thread communication. 3 Lectures


7.


Java. io package




a) Files




b)Byte streams and Unicode Character

streams




c) Persistence of Object.




d) Object Sterilization method 3 Lectures


8.


SWING




a) Introduction to SWING




b) Delegation Event Mode.




c) Layout and Component Manager




d) Handling images.

4 Lectures

9.


Applets.




a) The Applet class




b) Applet context, paint 0 repaint 0update 0 get Graphics 0




c) Passing parameters embedding in HTMI




d) Inter Applet communication.

3 Lectures

10.

Java and XML
-

new way working with Data




a) Multilevel application based on Java and XML




b) Use of XML in Oracle. 4 Lectures

11.

Micro Pr
ograms for browsers. Remote and Local Executions of programs.




a) Applet.




b) Servlets.




c) Scriptles
-

ASP, JSP.

5 Lectures

12. Java components.


a) Javabeans.




b) CORBA
and EJBS. 3 Lectures

13.

Database technologies.




a) Database access Methods ODBC. JDBC.JDBC Architecture.




b) Driver manager driver. Connection. Statement resultset.




c) Writing database a
pplications.




d) Connector interface creating new classes application. 4 Lectures


Books recommended:




1. S.Dunaev. “Advances Internet programming Technologies and
Applications.”




alist IT


Master.




2. “Core java.” Dietel and Dietel.




3.

“The complete reference java2.” Patrick Naughton Herbert Schind
TMIL.




4. “Jav script bible.”




5. “

HTML examples.” Norman Smith Edward Farrar.









Paper II


OBJECT ORIENTED MODELLING & DESIGN USING UML.



Lectures : 3 Hours/week

Practicals: 3 Hrs/week

One paper: 100 marks/ 3 hour duration. Practical test: 25 marks.



1.

Benefits of OO Methodology:



2.

Overview of Prominent OO Methodology




Booch Metho
dology.OMT (Rumbaugh).OOSE (Jackbson)



Responsibility driven design (RebeccaWirfs Brock). United Process.



3.

Introduction to UMI (5 Hrs)








4.

Use Case and Activity Diagra
ms.



Describing system functional requirements with use case diagrams and




activity Diagrams. Relationship between use cases. In use case diagrams.



Describing temporal sequencing of us cases w
ith activity diagrams.




5.

Basic Concepts and Notation for Class Diagrams



classes, attributes, methods, associations, Aggregation and Composition, Class



specialization. Inheritance type promotion an
d polymorphism.
(4hrs)



6.

Advanced concepts and Notations for Class Diagrams



Association rules, qualified associations, Association classes Dependencies



Refinements Extensions Mechanisms

(3hrs)



7.

Class Modeling and Design Approaches



Three approaches for identifying classes, class relationships etc. comparison



of Approaches using combination of approaches.


(2 h
rs)



8.

Flexibility guidelines for class design.



Guidelines and heuristics that lead to more extensible and reusable class



D
esigns

Coupling and cohesion in object
-

oriented programs. Class



normal
ization for cohesion. Guidelines for the use of inheritance.

Using


aggregation verses using

inheritance.

(
3hrs)



9.

UML Extension Mechanisms.



The use of properties, constraints
and stereo type to extend the UML notation.


(2hrs)



10. Concepts and Notation for Interaction Diagrams.




The concepts and notatio
ns for collaboration and sequence diagrams.


Denoting Iteration, branching and object creation. and destruction in each



type of diagram.The relationship of interaction diagrams to the class




diagram.







(4hrs)



11. Concepts and Notation for State Transition Diagrams.




When to use state transition diagrams. The Notation for the diagrams



including composite states ,hist
ory states and concurrent
state machine.




12. Behavioral Design Approaches




The “ Top
-

down” versus the “ bottom up” approaches to designing class




Behaviors. Use cases revisited : three approaches for identifying a pro
blem



use
Cases. The top
-
down process of identifying required seenarios., then


turning those scenarios into interaction diagrams, object methods and state


machines.

The

bottom

up approach of concentrating on class


responsibilities. (2hrs)



13. Flexibility Guidelines for Behavioral Design.




Guidelines for allocating and designing behaviors that led to more flexible




Designs Coupling revisited. Avoiding centralized control. The over use of



Accessor methods. Trading off extensibility ver
sus reuse. (
2hrs)



14. System Architecture.




Layered architecture. The p
ackage concept and its UML notation. Defining



layers And subsystems as packages. How to decompose a system into



subsystems. The UML component diagram.

(
2hrs)



15
. Concurrency and Synchronization.




Threads and processes. Managing concurrent access to objects. Scheduling




approaches. Introducing concurrency in UML interaction diagrams.



16. Physical distributions and the UML depl
oyment diagram. (3hrs)



17. Frame work and Design Patterns.




An introduction to reuse through class libraries, frame works and design



patterns.



(4hrs)





Reference Book


1.

Designing Flesible Object Oriented Systems with UML. By Charls



Richter

Techmedia.



Additional Reference Book.




1. UML us
ers guid

e by Booch. Rumbaugh, Jacobson

Addison


Wesley




2. Object Oriented Modeling and Design by Rumbaugh.




3. Object Oriented Analysis & Design


Practical Applications By


Booch


Addison Wesley.











Paper III

SOFTWARE ENGINEERING AND PROJECT
MANAGEMENT





Lectures; 3 Hours /week Tutorial: 1 hr/week


One paper: 100 marks / 3 hours duration P
ractical: test: 25


1.

Introduction



1.1 Programs vs Software Products. Soft ware characteristic Lecture



1.2 Emergence of Software of Software Engineering.



1.3 Notable changes in Software Development Practices.



1.4 Software life cycle/ process mode
ls. Classical waterfall model. Iterative



waterfall model
,
RAD model, prototyping model. Evolutionary model.



Spiral model. Concurrent
,

Model. Comparison of Different L
ife Cycle



Models.





(5 Lec)

2.

Software Project Management.



2.1. Projects planning


problem. Process.



2.2 Project Size Estimation Metric Measures. Metric and Indicators. Line of


code (IOC). Function Point Metric Features Point metric.

(
4 Lec)


3.

Software Project Management.



3.1. Software Scope



3.2. Decomposition Techniques



3.3. Software Estimation: Empirical Estimation Techniques



COCOMO



Model. Heuristic Techniques



3.4. Analytical Estimation Techniques. Export judgement make

Bye decision



(4 Lec)

4.

Project Scheduling and tracking



4.1. Relationship between people and effort: Staffing level Estimation. Effect


of schedule change on cost.



4.2. Selecting Software Engineering Tasks Degre
e of Rigor. Task set selector.




Task Net work .



4.3. Schedules: Work breakdown structure. Task Network / Activity Network.


Gantt Charts, PERT Charts.



4.4. Organization and Team Structures: Or
ganization Structures. Team



structur
es

(4 Lec)


5.

Software Risk Management: Risk Identification. Risk Assessment.

And Risk


Projection. Risk Containment.Risk Mitigation, Management and Management.


(4 Lec)


6. Software Configuration Management:

Necessity of Software Configuration


Management base line SCM Process and SCL Configuration. Audit Version Control


Source Code Control Systems (SCCS)


7.

Overview of Requirement Analysis and Specification.



7.1. Requirements Analysis



7.2. Sof
tware Requirements Specification (SRS): SRS Documents.



Characteristic of a good SRS, Documents, Organization of the SRS



Documents. Techniques for Representing Complex L
ogic Formal



Systems Development Techniques. (3 Lec)


8.

Software Design



8.1. What is Good Software Design?



8.2. Cohesion and Coupling: Classification of Cohesiveness. Classification of




coupling.



8.3. Software Design Approaches. Func
tion
-

Oriented Design (
3Lec)


9.

Function Oriented Software Design



9.1. Overview of the Sa/Sd Methodology.



9.2. Structure Analysis.



9.3. Data Flow Diagrams (DFDs)



9.4. Extending the DE
D Techniques to Real Time Systems.



9.5. Structure Design.


(3Lec)


10.

Software testing



10.1.Testing Overview: Verification vs Validation. Designs of test cases.



10.2 Black


Box testing : Equivalence Class Partitioning. Graph based testing



Boundary Value analysis.



10.3. White
-
Box Testing: Statement coverage , Branch Coverage. Condition



Coverage. Path Cover
age. Cycloramic Complexity Metric Data Flow



based Testing



10.4.Testing Specialized Environments; Testing GUL Testing Client Server



Architectures.



10.5 Integration T
esting Top down Testing. Bottom Up testing. Regression



Testing phased vs Incremental Integration testing.



10.6 System Testing. Stress Testing Recovery Testing Security Testing














(6Lec)


11.

Softw
are Reliability



11.1 Software Reliability



11.2 Reliability Metrics



11.3 Reliability Growth Modeling.

(2 Lec)


12.

Software Quality Concepts.



12.1 Software Quality Management System



12.2 Softw
are Quality Assurance



12.3 Software reviews



12.4 Formal Technical Reviews



12.5 Overview of ISQ 9000



12.6 SEL Capability Maturity Model (5 Lec)


13.

Software Maintenance



13.1 Software Revers
e Engineering



13.2 Software Maintenance Costs



13.3 Estimation of Maintenance Costs


References


1.


Software Engineering


A Parishioner’s Approach Press man

2.


Management Text and Cases R. Satya Raju A. Parthsarathuy PIIII

3.


Software Engine
ering Pankaj Jalote.


Assignment


1.

There are no practical for this subject in the syllabus. However, group Project are done



by assigning project to the group. The project is from following topics. Travel


agency. On line pl
acement services. Hostel accounting Systems Bank from office


Management etc. the following documents are product for the project.




Project proposal



Systems requirement study and analysis.



Project estimation plan



Risk mitigation monitoring and man
agement plan the project.



Project schedule and time line charts.



Project code.



Project test plans


Paper 4

MANAGEMENT INFORMATION SYSTEMS


Lectures 3 Hours/ week




Tutorial: 1 Hrs/week.

One paper: 100 marks/ 3 hours duration.


Practical Test: 25 marks.


1.

Introduction MS concepts definition. Role of MIS .MIS & computer MIS and academics
MIS and user.

2.

Role and importance of management: Introduction to management approaches to
management Function of the manager and the environment, Management as a control
s
ystem. Management by exception MIS a support to the management.

3.

Process of management: management effectiveness planning organizing staffing
coordinating and directing controlling MIS a tool for management process.

4.

Organization Structures and Theory: Basic

model of organization structure modification
of the basic model organization structure. Organization behavior organization as a
Systems MIS: organization.

5.

Strategic management of business: the concept of corporate planning essentially of
strategic plannin
g, development of the business strategies. Types of strategies Short range
planning tools of planning MIS: business planning.

6.

Decision making: decision
-
making concepts. Decision methods tools and procedures
behavioral concepts in decision
-
making organizati
on decision making MIS and decision
-
making concepts.

7.

Information: Information concepts information a quality product classification of the
information methods of data and information collection value of the information general
model of a human as an inform
ation processor. Organization and information. MIS and
the information concepts.

8.

Development of MIS: development of long range plans of the MIS ascertaining the class
of information. Determining the information requirement. Development and
implementation
of the MIS. MIS the factors of success 7 failure.

9.

Choice of information Technology: Nature of 11 decision strategic decision configuration
design evaluation information technology implementation plan choice of information
technology and the MIS.

10.

Decision S
upport Systems: Components, Development, Executive Information systems
Uses. GDSS. Introduction to the concepts of Data Warehousing and Data mining. OLAP
ERP fundamentals.



Reference

1. Management Information Systems by W.S. Jawadekar TMG.

2. Management I
nformation Systems by James A.O. Brien TMG

3. Computerized MIS Joseph Kelly.

4. Management Information Systems Effy OZ Thomson Learning.

5. Information Systems Concepts for Mangers Lucas H.C.

6. Database Systems design implement and management Rod control
Course Technologies.

Practical

1.Assignments: Should contain 4 assignment

2. Case Study Present a report of 10
-
15 pages on any topics from syllabus (e.g. The Student
Has to analysis the requirement and possibilities of implement MIS for his Institution)



PAPER

V

COMPUTER GRAPHICS


Lectures:3 Hours/ week. Practicals:3 Hrs/ week

One paper:100 marks/3 hour duration. Practical test:25 marks.


1.

.Introduction: What is C.G? Elements of graphics workstation. Video Display
Devic
es.Raster Scan Systems. Random Scan systems. Input devices. Graphics Software
Coordinate Representations, Fundamental Problems in Geometry.


2.

.Algorithms: Line drawing algorithms
-

DDA Algorithm. Bresenham’s Line
Algorithm.Frame buffers. Circle and Eclipse g
enerating algorithms. Midpoint Circle
Algorithm. Sean
-
line polygon fill algorithm. Inside
-
Outside tests. Sean
-

Line fill of
curved Boundary Areas. Boundary fill Algorithm. Flood fill Algorithm. Character
generation. Attributes of lines, curves, filling, ch
aracters. etc.


3.

Graphics Primitives: Primitive Operations, The display file interpreter
-
Normalized
Device Coordinates. Display
-

File structure. Display


file algorithm. Display control and
Polygons
-

polygon representation.


4.


Attributes of output primitive
s: Line attributes
-

Line type. Line width. Pen and Brush
options. Line Color. Color and gray scale levels. Color
-
tables. Gray scale. Area
-

Fill
Attributes
-

Fill styles. Pattern fill. Soft fill. Character Attributes. Test attributes.


5.

Geometric Transformati
ons: Matrices. Scaling Transformations.
Sin and Cos Rotation.
Homogeneous Co
-
ordinates and Translation. Co
-

ordinate Translations. Rotation about
an arbitrary point. Inverse Transformations, Transformations Routines.


6.

2
-
D Viewing
-

The viewing pipeline. Vi
ewing co
-
ordinate, Reference Frame. Windows
to view ports . co
-
ordinate transformation 2
-
D Viewing functions. Clipping operations
point clipping. Line clipping. Cohen
-

Sutherland. Line Clipping. Polygon clipping.
Suther land Hodge man clipping.


7.

3
-
D con
cepts. Three dimensional Display Methods Parallel projection. Perspective
projection. Visible line and surface identification. Surface rendering. Three Dimensional
Object representations. Bezier curves and surfaces. B
-
Spline curves and surfaces.


8.

Visibil
ity , Image and object precision Z
-

buffer algorithm. Floating horizons.


9.

Computer Animation: Design of Animation Sequences. General Computer Animation
Functions
-
Raster Animations. Key Frame Systems. Morphing Simulating Accilarations.
Motion Specificatio
ns. Kinematies and Dinamics.


Reference:



1.

Computer Graphics
-

Donald Hearn & M Pauline Baker.

2.

Computer graphics by Hill Jr.

3.

Computer graphics. Steven Harrington. Me Graw Hill.

4.

Computer graphics principles and Practice. J.D. Foely.
A Nan Dam. S.K. Leine
r & RA
Philips.
Addison Wesley.

5.

Principles of Interactive Computer Graphics. William M. Newman. Robert 1 Sproull. Me
Graw Hill.

6.

Introduction to Computer graphics. J.D. Foley.
A.Nan Dam. S.K. Leiner.
J N Hughes &
R.I Philips. Addison Wesley.

7.

Computer Graph
ics by Rogers.



































Detailed Syllabus Semester V



CLASS: MCA

Semester
-

V

SUB : Network Security

Periods per week

1 period of 60 min.


Lecture

4

Practical

2

Tutorial

-


Hours

Marks

Evaluat
ion System

Theory

Examination

3

100

Practical

-

-

Oral Examination

-

--


Term Work

-

25

Detailed Syllabus







1.

Introduction :

Attacks, Services and Mechanisms, Security Attacks, Security Services

Cryptography:

Terms, Outline, Plain text and
Cipher Text, Encryption and
Decryption,

Symmetric Cryptography, Asymmetric cryptography, Integrity
check, digital Signature, authentication, hash algorithms.


2.

Secret Key Cryptography:



Block Encryption,

DES: Overview, DES rounds, S
-

Boxes






IDEA : o
verview, comparison with DES, Key expansion, IDEA rounds

Skip jack: history overview

Uses of Secret key Cryptography; ECB, CBC,
OFB, CFB, Multiple encryption

DES.


3.

Hash Functions and Message Digests:

length of hash, uses, algorithms (MD2, MD4, MD5, SH
S)

MD2:ALGORITHM(padding, checksum, passes.)



MD4 and 5: algorithm (padding, stages, digest computration.)



SHS: overview, padding, stages.


4.

Public key Cryptography:



algorithims, examples, modular arithmetic (addition, multiplication, inverse,


ex
ponentiation)

RSA: generating keys, encyption and decryption.



Other Algorithms: PKCS, Diffie
-

Hellman, El
-
Gamal signatures,DSS,Zero
-






Knolwedge Signatures.


5.

Authentication:



Password Based, Address Based, Cryptographic Authentication.



Pass
words: in distributed systems, on
-
line vs off
-
line guessing, storing.



Cryptographic Authentication: passwords as keys, protocols, KDC’s,



Certification Revocation, Inter
-
domain, groups, delegation.

Authentication of People: Verification techniques, pas
swords, length of
passwords, password distribution, smart cards, biometrics.



6.

Public Key Infrastructure:

What is PKI, certificates, directories, cross
-
certification of domains in PKI, X
500 directories and X. 500 directories and X. 509 certificates.


7.

Security Policy:



What is security policy, high and low level policy, user issues.


8.

Security Handshake Pitfalls:



protocol problems, assumptions, Shared secret protocols, public key protocols,

mutual authentication, reflection attacks, use of ti
mestamps, nonces and
sequence numbers, session keys, one
-

and two
-

way public key based
authentication.

9.

Example System:

Kerberos: purpose, authentication, server and ticket granting sever, Keys and
tickets, use of AS and TGS, replicated servers.

Kerbe
ros V4: names, inter
-
realm authentication, Key version numbers

Kerberos V5: names, realms, delegation, forwarding and proxies, ticket
lifetimes, revoking tickets, multiple Reamls.


10.

Network Security:

Electronic mail security, IP security, Network manag
ement security, Network
management security.


11. Security for electronic commerce: SSL, SET.


12. System security



Intruders and Viruses, Firewalls, Intrusion Detection.


References

1.

Kaufman, c., Perlman, R., and Speciner, M., . Network Security, Priv
ate Communication


in a public world, 2
nd

ed.,

Prentice Hall PTR.,2002

2.

Stallings, W.,. Cryptography and Network Security: Principles and Practice, 3
rd

ed.,


Prentice Hall PTR.,2003.

3.

Atul Kahate, Cryptography and Network Security, McGr
aw Hill

4.

Stallings, w.Network security Essentials: Applications and standards, Prentice Hall, 2000



CLASS: MCA

Semester
-

V

SUB : Advanced Data Base Techniques

Periods per week

1 period of 60 min.


Lecture

4

Practic
al

4

Tutorial

-


Hours

Marks

Evaluation System

Theory

Examination

3

100

Practical

-

-

Oral Examination

-

--


Term Work

-

25

Detailed Syllabus






1.)Parallel and Distributed databases. 10 hours

-

Architecture for Parallel databases.

-

Parallelizing Individual operations.

-

Parallel query Evaluation.

-
Parallel query optimization.

-

Introduction to DDBMS.

-

Architecture of DDBS.

-

Storing data in DDBS.

-
Distributed Catalog Management.

-

Distribute
d Query Processing.

-
Distributed concurrency control and recovery.


2) Data Ware housing
-

6hours

Characteristics of Data Warehouse

-

Data Marts


Content of Data Warehouse Database


Da
tabase Structures


Getting data into the Data into the warehouse.


-

Extraction


-

Transformation


-

Cleansing


-

Loading


-
Summarization


Met a data


-

Human


-

Computer
-
based


Construction a Data Warehouse system


-
Stages of the project


-

Planning stag
e.

-
Data Warehouse Design Approaches.


-

Architecture stage

Any case study


-
Levis Strauss/ Hewlett Packard/ Govt. of Tamil Nadu/ Govt. of Andhra Pradesh.


3) OLAP

5hours


-
OLAP Architecture


-

Relational OLAP


-

Multidimensional OLAP


-

Relational vs. Multidimensional OLAP.


-

Web Based OLAP


Star Schemas


-

Facts


-

Dimensions


-

Attributes


-

Attribute hierarchies


-

Star schema representation


-

P
erformance
-

improving techniques


Implementation techniques for OLAP.


-

Bitmap Indexes


-

Join Indexes


-
File organizations


4) Data Mining. 5 hours


-
Intr
oduction.


-
Counting CO
-
occurrences.


-
Mining for Rules.


-

Tree
-

Structured Rules.


-

Clustering.


-

Neural Networks


-

Similarity Search over Sequences.


5) Object Database systems.


6 hours


-

Introduction.


-
User


Defined ADTs.


-

Structured Types.


-

Object, Object identity, and Reference types.


-

Inheritance.


-

Database design for ORDBMS.


-

New challenges in implementing ORDBMS.



Storage and access methods.



Query Pr
ocessing and optimization.


-

OODBMS.


-

Comparization between OODBMS AND ORDBMS.


6) Advanced Data types and New Applications. 6 hours


-

Motivation.


-

Time in databases


-

Mobile databases.


-

Main me
mory databases.


-
Geographic Information system.


-

Temporal and Sequence databases.


7) Database Security 2 hours


Refrence:

1. Database Management Systems
-

Rag
hu Ramakrishnan, McGraw Hill International
Editions.

2.Decision support and Data Warehouse Systems
-

Efrem G. Mallach
-

Tata Mcraw Hill
Edition

3. Data Warehousing
-

concepts, Techniques, Products and Applications
-
C.S.R. Prabhu
Second Edition , PHI

4. Databas
e Systems
-

Design, Implementation and Management
-

Rob
-

Coronal Thomson
Course Technology.

5.Database System Concepts. Korth. McGraw Hill.

6. Distributed Databases. Ceri and Pelagati.

7.Mastering Data Mining. Michael J.A.Berry, Gordon S. Linoff, Wiley Publi
cation.

8. Data Ware House. W.H. Inmon. Wiley
-

dreamtech India Pvt. Ltd.







CLASS: MCA

Semester
-

V

Advanced Java

Periods per week

1 period of 60 min.


Lecture

4

Practical

4

Tutorial

-


Hours

Marks

Evaluation Sy
stem

Theory

Examination

3

100

Practical

-

-

Oral Examination

-

--


Term Work

-

25

Detailed Syllabus








1) Introduction to Swing

J
A
pplet, Icons

and Labels, Text Fie
lds, Buttons, JB
utton Class, Check Box, Radio
Buttons,Container, Panel, Wind
ow, and Frame Classes, Combo Box, Tabbed Panes, Scroll
Panes, Trees, Tables, Custom Rendering of J List Cells,


2)JDBC

i)


JDBC Fundamentals

ii) Establishing Connectivity and working with connection interface

iii) Working with statements

iv)

Creating and Executing SQL Statements

v) Working with RESULT Set Object and Result set object and Result Set Meta Data


3)Servlets

i)

Introduction
to servlets( Life cycle of Serv
let, Java Servlet Development Kit
,


Creating,

Compili
ng and running serv
let )

ii) The servlet API : Javax. Servlet package

iii) Reading the S
ervl
et Parameters, Reading Initialization parameter

iv) The javax. servlet. http. Package

v) Handling HTTP Request and Response (GET / POST Re
quest)

vi) Using Cookies, Session Tracking


4)Introduction to Java Beans

i) What is Java BEAN? , Advantage

ii) Installing/ Starting/ Using BDK (Bean Development Kit)

iii) JAR Files

iv) Using the Java Beans API


5) JSP

i) Advanta
ge of JSP Technology (Comparison with ASP / Servlet)

ii) JSP Architecture, JSP Access Model

iii) JSP Syntax Basic ( Directives, Declarations, Expression, Scriplets, Comments)

iv) JSP Implicit Object ,Object Scope

v ) Synchronization Issue

vi) Exception Handling

vii). Session Management.

References


The Complete Reference JAVA 2, Herbert Schildt, TMH

The Complete Guide to JAVA Database

Programming, Matthew Siple, TMH

Practical

Should contain at least 8 Practical from the Syllabus


As
signments

Should contain 4 assignment


CLASS: MCA

Semester
-

V

Embedded System and Programming.

Periods per week

1 period of 60 min.


Lecture

4

Practical

4

Tutorial

-


Hours

Marks

Evaluation System

Theory

Examinatio
n

3

100

Practical

-

-

Oral Examination

-

--


Term Work

-

25

Detailed Syllabus







Introduction


1) Introduction to embedded system?, Variations on the theme, c : The least common
denominator, Introduction to about hardware.


2) What are real
-
ti
me embedded systems, examples of real time embedded systems.


3) Introduction to embedded program, The role of the infinite loop.


4) Compiling, linking and locating, the Build Process.


5) Memory: Types of memory, Memory testing, Validating memory content
s, working with
Flash Memory.


6) Peripherals: Control and status Registers, The device driver philosophy, A simple timer
driver.


7) Operating systems: History and purpose, a decent embedded operating system, real
-
time
characteristics, Selection process


References:

Programming Embedded system in C and C++, O’ reilly, SPD metrowreks. Com


Assignments

Should contain 4assignment.

Case Study: Present a report of 10
-
15 pages on any topics from syllabus.



CLASS: MCA

Semester
-

V
I

Distributed Computing.

Periods per week

1 period of 60 min.


Lecture

4

Practical

4

Tutorial

-


Hours

Marks

Evaluation System

Theory

Examination

3

100

Practical

-

-

Oral Examination

-

--


Term Work

-

25

Detailed Syllabus







1: Fund
amentals

Evolution of Distributed Computing Systems, System models, issues in design of Distributed
Systems, Distributed computing environment. (4 Hrs)


2: Computer Networks

Network types, LAN Technologies, WAN technologies, Communication protocols,
inter
networking, ATM networks. (4 Hrs)


3: Message Passing

Inter process Communication, Desirable Features of Good Message
-
Passing systems, Issues
in IPC by Message, Synchronization, Buffering, Mu
lti datagram Messages, Encoding and
Decoding of Message Data, Process Addressing, Failure Handling, Group Communication.

(4Hrs)


4: Remote Procedure Calls

The RPC M
odel, Transparency of RPC, Implementing RPC Mechanism, Stub Generation,
RPC Messages, Marshaling Arguments and Results, Server Management, Communication
Protocols for RPCs, Complicated RPCs , Client
-
Server Binding, Exception Handling,
Security, Some Speci
al Types of RPCs, RPC in Heterogeneous Environments , Lightweight
RPC, Optimization for better performance. (4 Hrs)


5: Distributed Shared Memory


General architecture of DSM Systems like Bus

based. Ring
-
based and NUMA
multiprocessors, Design and Imp
lementation Issues of DSM, Granularity,

Structure of Shared memory Space , Consistency Models, replacement Strategy, Thrashing,
Other Approaches to DSM, Advantages of DSM. (4 Hrs)


6: Synchronization



Clock Synchronization, Event Ordering, Mutual
Exclusion, Deadlock, Election Algorithms

(2 Hrs)




7: Resource and Process Management


Desirable features of a good global Scheduling Algorithm, Task Assignme
nt Approach, Load

Balancing Approach, Load
-

sharing Approach, Process Migration, Threads, Processor
allocation, Real time distributed systems. (6 Hrs)


8. Distributed File Systems


Desirable Features of a good Distribute
d File System, File Models, File Accessing Models,
File Sharing Semantics, File caching Schemes. File Replication, Fault Tolerance, Atomic
Transactions, Design Principles, Case Study: DCE Distributed File Service, Sun’s network
file system.

(4 Hrs)


9: Naming


Desirable Features of a Good Naming Systems, Fundamental Terminologies and Concepts,
Systems


Oriented Names, Object
-
Locating Mechanisms, Human
-

Oriented Names, Name
Caches, Naming and

Security, Case Study: DCE Directory Services



(4 Hrs)


10: Case Studies


Amoeba: Introduction, objects and capabilities, Proc
ess management, memory management,
communication, the Amoeba servers,

Mach: Introduction, process management, memory management, communication, Unix
emulation in March.

(4 Hrs)


References:


1.

Distributed OS by PradeepK. Sinha (PHI)

2

Tanenbaum S. Distributed Operating System, Pearson Education.

3.

Tanenbaums, Maarten V.S., Distributed Systems Principles and Paradigms ,( Pearson


Education.)



CLASS: MCA

Semester
-

VI

SUB: Wireless Technology

Periods per week

1 period of 60 min.


Lecture

4

Practical

2

Tutorial

-


Hours

Marks

Evaluation System

Theory

Examination

3

100

Practical

-

-

Oral Examination

-

--


Term Work

-

25

Detailed Syllabus








Session 1: Introduction and Overview


Session 2: Communication Fundamental Review and Wireless Communication


Technology.

Transmission Fundamentals, Communication Networks, TCP/IP




suits, Antennas and Propagation.


Session 3: Wireless Communication Technology

Signals , Spread spectrum, coding and error



control.


Session 4: Wireless web

Internet, Mobile IP, Web, Wireless Web


Session 5: Cellular Network
s

Ist

Generation,
2
nd

G
eneration,
3rd

Generation systems.


Session 6: Fixed Wireless networks and Wireless Local Loop

Cordless Systems, WLL, IEEE



802, 16


Session 7: Mobile IP and Wireless Access Protocol


Session 8 : Satellite Commun
ications



Satellite Orbits, Use of Satellites for Communication, Satellite Parameters and




Configuration, Capacity Allocation (Frequency Division and Time Division)


Session 9 : Wireless LANs
,
Overview, Infrared LANs, Spread Spectrum

LANs, Narrow Band



Microwave
LANs.


Session 10: IEEE 802. 11.


802 Protocol Architecture, 802, 11
-
Architecture and Services, MAC and



Physical layer.


Session 11: Blue tooth


Ov
erview Radio specification, Base band Specification, Link Manager



Specification, Logical Link Control and Adoption


Session 12: Mobile computing applications.


Session 13: Special Topics



Wireless security, The Future of Wireless
.


References


1. S: Stallings, W; “Wireless Communications and Networks”

2. U; Umar, A., “Mobile Computing and Wireless Networks


Technology


Briefing”

3. B: Blake Roy, “ Wireless Communication Technology”, Thompson