BHU MCA Course Fees

I am looking for Banaras Hindu University Master of Computer Applications course fees structure, will you please provide here???

[Arun Vats]

Banaras Hindu University Master of Computer Applications course details are as given below:

Master of Computer Applications

Duration
3 years - 6 Semesters

Eligibility
The applicant should have a Bachelor’s Degree under at least 10+2+3 pattern in any discipline with a minimum of 50% marks in the aggregate.

Mode of Admission
Admissions are made through an Entrance Examination Postgraduate Entrance Test (PET) generally conducted between May/June every year.

Fees
Course Fee Rs. 50,000.00
Hostel Fee: Rs. 4500.00

Syllabus
Here is the attachment for BHU MCA syllabus:


MCA-101 Discrete Mathematics Credits: 4

Poset, Hasse Diagrams, Lattice, Boolean Algebra, Application to switching circuits.
Formal grammars, Chomsky Hierarchy, Finite state Machines: Moore and Mealey.
Permutation, Combination, Recurrence Relations, Generating Functions, Principle of Inclusion and Exclusion.

Basic Concepts of Graphs and Trees, Adjacency and Incidence Matrices, Spanning Tree, Transitive Closure, Shortest Path, Planar Graphs, Graph colouring, Applications of Graph Theoretic concepts to Computer Science.
Introduction to Mathematical Logic.

Suggested Books:
(1) J.P. Trembley and R.P.Manohar, Discrete Mathematical Structures with Applications to Computer Science, McGraw Hill.
(2) Dornhoff and Hohn, Applied Modern Algebra, McMillan.
(3) N. Deo, Graph Theory with Applications to Engineering and Computer Science, PHI.
(4) R. Johnsonbaugh, Discrete Mathematics, Pearson Education, 2001.
(5) R. P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson Education, 1999.
(6) C.L. Liu, Elements of Discrete Mathematics, McGraw-Hill, 1985.
(7) K.H. Rosen, Discrete Mathematics and Its Applications, Tat McGraw Hill, 2003.


MCA-102 Introduction to Programming Languages Through C Credits: 7

High-level programming Languages and paradigms, Syntactic Structure, Semantics, Data Representation, Data Abstraction, Procedure activation, Structured Programming, Block Structuring.

Procedural Languages, Object-oriented Programming, Functional Programming, Logic Programming.

Introduction to Programming Language C, Data Type, Operators and Expressions in C, Control and Repetitive Statements : IF-THEN-ELSE, SWITCH, WHILE, FOR, DO. Break and Continue Statements. Input and Output functions, Function and Program Structure in C, Parameter passing, Pointers, Arrays, Structures, C-Library.

Suggested Books:
(1) R. Sethi, Programming Languages, Addison-Wesley, 1996.
(2) D. Appleby and J. J. VandeKopple, Programming Languages, Tata McGraw-Hill, 1991.
(3) B.W. Kernighan and D.M. Ritchie, The C Programming Language, PHI.
(4) R.C. Hutchinson and S.B. Just, Programming using the C Language, McGraw-Hill.
(5) B.S. Gottfried, Schaum's Outline of Theory and Problems of Programming with C, McGraw-Hill.
(6) H. Schildt, C Made Easy, Osborne McGraw-Hill.


( 14 )
MCA-103 Data and File Structures Credits: 4

Data Structures:
Basic Data Structures : Arrays, Linked Lists, Stack, Queue, Dequeue, Tree, Heap, Hash Table and Collision resolution. Basic algorithms for Creation, Manipulation of Data Structures. Internal Sorting Algorithms : Bubble, Heap, Quick Sort. Tape sorting and Merging. C as the programming language for implementation of these algorithms.

File Structures:
Primary File Organization: Sequential, Direct, Indexed Sequential.
Multi-list File Organization, Inverted Files.
File Sorting, Hashing

Suggested Books:
(1) Lipshutz, Data Structure, McGraw Hill.
(2) Standish, Data Structure, Addison-Wesley.
(3) B. Salzberg, File Structures, Prentice-Hall, 1988.
(4) A.L. Tharp, File Organization and Processing, John Wiley and Sons, 1988.
(5) A. M. Tennenbaum, Y. Langsam and M. J. Augenstein, Data Structures using C, PHI, 1991.


MCA-104 PC Software Laboratory Credits: 5

Document preparation using MS Word, Latex, Electronic Spreadsheet, Database Package using Access, Use of Mathematica.

MCA-105 Business Accounting Credits: 3

Introduction, Definition, Concepts and Conventions of Accounting, Principles of Double Entry System, Recording, Classification and Summarization of business transactions, Preparation of Cash Book and Bank Reconciliation statement.

Final Accounts: Final Accounts of Sale proprietary concern, Partnership and Joint Stock Companies.

Cost Accounting: Definition, objectives and significance of cost Accounting, cost Accounting Vs. Financial Accounting, Classificvation of costs, Preparation of Cost sheet.

Marginal Costing.

Suggested Books:
(1) J. Kellock, Elements of Accounting, Heinemann.
(2) R.L .Gupta & M. Radhaswamy, Advanced Accountancy, Sultan Chand.
(3) Dr. S.M. Shukla, Advanced Accounting, Sahitya Bhawan.
(4) Jawahar Lal, Cost Accounting, Tata McGraw Hill.
(5) S.P. Jain and K.L. Narang, Cost Accounting, Kalyani Publishers.



