| 23rd December 2014 09:33 AM | |
| Quick Sam | Re: Bharathidasan university virtual learning online MCA Hello friend here I am providing you syllabus of Bharathidasan University virtual learning online MCA Courses Discrete Mathematics Unit-I Sets, Relations & Functions: Property of binary relations, equivalence, compatibility, partial ordering relations, Hasse diagram, functions, inverse functions, compositions of functions, recursive functions. Unit-II Mathematical logic: Logic operators, Truth tables, Theory of inference and deduction, mathematical calculus, predicate calculus, predicates and qualifiers. Unit-III Groups & Subgroups: Group axioms, permutation groups, subgroups, cosets, normal subgroups, semi groups, free semi-groups, monoids, sequential machines, error correcting codes, modular arithmetic grammars. Unit-IV Lattices & Boolean Algebra: Axiomatic definition of Boolean algebra as algebra as algebraic structures with two operations , basic results truth values and truth tables, the algebra of propositional functions, Boolean algebra of truth tables. Unit-V Combinatorics & Recurrence Relations: Disjunctive and sequential counting, combinations and permutations, enumeration without repetition, recurrence relation, Fibonacci relation, solving recurrence relation by substitution, solving non- recurrence relation by conversion to linear recurrence relation. 1. Trembly. J.P & Manohar. P., " Discrete Mathematical Structures with Applications to Computer Science" McGraw Hill. 2. Kolman, Busy & Ross "Discrete Mathematical Structures", PHI 3. K.D Joshi, "Foundations of Discrete Mathematics", Wiley Eastern Limited. References Books 1. Seymour Lipschutz & March Lipson Tata Mc Graw Hill. 2. C.L.Liu " Elements of screte mathematics "Tata McGraw Hill". Database Systems Unit-I Introduction-Basic Terminologies- Purpose of Database system- Three level architecture- Data Independence-Data Abstraction- Data Models- Instances & Schema- Data Base Language-Database users- Keys- Relational Algebra- Relational Calculus- Views Unit-II SQL:Introduction- Basic structure- Queries on single relations- Set operations-Aggregate functions and grouping- Querying multiple tables with Nested Subqueries-Views- Modification of the database Unit-III File organiation: Introduction-Overall System Structure-File Organization- Fixed – Length Records- Variable – Length Records- Data Dictionarys. Unit-IV Transaction model: Introduction-Failure classification and types- Transaction model-Log - based recovery schedules- Schedules-Testing for serializability- Multiple Granularity -Multiversion Schemes - Insert and delete operations Unit-V Distributed Database: Introduction- Distributed System Structure-System Failure Modes-Two-Phase Commit Protocol- Handling of failures TextBook Arun K.Majumdar & Pritimoy Bhattacharyya, �Database Management Systems�, Tata McGraw Hill, New Delhi, (fourth edition), 1999. References Books 1. Date, C.J., �An Introduction to Database Systems�, Addison � Wesley Publishing Co., New York, 1995. 2. ISRD Group, �Introduction to Database Management Systems�, Tata McGraw Hill, New Delhi, 2006. Object OrientedPorgramming in Java Unit-I Introduction¯ Tokens, Operators & Expressions¯ Classes & Objects Unit-II Extending Classes¯ Interfaces¯ Nested classes & Interfaces. Unit-III Control flow¯ Exception¯ Strings¯ Packages Unit-IV Threads¯ Programming with types¯ I/O Packaging. Unit-V Collection¯ Utilities¯ Standard Packages TextBook Ken Arnold, James Gosling, David Holmes, "The Java Programming Language", 3rd Edition. References Books 1. Patric Naughton and Herbert Schildt "Java 2 Complete Ref". Tata Mc Graw Hill, 1999. 2. C. Muthu, " Programming with JAVA", Thomson, 2005. 3. Norton Peter and William STanek "Gude to Java Programming" Sams net 1996. Digital Electronics and Micro Processors Unit-I Number Systems: Decimal, Binary, Octal and Hexadecimal number systems- Conversion between number systems- Binary arithmetic-BCD codes � BCD addition- Alphanumeric codes. Boolean Algebra and logic gates : AND, OR, NOT, NAND, NOR, XOR and XNOR gates- Truth tables- Basic laws of Boolean Algebra � De-Morgan�s theorems. Unit-II Simplifications of Boolean expressions- Canonical SOP and POS forms- Karnaugh maps- Implementing Boolean expressions using NAND gates alone- Implementing Boolean expressions using NOR gates alone. Combinational logic circuits: Half and Full adders- Half and Full subtractors- Parallel binary adder- BCD adder- Encoders- Decoders- Multiplexers- Demultiplexers. Unit-III Sequential logic circuits: NAND latch � SR flip-flop- JK flip-flop � Edge triggering- PRESET and CLEAR inputs � Shift register- Universal shift register- Asynchronous and Synchronous counters � BCD counter. Unit-IV Parallel Computer Models: Introduction, Flynn's classification, Parallel & Vector Computers system Attributes to performance, implicit & Explicit parallelism, shared, Memory Multiprocessors. Uniform and Non-uniform Memory Access and Cache only Memory Access Models, distributed Memory Multicomputers Multivector & SIMD Computers, PRAM and VLSI Models Unit-V Processors and Memory hierarchy: CISC & RISC Architectures, CISC Family, RISC scalar processors, Super Scalar Processors and their features. Very Long Instruction word Architecture vector & Symbolic processors, Memory Hierarchy Text Books 1. Moris Mano, “ Digital Computer Fundamentals” TMH, III rd Edition 2. Thomas C Bartee “ Computer Architecture and logic Design ” TMH References Books 1. Malvino and Leech � Digital Principles and Applications� , TMH 2. Badri Ram, �Fundamentals of Microprocessor and Microcomputers� Dhanpat Rai and Sons. 3. Liu and Gibson � Microcomputer Systems� PHI Computer Networks Unit-I Computer Networks - Applications - Line configuration - Topology - Transmission Modes - Categories of Network: LAN, MAN, WAN - OSI Layer. Physical Layer: Signals - spectrum - bandwidth of analog/digital signals – signal encoding - DTE-DCE interface - Transmission Media - Multiplexing : FDM, TDM.. Unit-II Data Link Layer: Error Detection - Error correction - Line discipline Flow Control: stop - wait protocol and sliding window protocol Error control: ARQ, Go-back-n ARQ, selective - repeat ARQ. Data Link Protocols: Asynchronous protocols – synchronous protocol: character oriented - bit oriented protocols - HDLC. LLC, MAC, PDU. MAN: DQDB - SMDS. Unit-III Network Layer: Circuit switching - packet switching - message switching - Connection oriented and connectionless services. Routing Algorithms – congestion control Algorithms - internetworking - Routers and Switches - Introduction to firewalls- Wide Area Network - X.25 - Frame Relay - Frame relay - Protocol Architecture - Frame relay call control - User Data Transfer Network Function - Congestion Control. Unit-IV LAN Protocols: Ethernet - Token Ring - Token Bus - FDDI - Addressing and Frame format – Bridges - LAN Security: Types of threats - Levels of security Case Study: Novell Netware - Wireless LAN: need - components - Receiving Devices - advantages & disadvantages Unit-V TCP/IP Networking : TCE/IP Architecture - Structural overview – Inter networking model - Protocol evolution - Division of functions - Network characteristics - implementation characteristics - Network addressing and Routing: Datagram Header - IP address space - Basic routing consideration -Hardware addressing – Common interior Gateway Protocols - Internet control Message Protocol. Transport Layer: Data flow, ports, sockets - user Data gram protocol - Transmission control protocol - TCP Header - connection establishment and termination - TCP Reliable Delivery & Flow control - Applications and services: Domain name system - Remote Logon – Mail Exchange - File Transfer - Remote Procedure Call - Remote File Access - Security - Window system. Text Book(s) Data Communication and Networking, Behruz A. Ferouzon, Tata McGraw, 2004. References Books 1. Computer Networks - III edition - Andrew S.Tanenbaum - Pearson Edun. 1998. 2. Data and Computer Communication – William Stallings, Pearson Education, 5thEdition, September 2000 Operating Systems Unit-I Operating Systems Objectives and functions – Operating System and User/ Computer Interface, Operating System as a Resource Manager: Evaluation of Operating Systems – Serial Processing, Sample Batch Systems, Time Sharing Systems. Unit-II Process Description, Process Control –Processes and Threads. Concurrency –Principles of Concurrency, Mutual Exclusion – Software support, Dekker’s Algorithm – Mutual Exclusion – Hardware support, Mutual Messages – Deadlock – Deadlock prevention, Deadlock Detection, Deadlock Avoidance – An Integrated deadlock Strategy. Unit-III Memory Management – Memory Management Requirements – Fixed Partationing, Placement Algorithm, Relocation in a Paging System – Sample Segmentation. Virtual Memory – Paging – Address Translation in a Paging System. Segmentation –Organization, Address Translation in a Segmentation System – Combined Paging and Segmentation – Virtual Memory – Operating System Software – Fetch Policy, Placement Policy and replacement Policy, Page buffering resident set Management. Unit-IV Scheduling – Types of Scheduling, scheduling Algorithms, scheduling criteria, FIFO, Round Robin, Shortest Process next, Shortest Remaining Time, Highest response ratio and Feedback scheduling Performance comparison – Fair – Share Scheduling. I/O Management and disk scheduling – Organization of the I/O function – the Evaluation of the I/O function, Logical structure of the I/O function, I/O Buffering, Disk Cache. Unit-V File Management – Files, File Management Systems, File System Architecture, Functions of File Management File Directories – File Sharing – Secondary Storage Management – File allocation. Text Book(s) 1. William Stallings, “Operating Systems”, Second edition, Maxwell McMillan, International Editions, 1997. 2. Charles Crowley, “Operating Systems-A Design Oriented Approach”, IRWIN Publications Chicago, 1997. References Books 1. Dental H.M. “An Introduction to Operating Systems”, Addison Wesley Publishing Co., 1998. Data Structures and Algorithms Unit-I Introduction to data structures, Records, Arrays, Stacks, Queues, Recursion, Linked list, Binary tree and traversing. Unit-II Sorting and Searching Techniques: Introduction, Internal and External Sorting, Insertion, Selection, Merging, Radix, Quick sort, Heap sort and Bubble sort. Searching: Introduction, Sequential search, Binary search, Binary Tree search. Unit-III Graphs and Their applications: Introduction, Graph Theory, Terminology, Representation of graphs, Tree & Binary tree, operations on graphs, shortest path Algorithms, Topological sorting. Unit-IV Algorithms, Development of Algorithms, basic concepts, Structured Program Concepts, Top down development of algorithms, Principle of analyzing Algorithms, Algorithms design methods, Sub goals, Hill climbing Unit-V Algorithms Design Techniques: Divide and Conquer algorithms, Dynamic Programming, Greedy algorithms, Backtracking and Branch & bound. Text Book(s) Seymour Lipschitz “Data Structures, Tata McGraw-Hill 2. Ellis Horowitz & S. Sahni, Fundamentals of Data Structures, Galgotia Pub. References Books 1. Data Structures Using C – Langsam, Augenstien, Tenenbaum, PHI 2. Data structures and Algorithms, V.Aho, Hopcropft, Ullman , LPE 3. Introduction to design and Analysis of Algorithms – S.E. Goodman, ST. Hedetniem- TMH , Unit IV Contact detail: School of Computer Science & Engineering Bharathidasan University Khajamalai Campus Trichirappalli – 620023 |
| 23rd December 2014 08:30 AM | |
| Unregistered | Bharathidasan university virtual learning online MCA Hello sir can you please provide me syllabus of Bharathidasan University virtual learning online MCA?? |
