Home >> Academics >> MCA

 



The M.C.A. program prepares students to take up positions as systems analysts, systems designers, programmers, and managers in any field related to information technology. The program, therefore, aims at imparting comprehensive knowledge with equal emphasis on theory and practice. The M.C.A. students are encouraged to spend a full semester working in the industry/ in the institute giving them insight into the workings of the IT world. However, the course curriculum will have enough flexibility to enable a student to undertake advance studies in Computer Science later on.

 

First Year

1st Semester

Theory

MCC101 - Programming in C

Module – I
Introduction to computer: Evolution of computer, Computer system, Compiling environment, Time sharing, Client-Server environment, Distributed computing, Programming languages, Writing and editing programs, Compiling, linking and executing programs, System development, Life cycle, Program development. Number representation in computer: Number systems, Storing of integers and real numbers, Overflow and underflow, exceptions, Flow chart C language fundamentals: Character set, Key words, Identifiers, data types, Constants and variables, Statements, Expressions, Operators, Precedence and associativity of operators, Side effects, Type conversion, Managing input and output Control structures: Decision making, branching and looping.

Module – II
Arrays: one dimensional, multidimensional array and their applications, Declaration and manipulation of arrays Strings: String variable, String handling functions, Array of strings Functions: Designing structured programs, Functions in C, User defined and standard functions, Formal vs. actual arguments, Function category, Function prototype, Parameter passing, Recursive functions. Storage classes: Auto, Extern, register and static variables

Module – III
Pointers: Pointer variable and its importance, pointer arithmetic and scale factor, Compatibility, Dereferencing, L-value and R-value, Pointers and arrays, Pointer and character strings, Pointers and functions, Array of pointers, pointers to pointers Dynamic memory allocation.
Structure and union: declaration and initialization of structures, Structure as function parameters, Structure pointers, Unions. File Management: Defining and opening a file, Closing a file, Input/output Operations in files, Random Access to files, Error handling The Pre-processor directives, command line arguments, Macros.

Text Books:
  1. Approach Using C, Third Edition, 2007, CENGAGE Learning India Pvt. Ltd., New Delhi.
  2. E. Balguruswamy, “Programming in ANSI C”, 4th edition, 2007, McGraw-Hill Publication, New Delhi.
Reference Books:
  1. K.R. Venugopal, S.R. Prasad, “ Mastering C, McGraw-Hill Education India
  2. P. Dey, M. Ghosh, “Programming in C”, Oxford University Press
  3. K.N. King,”C Programming-A modern approach’’, W.W. Norton
  4. S. Prata,” C Primer plus”, 5th Edition, Pearson Education India

MCC102 - Microprocessor And Assembly Language Programming

Module – I
Digital Logic Fundamentals: Introduction, Number System, Binary Arithmetics, Logic Gates, Introduction to Multiplexer, Demultiplexer, Encoder, Decoder & Flip-Flops. Microprocessor History, 8085 Architecture and Register organization, Functional Block Diagram, Bus Organization, 8085 Instruction Set, Instruction classifications, Instruction word size, Instruction format, Addressing modes, Assembly Language programming, Memory, I/O devices, Addressing memory and I/O devices, Memory mapping, Memory Interfacing, Tri-State Devices, Buffers.

Module – II
Programming techniques with additional instructions: Looping, Counting, Indexing, Introduction to Advanced Instructions, Instruction cycle, Machine cycle, Timing Diagram, Stack and subroutine, Counter and Time delay, Debugging.

Module – III
Interfacing Chips: 8255A (PPI), 8155 (Multipurpose Programmable Device), Interrupts, 8259A (PIC), Serial I/O and Data communication, Serial Data communication standard (RS 232C) 8257 or 8237A (DMA Controller), 8251A (USART). . 16 bit processor 8086: Introduction, Architecture, Pin Diagram, Min & Max Mode, Addressing Modes.

Text Books:
  1. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming and Application with 8085”, 5th edition, Penram International Publishing (India) Pvt. Ltd.
  2. D V Hall, “Microprocessor & Interfacing” McGraw Hill Education India
Reference Books:
  1. A. P. Mathur , “Introduction to Microprocessor” McGraw Hill Education India.
  2. B.Ram, “Fundamentals of Microprocessor and Microcomputer” Dhanpat Rai & Co Publication.
  3. P K Ghosh, P R Sridhar, “0000 to 8085 Introduction to microprocessor to Engineers & Scientists”Prentice-Hall of India.
  4. M.Mano”Logic and Computer Design Fundamentals”Pearson Education/PHI.

MCC103 - Discrete Mathemetics

Module – I
Logic, Relation & Functions:
Logic, Relation & Functions: Logic: Propositions and logical Operations, Conditional statements; Predicate Calculus-First order logic, universal and existential quantifiers; Proof Techniques- methods of proof, Mathematical induction, recurrence relations. Relation and Diagraphs- Properties of relations, composition of relations, closure operation on relations, equivalence relations and partitions, paths in relation and diagraphs, Operations on relations, Transitive closure and Warshall’s Algorithm. Partial ordered sets (poset), Hasse diagram, External elements of partially ordered sets Functions, Functions for computer science, Growth of functions, Permutation functions

Module – II
Topics in Graph Theory: Directed and undirected graphs, basic terminology, paths and circuits, Eulerian paths and circuits, Hamiltonian paths and circuits, Transport Network, Graph coloring. Trees: definition and properties, rooted trees, tree traversals— preorder, inorder, postorder, binary trees, labeled trees, spanning trees, cut sets, Graph traversals — BFS and DFS, Minimum cost spanning trees-Prim’s and Kruskal’s algorithm, Shortest paths in weighted graphs- Dijkstra’s algorithm,.

Module – III
Algebraic Structures and Applications: Binary operations, semi-groups and groups, subgroups, cosets, Lagrange’s theorem, Product and quotient semi-groups and groups, Normal subgroup, Homomorphism; coding of binary information and error detection, group codes, decoding and error correction. Lattices, finite Boolean algebra, functions of Boolean algebra.

Recommended Text Books:
  1. Bernard Kolman, Robert Busby, Sharon C. Ross, “Discrete Mathematical Structures”, Sixth Edition, 2008, Pearson Education Inc., New Delhi. / Prentice Hall of India (PHI) Pvt. Ltd., New Delhi.