MCA-201 Digital Computer Organisation and Assembly Language Programming Credits: 4

Information Representation and Manipulation, Character Codes, Redundant Coding, Logic Gates, Switching Algebra, De-Morgan's Theorem, Switching function minimization using Karnaugh's map (up to 4 variables). Basic building blocks of digital computer: Flip flops. Registers, Counters, Multiplexer, etc.

Basic Model of Stored Program Computer, Instruction sets : Reduced, Complex. Addressing Schemes, Instruction Execution mechanism, Organization of CPU, Memory Organization, RAM, ROM, Cache Memory, Associative memory Organization, I/O devices with special reference to modern peripheral devices, Data Transfer Schemes : Hand Shaking, Polling, DMA. I/O Processor. Overview of 32-bit Processors.

Assembly Language Programming :
Assembly Language of P-IV, Assembler, Machine Language Instruction Processor, Completeness of Instruction Set. Details of the instructions of P-IV with timing diagrams for instruction execution. Design of Assembly Language Programs for Common Application Problems such as Maximum finding, Summation, Sorting, Searching, Multiple Precision Arithmetic, etc.

Suggested Books:
(1) Malvino, Digital Computer Electronics, TMH.
(2) Gaonkar, Microprocessor Architecture Programming Applications with 8085/8080A, Wiley Eastern.
(3) J.P.Hayes, Digital System design and Microprocessor, McGraw Hill
(4) J.P.Hayes, Computer Architecture and Organization, McGraw Hill.
(5) M.M.Mano, Computer System Architecture, PHI.
(6) Y. Yu and C. Marut, Assembly Language Programming and Organisation of the IBM PC, McGraw Hill, 1992.


MCA-202 E-Commerce Credits: 3

Introduction, Definition, Objectives, Advantages and disadvantages, Forces driving E-Commerce, Traditional commerce Vs. E-Commerce, E-Commerce opportunities for industries, Growth of E-Commerce.

E-Commerce Models: Business to consumer, Business to Business, Consumer to Consumer, other models – Brokerage Model, Aggregator Model, Info-mediary Model, Community Model and value chain Model.

Electronic Payment Systems: Special features required in payment systems, Types of E-payment systems, E-Cash, E-cheque, credit card, Smart Card, Electronic Purses.

E-Marketing, E-Customer Relationship Management, E-Supply Chain Management.
Security Issues in E-Commerce: Security risk of E-Commerce, Types of threats, Security tools and risk management approach. Cyber laws, Business Ethics, IT Acts.

Suggested Books:
(1) Bharat Bhaskar, Electronic Commerce – Frameroork Technologies and Applications, Tata McGraw Hill.

( 16 )
(2) Ravi Kalakota & A.B. Whinston, Frontiers of Electronic Commerce, Pearson Education.
(3) Ravi Kalakota & A.B. Whinston, Electronic Commerce – A Manager’s Guide, Pearson Education.
(4) Agarwala Kamlesh, N and Agarwala Deeksha, Business on the Net_Introduction to the E-Com., Macmillan India.
(5) P. T. Joseph, E-Commerce: A Managerial Perspective, PHI, 2002.


MCA-203 Data Base Management System Credits: 7

DBMS Concepts: Data abstraction, database system architecture, Schemas and Subschemas, data independence. Physical Data Organization: Hashed, index file, B-tree.

Data Models: Data modeling using entity relationship. Hierarchical and Network Model: DBTG proposals, data manipulation languages.

Relational Model : Relational Algebra and Calculus, Storage organization for relations, Functional, Multivalued and Project-Join dependencies, Decomposition. Normal Forms: First, Second, Third, BCNF, Fourth and PJ normal forms.

Relational Query language, Query processing, Query optimization : General strategies of optimization, Optimizing Algebraic Expression, Systematic Query optimization using cost estimate.
Security in DBMS to gain integrity mechanism of roll-back and recovery, validation and data translation of database operation and management.
Case Study of Oracle.

Suggested Books:
(1) C.J. Date, An Introduction to Database Systems, Vol I & II, Addison Wesley.
(2) J.D. Ullman, Principles of Database Systems, Galgotia, New Delhi.
(3) Wiederhold, Database Design, McGraw Hill.

MCA-204 Operating System Credits: 4

Evolution of Operating System. Basic concepts: User, job, Resources, Batch processing, Multi-programming, Time sharing, Process, Process Control Block.

Memory management: Address Protection, Segmentation, Virtual Memory, Paging, Page replacement algorithms. Support for concurrent process : Mutual Exclusion, Shared Data, Critical Sections, Busy form of waiting, lock and unlock primitives, synchronization, blocking and wake up. Process Scheduling: Process states, virtual processors, interrupt mechanism, scheduling algorithms, implementation of concurrency primitive.
System Deadlock : Prevention, Detection and Avoidance.

Multiprogramming system: Queue management, I/O Supervisors, Memory Management. File system, disk scheduling.
Shell Programming, UNIX-C interface, System calls, Device Driver,
Interrupt Handler.
UNIX and Linux as example systems.