MCA In Punjab Technical University

I want to do MCA from Punjab Technical University . Will you please provide the PTU MCA course syllabus for an idea ?

[Quick Sam]

Punjab Technical University is located at Jalandhar , Punjab and offers three year duration MCA (Masters of Computer Applications) course .

Course structure

SEMESTER I
MCA-101 (N2) Introduction to Information Technology
MCA-102 (N2) Programming in C
MCA-103 (N2) Accounting & Financial Mgmt.
MCA-104 (N2) Computer Mathematical Foundation
MCA-105 (N2) System Analysis And Design
MCA-106 (N2) Software Lab-I (IT)
MCA-107 (N2) Software Lab-II (C)

SEMESTER II
MCA-201 (N2) Management Information System
MCA-202 (N2) Object Oriented Programming using C++
MCA-203 (N2) Data Communication & Networks
MCA-204 (N2) Principles of Management
MCA-205 (N2) Introduction to Micro Processor
MCA-206 (N2) Software Lab-III (C++)
MCA-207 (N2) Hardware Lab-I (Micro Processor)

SEMESTER III
MCA-301 (N2) Computer System Architecture
MCA-302 (N2) Data Structures
MCA-303 (N2) Workshop on Visual Basic
MCA-304 (N2) RDBMS-I
MCA-402 (N2) Software Engineering
MCA-306 (N2) Software Lab-IV (DS)
MCA-307 (N2) Software Lab-V (RDBMS-I)

SEMESTER IV
MCA-401 (N2) RDBMS-II
MCA-305
MCA-403 (N2) System Software
MCA-404 (N2) Operating System
MCA-405 (N2) Elective-I
MCA-406 (N2) Software Lab-VI (RDBMS)
MCA-407 (N2) Software Lab-VII (OS)
(LINUX/NT)

SEMESTER V
MCA-501 (N2) Computer Graphics
MCA-502 (N2) Internet Programming And Java MCA-503 (N2) Elective-II
MCA-504 (N2)
Elective-III
MCA-505 (N2) Software Lab-VIII (Graphics)
MCA-506 (N2) Software Lab-IX (Java)
MCA-507 (N2) Comprehensive Viva Voce

Elective-I
MCA-405-A (N2) Artificial Intelligence MCA-405-B (N2) Robotics Engineering MCA-405-C (N2) Object Oriented Analysis and Design

Elective-II
MCA-503-A (N2) E-Commerce
MCA-503-B (N2) Compiler Design

Elective-III
MCA-504-A (N2) System Simulation And Modeling MCA-504-B (N2) Advanced Microprocessor Systems