Reference Books:
  1. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, Sixth Edition, 2008, Tata McGraw-Hill (TMH) Publications Pvt. Ltd., New Delhi.
  2. D. S. Malik & M. K. Sen, “Discrete Mathematical Structures”, First Edition, 2005, CENGAGE Learning India Pvt. Ltd., New Delhi.
  3. Judith L. Gersting, “Mathematical Structures for Computer Science: A Modern treatment to Discrete Mathematics”, Fifth / Sixth Edition (Asian Student Editions), 2008, W. H. Freeman & Company, New Delhi.
  4. Richard Johnsonbaugh, “Discrete Mathematics”, Seventh Edition, 2008, Pearson Education Inc., New Delhi.

MCC104 - Engineering Economics And Costing

Module - I
Engineering economics- Nature and scope, The theory of demand, demand function, law of demand and its exceptions, Elasticity of demand, Law of supply and elasticity of supply. Determination of equilibrium price under perfect competition (Simple Numericalproblems to be solved). Theory of production and cost, Law of variable proportion, Law of returns to scale,

Module - II
Time value of money-Simple and Compound Interest, Cash Flow Diagram, Principle ofEconomic Equivalence Evaluation of Engineering projects- Present worth method, Futureworth method, Annual worth method, Internal rate of return method, Cost-benefit analysisin public projects. Depreciation Policy, Depreciation of capital assets, Causes of depreciation, Straight line method and declining balance method

Module - III
Cost Concepts, Elements of costs, Preparation of cost sheet, Segregation of costs into Fixedand variabele costs. Break-even Analysis-Linear Approach. (Simple Numericalproblems tobe solved).Banking: Meaning and functions of commercial banks, function of Reserve Bank of India.Overview Indian Financial System.

Text Books:
  1. Education India
  2. C. T. Horngreen, “ Cost Accounting “, Pearson Education India
  3. R. R. Paul , “Money banking and International Trade”, kalyani publuisher, New-Delhi
  4. H.L. Ahuja , “Principle of Economics”, S. Chand & Co

MCC 105 - Financial Accounting

Module - I
Fundamentals of Accounting; Accounting as a business function and language of business, Functions and objective of Accounting, Users of Accounting information, Limitations of Accounting, Cyclical nature of business and Accounting cycles, Accounting equations, Accounting events and transactions, Classification of transaction and their effect on Accounting Equation, Statement showing the effect of transaction on assets, liabilities and capital, Accounting concepts – as applicable to Balance sheet and Income Statements, The rule of debit and credit

Module - II
Recording transaction: The journal, The ledger postings, Subsidiary Books ao Accounts, Capital and revenue transactions, Fixed assets and depreciation policy Preparation of Financial Statements: Trial balance, Trading Account, Manufacturing Account, Profit and Loss account, Balance sheet

Module - III
Company Accounts: Authorized Share Capital, Subscribed, issued,, paid up share capital Kinds of share capital, relative merits and demerits, Format of Income statements and balance sheet, Issue of share capital and treatment of Books of Accounts, Journal entries for issue only(forfeiture of share excluded)

Text Books :
  1. Bal and Sahoo , “Financial Accounting”, S. Chand Publication
  2. Jain and Narang , “Financial Accounting” Kalyani Publisher
Reference :
  1. A. K. Bhatacharya , “Financial Accounting”, Prentice Hall of India

MCC106- English Communication Skills

Module-I The elements of communication
  1. The importance of communication through English at the present time
  2. The process of communication & factors that influence communication : sender, receiver, channel, code, topic, message, context, feedback, ‘noise’, filters and barriers
  3. The importance of audience and purpose
  4. The information gap principle : given and new information ; information overload
  5. Verbal and non-verbal communication : body language
  6. Comparing general’ communication and business communication
Module-II The sounds of English
  1. Vowels, diphthongs, consonants, consonant clusters
  2. The International Phonetic Alphabet (IPA) ; phonemic transcription
  3. Problem sounds
  4. Syllable division and word stress
  5. Sentence rhythm and weak forms
  6. Contrastive stress in sentences to highlight different words
  7. Intonation : falling, rising and falling-rising tunes
  8. Varieties of Spoken English : Standard Indian, American and British
(Note : This unit should be taught in a simple, non-technical manner, avoiding technical terms as far as possible. )

Module-III Review of English grammar
  1. Stative and Dynamic Verbs
  2. The auxiliary system : finite and non-finite verbs
  3. Time, Tense and Aspect
  4. Voices: Active and Passive
  5. Modality
  6. Negation
  7. Interrogation : Reported and tag questions
  8. Conditionals
  9. Concord
  10. Phrasal verbs
Text Books And Reference:
  1. A course in communication skills by Dutt,Rajeevan & Prakash (Foundation Books,Cambridge)
  2. Business Communication by Meenakshi Raman and Prakash Singh (Oxford)
  3. Business Communication Today by Bovee et al (Pearson)

Practicals

MCL107- Communicative Practice Lab -I

Lab sessions will be devoted to practice activities based on all three modules of theory.
  1. Phonemic transcription 5 hours : Students will be trained to find out the correct pronunciation of words with the help of a dictionary, to enable them to monitor and correct their own pronunciation.
    1. Transcription of words and short sentences in normal English orthography (writing) into their IPA equivalents ;
    2. Transcription of words presented orally ;
    3. Conversion of words presented through IPA symbols into normal orthography
    4. Syllable division and stress marking (in words presented in IPA form)
  2. Listening 10 hours
    1. listening with a focus on pronunciation (ear-training) : segmental sounds, stress, weak forms, intonation Students should be exposed, if possible, to the following varieties of English during listening practice : Standard Indian, British and American.
  3. Speaking 15 hours
    1. Pronunciation practice (for accent neutralization), particularly of problem sounds, in isolated words as well as sentences
    2. Practising word stress, rhythm in sentences, weak forms, intonation
    3. Reading aloud of dialogues, poems, excerpts from plays, speeches etc. for practice in pronunciation
  4. Grammar and usage 12 hours
The focus will be on the elimination of common errors. Some writing activities (e.g. writing of short paragraphs on assigned topics) can be used to identify these errors. identifying the central idea as well as supporting ideas preparing notes in diagrammatic form after reading a text,showing the main idea and supporting ideas and the relationships between them. Project Work Students will be required to produce and submit by the end of Semester 1 a 350-500 word project report on a topic of their choice. The project should involve data collection, analysis and reporting. Ten marks (out of the 70 marks allocated for the test at the end of Semester 1) will be set apart for the project.

