This action might not be possible to undo. Are you sure you want to continue?
(Established u/s 3 of the UGC Act, 1956 vide Notification No.F.9-15/95-U-3 of the Govt. of India)
‘A’ Grade Accreditation by NAAC
Social Transformation Through Dynamic Education...
SCHOOL OF DISTANCE EDUCATION
PROGRAMME GUIDE OF MASTER OF COMPUTER APPLICATION (M.C.A.)
BHARATI VIDYAPEETH UNIVERSITY SCHOOL OF DISTANCE EDUCATION, PUNE MASTER OF COMPUTER APPLICATION (M.C.A.)
Objective: The objective of the programme shall be to develop youths to work in fields of Computer applications in various sectors together with Internet technologies, Ebusiness applications etc. The MCA Programme is focused on exposing students to business application areas. Duration : 3 years; divided into 6 Semesters. Structure : The list of Courses prescribed for study and examination is as given below. SEMESTER-I Subject Code 101. 102. 103. 104. 105. 106. 107. Subject Code 301. 302. 303. 304. 305. 306. 307. Subject Name Elementary Algorithmics Computer Organization and Architecture Procedure Oriented Programming Introduction to Management Functions Mathematical Foundation Practical (Information Technology Laboratory) Minor Software Project-I SEMESTER-III Subject Name Software Engineering Computer Communication Networks Object Oriented Programming Communication and Organization Behaviour Decision Technology Practical (Database Design, Implementation) Minor Software Project-III Subject Code 401. 402. 403. 404. 405. 406. 407. Subject Code 201. 202. 203. 204. 205. 206. 207. SEMESTER-II Subject Name Data Structures Operating Systems Data Base Management Theory Accounting and Management Control Probability and Combinatories Practical (Windows Programming Laboratory) Minor Software Project-II SEMESTER-IV Subject Name UML and Design Patterns Unix and Linux Internals I.T.Elective-I I.T.Elective-II BM Elective-I Practical (Internet Programming) Minor Software Project-IV
SEMESTER-V Subject Code 501. 502. 503. 504. 505. 506. 507. Subject Name Software Project Management Artificial Intelligence and Applications I.T.Elective-III I.T.Elective-IV BM Elective-II Practical (Advanced Internet Programming) Minor Software Project-IV Subject Code 601. 602. 603. 604.
SEMESTER-VI Subject Name Major Software Project Trends in Information Technology (Term paper) Comprehensive Examination (Objective Type) Comprehensive Examination (Conventional Type) -
I.T.Elective-I a) b) c) Theory of Automata Data Warehousing & Data Mining Embedded Systems Concepts & Modeling I.T.Elective-III a) b) c) d) Design of Language Processors Computer Graphics & Multimedia Simulation Modeling Embedded Systems interfacing & Embedded Communication Systems a) b) c) d) a) b) c) I.T.Elective-II Programming with STL Database Management with SQL Server Embedded Systems Design & Programming I.T.Elective-IV Programming with MFC NET Technology Assembly Language Programming Embedded Systems Programming using High Level Language
BM ELECTIVE DETAILS
BM Elective-I a) b) Marketing management Managerial Economics a) b) c) BM Elective-II Knowledge Management Business Finance Design and Implementation of Ecommerce Application
Standard of Passing :
In order to pass the course, or Examination Head a candidate will have to obtain minimum 40% marks and to pass examination, 50% marks in aggregate for the entire examination.
Rules of A.T.K.T. :
i) A candidate is allowed to keep term for M.C.A. Part-II, Sem-III if he/she fails in not more than 5 subjects/ courses of Sem-I & Sem-II examination together. ii) A candidate is allowed to keep term for M.C.A. Sem-III, Sem-V he/she fails in not more than 5 subjects/ courses of Sem-III & Sem-IV examination together and has no backing of M.C.A. Part-I (Sem-I and Sem-II) examination. iii) A candidate is allowed to keep term for Sem-II, Sem-IV & Sem-VI irrespective of passing in my subject/ course of Sem-I, Sem-III and Sem-V examination.
Award of Class :
The award of class will be based on the marks obtained by students in M.C.A. Part-I, M.C.A. Part-II, M.C.A. Part-III examinations taken together (i.e. out of 3200 marks) Aggregate percentage of marks 70% & above 60% & above but less than 70% 55% & above but less than 60% 50% & above but less than 55% 40% & above but less than 50% Less than 40% First Class Higher Second Class Second Class Pass Class Fail Class First Class with Distinction
If the candidate fails to secure 50% marks in aggregate in a examination, the candidate can also reappear in paper(s) of his/ her choice in which he/ she obtained 40% marks.
ELIGIBILITY FOR ADMISSION TO THIS COURSE :
Admission to the course is open to any graduate (10+2+3) of any recognized university satisfying the following conditions. i) The candidate should have secured at least 45% (40% for SC/ST) in aggregate at graduate level university examination. ii) The knowledge of mathematics/ Statistics at XLL level or higher level is essential except for BCA, B.Sc. (Computer), BCS graduates.
MASTER OF COMPUTER APPLICATIONS (M.C.A.) M.C.A.-I (First Year)
Semester-I This is a foundation paper for almost all other papers. Problem analysis, algorithms design and algorithm representation techniques will be studied. About 30 problems will be analyzed and algorithms will be developed. Concepts of algorithm efficiency will be introduced. Emphasis will be given to Pseudo codes, flowcharts and tracing of algorithms. Student should be able to identify and use sequential, selection and iteration structures with ease. 1. Concepts of Problems, Procedure and Algorithm, Algorithm Representation through Pseudo Code and Flow-Charts. Tracing of Algorithms. Concepts of a program and structure of procedure oriented languages. 2. Problem Analysis and Design of Algorithms for problems such as (1) Swapping (2) Counting (3) Finding the Sum, Product, maximum, minimum of a finite list of numbers, and (4) Simple variations of the above problem realization that, there may be alternative algorithm and that one algorithm may be better (in some sense) than the other. 3. Problem Analysis Design of Algorithms for problems such as (1) Evaluation of a polynomial (2) Sum of first n factorials (3) Finding the nth term of a Fibonacci sequence, (4) Finding the largest and second largest of a finite list, (5) Evaluating in finite series and variations of these problems, (6) Determining nth root of a number. 4. Introduction to recursive algorithms and their tracing. Applications to: (1) Computation of a factorial, sum, Fibonacci terms etc. (2) Base conversion (3) Reversing a string and checking for palindrome property (4) To compute GCD. Efficient algorithms for power function evaluation, Fibonacci terms. 5. Concept of array and problems that involve array manipulation (1) removing the duplicates (2) Partitioning of an array, (3) Listing of prime numbers, (4) Finding the prime factor of a numbers (5) Printing a Histogram. 6. The problem of search and merge, linear search, Binary search and Hash search algorithm. The problem of Sorting: Selection, Insertion, Bubble, Quick and Merge Sort algorithms.
computer information. Serial communication. G. memory management hardware. Data Representation: Data types. microprogramming examples. space complexity. Computer System Architecture: M. Illustration with simple examples. Associative and cache memories. fixed point and floating point representation. : How to Solve it by a Computer. Division algorithms. PHI (1993). decimal arithmetic units. Register transfer and micro processions. 3. CPU-control register organization. virtual memory. decimal arithmetic operations. performance measurements. instruction formats. Algorithms and Applications in C++ (Ch II). multiplexes. Rules Simplifications. Design of basic computers. Text Book: 1. Integrated circuits. 5. Digital Logic Circuit and Digital Components: Digital Computers. * * * 102. Priority interrupt. subtraction. Program performance. nodes of data transfer. 2. stack organization. Memory Organization – Hierarchy. IOP. DMA. floating point arithmetic operations. 4. decoders. address reducing. Text Books: 1. Asynchronous data transfer. Logic gates Boolean algebra. CICS and RISC characteristics. Sartaj Sahni: Data Structure. I/O instructions and interrupts. Flip-flops and sequential circuits. Programming with 8085. instruction codes. Input Output interface. Practical complexities. registers. addressing modes. asymptotic notation. Morris Mano. memory reference instruction. complements. 6 . Computer Organization and Architecture 1. instruction cycle. computer registers. Input/ Output organization: Peripheral devices. Combinational Circuits. multiplication algorithms. shift registers. design of control unit. 2. data transfer and manipulation. program control. simple 8086 programs. base conversion algorithms. Micro-programmed control: Control memory. time complexity.7. Dromey R. binary counters and memory units.
relational expressions. with emphasis on using functions and files.. Procedure Oriented Programming This is a first course on Computer Language. block of statements. arguments to subprograms and return values. assignment and arithmetic statements. simple and compound statements. reserved and userdefined words. 3. Procedural elements in ‘C’: Character set. Iteration structures – for. assignment statement.else.. data types and type declarations. Emphasis is on the basic 8 constructs that appear in any procedure-oriented language. precedence and associative properties. algorithm. while. algorithm representation – Pseudo code and flowchart. continue and 7 . statements and statement types-executables statements.. algorithm design. computer languages. constants and variables. programming. and Radhakrishnan t. Introduction to Digital Design: Raja Raman V. tracing an algorithm. do. language hierarchies..else if. data types. Concepts of procedure oriented languages: Character set. The language will be covered exhaustively.. if. * * * 103. 1. debugging and documentation down approach to algorithm design. PHI. arithmetic statements – arithmetic operators. Computer Organization and Design: Pal Choudary P. selection and iteration structures. structure of a ‘C’ program – header files and include command..Reference Books: 1. Good style.. Subprograms – functions and procedures.. input statements. identification of sequential. conditional operator – switch.. case statement. Logical operators. emphasis on semantics is the important criteria in writing programs. PHI (1997) 3. 2. while statements. program. Transfer of control statements – implicity and explicit transfers. coding. PHI (1994). testing. interpreters and compliers.. generation of test data. if. W. Simple and compound statements. problem analysis. statements. 2.. Concepts of problem. output statements. arithmetic expression. reserved words. main function. comments and type declarations. simple selection structure – relational operators.. Computer Organization and Architecture: Stallings.... programming stages – analysis.. if. Implementing the algorithms in C language is the goal. Declarative statements – comments. logical expressions. Libraries.
* * * 8 . function type and function signature. Scheldt. Balaguruswami Reference Books: 1. dynamic memory management. 2. arrays – one two and higher dimensions.break statements. nested structures. The Art of C by H. Kochan. unions and enumerated data types. Text Books: 1. 6. Keyword. Files: Internal and external. index sequential and random files. void return type. 3. C Programming by e. pointer to function as arguments. structures with array components. dynamic memory management. exception handling. Boro to code in C by H. arrays as arguments. file maintenance sequential. procedure oriented programming with C++. function definition. Use of const. 4. C Programming by Kerninghan and Ritchic – 2nd ed. Programming in C by S. 4. Schildt. Derived data types: Pointers. dynamic arrays. User defined functions. structure as arguments. 5. variable scope and storage classes. recursive functions. Functions with pointer arguments. Pre-processor commands define and macros. Let us C by Yashwant Kanetkar 2. return types. user defined data types – structures. function prototypes. Use of string and math libraries. Unconditional Branching – labels and go to statement. nested loops. character arrays and operations on strings. recursive structures. and function call: Argument types. Differences between procedural elements of C++ and ANSI C. arrow and dot operations arrays of structures. variable number of arguments and command line arguments.
quality circles). introduction to project time calculations through PERT/CPM). strategies for growth and diversification. These marketing mix elements consist of product policy and design. short term scheduling of job shop. Materials Management (introduction to materials management. setting production rate in continuous production systems. Prentice Hall of India. financial planning): estimation and management of working capital (opening cycle concept. Marketing: Understand the concept of marketing mix. inventory. cash and accounts payables. Training and Information Systems. Appraisal. cash flow forecasting under uncertainty. Management of Supply Chain.D. 2.: “Organization and Management”. scope and its relationship with other functions). this paper is an overview of all functional areas of management namely. ratio. Manufacturing: . Introduction to Management Functions This is a first paper in a series of four compulsory and two elective papers on Business Management. R. and advertising and sales promotion. Reference Books: 1. 4th ed. choice of marketing intermediaries. Marketing. activity scheduling in projects. Some of these topics will be taught elaborately in subsequent papers. Massie: “Essentials of Management”. Finance: Finance function (concept. methods of physical distribution. risk-return trade-of): financial forecasting (Performa income statement and balance sheet. accounts receivables. pricing. evaluation of corporate strategy. Particulars. quality management (quality concept and planning. and Strategy. tools of financial analysis (funds and cash flow analysis. 5.104. Agarwal. analysis. 1986. Manufacturing. Strategy: Firm and its Environment: strategies and resources. 2. In these papers. use of personal selling. and procurement of materials). the domain specific knowledge from which most of the Computer applications arise will be imparted. systems and procedures for inventory management planning. 4. standardization. working capital requirements). * * * 9 . industry structure and analysis. production cycles. Tata McGraw Hill. 1996. HRD. marketing research and marketing organization. process of strategic planning. 1. HRD: Selection. Finance.Operations Planning and Control (aggregate planning. multiple product batch. 3.
105.: “Discrete Mathematical Structures for Computer Science”. Binary trees: Sequential and linked list representation of trees. normal forms. 2-trees. Kolman B. Function one-to-one. Reference Books: 1.” McGraw Hill. “Concepts in Discrete Mathematics”. reduction to normal forms. application to algorithm verification. 3. Relations and functions: Product sets and relations. onto. About half the paper covers all aspects of graph theory. Sahni S. The topics covered include sets. * * * 10 .: “Discrete Mathematical Structures for Computer Science. their computer representations and manipulation. 1981. Mathematical Foundations The purpose of this paper is to teach mathematical concepts necessary to understand other topics. J. P. tree traversal algorithm. 3. equivalence relations and partitions. PHT (UNITS 2 & 3). Binary search tree and heaps. Graph Theory: Graph terminology and graph representations.. graph coloring. Mathematical Logic: Statements and connections. Algorithm for manipulation of function and relations. matrix and diagram representation of relations. 1987.” Prentice Hall. permutation differentiation and integration of a function. representation and manipulation of finite sets in computer. Automatic theorem proving.. 1. 2. application to regular languages. inference theory of statement and predicate calculus. 2. properties of relations. and Busby R. Tremblay. and Busby R. relations and functions. “Discrete Mathematical Structures with Applications to Computer Sciences. application to Huffman codes. Induction and recursion. Mathematical logic and Graph Theory. et al. Warshal algorithm. 5. Seal Theory: Basic concepts sets. Elementary concepts of differentiation and Integration will also be reviewed. Elementary graph algorithm. USA. Kolman B. insertion and deletion algorithm into binary trees. Textbooks: 1. classes properties.. 4. Camelot Publisher. 1987. graph representation and graph a algorithms. Directed graph-topological sorting algorithm. inverse function.
Minor Software Project A Minor Software Project is little more than a practical assignment. operating system concepts. detailed study of DOS and Windows. 5. Computer definition. history and evolution of Computers. Information Technology Laboratory In this paper components. memory unit and CPU. mouse. Communication networks and Internet are also covered. MAN. WAN. 2. scanner. multiprogramming real-time. communication media. concept of a file allocation table.106. * * * 107. and hashed organization. Networking-Data communication concepts. Elementary digital electronics. Extranet. indexing and updating functions. Data representation and algorithms for base conversions and arithmetic operations are covered. 3. function prototyping. sorting. MS-Power point. compilers. functions of ALU. LAN. batch processing. flow-charting. media access methods. problem decomposition. The Project work should be completed in about 25 terminal hours. field I/O. This project can be done only in ‘C’ environment. their functions. Elementary concepts of software types. Topology. OCR. MICR. It is important to complete the project with quality. input/ output. plotter. block diagram. Browsers and their efficient use. 4. 1. functions of operating systems-Introduction to file management. joystick. sequential. MS-Excel). preparing the user manual and good presentation of the work as a report. loader. merging. Finally. protocols. Bar decoder. Software-types. Study of Office 2000 (MS-word. characteristics and functioning of Input Output devices are left to be covered through assignments. Operating System-types-timesharing. good user interface. Intranet. Files-types and operations. keyboard. addressing modes and assembly language constructs are introduced. * * * 11 . assembler. communication process. interpreter. and interactions of a task performing system are studied. OSI Layers. high-level and lowlevel languages. linker. monitor. indexed. uses. Emphasis is on Problem Analysis. printer. classifications. Internet.
Data Structures are covered in depth. binary trees. Concept of Height-Balance (AVL) Trees. Binary Tree Representation of Trees. queues. Queues as ADT. Data Structure and Representation. Binary Search. Introduction to Rebalancing Techniques (Concept only). storage structure. 4. by Tanenbaum. Application of Double Linked Lists in Dynamic Management. Hashing Techniques. by Seymore Lipschutz. 2. 1. Searching: Linear Search. Preorder (both recursive and non-recursive versions). Data Structures and Algorithms This is another functional paper that complements the paper on Elementary Algorithms. 2. Basic Terminology. 12 . Implementation of arrays. 8. Abstract Data Structures. Concept of Data type. Data structure Using ‘C’. implementation in a language are clearly studied in this paper. Application of Queues to Pre-Emptive Scheduling in Transaction Processing. Push and Pop Operations. 7. A program has two components the first one is data structure and the second one is algorithm. Insertion and Deletion of Node in Dynamic Binary Search Tree. Binary Search. Huffman Algorithm. Traversal of Thread-ed Binary Trees. Tree Definition and Search Algorithms. Conversion of Infix to Postfix Notation. Hash Table. Singly Linked List. trees with possible variations and their applications are taught. Single Dimensional and Multimensional. stacks. Symbol Table: Concept of Table. Data object. Doubly Linked Lists. Operations on Linked List. Trees as ADT. 9. Evaluation of Postfix Notation. Stack as ADT. 5.Semester-II 201. linked lists. Arrays as ADT. Linked List as ADT. 3. Threaded Binary Trees. Circular Queues Using Arrays. Post order. Static Tree Table. In this paper. Recursion Using Stacks (Concept only). Data Structure. Sorting: Bubble Sort. Introduction to Analysis of Data Structure and Algorithm. Concept of Generalized Link List. Quick Sort. Implementation of Queues. The arrays. 6. Depth First Search and Breadth First Search on Binary Trees. Insertion Sort. and Heap Sort. Algorithm complexity with reference to searching and sorting are introduced. Dynamic Tree Table as Binary Search Tree. Binary Tree Traversa-In order. Implementation of Stack. Textbooks: 1. The distinction between data structure. Implementations of Stacks and Queues Using Linked Lists.
* * * 202. design issues for paging systems. Types of operating systems. Weises. virtual memory. swapping. page replacement algorithms. Kruse. critical region and conditional critical region. Introduction to Data Structure an Application. 3. Input/ Output: Principles of I/O Hardware: I/O devices. 2. file system implementation. 4. device independent I/O software. 2. 5. Fundamentals of Data Structure in Pascal-by Horowitz. queuing implementation of semaphores. 4. Process: The process concept. File Systems: File systems. directories. interrupt handlers. Terminals: Terminal Hardware. I/O management will be covered. Performance evaluation. Principles of I/O software. operation system concepts and structure. device controllers. modeling-paging algorithms. deadlocks. security protection mechanisms.Reference books: 1. Scheduling algorithms. Data Structure and Program Design – by Robert L. mutual exclusion. Goals. 6. hardware sport for mutual exclusion. systems programmer’s view of processes. Introduction: Evolution of operating systems. 1. 13 . I/O software. Different views of the Operating system. Also operating system concepts such as processes and process management. Architectural concepts related to control unit memories. Operating Systems Operating System concepts are closely associated with architecture. classical problems in concurrent programming. Hence. memory management. Disks: Clocks: Clock hardware. semaphores. monitors. Data Structure an Advance Approach Using ‘C’ – by Esakv. direct memory access. Memory management: Memory management without swapping or paging. 3. memory mapped terminals. File systems. I/O devices will be covered. User space I/O software. messages. in this paper both would be covered together alternating between architecture and operating system concepts. Inter-process Communication and Synchronization: The need for inter-process synchronization. Sahani. The operating system services for process management. device drivers. Inter process communication.by Trambley Scrioson. segmentation.
* * * 203. trends. L. networking and relational database model and their relative advantages and disadvantages. introduction E-R diagram. type of the models. data base users. database architecture and data independence. 1995. 1. Ltd. 2. A. Data Modeling Techniques: Basic concepts. Structured Query Language (SQL) is introduced. database languages and interfaces. Introduction: . feedback loops.: “An introduction to Operating Systems”. Computer Science Series. comparisons Relational Database 14 . bottlenecks and saturation. Process and Processors in Distributed Systems: Threads. Textbooks: Peterson J. Reference Books: 1. Distributed Files Systems: Design. life cycle of DBMS applications. normalization. : “Operating Systems – Concepts and Design”. 1989. McGraw International Edition. demoralization transaction processing.. role of DBMS. and other topics are covered in depth. implementation. products. system models. Addison Wesley Publishing Company. Database Management Theory In this paper file structures are taught Database Management theory – design principles. 1984. database abstraction schemas and instances. 3. Monitoring and Evaluation: Introduction. 2.S. Abraham Silberschatz: “Operating System Concepts”. important trends affecting performance issues. Prentice Hall of India Pvt. evaluation techniques.Basic concepts. Performance Measurement. why performance monitoring and evaluation are needed performance measures. processor allocation. advantages of DBMS over file processing system. Deitel. 7. Database design and implementation is illustrated with MS-Access. database models. Tanenbaum. hierarchical. Milenkovic M. concurrency control. scheduling.memory mapped terminals.M. relational Algebra. 1992. Addison Wesley Publishing Company.: “Modern Operating Systems”. I/O software. relational calculus. H.
Concept of Domain Tuple. Drop a Table. Modify a Table. Select. Security and Privacy. 8. Sum. Constraints SQL commands. Sub-queries Views. comparison between HDB-NDB-RDB. 6. Update. 7. Normalization: Advantages and disadvantages of Normalization. Creation of Tables. Reference books: 1. Having. Insert. Relational data model and Relational Algebra: Relational Model Concepts. Checkpoint and Shadow Paging. Textbooks: 1. Concepts Object Oriented Database Management Systems. 3. Delete. integration of expert systems in database. 9. Other Clauses-Group By. Time stamps. In-Exits. Joins. Order By. Scheduling and MVT. Aggregate Functions. 3. Computer Database Organizations by James Martin. * * * 15 . cardinality. loss less join and dependency preserving decomposition. Recovery Mechanism: Recovery from various problems of volatiles and nonvolatiles storage devices: Concept-properties-states of Transaction. 10. Predicates. Data Manipulation Commands. Alter a Table. Distributed Database: concepts. Introduction to mechanisms such as-Log. Relational Database Design for Micro Computers Application – Prentice Hall – Jackson. Concurrency Control: Problems of concurrent Transactions: Control Mechanism such as Locks. 2. 5. Union. Between-Null. Mx. Count. 2.Introduction: Codd’s 12 Rules. Knowledge database systems. Database Distributions Techniques. Principals of Database Management by James Martin. Avg. Comparison-Like. normalization form on primary keys. Create/ Drop an Index. Database Management Systems by Nawathe. Min. functional dependencies and normalization of relational database. Generality.Create/ Drop a Database. Optimistic. 4. INF-2NF-2NF-BCNF rules with examples. Database System Concept by Korth.
New Delhi. 4. Control of Service Organizations. 3. Basic Cost Concepts: (introduction. Cost Analysis for Managerial Decisions (direct costing. evaluation of cost control systems). Performance Measures. Control Dynamics. Basic Accounting. New Delhi. elements of budgeting. performances appraisal. Basic Accounting and conventions underlying preparation of Financial Statements (Balance Sheet highlighting accounting equation. Control of Multinational Companies. losses such as bad debts. concepts of Management control systems will be covered. Welch. inventory valuation). issues such as provisions for bad debts tax. “Introduction to Management Accounting”.. cost centers). Income Measurement (revenue. Hilton and Gordon (5th ed. classification effect. Control of Non-Profit Organizations. dividends.). and Key Variables.). basic concepts. labour. cost classification. 2.K. profit and loss statement. Prentice Hall of India Pvt. “The Essence of Financial Accounting”. New Delhi. and Deardem John. sales and profit).. pricing. Organizational Relationships in Control. Introduction to Management Control Systems. 2. accounting process. Ltd. break-even analysis. Reporting Systems. control of Projects. Strategic and Long-Range Planning. Goals. Reference Books: 1. cost of assets. control of manufacturing and manufacturing expenses. trial balance and financial statements. Understanding published annual accounts including funds flow statement. Prentice Hall of India Pvt. missing information.204. pricing-joint costs. overhead. 1. Ltd. Standard Cost Accounting (budgeting and control. Strategies. recognition and matching costs and revenues. allocation. Sundem and Selto (9th ed. Accounting and Management Control In this paper. relevant fixed costs and sunk costs) Cost Analysis for Control (standard costing. Management and Control. make or buy. variances. Intangible Assets Accounting. 3. Responsibility Centres and Transfer Prince. Bhattacharya S. Horngren. “Accounting for Management”. Prentice Hall of India Pvt. Management by Objectives. “Budgeting: Profit Planning and Control”. Ltd. relevant costs. basic accounts. Depreciation Accounting. Prentice Hall of India. material.). Investment Centres. rentals etc. appointment and absorption. 16 . Budgeting and Control. Chadwick.
Introduction to probability: Random experiment. Bays Theorem and Independence of events. Binomial and multinomial theorems. Binomial. Conditional Probability Multiplication rule. 4. Rule. Exponential. Recurrence relations. Chapter 1. solution of recurrence relations using generating functions. Empirical (Relative frequency. Algebraic solutions of linear recurrence relation with constant coefficients. Erlong. Hyper Geometric. 1. Algorithms to conduct random experiments and to determine empirical probabilities. Negative Binomial. 2. Definition and properties of Standard Discrete and continuous distributions-Bernoulli. Expectation and variance. mathematical (classical) definition of probability. Probability and Combinatories In this paper probability theory essential for further applications in Computer Science is covered. Generalized Permutations and Combinations. 3. Axiomatic definition of probability and consequences of the axioms. Pigeonhole principles. Probability density function. Generating function and Recurrence Relation: Ordinary and exponential generating functions. Discrete Uniform. Poisson. and Normal Probability generating function of discrete distributions.205. Geometric. * * * 17 . Partitions of positive integers. derangements. K. concept of subjective probability. Distribution function. sample spaces and classification of sample spaces. Textbooks: Theory and Problems of Combinatories: V. 5. Simulation: Generation of Pseudo Random Numbers and Generation of random variates from standard distributions given in Unit-3 above. Uniform. inverse of permutation. sequence and selections the inclusion and exclusion principle. Also statistics and elementary numerical methods will be taught. Application of the above concepts. Product Rule and generalizations. statistical) Definition of a Probability. Beta. permutations and combinations. Random Variables: Definition. Balakrishnan (Schaum Outline Series). composition of permutations. Simple Application of Simulation. classification. algorithm to enumerate permutation. 2 McGraw Hill Publications. Combinatories : Sum. Total Probability Theorem.
Long (long integer). Saving Project. Microsoft Windows Common Controls3 6. Programming with Objects (Creating objects of a user defined class and using them on the form) 10. SQL Queries in VB. Visual Basic Controls: Label and Textbook Controls. Variant (with numbers. ADO (with control and code). Data type conversion functions. Directory List Box and File Box Controls. Drive List Box. Common Dialog Box Microsoft Common Dialog Control 6. Data Grid Control. Introduction to visual Basic : Event Driven Programming. 8. Menus: Creating Menus. Date Functions. Decimal. For Statement. 3. Data Form Wizard. 18 . Working with Functions: String Functions. Windows Programming Laboratory This is a Practical oriented paper. Toolbox. Object. Running Applications. Adding Active-X controls to a Project. Accessing Data: Reading and Writing Files. Currency (scaled integer). Adding Code to Menus. The Visual basic Environment is taught in depth. Error Handling. 1. Select case statement. User-defined (using Type). Integer. Exist Statement. Boolean. 4. 9. Adding Code and Events: Code Window. DB-Combo Box and DB-List Box. Getting Help. Formatting Controls. Single (single-precision floatingpoint). Local. String (variable-length).0) 7. Starting and Existing VB.206. Other Common Controls (Microsoft Windows Common Controls 6. Checkbox and Option Button controls. Control Statements: If and IIF statements. Constants. Properties Windows. Input box. Frame. Toolbars. concepts of Windows Programming are introduced. Tab Order. Jet DAO.0). List box and Combo Box Controls. Objects and Classes: OLE Control. After a brief introduction to Windows operating system. Understand VB Environment. Variables (All data types): Byte.0. 6. Mathematical Functions. Scope (Global. String (fixed-length). Form Layout Window. Printing Projects. Dialog Boxes: Msgbox. Static). 2. Property Pages. Date. Active-X Controls: Creating your own Active-X control. Project Explorer. 5. Do Statement. Control Arrays. Double (double-precision floating-point). Naming Conventions. Data Control. Command Button Control. Variant (with characters).
Visual basic 6. Declare statement. Project will be done in groups of not more than 4 students each.0 in 21 days by Perpy Greg. The emphasis is on Database Design.0 Programming by Hotzner Steven. 12. * * * 19 . Reference books: 1. 2. Visual Basic 6. Calling API routine. Introductions to BV Script to develop web page and discuss Internet development Features through Visual Basic. Textbook: Peter Norton’s Guide to Visual basic 6. * * * 207. Preparing quality report with user manual is important. 3. representation of the design through Data flow diagram and context diagrams.0 by Peter Norton. DLLs. implementation in MS-Access and using VB as front end. Data/ Crystal Reports: 13.0 by Peter Wright. The student is expected to spend about 25 terminal hours. Windows API: Defining Windows API. Minor Software Project-II For this paper the student develops a software package using Visual Basic.11. Visual Basic 6.
S/W Inspection: Communication Skills for the System Analyst.less system. Software Engineering This is first of a series of 3 papers on this topic the second two being Unified Modeling Language and Design Patterns (Paper 401) and Software Project Management (Paper 501). This paper covers all topics in Software Engineering for Procedure Oriented approach. System Analysis SA tools and Techniques: . 2.DFDs. Software Configuration Management: Base Line. programming. Consistent. icons. Document Composition of the inspection team. error messages etc. 7. – II (Second Year) Semester-III 301. Menus. SCM Process.A. User Manual: User Profile. Tools for Project Management Support. Prototype outline for SRS. Scrolling. Design issues. Software Life Cycle: Models: Waterfall model. Software requirements specifications (SRS). check list. Characteristics of the good SRS: Unambiguous. future of CASE. 1. 3. 20 . Structured Programming. Spiral Model.C. Revive/ Inspection Procedure. 4. panels. Complete Variable. Codes designing for field values and designing code. 8. Project Dictionary. Students should practice inspecting small requirement specification for good characters. Student is urged to install and use a software using its user manual and report the strength and weakness of that user manual. User Interface Design: Elements of good design. 5. recording of the defects and action recommended. Computer Aided Software Engineering: CASE. Change Management. S/W losses. Prototyping. The tools and techniques for various stages of life cycle are covered thoroughly. Contents of an User Manual. S/W Design System Design tools and techniques. maintenance. Windows. Modifiable. Version Control. Traceable and usable during the operation and Maintenance phase. Prototyping Forth generation techniques. Prototyping.M. 6. In this Paper Software Development life cycle models are introduced in depth. Entity Relationship Diagram’s. reading by the inspector. Analysis and Design. Features of a modern GUI. Fact finding Techniques.
1. peer-to-peer priority slot. packet routing.X. value of the transport layer.25 and the data link layer. time division multiplexing (TDM). the frame relay and X. the transmission control block (TCB). examples of route discovery protocols. OSI Model layers function and application in protocol. Bentley and Barlow. NETBIOS.Message switching. Software Engineering – A Practioner’s Approach by Roger S. Protocols for servers and workstations (SPX/TCP/IP. carrier sense (collision free) systems. Network Protocols. RIP).25 logical channel states. An Integrated Approach to Software Engineering by Jalote. 21 . passive and active operation.25 stacks. * * * 302.Reference books: 1. route discovery protocols.25. P. Network types. Switching and Routing Networks. Network Components: Types of Servers. packet switching when and when not to use packet switching. Protocol suite TCP/IP. major features of IP. Types of workstations. Decision of optimal networks will be introduced. Network Protocols: Hardware Protocols. carrier sense (collision) systems. Network types. Features of X. Wide area and local networks. token passing (priority) systems. token passing.25 Network and Supporting Protocols. IP source routing. Network Architecture. NWLINK. internetworking. 4. X. connections oriented and connectionless networks. TCP. Interconnecting networks. 2. packet formats. System Analysis and Design Methods by Whitten. 3. media for network communication. 3. connectionless mode networks. packet switching support to circuit switching networks. related protocols ports and sockets. application layers protocols. Concepts of Intranet and Extranet will be taught in depth. Network Types: Peer-to-peer network-implementation of Peer-to-peer network using WIN 98. the IP address structure.25 layers of X. Computer Communications Networks Some basic concepts of communication Networks are introduced earlier in this paper. type of network interface card. NETBUI. Pressman. major features of TCP. Network components. software protocols. Software Testing Techniques by Beizer. 2. Client Server Network – Topologies for Client Server Network.25 and the physical layers. features of X. Classification of communications protocols. companion standards to X. time division multiple access (TDMA). TCP/IP and inter Networking – Example of TCP/IP operations.
Essentials of Networking – Microsoft Press. W. LINUX. Patch Cords.0 3. Speed. Information Outlets. 5. Computer Communication Network.S. Electronic Version of Documentation of WIN 2000 and NOVELL 5. * * * 22 . Network Architecture: Polling/ Selection Protocols. 4. Setting a Dial-up connectivity. HDLC subset. Site Preparations for Structured Cabling. Computer Networks. HDLC. Interconnecting Networks: Pre-requisites for Inter connecting Networks Devices and Methods user in Inter-Connecting Networks. Inter-linking Networks of Different Server Operating Systems (NT/WIN to NOVELL. Network Installation: Installation of File Server. Study guide for CNE-Novell Press. SDLC. WIN 2000. Documentation of LINUX Installation (Electronic Version). 6. Setting Modem and Modem Properties. binary synchronous control (BSC). Features).Tannenbaum A. Textbook: Computer Networks – U. Routers. Cascading Switches and Hubs. Dial-up Network : Model (Type. 6. Print Server using.4. Token Ring and SNA Standards. HDLC frame format. Bridge. Concentrators etc. Novell 5. Black. Multiplexers. Setting up Network Cards and Configuration. Protocols conversion. Reference Books: 1. Segmentation.Stallings. 8. code transparency and synchronization. Structured Cabling – Components required in Structured Cabling. Ethernet (Ethernet Standards.character and bit protocols. HDLC options. UNIX and Vice Versa). Installation of Client or Workstation using WIN-98. Frame formats and cabling). 2. Connecting Network: Components for connective – Switches Hubs.0 and LINUX. 5. Cable Laying Methods. 7. Frame formats and Specifications). HDLC transmission process.
4. Object oriented programming concepts such as Inheritance. buffered reader/ writer. text fields. vector. date. File I/O in C++ and JAVA: Understanding stream class hierarchy. parameter passing. functions with default parameters. exception handling. tables. local variables. panel. file I/O will be introduced. combo boxes. JAVA swing – J applet. inline functions. 23 . Object based constructs in C++ . button. As a second step. This paper also covers Thread Programming in Java. function objects. JAVA. Inheritance and polymorphism in C++ and JAVA: Simple multiple and multi level inheritance. JAVA applets. manipulators. polymorphism. wrappers. layout managers. list. string buffer. This part also includes topics such as function and operator overloading. abstract classes. JAVA threads. exception handling. virtual function. 1. exception handling. file reader/ writer. listeners/ adapters. function overriding. friend functions. Procedural elements of C++ & JAVA : Review of basic constructs. access specifiers. smart pointers. Programming paradigm: Monolithic programming procedure oriented programming decomposition of a solution into subroutines. frame. dialog. hash table. interfaces. pure virtual function. object base programming-data hiding. object. Util – random. text components. member functions. print writer. array of objects. JAVA event programming – AWT components (windows.class. checkbox. 5. static and constant member functions. Object Oriented Programming In this paper first object based programming concepts involving encapsulation and data hiding will be covered. button. function overloading. and polymorphism. 2. dynamic memory management. Object oriented programming-inheritance. Similar constructs in JAVA.303. file dialog. return values. tabbed and scroll panes. trees. JAV packages: Importing packages. 3. sequential and random file management. math. choice. event model. constructors and destructors. byte/ character streams. encapsulation. cin and count. JAVA I/O – JAVA I/O package. various types of inheritance. icons and labels. Similar constructs in JAV. files – sequential/ random. independent compilation. The implementation of these concepts in C++ and Java will be covered in depths. operator functions. templates. operator overloading. member functions. JAVA doc. JAV Lang-string. modular programming-grouping of procedures based on data. system. label. menu components).
organizational and business variables. interpersonal communication. organizations in the Indian context. review reports. covering. long. slide preparation. institutions 24 . Introduction to Organizations and Individuals: What is an organization. 3. facing the interview. body languages and KINESICS. 2. 4. components of organization. verbal and non-verbal communication skills. Important and benefits of communication. listening skills. telephone communication. Section-I (Oral and Technical Communication): 1. Verbal and Non-verbal communication – face to face. essay and précis writing. L.). 3. and written presentation of technical material. stress management. written communication skills will be taught. Balguruswamy.Textbooks: 1. business letter writing. leadership and conflict management will be taught among other related concepts of organizational behaviour. motivation process. 5. structure etc. Writing of user annual. Using Turbo C++ by Herbert Schildt. Report writingShort. models of analyzing organizational phenomena. * * * 304. In the second section of this paper. Stevens. nature and variety of organization (in terms of objectives. principles of communication (7 C’s). Herbert Schildt: The Complete Reference JAVA 2. Patric Naughton. barriers in communication. public speaking. Note taking from lecturers and reference material. Written communication – Resume/ Bio data preparation. case study involving business analysis. meetings and group communications. Teach Yourself C++ by A. 2. OOP with C++. Object-Oriented Programming in Turbo C++ by Robert Lafore. 2. fundamental concepts of organizational behaviour. Section-II Organizational Behaviour: 1. Reference books: 1. Applying C++ by Scoot Robert Ladd. Group dynamics. oral presentation principles. components of communication. preparing for an interview. Communication Skills and Organizational Behaviour In this paper principles of communication. 3.
motives (achievement. A Global Perspective”.. team problem solving. Interpersonal and Group Processes: Interpersonal trust. “Management of Organizational Behaviour: Utilizing Human Resources”. 4. 5.. 6. Dwivedi R. Delhi 1996.. dysfunctional ties of structures.. New Delhi.. integrating cases. Organizational Structure and Integrating Interpersonal and Group Dynamics: Elements of structure. counseling. organizational communications. Hersey and Blanchard (6th ed. understanding the other person from his/ her point of view. role-plays.). Prasad Kesho: “Organizational Development for Excellence”. 3. French and Bell (4th ed. team functioning.. determinants of structures. Ltd.). organizational change.. Robbins (4th ed. Arnold John Robertson. Prentice Hall of India Pvt. principles underlying design of organizations. values creativity and other personality factors. perception. 1996.. 2. Ltd. team decision making. 25 . self-fulfilling prophecy etc. 3. “Organizational Development: Behavioral Science Interventions for Organization Improvement”. Ltd. MacMillan India Ltd.). organizational politics. and behaviour simulation exercise. attitudes. 7. 1996. New Delhi 1994. power and affiliation). leadership. New Delhi 1995. Delhi 1995. Prentice Hall of India Pvt. Reference books: 1. New Delhi. MacMillan India Ltd. USA. functions of structure.and structures. commitment. listening. Prentice Hall of India Pvt. Hell Segel. working as a member of a team. “Essentials of Organizational Behaviour”. issues of power and authority. West Publishing Co. Case method and lectures should be supplemented with a variety of other methodologies such as feedback on questionnaires and tests. team conflict resolution. MacMillan India Ltd. transactional analysis. feedback. 2. motivating people.: “Work Psychology. and Cooper Carry L. Ivan T. interpersonal communication. Understanding Human Behaviour in the workplace”. organizational culture.S. profile of a manager and an entrepreneur. structure technology-environment-people relationships. 1986. Solcum and Woodman: “Organizational Behaviour”. basic role sin an organization etc.: “Human Relations and Organizational behaviour.
Weston Mergers. scheduling on controlling project costs. resource allocation problems. EOQ model with planned shortage. Branch and bound algorithm. (a) Inventory Theory: Cost components of inventory models. correlation and regression. Numerical Integration Iterative methods to solve equations of the form g(x) = 0. 2. with gradual 26 . 1995. Decision Technologies This paper covers Decision models such as Linear Programming: Transportation and assignment problems. test for proportions. The basic EOQ model. New Delhi. transportation and assignment problems. 9. Statistical classification and tabulation of data: Algorithms to plot histograms and frequency curves. 1. what if analysis. Linear Programming: Linear programming concepts graphical methods to solve two variable problems simplex dual simplex of revised simplex methods. with price breaks. using utilities to better reflect the values of payoffs. measure of central tendency and dispersion. distribution network problems. Ltd. Prentice Hall of India Pvt.8. means and variances. dealing with uncertain activity durations.. USA 1982. Network Optimization: Minimum cost flow problem maximum flow problem shortest path problem. replacement problems. Curve fitting. 6. scheduling project with PERT and CPM. “Restructuring and Corporate Control”. Decision Theory: Formulating the problem decision criteria that use probabilities. minimum-spanning problem. CPM and PERT will be covered. 4. PERT and CPM Using a network to virtually display a project. decision making under uncertainly and simulation are also covered. However the emphasis is on using a Decision Support System such as MS-EXCEL to analyze the problem and interpret the results. Rank correlation coefficient. corresponding time-cost trade offs. John Wiley and Sons. Dynamic programming. Tests of Significance: Concepts of testing of hypothesis. In this paper. * * * 305. Networks. checking whether to obtain more information using new information to update the probabilities using decision tree to analyze the problem with sequence of decisions. SQC. Hund and Osborn: “Managing Organizational behaviour”. 3. 5. contingency tables. Schermerhorn.
and priority queuing models. DML. or. Database Design and Implementation Laboratory This is a practical oriented paper. Object relational. Export). E. with ‘where’ clause.K. Normalization (Applied) – Commands and clause. forecasting with regression models. 2. A continuous review inventory system (b) Queuing Theory: Elements of a queuing model. Operations and operators – Arithmetic Comparison Logical.” 2.” * * * 306. “Operation Research. Data model. is null. CLOB. measures of performance of queuing systems. Create table. Textbooks: 1. Introduction to Oracle – Reports Pre compilers (SQL Loader. In. Insert. Date data type. Raw data type. % any. is not null. 7. Over view of RDBMS.S. single server.. Reference books: 1. delete. Varchar/varchar2. Long raw data type. This paper covers the Application part of the topic covered in the paper Database Management – Theory (Paper 203). 3. 27 . domain.V. and. An inventory model for reusable products. Select with all options. An important aspect is that Database Administration is also covered thoroughly. Operation Research by Taha H. Introduction to SQL: DDL. Kanti Swarup. exists. all. Number. not exists. models for time serves with irregular components.replacement. and Man Mohan. multiple servers.L. Drop table. s) – floating point. Do it by yourself on PC by K. Gillet. B. In this paper Oracle DBMS and Developer 2000 are covered in depth. BLOB. update.Character: Char. The Critical Path Method by Saffer L. Data types. Forecasting: Applications of forecasting. Column-name number.R. Union. and Reyer W. not in. Entity. not Query Expression Operators. Column-name number (p.A. : “Introduction to Operations Research: A Computer Oriented Algorithmic Apporach. like. intersect. BFILE. Import. not like. Table: Constraint Definition. LOB data type. Codd’s rule. Queries and SQL functions.Sarma. gupta P. Column-name number (P) – fixed Point. DTL (TCL). between. fitter J. Time sense components. Referential. Long.
Error handling. Computer sum. exp. types of lock. numeric. sequence. character.vsize. update.. zero_divide. operators function comparison. Drop. interactive – loop. create. selfjoin. last_day. su. intersect. invalid_cursor. Group by clause. Outer join. REVOKE. number Variable.Static cursor. next_day. row level (select. SAVEPOINT). Object. program_error. Miscellaneous: Uid. union all. Group function – avg. skip. Object type Definition.Date:Sys_date. length. (GRANT. Attribute. for update clause) table level. no_date_found. minus. Expression (Set operations: join) – Set operations – Union. share. COMMIT.minus. synonym as alias for table and view. Dynamic cursor. create Locks in oracle (Conceptual) – concept of locking. floor. login_denied.new_time. to_date. abs. Operators Precedence. to_number. Btitle. Case should be thought/ Example Introduction to object oriented database. cos. share update. Class.pno. %rowtype. Raw. System. min. upper.User create. Attribute. sequential – goto. invalid_number. deadlock Primary Introduction to DBA. trim. SQL.. months_between. Add_months. Explicit and implicit cursor.translate. drop. constant. User. column. PL/SQL Introduction to PL/SQL.condition – if. ROLLBACK. User definition with example. Advantages. equi join. alter sequence. set pause. concept of exception – pre defined exceptions. rowed. Break on. Conversion: to_char. Declaring and initializing Methods. max. nvl. exclusive. SQL Functions. REF Cursors. Support for SQL. Integration with Oracle. Views and synonyms Introduction: Object type. object binding in Oracle. Parametric cursor. Numeric: round.Model. creates with option. High productivity. Report writer using SQL : Title. concept. PL/SQL blocks. Boolean. Table aliases. %type. creates. user defined exceptions Cursor Management. lower. set server output on. dbms_output. Methods. Better performance Portability. User. index. Cursor for loop. Having clause. Character. Query and sub queries. dup_val_on_index. into. cursor_allready_open. trunk. PL/SQL Character set-data types. binary_integer. too_many_rows. count. for. non equi join. drop view. Character:initcap. relating data through join concept-Join Theory. nowhere. char. Declaring cursor 28 . cell. while. Control structure. storage_error. introduction. Alter and Drop type. date. Privileges. simple join. granting.Introduction.
features. and Later J. Oracle-8 DBA Handbook by Loney Tata McGraw Hills. Introduction to Developer/ 2000 (SQL FORM. Stored procedure and functions. restricted). closing cursor variables. Executing non-query DML & DDL statements. record: declaration. types of triggers enabling and disabling triggers. SQL by Scott Urman. in out. varies in database. next. prior). Privileges DBMS_SQL. 3. 2. Textbooks: 1. index by tables. Varray: declaring a varray. refer. formal with implementation. ORACLE 7 by Ivan Byross. Parameter: in. 2. body. Packages. Composite data types. first.variables. creating. table attribute. DBMS_SQL enhancements. Constrained and unconstrained cursor variables. ORACLE PL/SQL Programming by Scott Urman.SQL REPORT. sub programs and procedures. delete. Reference books: 1. Predicates: inserting updating and deleting. Executing PL/SQL.Definition and implementation. Dynamic PL/SQL. exists. Understanding ORACLE by Perry J. nested tables. 29 . table: declaration. Menu and Graphics).Definition. (count. Tables vs array-Database triggers. syntax. Procedure. Opening a cursor variable from a query.Definition. record assignment. out. last. Function. subprograms. Restrictions using cursor variables. parts of triggers (statement. sorted tables. definition.
Designing Databases. Builder. Writing good project report with user manual is essential. Proxy. Dynamic modeling State diagram. catalog. Classes. This paper is one of the most important advanced level Papers. uses of UML. * Semester-IV 401. C++ foundation classes that is used by design patterns. using a design pattern. Associations. Overview of UML – views. Introduction to design patterns. description. Generalizations. Logical and Physical Architectures-Component diagrams. Facade. Students work in groups of not more than 4. In this project emphasis is on following software engineering principles. Sequence diagrams. constraints and stereotypes. 6. Packages and templates. report design. UML extensions. 5. and interaction diagrams of UML will be introduced. Brief history of UML. UML and Design Patterns This paper is Software Engineering for Object Oriented Programming. objects and their relationships classes and objects. diagrams. Composite. Activity diagrams. identification of proper test cases is also emphasized. the student develops software in Oracle environment. Quality of models. Object. Bride. normalization. Interfaces (protocols). 3. selecting a design pattern. Real time modeling in UML-real time concepts. Modeling Tools. Collaborations diagram. 4.Abstract factory. Structural Patterns. Rect. phases of system development. Flyweight. Implementation pattern in C++ and Java. Java and Visual Basic. Each student spends about 25 terminal hours. Factory method.307. Creational Patterns. class diagrams.Adapter. Decorator. Usecase modeling. 1. special real-time Modeling concerns. Minor Software Project-II For this paper. singleton.lists iteration. Relationships. The object oriented thinking is taught using the 23 Design Patterns introduce by Gamma etal. point. Development diagram Extending UML-Tagged values and properties. need of design patterns. Implementation pattern in C++ and Java. The Design Patterns will be implemented in C++. prototype. Visual Basic or Developer 2000 may be used as front end. * * 30 . 2. The class. Model elements.Definition.
2. system boot and in it process. 4. shell scripts.Swapping. Architecture. saving the context of a process. 3. strategy. system Administration. observer. the I/O sub system driver interfaces.Chain of responsibility. The structure of processors-process and transaction. Process control – creation. 6. termination. demand paging. Boch. Disc Drivers. the shell. Single and compound commands. 5. 1. context of a process. Inter process communication sockets. Mediator. hybrid system. state. operating system services. Template methods. use of c-programs. Buffer cache. internal representation of files. History. Terminal Drivers. The Design of the Unix Operating System – by M. Iteration. involving other programs. streams. Shell programming is an important component of this Paper. Design Patterns. Object-oriented software by Johnson and John Vlisside. 7. Memory Management policies. building command library of program.Elements of reusable by Enrich Gamma. layout of system memory. command interpreter. and visitor. manipulation of the process address space. Unix and Linux Internals This paper covers in depth all aspects of Unix and Linux operating systems. System calls and c-library system calls and library functions. Richard Helm.by Stephen Prata. Advance Unix – A Programming Guide. Ralph. 31 . J. Behavioral Patterns. system calls for the file system. socket implementation. 2. and passing file descriptors. socket system calls. Advanced Unix/ Linux programming concepts. System calls and interfacing with C will also be taught. UML Fool Kit by Hans-Frike Erikson and Magnus Penker. reserved ports. Memento. Text books: 1. The Unix/ Linux administration will also be covered at elementary level. 2. Textbooks: 1. sleep. Implementation pattern in C++ and Java. user perspective. signals. system concepts. system structure. Kernal data structure. the user ID of a process.7. Process scheduling and time. * * * 402. 3.
functions and relations. Mapping between sets. Chomsky hierarchy. left linear and right linear Regular Grammar. Regular expression and FA . Nn-deterministic 32 . Graphs and Tress – basic definitions. adjacency matrix. Regular grammar – definition. Finite control. intercoversion. Unix System V Release 4 – by Sumitabha Das. Language acceptance by FA. Derivation graphs – type 0 and 1 grammars. Basic concepts. Regular grammar and Finite Automata Normal Forms – Chomsky Normal form (CNF). ambiguous grammar. language states. Mathematical preliminary – Induction. Context Free Grammar (CFG) – definition. R. Advanced Programming in the Unix Environment – by Stevens W. E-production. Basic machine – concept only. pushdown Automata (PDA). Reduced form grammar – removal of unit productions. inherently ambiguous CFLs. NFA without E-moves. Intercoversion between NFA and DFA. Finite automata (FA) – Deterministic Finite Automaton (DFA) and Nondeterministic Finite Automata (NFA). 4. Language – Definition. closure properties of relations. Context Free Language (CFL) – definition. Deterministic Push Down Automata (DPDA) – definition. Transition graphs. Grammars: Definition. countability of a set. Griebach Normal Form (GNF). removal of ambiguity. finite and infinite set. alphabet.symbols. Introduction: Set theory – Definition. 2. string/ word. (FSM must be dealt with machine function and state function). closure of a set. 5. 3. Regular Expressions: Recursive definition of Regular Egression. IT Elective-I Theory of Automata 1. Moore and Mealy machines – Definition. production rules. Pushdown Stack Memory Machine: Formal definition. models. 3. cardinality of a set. Unix Shells – by vijay Mukhi. * * * 403. Intercoversion between left linear and right linear regular grammar. derivation trees.Regular setsProperties. pumping lemma. Regular setrecursive definition. Finite State Machine (FSM): Definition. NFA with E-moves – definition. simplification of CFG. useless symbols.Reference books: 1. difference between natural and formal language. FA limitations. Formalization. 2.
Application of PDA – Expression conversion. 3. EWP publications. 6. 1. Reference Books: 1. The emphasis is on data mining algorithms.Push Down Automata (NPDA) – definition. Data warehousing: Characteristics of a data warehouse. Cohen: “Introduction to Computer Theory”. 2. combinational TM. multi-stack Turing machine.V. Semisolvability and unsolvability of problems (only concept required). Wiley Publications. incompleteness and undecidability. acceptors and generators. Narosa. FSM. IT Elective-II Data Warehousing and Data Mining The subject deals with the concept of data warehousing for effective storage of large data sets and the data mining techniques. PMT systems. Axioms. Applications: Application of RE and PA – Lexical analyzer. OLAP tools. maintenance. PDM and PM Examples of TM. Post Machine and Production System: Definitions. Relative powers of DPDA and NPDA. Hoperoft Ullman: “Introduction to Automata Theory. PDA and CFG and their closure properties. TM limitations. Martin: “Introduction to Language and Theory of Computation”. Nohn C. language definition. Post canonical systems. For data warehousing. Text editor and searching using RE. Languages and Computations”. Turing Machine : Introduction. performance issues. Data modeling – Star schema. 7. E. 8. Application of CFG – syntax analysis. data marts – types. halting problem. Snow Flake schema. iterative TM. Daniel L. software components of a data mart. 33 . comparison of Turning Machine – (TM). * * * 403. Solvability. performance considerations. McGraw Hill. Church’s Turing hypothesis. A. One line Analytical Processing OLTP and OLAP Systems.Krishnamurthi: “Theory of Computer Science”. Comparison between PDA and Post machine. 2. nature of data in a data mart. 4. Markov algorithm and labeled Markov algorithm. Definitions. which are effectively used in knowledge discovery from database. model. recursive TM.
KD and related areas. 4. Classification and Regression Trees by Breiman L.J. Reference books: 1. Discernibility matrix. decision rules. Data Cleaning.. and Watson H. 3. Kurth thearling. 1. reduct and core. 4. 5. Decision Support System – Putting Theory into Practice by Ralpha H. 5. Algorithm for finding minial subsets. Building Data Mining Applications for CRM by Alex Cerson. Knowledge representation. decision tables.J. Olshen R. Textbooks. Decision Trees: Definition. Data Mining by Ivan Kemberly. Cois. Data Tuining and OLAP by Alex Berson and Stephen Smith.3. accuracy of approximation. 4. Dynamic Reducts. 2. using decision base for exploration. J. Hierarchical clustering. and Store C. Decision Models and Expert Systems by David L. Witild Pedryez and Roman W. Swiniarski. 2. Data Mining (DM) AND knowledge Discovery (KD): Defining KDD. Cluster Analysis: Unsupervised learning. 3. Jr. Data Mining Techniques by Arun Pujari. Freidman.A. applying decision trees to business. Sprague. application. Rough Sets – Information system. Stephen Smith. * * * 34 . Basic models of DM. H. Data Reduction. Definable and non-definable sets. Data mining methods for knowledge discovery – Krazystof J. accuracy of classification. Data integration and transformation. Data Warehousing. main features of KD Process. objective functions-based clustering. Olson and James Courtreq Jr. Architectures of KDD. for data processing. 6. clustering methods and data mining. Deriving Association Rules: Concepts. Indiscernibility relation. Data/warehousing concepts techniques and applications by Prabhu. segmentation with purpose.
16-bit microprocessor. Requirements of embedded systems. output. An Embedded System Primer. Embedded Operating system. std::priority_queue container adapter. 4. Distributed computing. Associative container: Set. Use cases. Real-Time UML by Douglass. IT Elective-III Embedded System Concepts and Modeling 1. using microcontroller. Introduction to STL (Standard Template Library).403. Map. vector. input. Related Concepts Involved in Embedded Systems: Digital signal processing. Sequences: Introduction to sequence containers. Books: 1. mutating sequence algorithm. Real-Time operating system. 8-bit micro-controller. Applications of embedded systems. IT Elective-I Programming with STL 1. deque and list class. Trends in embedded system development. * * * 404. Microprocessor Architecture. Introduction to embedded systems: Understanding embedded systems. 2. sorting algorithm and numeric algorithms. Classes involved in system. Generic algorithms: Introduction to generic algorithm. sequence diagram. VLSI designing. State changes in system. Exception handling: 35 . Wireless networking Parallel programming. 2. 3. and special purpose: stream iterators. Soft and hard real-time systems. System design. 4. 3. Programming and Applications by Gaonkar. Microprocessor and Micro-Controller Based Embedded Systems: -8-bit microprocessor. non_modify sequence algorithm. Iterators: Introduction to iterators. 4. Deployment. Multiset. Interaction among different classes. Categories of embedded systems. 2. 5. 3. randomaccess. bi-directional. UML in a Nutshell by Albir.by David E. forward. std::queue. 5. Std:: stack. Iterator adapter. Simon. Embedded System Modeling Using UML: Concepts involved in embedded systems. Multimap and Bitset class template. Embedded and Real-Time Operating Systems: General purpose operating system. system design using microprocessor.
Programming languages. Reset circuit. unnamed namespaces.exception handling in C and C++. Memory. 2. default and global locales. 8051 interfacing. Namespaces: Introducing Namespaces. Programmable logic devices. MCS-51 Series: Micro-controller based Embedded System Design and Programming: Internal architecture of 8051 micro-controller. The 8051 Micro-controller and Embedded Systems – by Mazidi and Mazidi. exception specification. Ayala. Programming and Applications – by Kenneth J. 7. * * * 404 IT Elective-II Embedded System Design and Programming Embedded System Design: Processor. defining namespace. ADC and DAC. Development Environment For Embedded Systems: Target hardware platform. Programming on MCS-51 kit. local class: the standard facets. uncaught exception. throw statement. using Namespace statement. 3. 8. Application specific control circuitry. Delay units. catch-all exception handlers. Runtime Type Information (RTTI). Latches and buffers. 8051-assembly-language programming. throwing an exception from an handler. New Style casts and RTII: New style casts: dynamic cast. Catch exception handler. creating a locate object. Development platform. Keypads. * * * 36 . Fundamentals of Embedded Software Where C and Assembly Meet by Lewis. unexpected exceptions. creating a mixed locale. nested namespaces. Locales: Elements of Internationalization. namespace aliases. static cast. Try block. try/throw/catch sequence. Development-tools. stream and locales. The 8051 Micro-controller – Architecture. const cast. Crystal. manipulating facets. Books: 1. reinterpret cast. 6. Chip-select logic. Operating systems.
Product life cycle. 8. Core marketing planning process. 10. 6. S. 4. Sales forecasting marketing information system. 2. market segmentation in Household and Organizational market. Demand. value and marketing. deciding channels of distribution. 9. Research methodology. Marketing Organization Structure. Sales and Distribution Management – Selection and training of sales staff. channel conflict. 4. Marketing of services – Characteristics of services. product. Marketing Research – Importance. Organizational Buyer Behaviour. 1. Consumer Behaviour – Household Buyer. 5. personal selling process. Introduction to Marketing – Concepts of Need. of IT and related services. Marketing Management by Philip Kotler. Sales force management.405. Sales report and sales analysis. Want. Positioning strategies and Overview of marketing Mix. Promotion Management – Advertising and sales promotion. allocation of territories. Scope. Marketing process and functions of marketing managers. Marketing mix and strategies adopted in different market situations. packaging. Davar. Product Management – Concept of Product mix. * * * 37 . Marketing Management – Indian Context – by Ramaswammy. Namkumari. Fundamentals and marketing by Stanton Etzel Walker. Marketing Control. and limitations. 3. Principles of Marketing by Kotler and Armstrong. BM Elective-I Marketing Management The aim is to impart knowledge to students on concepts of fundamentals of Marketing. Marketing Environment. 3. Marketing Environment in India. marketing mix in services marketing. Textbooks: 1. 7. market. Marketing planning and strategy – Target market selection. branding and pricing strategies. 5. Modern Marketing Management by R. 2. Evolution of marketing philosophy. 11.
time perspective.405. Internet Programming Laboratory This is practical paper. HTML Forms. Applications. incremental. Layout. Pricing. 5. Method of demand forecasting. 2. World Wide Web. 7. Prescriptive approach. Links and Addressing. controlling JAVA script. Common HTML. Servers. PERL are taught in this paper. Short run and long run average cost curves. oligopoly and monopolistic competition. Also various scripting languages HTML. Software Engineering for Web Application is also covered in this paper. Web Publishing. 3. Objective of the firm managerial and behavioural theories of the firm. Java script. Books: 1. Price determination under perfect competition. Introduction to Front Page. Developing Tool: Front Page. Principle of discounting and equimargins. pricing strategies.L. Elasticity of demand. Predefined functions. HTML and other Media. Law of supply: Economics and diseconomies of scale. creating functions. security techniques. 4. BM Elective-II Managerial Economics 1. Operators. Law of variable proportions. creating forms using wizards. Demand analysis – purpose and concepts. Browsers. Product and cost analysis. Profits: nature and measurement policy. Window objects. 6. Style Sheets. styles. Internet. 2. concepts of opportunity cost. Delivering Web Sites. VB script XML. Case Study. Management Economics by Dean J. cold fusion applications. Break-even analysis. Components of Internet Technology: Clients. Images. working with Explore and Editor. Introduction to HTML. * * * 406. HTML and Images. even handling. 2. Management Economics by Mote V. front page components. JAVA Script and VB Script: Identifiers. full cost pricing product time pricing. Monopoly. 1. Web browser object Model. cold fusion-basic cold fusion. In this paper the concepts of Internet are reviewed. Production function: single output isoquants. 38 . tables. Client Side Script Programming. 3. KHTML. Nature and scope of managerial economics.
4.Teach Yourself Web Publishing by Laura Lemey. 2. as project report will be prepared. At the end of the work. XTML. Textbooks: 1. XML Schemas and name spaces document object model. Reference Book: The Complete Reference HTML by Thomas Powell. connectivity of JAVA-XML and data base VD XML and data base. Introduction to XML and XSL: Components of XML. 3. Programming in JAVA Script by Tim Richey. Minor Software Project-IV In this paper. The projects are concerned with web designing. Document type definition. 39 . working with cascaded style sheets. As every aspect of software prepared Engineering is covered this project work is expected to follow all the professional guidelines for software development. channel definition format. students in groups of at most 4 each work on Software Project. * * * 407. Each student is expected to spend 25 terminal hours. Extentiable style language. Advanced Cold Fusion by Ben Forta.
Software Project Management In this paper coding standards. software maintenance issues will be discussed in depth. 40 .M. Resource Planning and Scheduling: Work Breakdown Structure (WBS). Project Management concepts. Cost Estimation Techniques. 1. and J.A. Types of requirement. Overview of Project Management phases viz.C. Function Point Analysis. Risk Prioritization. J. software metrics. Testing aspects. cost estimation. Project Organizations. 2. Requirement Analysis Document (RAD). Key characteristics to distinguish the project. paper by Barry Boehm. Requirement Analysis Requirement Specifications. “Software Engineering Economics”. Introduction: Project and Project Management. e-mail system. Project Scheduling. 10 risks in Software Projects and their mitigation. Reference material: “No Silver Bullet: Essence and Accidents of Software Engineering”.PERT/CPM methods. paper by Brooks F. 2. Source Lines of Code and Development Efforts Prediction: A Software science Validation”. Reference materials: 1. Software quality assurance. P.IEEE. Model Tuning. – IEEE. Case study: Using MSP 98 or MSP 2000. – III (Third Year) Semester-V 501. Software Effort and Cost Estimation: Software Cost Factors. Requirements validation. 4. Caste study: Estimate the effort and cost for the given project. 5. Case study : Prepare the RAD for the given project. Case study: Identify the phases of the given project e. Gaffney – IEEE.g. paper by Albrecht A. Team Structures. Steady State. Risk Analysis. Empirical models. termination. “Software Function. Software projects Vs there projects. initiation. Introduction to the PMBOK (Project Management Body of Knowledge) – PMI. COCOMO models. Requirement Engineering – Requirement Elicitation. Risk Management: Elements of Risk Management. Software Project Management Plan (SPMP). 3. Library Management etc. Gantt chart.
S.A Unified Framework by Walker Royece-AddisonWesley.paper by Barry Bochm – IEEE. robotics. – IEEE. Kemerer. 2. knowledge manipulation in every scheme and various graph search techniques. Textbooks: 1. – IEEE. “Characterizing the Software Process: A Maturity Framework” paper by Humphrey W. 1. Software Quality Assurance and Processes: Software metrics. This paper covers artificial intelligence theoryknowledge representation schemes. Learning and Pattern recognition. Allen H. vision and speech processing. Artificial Intelligence and Applications The nature of the all problems and their solutions are entirely different from what has been dealt with so far in other papers. metrics for quality. Scope of Al: Games. 41 . Al techniques-search knowledge abstraction. “Risk Management for Software Projects”. Rational Unified Process.paper by Fairley R. The Al language PROLONG and if possible LISP will be taught. natural language processing. CMM. McGraw Hill Publication. 6. Dutoit-Prentice Hall International Edition. Object Oriented Software Engineering – conquering Complex and Changing Systems by Berno Bruegge. Software Project Management.Case study: Prepare a Risk Management Plan for a given project Reference material: “Software Risk Management: Principles and Practices”. Testing concepts. Applications include elementary introduction to Natural Language Processing. paper by Barry Bochm-IEEE. * * * 502. expert systems. theorem providing. quality Systems-ISO. 2. “A Spiral Model of Software Development and Enhancement”. Expert Systems. Spiral model. Software Project Management – Readings and Cases by Chris F. 3. Software Processes – Comparative study of Waterfall model. Reference Books: 1.
RI. absolute and relocated loader.. grammar. Artificial Intelligence by Rich E. Expert Systems: Need and justification for expert systems. Ramani S. IT Elective-III Design of Language Processors 1. exceptions and default. 3. Production systems. Learning automation. Janakiraman. polish expression operator... Principles of Al by Nilsson N. learning induction. 5. dependency directed backtracking. L. 42 . Depth first. genetic algorithm.. 4. static and dynamic Linking. Fuzzy logic. Rule based Systems: Forward reasoning. 6. Sarukesi. neural nets back propagation.. BSS loader. Minima search. and Knight K. knowledge acquisition. Noyes. Bottom up passing. Use of no back track. concept of . 6. Linking and loading Allocation. LL grammars. Knowledge Representation Predicate Logic: Solemnizing queries. IR diagram. 2. 2. Rules base Expert System by Sasikumar M. VIDWAN Expert System Shell.S.. background reasoning. Classification of grammars: Context Free Grammars. Alpha-Beta cut offs. Non-DFA. P. breadth first search. Handling uncertainty: Probabilistic Reasoning. Modus pones. Problem solving: State space search... frames. 5. slots. heuristic search-Hill Climbing. Unification. Introduction to Al and Expert systems – by Patterson. Al with Common LISP by Krishnan J. Gopal. Comparison of parsing methods. Error Handling. 8. Books: 1. best first search. various schemes of linking and loading.2. 4. * * * 503. conflict resolution. 3. Resolution. Learning: Concept of Learning. 7. K.J. Foundation of Al and Expert Systems by V. 3. Deterministic finite state automata.. branch and bound... Use of certainty factors.. Scanners down parsing. Case studies: MYCIN. Structured knowledge Representation: Semantic net.
43 . Assembler: Statements. polygon clipping. midpoint subdivision algorithm. 2. Interpreters: Interpretive execution. scaling. 9. concepts of display. screen editors. matrix representation. static and dynamic allocation. Homogeneous coordination. Picture representation. structure of interpreter. simple assembly scheme. 5. stream and structure editors. Assembler implementation. Principles of Compiler Design by Atio Ullmanas Sethi. Semantics analysis and code generation. file and display processors. 10. 3. Textbooks: 1. IT ELECTIVE-III Computer Graphics and Multi Media 1.4. working of interactive. partial compilation (Intermediate code). The Theory and Practice of Compiler Writing by Temblay. Run time storage admin. Folding. rotating. 6. Forward reference. Intermediate forms of source programs. Symbol table handling techniques. Clipping and Windowing: Line clipping algorithm. the user interface. 8. Editors-line. Interpretive languages. Organization for structured and non-structured languages. Graphics devices. code optimization. case study. work distribution in 2 passes.UNX system V. 2. Debuggers: Functionality info. * * * 503. Optimization within iterative loops. debugging techniques. Two dimensional Transformation: Principles. symbol table. design of 2 pass assembler. redundant sub-expression evaluation. window transformation. computer graphics display. 7. Polish N-tuple and syntax trees. design and implementation issue. translation. intermediate code. pass structure. viewing transformations. Introduction: The origin of computer graphics computer graphics applications. window. Reference: Lex and Yacc: Levine et al. op-code table. required by debuggers.
surface shading methods. line drawings. 3. Software interrupts. frame buffer and mathematical curves presentation of raster image. inverse transformation. and transparency. image processing. Interrupts: Interrupt vector table. scan converting. Interrupt service routines. Curves and fractals: Terminology. shading model. Shading: Basic terminology. Computer Graphics: A Programming Approach – Steven Haarington. Parallel Port Communication. 44 . Bresenham’s line generation algorithm. Ellipse generation. Raster Graphics: line generation. System integration. Computer Graphics – Bhandari S. Three dimensional Graphics: 3 dimensional geometry. Mathematical Elements of Computer Graphics – David Roger. 5. Synchronous serial communication. Multimedia technology applications. LCD interfacing. curve interpolation. angle calculation. Pulse measurement. Procedural Elements for Computer Graphics. Communication services. TCP/IP protocol stack. 7. Communication protocols. 5.P. 3-D geometric transformation. 4. Textbooks: 1. reconstruction of 3-D image.David Rogers. Animation. 2. Principles of Interactive Computer Graphics – Newmann Sproul. Servomotor interfacing. circle generation. LED interfacing. Serial Port Communication: Asynchronous serial communication. DAC techniques.A. Analog Interfacing: Digital-to-Analog converter interfacing. IT ELECTIVE-III Embedded System Interfacing & Embedded Communication Systems Digital Interfacing: Keyboard interfacing. algorithm. LAN Communication: Ethernet connectivity. * * * 503. Hardware interrupts. USB communication.4. 6. 3-D Solid modeling. and Joshi S. Analog-to-Digital converter interfacing ADC techniques.
NET Common Language Runtime (CLR) and services offered by CLR.NET. Attributes.NET 2003 O’Reilly Covers topics from scratch till Web Appl. Little black Book.0 and VB. The 8051 Micro-controller-Architecture. Prg VB.config and global. Namespaces.NET language Introduction to Object Oriented Programming in VB. page derivatives code behind pages and programming includes error handling event handling.Net Exception Handling ADO. Remoting.NET web services writing ASP.by Kenneth J. Language compilers that support CLS. 3. Components of . Global Assembly Cache. Bible – VB.NET initiative and framework. IT ELECTIVE-IV Dot Net Technology 1. 2. VB. JIT compiler and its benefits. References: 1. Threads. 45 .NET Events and delegates Introduction to Multithreading Use of Attributes.NET web service consumer ASP. application and session state) web controls: HTML controls and ASP. 3. 4.NET pages caching partial page caching using user controls composite controls. Components in .Net Technology: What is . VB programming Black book by Dreamtech covers all the topics from beginning. Introduction to . page redirection state management – server side (View state. 2. * * * 504. Programming and Applications.NET VB. 2.NET prg Freamtech.NET components on web forms data access on web form using data reader inserting and updating data from web forms introduction to ASP. Ayala. What is Intermediate Language code. Assemblies and deployment Manifest.Net: Differences in VB 6. What are Common Language Specification (CLS) and its need. The 8051 Micro-controller and Embedded Systems – by Mazidi and Mazidi.NET: Introduction to web applications using ASP.Books: 1. comparison with ASP web application components and configuration including web. asp introduction to web forms.NET server controls validation using validation controls using. metadata and extending metadata.NET. Developing web applications in ASP.
Thread Synchronization. 46 . * * * 504. Exception Handling: exception. Ctreeview. Dialog Box (3) – Cdialog. CcmdUi classess. Cpalette. CwindowsDC and CpaintDC classes. Drawings shapes and curves. 6. Critical section. CsliderCtrl. Document templates: CdocTemplate. Ip Address control. Colors and Fonts. CrichEditCtrol. Data exchange to from variables and controls. Basic MFC classes: Cstring. Cmainframe classes. Drag and Drop. IT ELECTIVE-IV Programming with MFC 1.NET Microsoft Press. Cbursh. Cbutton. Cwnd. CtreeCtrl classes. 4. CprintDialog classes. Menus and accelerators(2) – Command Processing. Tab stops and groups. event object: Covent. Multithreading (3) – Multithreading Concepts: Cwin Thread. Graphics Device Interface(GDI) (3) – CclientDC. Cpoint. Event Signaling. Property Sheets: CpropertyPage class. richEditView. CfontDialog. Cedit. OK and Cancel buttons. C winApp. and Csemaphore. Floating Pop-Up Menus. Crect. Introduction to MCF(5) MFC Class Hierarchy. Modeless dialogs. Advanced Document Handling(6)Clistview. Prg in VB. Cmutex. CsingleDocTemplate and CmultiDocTemplate CframeWnd and CsplitterWnd. 3. Clistctrl. Document/ View Architecture: Cdocument and Cview. date time picker. Carray and Clist. Handling Windows message in MFC. C++ Template classes review. User defined message handling. Cfont. Crgn Classes. Cformview and CrecordView. Clistbox. extended combo box controls. Windows Controls and Dialogs(7) – CprogressCtrl. Keyboard accelerators for menus.5. Tool tips and status bar: Ctoolbar. Balena. CcolorDialog. moth calendar. Cmenu. Toll bar. Cfieldialog. 6. Cbitmap. Enabling and Disabling menu items.. 2. 7. VB. CspinbuttonCtrl.NET Microsoft Press covers topics from framework intro but no data handling. MFC Text Editing: Ceditview. 5. Cstatusbar. Ccombobox classes.stcok GDI Objects. Csize. Cpen. Context-Sensitive help.
containment and Aggregation. Marshaling. 9. Proc file system. Cdatasource. CdaoTableDef. Block devices. CmanualAccessor OLE DB Provider. Inprocess and out-of-process servers. * * * 504. Iunknown. Bit-wise operations.8. Data binding. CdynamicAccessor. Data Access Objects(DAO): CdaoWorkspace. Cenumerator. 4. Dynamic Kernel module programming. Wrapper classes for ActiveX controls. CdaoDatabase. Linking assembly and C object files. Logical operations. Dynamic Link Libraries(DLL)(2). Jini. Scot Wingo Microsoft Press 1998. Gerorge Shepherd. 2. Mapping ActiveX control events. 3. Caccessor. Device Driver Programming – Rubini. CdaoQueryDef. dynaset. 4.. 2. C With Assembly Language – Braddy. CdynamicParameterAccessor. David j Kruglinski. 5th edition. Data exchange between variables and ActiveX control properties. Character devices. Case study: Calendar and Web Browser controls. Iclass Factory Interfaces. Fundamentals of Embedded Software Where C and Assembly Meet – by Lewis. Textbook: Programming Microsoft Visual C++. 47 .MFC Extension DLL: Exporting classes. Java in Embedded Environment: J2ME. C in Embedded Systems: Data types. Pointers. CdaoRecordset. Difference between ActiveX controls and ordinary Controls. Memory management. Csession. Device Driver Programming in Linux: User-mode and kernel-mode programming. definition language. Database Connectivity()-ODBC: Cdatabase and Crecordset. Connecting C with Assembly: Inline assembly code. Programming for Embedded Systems – by Deamtech. IT ELECTIVE-IV Embedded System Programming Using High-Level Languages 1. Books: 1. Code optimization. MFC: Regular DLL Basic Component Object Model (COM( (8). what is COM and why COM? Interfaces. Structures and unions. 3. OLE DB Consumer. Data structures. Device driver programming. Dynamic data binding. snapshots.
3. Core Network Protocol. SET. Commerce client Technology. Programming Clients. Domain Name System. Symmetric and Asymmetric Cryptography. Technology for fulfillment of digital goods. Outsourcing. Example of System Architecture. Security and Payment System: Security for Internet Commerce. Business and Technical issues of IC. Client Security Issues. Multi-organization Operation. Transaction Processing. future of Internet Commerce. Core Architectural Ideas. doing business internationally. 2. Evaluation of Cryptography. basic computer Security. Roles. Role of Standards. 4. Custom Development. Creating and Managing content and Cryptography: Philosophy of Design. Electronic Cash. Goals and requirement: Business segments. CASE STUDY: Auxiliary Systems. 6. Online Credit Card Payment. types. Consumer Retail. Introduction of Commerce value chain. * * * 48 . Protocols. Internet Commerce. Real world Payment System. basic contents. Multimedia Presentation. Project Management. Server Component. Smart Cards. Object Technology. Fundamental Design Issues. Characteristics of Internet. Components. Merchandising. Authentication. 7. Business-to-Business Cataloging and Information Commerce. Tools for Creating Content. Goal of participants. Privacy. Introduction to Internet Commerce and Commerce value Chain: Introduction. Building Block for Internet Commerce and World Wide Web: Design principle of the Internet. Content Transport. Internet Payment System. Server Security Issues. Web Fundamentals. Public Key Cryptography.BM Elective-II Design of E-Commerce Applications 1. Session and Cookies. Analyzing Risk. Key Management. Planning the Implementation. functions of cryptography. Role of ISP. System Design. Functional Architecture and Implementation Strategies: Introduction. Manage the Content. Internet. Internet Business Strategy. Security Design. Business Models. 5.
7. identifying knowledge centres. structure of information. types of knowledge. experience. Manage change and rewards structures. 5. modern information system-DSS. post system evaluation.on site observations. traditional types of Information system. levels of information system. challenges of KM.The Delphi method concept mapping – procedure semantic net. Evaluation of information system. 8 C’s successful KM. technical core. Other knowledge captures. Knowledge codification: Concept of codifying. TPS. the interview. commence sense. types of information. users Vs knowledge workers. intelligence. Developing a relationship with experts. Interpretation. Office Automation. Components. KM drives. benefits of KM. Black boarding. Nonaka’s model of knowledge creation and transformation. blue print. Knowledge creation. Knowledge: Concept. Instruction.The user interface layers. capturing single and multiple experts. Design of KM. Fuzzy reasoning and the quality of knowledge capture. models of 49 . role of the knowledge developers in each phase. Technical layers of the KM. MIS. 6. Protocol procedure of the diabetic foot KM system. features of quality information. 3. Implementation KM system. ES. Brainstorming-Electronic. Key attributes of knowledge. BM ELECTIVE-II Knowledge Management 1. KM Myths. advantages and drawbacks of using single experts and multiple experts. EIS/SIS. 2. protocol analysis. knowledge architecture. Form the KM team. 4. guide to successful interview. knowledge capture.505. information. Concept of Scenario. Phases of KMSLC-Evaluate existing infrastructure. human thinking and learning. benefits and drawbacks of interview. Brainstorming. Nominal Group Technique (NGT). planning and scheduling.diagnosis. Difference between SDLC and KMSL. KM Organization. knowledge. verify and validate the KM system. Evaluating the experts-level of expertise. prediction. role of planning. Knowledge Management: Definition. Concept of data. evaluation of Knowledge Management. reasons for implementation of KM. Capturing Tacit Knowledge: concept. KM Life Cycle: Challenges in building KM Systems.
Tata McGraw-Hill.knowledge conversion. Network dependents UNRI 0. Proxy server. 3. Companies. System Testing and Deployment: Quality and Quality assurance. Leading with Knowledge – Knowledge Management Practices in Global InfoTech. Knowledge Management – By. Knowledge Mgt. and William R. Managing testing phases. 1. Win sock Programming: Using the windows socket. KM system deployment. Strategies – By Honeycut. 8. Installation of Proxy Server. Berkeley Sockets: Overview. approaches to logical Testing. Prentice Hall of India. WAP concepts. codification tools and procedures.R. socket system calls. DDL. sending and receiving data over connections termination. reserved ports. Java Beans and EJB. API window sockets and blocking I/O. Protocol Comparison. The knowledge developers’ skill set. 5. Awad and Hassan M. 50 . socket addresses. Methods of deploying web Applications. Virtual Private Networks.L. Internet: Concept. steps to codify knowledge. I/O asynchronous and Multiplexing. Field Book – By Bukowtiz W. 4. Textbook: 1. Introduction to Networking with JAVA. IPX/SPX for LANS. passing file descriptors. JDBC. Network and Internet Programming (Laboratory) This is a practical oriented paper. components for developing and Implementing Internet Based Applications. knowledge testing. COM. PWS. IIS and FTP Browser. 3. Knowledge Management System – By Barnes S. Aim is to cover socket Programming Advanced Java Programming. Unix domain protocols. Knowledge Management. 2. Elias M. * * * 506. CORBA. NGI Internet Protocol V6. 5. Components of Internet Technology. other window extension. DCOM and other related concepts. Personnel Web server. Madanmohan Rao. review of post implementation. (Theory and Practice) Thomas Learning Publication. 2. issue related to deployment and user training and deployment. By. 4. Intranet. JNI. IIS. user acceptance testing. UUCP. Ghaziri Pearson Education. socket implementation.
3. Distributed Java Programming (RMI) Active Server Pages (ASP).. Out of these 400 marks. Creating and Implementing Virtual Private Networks by Casey Wilson. the student shall submit a project report. understands and writes a report. Introduction to CGI and Perl. Minor Software Project-V In this paper. Java Servlets. which will be evaluated by a committee of examiners appointed by the University. The report will be evaluated for 100 marks based on presentation and viva. Windows Network Programming by Devis. the student group has to chose a problem and develop software using any application development environment. Major Software Project This paper carries 400 marks. 2.com). the student chooses an IT topic. Java Server Pages (JSP). Peter Doak.com). White paper on specifications and Documentation from WAP forum (www. Every student must go to an organization and spend 150 days in the organization working on a problem which the organization suggests. Another 225 hours must be spent on preparation. * * * 601. 100 marks will be for Project Work. and that they can be on their own. Textbooks: 1. Now the students have through grounding of all most all aspects of theory and Practice of information Technology. collects literature.6. * * * 60. Reference Books: 1. they are good in communication.2 Trends in Information Technology-Term Paper For this paper. original in thinking and capable of doing work diligently. White paper on VPN using Windows 2000 (www.microsoft. Unix Network Programming by Steven. 2. The work should be equivalent of 225 hours of terminal time. Java Web Servers. At the end of the work. Project report must reflect that they are ready to take any kind of responsibility. 51 . 100 marks for the presentation of the work and 100 marks for Viva. * * * 507. report writing etc. 100 marks will be for Project report.pwapforum. they have to show that they are productive.
603. 102. 103. * * * 52 . 203. 302. 202. The syllabus for the two papers will be based on Papers 101. Comprehensive Examination (Conventional Type) For these two papers. 402. 105. Detailed syllabus will be given for these two papers later. 201. Comprehensive Examination (Objective Type) 604. 301. the student has to prepare on his/ her own.
This action might not be possible to undo. Are you sure you want to continue?