SEMESTER VI
MCA (N2)-601 Project
Punjab Technical University MCA course syllabus
Section A
Computer Fundamentals: Block structure of a computer, characteristics of computers, generation of
computers, classification of computers.
Number System: Bit, byte, binary, decimal, hexadecimal, and octal systems, conversion from one system to
the other, Binary Arithmetic: Addition, subtraction and multiplication. Representation of Information: Integer
and floating point representation, Complement schemes, Character codes (ASCII, EBCDIC, BCD, Excess-3,
Grey).
Section B
Elements of a computer processing system: Hardware – CPU storage devices and media, VDU, input-output
devices, data communication equipment. Software – system software, application software.
Programming languages: classification, machine code, assembly language, higher level language, and fourth
generation languages
Section C
Operating system: Batch, multi-programming, time sharing, mmultiprocessing, PC operating system, network
operating system, on-line and real time operating system.
Computer Network and Communication: Network types, network topologies, network communication
devices, physical communication media, network protocol, (TCP/IP.)
Internet and its Applications: E-mail, TELNET, FTP, World Wide Web, Internet chatting.
Section D
Range of application: Scientific, Business, educational, weather forecasting, and remote sensing, planning,
multilingual applications, management information, decision support system, inventory control, medical,
industrial control, banks, railways, etc.
References:
1. D.H. Sanders,” Computers Today”, Mc Graw Hill, 1988.
2. T.N. Trainers,” Computers” (4th edition) Mc Graw Hill, 1994.
3. V. Rajaraman,”Fundamentals of Computers” (2nd edition),
Internal Assessment: 40
External Assessment: 60
Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have
two questions from the respective sections of the syllabus and will carry 15% marks each. Section E
will have 10-20 short answer type questions, which will cover the entire syllabus uniformly and will
carry 40% marks in all.
Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question
paper and the entire section E
Use of non-programmable scientific calculator is allowed
Section A
Problem Solving with Computers: Algorithms, and Flowcharts. Data types, constants, variables,
operators, data input and output, assignment statements, conditional statements.
Section B
Iteration, arrays, strings processing, defining function, types of functions, function prototype,
passing parameters, recursion.
Storage class specifiers, pre-processor, header files and standard functions.
Section C
Pointers: Definition and uses of pointers, pointer arithmetic, pointers and array, pointers and
functions, pointer to pointer.
Structures, union, pointers to structures, user-defined data types, enumeration.
Section D
Data files: Opening, closing, creating, processing and unformatted data files.
Introduction to Dynamic Memory Allocation
C-programming applications: Sorting (Bubble sort, Selection sort), Searching
(Binary search, Linear Search)
References:
1. Kerighan & Richie The C programming language (PHI Publication)
2. Byron Gottorfried Schaum’s outline of programming with C
3. E.Balaguruswamy Programming in ansi ‘C’ (Tata McGraw Hill)
4. Kanetkar “Let Us C”, BPB Publications. (Tata McGraw Hill)
Internal Assessment: 40
External Assessment: 60
Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have
two questions from the respective sections of the syllabus and will carry 10 marks each. Section E
will have 10-20 short answer type questions, which will cover the entire syllabus uniformly and will
carry 20 marks in all.
Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question
paper and the entire section E
Use of non-programmable scientific calculator is allowed
Section A
Accounting: Principles, concepts and conventions, double entry system of accounting, introduction
to basis books of accounts of sole proprietary concern, closing of books of accounts and preparation
of trial balance.
Final Accounts: Trading, Profit and Loss accounts and Balance sheet of sole proprietary concern
(without adjustment)
Section B
Financial Management: Meaning, scope and role, a brief study of functional areas of financial
management. Introduction to various FM tools: Ration Analysis, Fund Flow statement and cash
flow statement (without adjustments)
Section C
Costing: nature, importance and basic principles. Marginal costing: Nature scope and importance,
Break even analysis, its uses and limitations, construction of break even chart, Standard costing:
Nature, scope and variances (only introduction)
Section D
Computerized accounting: Meaning and advantages, Computer Programs for accounting, Balancing
accounts, Trial balance and final accounts in computerized, Accounting, control, and Audit, Sub-
Modules of computerized accounting systems.
References:
1. J.C.Katyal,” Principles A Book-Keeping”.
2. Jain and Narang,” Principles of Accounting”.
3. I.M.Pandey,” Financial Management, Vikas Publications.
4. Sharma, Gupta & Bhalla,”Management Accounting”.
5. Jain and Narang,” Cost Accounting”.
6. Katyal,"Cost Accounting”.
7. P.H.Barrett,” Computerized Accounting”, BPB.
Internal Assessment: 40
External Assessment: 60
Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have
two questions from the respective sections of the syllabus and will carry 10 marks each. Section E
will have 10-20 short answer type questions, which will cover the entire syllabus uniformly and will
carry 20 marks in all.
Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question
paper and the entire section E
Use of non-programmable scientific calculator is allowed
Section A
Sets and Relations: Definition of sets, subsets, complement of a set, universal set, intersection and
union of sets, De-Morgan’s laws, Cartesian products, Equivalent sets, Countable and uncountable
sets, minset, Partitions of sets, Relations: Basic definitions, graphs of relations, properties of
relations
Section B
Algebra of logic, Propositions, Connectives, Tautologies and contradiction, Equivalence and
implication, Principle of Mathematical induction, quantifiers.
Section C
Introduction of a Matrix, its different kinds, matrix addition and scalar multiplication, multiplication
of matrices, transpose etc. Square matrices, inverse and rank of a square matrix, solving
simultaneous equations using Gauss elimination, Gauss Jordan Methods, Matrix Inversion method.
Section D
A general introduction, simple and multipgrpahs, directed and undirected graphs, Eulerian and
Hamiltonian Graphs, Shortest path algorithms, Chromatic number, Bipartite graph, graph coloring.
References:
Alan Doerr,”Applied Discrete Structures for Computer Science”, Galgotia Publications.
Kolman and Busby “ Discrete Mathematical structures for Computer Sciences” PHI.
Internal Assessment: 40
External Assessment: 60
Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Section A, B, C and D will have
two questions from the respective sections of the syllabus and will carry 10 marks each. Section E
will have 10-20 short answer type questions, which will cover the entire syllabus uniformly and will
carry 20 marks in all.
Instruction for candidates
Candidates are required to attempt one question each from sections A, B, C and D of the question
paper and the entire section E
Use of non-programmable scientific calculator is allowed
Section A
System: Definition, Characteristics, elements and types of system. System Development Life Cycle,
Role of system analyst, Initial investigation, Feasibility study-Technical, economic and behavioral
feasibility, Cost and Benefit analysis.
Section B
System Analysis: Problem Definition, Information requirements, Information gathering tools, Tools
of structured Analysis – Data Flow Diagrams, Data Dictionary, Decision Tree, Decision tables and
structured English.
Section C
System Design: Structured Design, Input design, and Output design, Form Design. File
Organization: Sequential Indexed Sequential, Chaining and Inverted list organization. System
Testing: Test Plan AND test data, type s of system test.
Section D
System Implementation: Implementation Plan, activity network for conversion, combating resistance
to change. Hardware/Software Selection: Procedure for selection, Major phases in selection, Make
v/s buy decision, Criteria for software selection.
References:
1. Awad, EM: System Analysis and Design, Galgotia Publications Pvt. Ltd
2. Gane and Sarson: Structured System Analysis and Design.
3. Silver, GA, Silver, ML: System Analysis and Design, Addison-Wesley Publishing Co
Internal Assessment: 40
External Assessment: 60
This laboratory course will mainly comprise of exercises on:
MCA 101: Typical Commands of DOS, GUI in Windows.
MCA-103: Introductory Study of Computerized Accounting Packages
Maximum marks for continuous assessment: 40
Maximum marks for university examination: 60
Note: The break up of marks for the practical 9university examination) will be as under
Lab record 15 marks
Viva Voce 15 marks
Execution of commands 30 marks
Internal Assessment: 40
External Assessment: 60
This laboratory course will mainly comprise of exercises on what is learnt under paper: MCA-102
Maximum marks for continuous assessment: 40
Maximum marks for university examination: 60
Note: Program should be fully documented with simple I/O data. Flow charts should be developed
wherever necessary.
Write program in ‘C’ language
1.Using input and output statements
2.Using control statements.
3.Using functions.
4.Using array
5.Using structure.
6.Using files.
7.To sort an array using different methods
8.To search an element from array.
The break up of marks for the practical 9university examination) will be as under
Lab record 15 marks
Viva Voce 15 marks
Program Development 30 marks
And execution
Contact Details:
Punjab Technical University
Jalandhar-Kapurthala Highway, Kapurthala, Near Pushpa Gujral Science City, Jalandhar, Punjab 144601
0182 266 2521
For detailed syllabus, here is the attachment;