MCL108 - Programming In ‘C’ Lab

  1. Introduction to OS: Linux/Unix, DOS, and Windows.
  2. vi editor basics, common commands on UNIX.
  3. File handling, directory structures, file permissions, Creating and editing simple C programme, Compilation and execution.
  4. C programming on variables and expressions.
  5. Precedence of operators, Type casting.
  6. Decision control structures— if and nested if-else.
  7. Loop controls— do, while, for and case control structure.
  8. Unconditional jumps— break, continue, goto.
  9. Modular program development using functions.
  10. Arrays and matrix operations—add, subtract, multiply.
  11. Recursion
  12. Pointers, address operators and pointer arithmetic.
  13. Structures and Unions, Accessing their members.
  14. Self-Referential Structures and Linked lists.
  15. Files and file operations, standard streams.
  16. Dynamic memory allocation and deallocations.
  17. Different mathematical operations using .
  18. Pointers to pointers, arrays, functions, structures and unions.
  19. Command line arguments, enums and prepocessors.
  20. International features and Code optimization.

MCL109 - Assembly Language Programming Lab

  1. Verification of 8085 Instruction Set.
  2. Addition, Subtraction, Multiplication & Division of two 8-bit numbers.
  3. Development of code conversion programs:
    1. Binary to Gray
    2. Gray to Binary
    3. ASCII to Binary
    4. Binary to ASCII
  4. Identification of the ports and pins of I/O ports of Intel 8255.
  5. Generation of Square, Triangular and Sinusoidal waveforms using DAC.
  6. Study of Interrupt RST 7.5.
  7. Stepper Motor control using 8085 Microprocessor.

2nd Semester

Theory

MCC201 - Data Structure Using ‘C’

Module – I
Data structure and C: Functions, storage structures for arrays, sparse matrices, strings, pattern matching, structures and arrays of structures, Abstractio Mechanisms, Abstract data type, Stacks and Queues: representation and Applications. Linked Lists: Singly linked lists, Linked stacks and queues, Operation on polynomial, Lnked dictionary, Doubly linked list, Circular linked list, Doubly circular linked lists,

Module-II
Dynamic storage Management, Garbage collection and compaction, Hashing functions. Hash tables and collision resolution techniques. Trees: Binary trees, Terminologies and memory representation, Binary search trees, General trees, Tree traversing, Operations on binary trees, - Expression manipulations, Threaded binary trees, Height balancing trees, Heaps, forest, File structures, Introduction to multi-way search trees, B-tree and B+-trees.

Module – III
Graphs: Terminologies and representation, Path matrix, graph traversal,- DFS and BFS, shortest path problems, Bi-connected graphs, Topological sort. Sorting techniques: Bubble sort, selection sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort, Shell sort and address calculation sort, Linear search and binary search.

Text Books:
  1. Richard Gilberg, Behrouz A. Forouzan, “Data Structures: A pseudo code approach with C”, Second Edition, 2007, CENGAGE India Pvt. Ltd., New Delhi.
  2. G.A. V. Pai, “ Data Structure and Algorithms”, McGraw Hills Education India
Reference Books:
  1. Alfred V. Aho, John E. Hopcropt & Jeffrey D. Ullman,“Data Structures and Algorithm”, First Edition, 1983, Pearson Education Inc., New Delhi.
  2. Ian Chai & J. White, “Structuring data and building Algorithms”, McGraw Hill Education India
  3. Aaron M. Tenenbaum, Yedidyah Langsam & Moshe J. Augenstein, “Data Structure Using C”, 1st Edition, 1990, Prentice-Hall of India (PHI) Pvt. Ltd., / Pearson Education Inc., New Delhi.
  4. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second Edition, 2008, Universities Press Pvt. Ltd. Hyderabad.

MCC202 - Computer Architecture & Organization

Module – I
Introduction:
Basic architecture of computer, Functional units, Operational concepts, Bus structures, Von Neumann Concept.
Basic Processing:
Instruction code, Instruction set, Instruction sequencing, Instruction cycle, Instruction format, Addressing modes, Micro instruction, Data path, Hardwired controlled unit, Micro programmed controlled unit.
Arithmetic:
Design of ALU, Binary arithmetic, Addition and Subtraction of signed number, Multiplication of Positive number, Signed operand multiplication, Division, Floating point number representation and arithmetic.

Module-II
Memory:
Memory Hierarchy, RAM, ROM, Cache memory organization, Mapping techniques, Virtual memory, Mapping technique, Associative memory, Memory Interleaving, Secondary Storage, Flash drives.
Module – III
Input/Output:
Accessing I/O devices, I/O mapped I/O, Programmed I/O, Memory Mapped I/O, Interrupt Driven I/O, Standard I/O interfaces, Synchronous and Asynchronous Data transfer, DMA data transfer. Introduction to Parallel processing: Flynn’s Classification, Pipelining, Array processing, vector processing
Text Books:
  1. Rajaraman, and T. Radhakrishnan, “ Computer Organization and Architecture”, Prentice-hall of India
  2. M. Murdocca,” Computer Architecture and Organization- An Integrated Approach”, Willey India Pvt Ltd
Reference Books:
  1. William Stalling , “ Computer Organization and Architecture ”Pearson Education
  2. J. P. Hayes “Computer Architecture and Organization" McGraw Hill Education India.
  3. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “ComputerOrganization”, 5th Edition, Mc Graw-Hill Education India
  4. A.S. Tananbaum “Structured Computer Organization” Pearson Education.

MCC203 - Object Oriented Programming Using C++

Module – I
Introduction to C++ : C++ as multi-paradigm language, features supported by C++, syntax, data-type, const and bool qualifiers, variables, strings, operators Control Structures, Decision and Loop Control Statements, Modular program design using functions, Top down program design with examples, parameter passing mechanisms, inline functions, recursion, Arrays and pointers, dynamic arrays, structures and unions in C++, Coding Style in C++ Object Oriented Programming in C++: Abstraction, OOP concepts, software life cycle, Abstraction Mechanisms: Procedural Abstraction and data abstraction; Classes and objects, object creation, access specifier-private, public and protected, constructors, default constructors, copy constructors, destructors, member functions, static members, references; Message communication using objects

Module-II
Classes, Multiple inheritance, multileveled and hybrid inheritance, Abstract Base Classes, Composition and aggregation with example, polymorphism—compile time & run time polymorphisms, object slicing, base class initialization, virtual functions and Dynamic Binding. Overloading: Function overloading and Operator overloading, ambiguity, Overloading Restriction, friends function, member operators, operator function, I/O operators, Automatic Conversions and Type Casts for Classes, Memory management in C++: new, delete, object copying— deep & shallow copy, this pointer

Module – III
Exception Handling Mechanisms: Exceptions and exception class, exception declarations, unexpected exceptions, RTTI, Calling abort(), Returning an Error Code, Exception Mechanism, Using Objects as Exceptions Templates and Standard Template Library (STL): Generic Programming in C++, Template classes, declaration, Template functions, Template Classes and Friends, Namespaces and separate compilation; String class, Containers, Iterators, Vectors Files in C++: Buffers, and the iostream File, redirection, streams and I/O streams classes, File Input and Output, Stream Checking and is_open(), Opening Multiple Files, Command-Line Processing, File Modes

Text Books:
  1. B.A. Forouzan & R. F. Gilberg, “ Astructured approach using C++”, CENGAGE learning India
  2. E. Balguruswamy. Object-Oriented Programming with C++, 3rd Edition, 2007, Tata McGraw-Hill (TMH) Publication Pvt. Ltd., New Delhi.
Reference Books:
  1. David Parsons, “Object-Oriented Programming with C++", , Pearson Education .
  2. H. Schild, “A complete reference to C++”, TMH
  3. Walter Savitch, “Absolute C++”, 2nd Edition, 2007, Pearson Education Inc., New Delhi.
  4. Stephen Prata,” C++ Primer plus”, Pearson Education

MCC204 - Theory Of Computation

Module - I
Introduction of Automata, Computability, and Complexity ; Mathematical notations and terminology; Finding proofs and types of proofs. Finite Automata and regular languages: Formal definitions, Designing finite automata, Deterministic finite automata, Non-deterministic finite automata, Equivalence of NFAs and DFAs, finite automata with e-transition; regular expressions and languages, Properties of Regular languages, conversion of RE to FA and vice versa.

Module - II
Push down Automata and Context free languages: Context free grammars, Designing context free grammar, Ambiguity in CFG and its removal, Chomsky normal form Push down Automata: formal definition, graphical notations, Languages accepted by PDA, Equivalence of PDA and CFG, Non-context free languages

Module - III
Turing Machines and Computability: Formal definition of Turing machines with examples, Graphical notations, Variants of Turing machines, Church-Turing thesis, Hilbert’s problem Decidability, undecidability and reducibility: Decidable languages; Decidable problems concerning regular languages and context free languages, The halting problem, Post correspondence problems, Undecidable problems, Mapping reducibility, Decidability of logical theories, Turing reducibility.

Recommended Texts:
  1. Michael Sipser, “Introduction to the Theory of Computation”, Second Edition, 2007, CENGAGE learning India Pvt. Ltd., New Delhi.
  2. John E. Hopcroft, Rajeev Motwani & Jeffrey D. Ullman, “Introduction to Automata Theory, Languages, and Computation”, Third Edition, 2007, Pearson Education Inc., New Delhi.
Reference Books:
  1. Nasir S.F.B., P.K. Srimani “ A text book on Automata Theory”, Cambridge University press India Pvt. Ltd.
  2. Peter Linz, “An Introduction to Formal Languages and Automata”, Fourth Edition, 2007, Narosa Publishing House, New Delhi.
  3. John C. Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, 2003, Tata McGraw-Hill (TMH) Publication Pvt. Ltd., New Delhi
  4. Thomas A. Sudkamp, “Languages and Machines: An Introduction to the Theory of Computer Science”, Third Edition, 2006, Pearson Education Inc., New

MCC205 - Computer Based Numerical Methods

Module - I
Errors and approximations in Numerical Computation, sources of errors, significant digits, Numerical solution of algebraic and transcendental equations by simple iteration method, Bisection method, Regula-falsi method (method of false position), Newton-Raphson method and their rate of convergence. Solution of simultaneous linear system of equations by Cramer’s Rule, Stability, ill conditioning, Gauss- elimination method, Gauss-Jordan method, Matrix inversion by Gauss-Jordan method, Iterative method for solving linear equations by Gauss-Jacobin and Gauss-Seidel method, Methods for solution of Eigen value problems.

Module - II
interpolation formula, divided differences, Newton’s divided difference formula, Inverse interpolation. Numerical differentiation based on Newton’s forward and backward interpolation formula, Numerical integration by Trapezoidal rule, Simpson’s 31 rd rule (with linear multiple application), Simpson’s 83 rule, error estimates of the rules, Gaussian quadrature formulae (2-point,3-point and 4-point).

Module - III
Numerical solution of ordinary differential equation using Taylor Series method, Euler method, Modification of Euler’s method, Picard’s method, Runge-Kutta method of order two and four, Predictor-Corrector methods.

Recommended Text Book:
  1. S. Rajasekaran, “Numerical methods in Science and Engineering: a practical approach”, S. Chand and company Ltd., New Delhi.
  2. T. Veerarajan and T. Ramachandran, “Theory and problems in Numerical methods”, Tata McGraw-Hill Publications, New Delhi.
Reference Books:
  1. W. Chenny and D. Kincaid, “Numerical Mathematics and Computing”, CENGAGE publication
  2. J. H. Mathews, “ Numerical methods for Mathematics, Science and Engineering”, PHI publication

MCC206 - Business Communication

Module -I The Elements of Business Communication
  1. horizontal, grapevine etc
  2. internal and external channels of communication; formal and informal channels
  3. cross-cultural communications
  4. avoiding gender, racial and other forms of bias in communication
  5. common forms of oral and written communication in the business world: Oral presentations, interviews and group discussions Memos, reports, summaries and abstracts, e-mails
Module-II Reading and writing
  1. The importance of developing reading skills
  2. the sub-skills of reading :
    1. understanding the main idea and supporting details
    2. reading between the lines : inferential reading
    3. understanding the writer’s point of view
    4. making predictions
    5. guessing the meanings of unfamiliar words
    6. skimming and scanning
    7. note-making
  3. the importance of writing skills
  4. the differences between speech and writing
  5. the qualities of effective writing : coherence, cohesion, logical structuring and organization, clarity of language, stylistic variation etc.
  6. the writing process : pre-writing, drafting, re-writing
Module -III Personality development and soft skills
  1. personality theories: Carl Rogers, Maslow, Eysenck, Murray
  2. emotional Intelligence
  3. lateral thinking: Edward De Bono
  4. soft skills: becoming a good leader and team-player
  5. inter-relating soft skills and communication skills
Books Recommended:
  1. Business Communication Today by Bovee et al ( Pearson)
  2. Business Communication by Meenakshi Raman and Prakash Singh (Oxford)
  3. Personality : Classic Theories and Modern Research by H.S.Friedman and M.W.Schustack ( Pearson Education)
  4. Personality Theories by Barbara Engler (Houghton Mifflin Company)
  5. Crash Course in Personal Development by Brian Clegg ( Kogan Page)
  6. Activities for Developing Emotional Intelligence by Adele B.Lynn (HRDPress)
  7. Lateral Thinking by Edward De Bono (Penguin)

Practicals

MCL207 - Communicative Practice Lab -II

  1. Communication Practice 30 hours
    1. Speaking : oral communication in social and 10 hours Work-related situations, e.g.: Greeting an acquaintance/ friend, introducing oneself, introducing a friend to another friend, breaking off a conversation politely, leave-taking; making and responding to inquiries; expressing an opinion; expressing agreement/ disagreement, contradicting/ refuting an argument; expressing pleasure, sorrow, regret, anger, surprise, wonder, admiration, disappointment etc. Narrating or reporting an event; Describing people, objects, places, processes etc. Ordering / directing someone to do something Making requests; accepting / refusing a request Expressing gratitude; responding to expressions of gratitude Asking for or offering help; responding to a request for help Asking for directions (e.g. how to reach a place, how to operate a device etc.) and giving directions asking for and granting/ refusing permission prohibiting someone from doing something suggesting, advising, persuading, dissuading, making a proposal praising, complimenting, felicitating expressing sympathy (e.g. condolence etc.) Complaining, criticizing, reprimanding
    2. Reading 10 hours Students will be given practice in reading and comprehending 6-8 simple passages of 100-300 words each, on topics of general as well as professional interest. The texts will be supported by suitable exercises designed to foster comprehension skills and vocabulary enrichment, together with study skills (note making) and reference skills (using a dictionary). Practice will be provided in the important sub-skills of reading which are introduced in Module 2 of the theory component.
    3. Writing 10 hours Writing short paragraphs on given topics or topics of one’s choice; social and business letters; reports; applications ; resumes ; summaries The principles of ‘Process Writing’ should be used to teach writing skills.
      • pre-writing : generating ideas, brain-storming, idea mapping, outlining
      • writing : generating a first draft ; reviewing, redrafting, editing
      • post-writing : making a presentation ; discussion and feedback, preparing the final draft.
  2. Soft skills practice 10 hours Activities designed to highlight leadership and ‘team’ skills ; Group discussion

MCL208 - Data Structure Using ‘C’ Laboratory

  1. Matrix Operations-Add, Multiply, Rank, Det.etc.
  2. Stack & Queue operations using Arrays.
  3. Self-referential structures & single linked list operations.
  4. Implementing Stack and queues using linked lists.
  5. Implementing Polish Notations using Stacks.
  6. Circular and double linked list operations.
  7. Implementing priority queue & dequeue using lists.
  8. Evaluating polynomial operations using Linked lists.
  9. Implementing set related operations & Hashing.
  10. linear & binary search, bubble sort technique.
  11. Insertion sort, selection sort & merge sort techniques.
  12. Quick sort, counting sort and Shell sort techniques.
  13. Radix (bucket) and address calculation sort methods.
  14. Binary tree traversals (preorder, inorder, postorder).
  15. Heap sort & AVL tree implementations.
  16. Graph representation with matrix & adjacency lists.

MCL209 - Object Oriented Programming With C++ Laboratory

  1. Implementing classes and creation of objects.
  2. Checking Precedence of operators & side effects.
  3. Implementing various control structures & loops.
  4. Making structured programming & stepwise refinement.
  5. Implementing Procedural abstraction with functions.
  6. Implementing Constructors and destructors.
  7. Implementing Data abstraction & inheritance.
  8. Implementing Multiple & hybrid inheritance.
  9. Implementing Polymorphism concepts.
  10. Implementing Operator overloading & friend’s functions.
  11. Working with new & delete, object copying.
  12. Implementing Object slicing, this operator.
  13. Exception handling mechanisms.
  14. Implementing class templates & function templates.
  15. Working with STL.
  16. Creating files in C++ and file related operations.

Second Year

3rd Semester

Theory

PCS3001 - Analysis and Design of Algorithms

Module – I :
Algorithms and Complexity – asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques – divide & conquer, dynamic programming, greedy method, backtracking.

Module – 2 (10 Hours)
Branch and bound, randomization. Data Structures – heaps, search trees, union-find problems. Applications – sorting & searching, combinatorial problems.

Module – 3 (10 Hours)
Optimization problems, computational geometric problems, string matching. Graph Algorithms – BFS and DFS, connected components,

Module – 4 (10 Hours)
Spanning trees, shortest paths, max-flow. NP-completeness. Approximation algorithms.

Text Books:
  1. Horowitz E. & Sahni S., Fundamentals of Computer Algorithms, Galgotia Publications.
  2. Aho, Hopcroft & Ullman, The design and Analysis of Algorithm, Addison – Wesley.

PCS3002 - Operating Systems

Module – I :
Evolution of Operating System: Type of operating systems – Different views of the operating systems – Principles of Design and Implementation. The process concept – system programmer’s view of processes – operating system’s views of processes – operating system services for process management. Process scheduling – Schedulers – Scheduling Algorithms .

Module – II
Structural overview, Concept of process and Process synchronization, Process Management and Scheduling, Hardware requirement: protection, context switching, privileged mode; Threads and their ; Management; Tools and Constructs for Concurrency, Detection and Prevention of deadlocks, Mutual Exclusion: Algorithms, semaphores – concurrent programming using semaphores.

Module – III
Memory Management: paging, virtual memory management, Contiguous allocation – static, dynamic partitioned memory allocation – segmentation. Non-contiguous allocation – paging – Hardware support – Virtual Memory, Dynamic Resource Allocation.

Module - IV:

File Systems: A Simple file system – General model of a file system – Symbolic file system – Access control verification – Logical file system – Physical file system – Allocation strategy module – Device strategy module, I/O initiators, Device handlers – Disk scheduling, Design of IO systems, File Management.

Introduction to Unix and Unix commands. Introduction to sed, awk, and grep family.


Text Books:
  1. Siberschatzx & Galvin, Operating Systems Concepts, Addison – Wesley.
  2. Tanenbaum, Modern Operating System, Pearson Education.

MGT3003 - Financial and Management Accounting

Module – I
Accounting Information (10 Hours)
Concepts, Conventions and Standards. Preparation of Journals, Ledgers, Trial Balance and Project & Loss Account and Balance sheet of a concern. Uses of Accounting Information.

Module – II
Accounting Relation to the Companies: (5 Hours)
Sources of Capital, Types of Share Capital, Accounting for issue, allotment of Shares and Debentures, Forfeiture of Shares and Issue of Bonus Shares.

Module – III
Working Capital: (5 Hours)
Estimation methods, determinants of Working Capital, Working Capital Financing.

Module - IV
Preparation of Financial Statements: (10 Hours)
Ratio Analysis (Liquidity, Leverage and profitability ratios) Funds Flow and Cash Flow Analysis
Recommended Text Books:
  1. Jain & Narang: Financial Accounting, Kalyani Publishers.
  2. Maheswari, S. N. Management Accounting, Sultan Chand & Sons .
Reference Books:
  1. Bhattacharjee & Dearden; Accounting for the Management Text & Cases, Vikas.
  2. R. Narayanna: Financial Accounting, PHI.
  3. A. Mukherjee, M. Hanif, Modern Accountancy; Tata McGraw Hill.

MGT3002 - Management Information Systems

Module - I
Fundamental of Information Systems, Systems approach to problem solving, Developing is solutions.

Module - II
Corporate databases & database management, Data Organisation, Data Models, Data security & Information quality.

Module - III
Transaction Processing Systems, Executive information Systems, Decision Support Systems, Expert Systems, Information Systems in marketing, manufacturing, HRM, Accounting and Finance.

Module - IV
Information Resource Management, planning implementating & Controlling Information Systems, Computer crime, Ethics & Society.

Text Books:
  1. Brein James O. – Management Information Systems.
  2. Murdick & Ross – Information System for Modern Management.
  3. Parker C. S. – Management Information Systems – Strategy and Action.
  4. Aktas A. Ziya – Structured Analysis and Design of Information Systems.

PCS 3003 - Relational Database Management Systems

Module - I
Database System Architecture – Data Abstraction, Data Independence, Data Definitions and Data Manipulation Languages.
Data models – Entity Relationship (ER), Mapping ER Model to Relational Model, Network. Relational and Object Oriented Data Model, Integrity Constraints and Data Manipulation Operations.

Module - II
Relations Query Languages, Relational Algebra, Tuple and Domain Relational Calculus, SQL and QBE.
Relational Database Design: Domain and Data dependency, Armstrong’s Axioms, Normal Forms, Dependency Preservation, Lossless design, Comparison of Oracle & DB2.

Module - III
Query Processing and Optimization: Evaluation of Relational Algebra Expressions, Query Equivalence, Join strategies, Query Optimization Algorithms.

Module - IV
Storage Strategies: Indices, B-Trees, Hashing, Transaction processing: Recovery and Concurrency Control, Locking and Time stamp based Schedulers, Multiversion and Optimistic Concurrency Control Schemes.
Advanced topics: Object-Oriented and Object Relational databases. Logical Databases, Web Databases, Distributed Databases, Data Warehouse and Data Mining.

Text Books :
  1. Elmaski & Navathe – Fundamentals of Database Systems, 4th Edition, Pearson Education.
  2. C. J. Date – An Introduction to Database System, Pearson Education.
  3. Bipin Desai – An Introduction to Database System, Galgotia Publication.

Practicals

PMC3901 - Operating System Laboratory

Shell programming, Sed, awk, grep
Process creation and execution, interprocess communication
Process signaling
File system mounting, disk organization
Semafor, creation and management of shared memory among processes

PMC3902 - RDBMS Laboratory

(10 Classes for 10 Different Programs)
  1. Use of SQL syntax: Insertion, Deletion, Join, Updation using SQL. (1 Class)
  2. Program segments in embedded SQL using C as host language to find average grade point of a student, etc. (1 Class)
  3. Program for Log based data recovery technique. (1 Class)
  4. Program on data recovery using check point technique. (1 Class)
  5. Concurrency control problem using lock operations. (1 Class)
  6. Use of Package (ORACLE) for programming approaches (2 Classes)
  7. Use of package (DB2) for programming approaches (2 Classes)
  8. Programs on JDBC/ODBC to print employee’s / student’s information of a particular department. (1 Class)

4th Semester

Theory

PCS3006 - Programming with JAVA

Module – I :
Introduction to Java and Java programming environment.
Fundamental programming structures in Java: Data Types. Variables. Assignments and Initializations. Operators, Strings, Control Flow, Arrays, Comments.
Objects and Classes: Introduction to Object-Oriented Programming. Using Existing Classes. Building your own classes, Static Fields and Methods, Method Parameters. Object Construction. Packages. Documentation Comments. Class Design Hints.
Multi-threading, Collections, Networking, database connectivity (JDBC), remote objects and remote object invocation.

Module – II
Inheritance: Extending Classes Object: The Cosmic Superclass. The Class. Reflection. Design Hints for Inheritance. Interfaces and Inner Classes: Interfaces. Object Cloning. Inner Classes. Proxies.
Graphics Programming: Introduction to Swing. Creating a Frame. Frame Positioning. Displaying Information in a Panel. 2D Shapes. Colors. Text and Fonts. Images.
Event Handling: Basics of Event Handling. The AWT Event Hierarchy. Semantic and Low-Level Events in the AWT. Low Level Event Types. Actions. Multicasting. The Event Queue.

Module – III
User Interface components with Swing: The Model-view-Controller Design Pattern. An Introduction to Layout Management. Text Input. Making Choices. Menus. Sophisticated Layout Management. Dialog Boxes.
Deploying Applets and Applications: Applets Basics. The Applet HTML Tags and Attributes. Multimedia. The Applet Context. JAR Files. Packaging Applications. Java Web Start. Storing Application Preference.

Module - IV:
Exceptions and Debugging: Dealing with Errors. Catching Exceptions. Some Tips on Using Exceptions. Logging. Assertions. Debugging Techniques. Using a Debugger.
Streams and Files: Streams. The Complete Stream Zoo. Zip File Streams. Putting Streams to Use. Object Streams. File Management. New I/O. Regular Expressions.
Java beans, Java Security, Internationalization.

Text Books:
  1. Balguruswami, Programming with Java, TMH.
  2. Arnold Ken et al, The Java Programming Language, Pearson Education.

PCS3004 - Software Engineering & OOAD

Module – I :
Introductory concepts: Introduction, definition, objectives, Life Cycle – Requirements analysis and specification.
Design and Analysis: Cohension and coupling, Data flow oriented Design: Transform centered design, Transaction centered design. Analysis of specific systems like Inventory control, Reservation system.

Module – II
Object – oriented Design: Object modeling using UML, use case diagram, class diagram, interaction diagrams: sequence and collaboration diagrams, state-chart diagrams, activity diagram, unified development process.

Module – III
Implementing and Testing: Programming language characteristics, fundamentals, languages, classes, coding style efficiency. Testing: Objectives, black box and white box testing, various testing strategies, Art of debugging.
Maintenance, Reliability and Availability: Maintenance: Characteristics, controlling factors, maintenance tasks, side effects, preventive maintenance – Re Engineering – Reverse Engineering – configuration management – Maintenance tools and techniques. Reliability: Concepts, Errors, Faults, Repair and availability, reliability and availability models, Recent trends and developments.

Module - IV:
Software quality: SEI CMM and ISO-9001. Software reliability and fault-tolerance, software project planning, monitoring, and control. Computer-aided software engineering (CASE), Component model of software development, Software reuse.

Text Books:
  1. Mall Rajib, Fundamentals of Software Engineering, PHI.
  2. Pressman, Software Engineering Practitioner’s Approach, TMH .

MGT3004 - Human Resource Management

Module – I
Introduction to Human Resource Management : (4 Hours)
Concept, Nature and Scope of Human Resource Management. Its growth and development in India. Role and function of HR Manager.

Module – II
Human Resource Base: (8 Hours)
Human Resource Planning, Concept & objectives, Job Analysis, Recruitment, Selection Procedure, Tests and interviews Components of wages, criteria of wage fixation, wage differentials.

Module – III
Training and Development: (8 Hours)
Training of Organization: Its objectives, Process, Types of training programmes: Induction, On the job and Off the job training. Identification of Training Programmes. Evaluation of Training Programmes, Performance Appraisal.

Module - IV
Industrial Relations: (10 Hours)
Concept Values, Scope, Industrial Disputes: Concepts, Forms, and Types Causes, Procedure for settlement of disputes in India. Workers participation in Management.

Recommended Text Books:
  1. Maamoria C. B. Personnel Management, Himalayan Publishing, New Delhi.
  2. Subba Rao P. Human Resource Management Texts and Cases.
Reference Books:
  1. . Dessler Gary, Human Resource Management, PHI.
  2. Rao, V. S. P., Human Resource Management, Excel Books
  3. Gerhat & Rynes, Compensation: Theory, Evidence and Strategic Implications, Response Books.

PMC3903 - Quantitative Techniques – I

Module - I
Operations Research
Behavioural versus quantitative decision making, role of models. Linear programming, Graphical and simplex procedure, Sensitivity analysis; Transportation and Assignment problems, Application of linear; programming in business and other systems, Integer linear programming, Cutting plane algorithm and branch and bound methods. Introduction to queuing, single and multiple server models, finite population models, queuing costs and application.

Module - II
Probability & Statistics
Probability: Classical, relative frequency and axiomatic definitions of probability, addition rule and conditional probability, multiplication rule, total probability, Bayes’ Theorem, and independence.
Random Variables Discrete continuous and mixed random variables, probability mass, probability density and cumulative distribution functions, mathematical expectation, moments, moment generating function, Chebyshev’s Inequality.

Module - III
Special Distributions: Discrete uniform, Binomial, Geometric, Poisson, Exponential, Gamma, Normal distributions, Function of a Random Variable. Joint Distributions: Joint, marginal and conditional distributions, product moments, correlation, independence of random variables, bivariate normal distribution.

Text Books:
  1. Taha, Operation Research, PHI.
  2. Trivedi, Probability Statistics, PHI

Practicals

PMC3904 - Computer Graphics Laboratory

Drawing Lines, Curves, Generating Curves, surfaces and volumes in 3d. Spline curves and surfaces and line elimination Video Games and Computer Animation Java Graphics environment.


PSV3001 - Programming with Java Laboratory

Basic Java Programming (Application & Aplet)
  1. Usage of constructors.
  2. Usage of various Data Types.
  3. Usage of Method overriding.
  4. Usage of method over loading.
  5. Incorporating the concepts of inheritance.
  6. Usage of string related operation.
  7. Usage of Exception Handling.
  8. Multi-Threaded Programming.
  9. Programmes involving various methods of creating multi-threaded program.
  10. Thread communications & signals.
  11. Programmes involving Event handling in AWT.
  12. Use of various Layout Managers.
  13. Programming to carry out different types an I/O.
  14. Graphics programming in AWT/swing.
  15. Database programming in JAVA using JDBC .
      SEM3901 - Seminar

Thrid Year

5th Semester

Theory

PCS5009 Computer Networks

Module – I (10 Hours)
Overview of Data Communications and Networking Physical Layer: Analog and Digital, Analog Signals, Digital Signals, Analog versus Digital, Data Rate Limits, Transmission Impairment, More about signals. Digital Transmission: Line coding, Block coding, Sampling, Transmission mode. Analog Transmission: Modulation of Digital Data: Telephone modems, modulation of Analog Signals. Multiplexing : FDM 150, WDM 155, TDM 157 Transmission Media: Guided Media, Unguided media (wireless) Circuit switching and Telephone Networks: Circuit switching, Telephone network.

Module – II (10 Hours)
Data Link Layer: Error Detection and correction: Type of Errors, Detection, Error Correction. Data Link control and protocols: Flow and error Control, Stop-and-wait ARQ. Go-Back. N. ARQ, Selective Repeat ARQ, HDLC. Point-to-Point Access: PPP Point-to-Point Protocol, PPP Stack, Multiple Access: Random Access, Controlled Access, Channelization. Local area Network: Ethernet Traditional Ethernet, Fast Ethernet, Gigabit Ethernet. Wireless LANs: IEEE 802.11, Bluetooth virtual circuit: Frame Relay and ATM.

Module – III (10 Hours)
Network Layer; Host to Host Delivery: Internetworking, addressing and Routing. Network Layer Protocol: ARP, IPVA, ICMP, IPV6 and ICMPR6 Transport Layer; Process to process Delivery: UDP; TCP congestion control and Quality of service.

Module – IV (8 Hours) Application Layer: Client Server Model, Socket Interface Domain Name System (DNS): Electronic Mail (SMTP) and file transfer (FTP) HTTP and WWW Security: Cryptography, Message security, User Authentication

Text Books :
  1. Data Communications and Networking : Third Edition, Behrouz A. Forouzan Tata McGraw Hill Publishing Company Limited.
Reference Books:
  1. Computer Networks: Third Edition, A system Approach, Larry L/ Peterson and Bruce S. Davie ELSEVIER.
  2. Computer Networks, A. S. Tannenbaum PHI.

PEE5001 Computer Security

Module – I (10 Hours)
The Security Problem in Computing: The meaning of computer Security, Computer Criminals, Methods of Defense, Elementary Cryptography: Substitution Ciphers, Transpositions, Making “Good” Encryption Algorithms, The Data Encryption Standard, The AES Encryption Algorithm, Public Key Encryptions, Uses of Encryption.

Module – II (10 Hours)
Program Security: Secure Programs, Nonmalicious Program Errors, viruses and other malicious code, Targeted Malicious code, controls Against Program Threats, Protection in General –Purpose operating system protected objects and methods of protection memory and addmens protection, File protection Mechanisms, User Authentication Designing Trusted O.S.: Security policies, Models of security, trusted O. S. design, Assurance in trusted OS. Implementation examples.

Module – III (10 Hours)
Database Security: Security requirements, Reliability and integrity, Sensitime data, Inference, multilevel database, proposals for multilevel security. Security in Network: Threats in Network, Network Security Controls, Firewalls, Intrusion Detection Systems, Secure E-mail.

Module – IV (8 Hours)
Administering Security: Security Planning, Risk Analysis, Organizational Security policies, Physical Security. Legal Privacy and Ethical Issues in Computer Security. Protecting Programs and data, Information and the law, Rights of Employees and Employers, Software failures, Computer Crime, Praia, Ethical issues in Computer Security, Case Studies of Ethics.

Text Books :
  1. Security in Computing Third Edition Charles P. Pfleeger, Shari Lawrence Pfleeger. PHI.

PCS5010 Enterprise Web-Based computing with JAVA

Module – I (10 Hours)
Designing web pages: HTML, Forms, CGI Scripts and Clickable Maps

Module – II (10 Hours)
Designing web application: JAVA Applets, JAVA Scripts, JAVA serviets

Module – III (10 Hours)
JAVA Server pages, JAVA server faces, Struts, Perl, DHTML, XML Web based application architecture: JSP model 1, MVC Architecture, Struts

Module – IV (10 Hours)
J2EE 1.3 including RMI, EJB, JDBC, SERVLETS, JNDI, JTA, JAAS, JMS JAVA Main etc.

Text Books :
  1. Web Technologies – I & II by Ivan Byross
  2. Java Server Programming J2EE 1.3 Edition.

PCS5008 Internet Technology

Module – 1 (10 Hours)
Internet architecture: Internet overview, evolution of internet. Internet components – Local Area Networks, Access Networks, Core Networks, Routers, Transmission infrastructure, ISPs Packet switching fundamentals – packet Switching versus Circuit Switching. Connectionless packet switching (IP). Internet Standards: Standards bodies and the standards process, IETF, ITU, IEEE, ATM Forum.

Module – 2 (10 Hours)
Networking protocols Network Protocol Overview: What are networking protocols, and what do they do? Key protocol architectures. IP Network overview: What are the key IP network capabilities? How will these capabilities adapt to future networks? IP protocol operation. IP addressing: IP address classes. Why are IP addresses under pressure, and what fixes are in place? TCP Fundamentals: How does TCP shield end users from IP network problems? TCP protocol operation and capabilities. TCP/IP: routing.

Module – 3 (10 hours)
Access Methods and Internet working: Access Network Architectures: Access network characteristics. Differences between Access Networks, Local Area Networks and Wide Area Networks. Access Technologies: Why there is an upper limit on modem speeds. Voice grade modems, ADSL, Cable Modems, Frame Relay. DNS: Domain Names. Resolving Domain Names to IP addresses (DNS operation). Registering Domain Names and solving Domain Name disputes. Routing: How the key IP routing protocols (OSPF and BGP4) operate. Implications of future Internet growth on routing protocol performance.

Module – 4(10 Hours)
Internet application: FTP, Telnet, Email, Chat. World Wide Web: HTTP protocol. Search Engines E – Commerce and Security issues including symmetric and asymmetric key, encryption and digital signature, authentication. Emerging trends, Internet telephony, virtual reality over the web, etc. Intranet and extranet, firewall.

Text Books :
  1. Data & Computer Communications, By William Stallings
  2. Computer Networks, A system approach By Larry L. Peterson, Bruce S. Davie
  3. Internetworking with TCP/IP, Principles, Protocols and Architecture, By Douglas E. Corner.

PMC5905 Quantitative Techniques – II

Module – 1 (10 Hours)
Inventory Concepts: The technique of Simulation, Major application areas, concept of a System, Environment, Continuous and discrete systems, systems modeling types of models progress of a Simulation Study, Monte Carlo Method, Comparison of Simulation and Analytical Methods. Numerical Computation technique for discrete and continuous models, Continuous System Simulation.

Module – II (10 Hours)
Probability Concepts in Simulation: Stochastic variables, Discrete and Continuous Probability Functions, Numerical evaluation of continuous probability functions, continuous uniformaly distributed random numbers, Random Number Generators – Linear congruential Generator, Mid square Method, Multiplicative Congruential generator, rejection Method, Testing of random Numbers, Generation of Stochastic variates, Arrival patterns Service times.

Module – III (10 Hours)
Discrete System Simulation and GPSS: Discrete Events, Representation of Time, Generation of arrival patters, fixed time step versus next event simulation, Simulation of a Telephone System, delayed calls. Introduction to GPSS: Creating and moving transactions, queues, facilities and storages, gathering statistics, conditional transfers, program control statements, priorities and parameters, standard numerical attributes, functions, gates, logic switches and tests, Variables, Select and Count.

Module – IV (10 Hours)
Simulation Languages and Practical Systems: Continues and discrete systems languages, factors in the selection of discrete system simulation languages. Computer model of queuing, inventory and scheduling systems. Design and Evaluation of simulation Experiments: Length of simulation runs, validation, variance reduction techniques, experimental layout, analysis of simulation output, Recent trends and developments.

Text Books :
  1. System Simulation – Geoffrey Gordon, 2nd edition, PHI
  2. System Simulation with digital computer – Narsingh Deo, PHI
Reference Books:
  1. Simulation, Modeling & Analysis – Averill M. Law & W. David Kelton, TMH.
  2. Discrete Event System Simulation – Banks, John, S. Carson, Barry L. Nelson, David M. Nicol, PHI.

Practicals

PSV3905 Enterprise Web Based Computing With JAVA

  1. Web page designing using HTML (Table, Forms, Frameset, clickable map, images, list etc) DHTML.
  2. Client side scripting through Java Script (simple Script, Java Script object, Model working with properties and methods, event handling, Form validation etc.)
  3. Server side scripting through Perl, IServlet, JSP (Simple Server Side Programming).

PMC3906 Network Programming Using Socket (C/ JAVA)

  1. Connection oriented socket (TCP)
  2. Connection less socket (UDP)
  3. Socket system calls: Bind (), Send (), Listen (), Send to (), Recv (), Recvform (), Accept (), etc.
Examples: Echo server & client using TCP & UDP Connect Server client using TCP & UDP Literative Server client using TCP & UDP File transfer client using TCP & UDP
      CVV3901 Comprehensive Viva-Voce

6th Semester

Practicals
      Project Work