SCHEME OF EXAMINATION FOR MASTER OF COMPUTER APPLICATIONS (M.C.A.)
w.e.f. Academic Session 2017-18 (CHOICE BASED CREDIT SYSTEM (CBCS))
|
Paper Code
|
Nomenclature of Paper
|
Credits
|
Exam Time
(hrs.)
|
External Marks
|
Internal Marks
|
Total Marks
|
Max
|
Pass
|
Max
|
Pass
|
3rd Semester
|
MCA-16-31
|
DATABASE SYSTEMS
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-32
|
COMPUTER NETWORKS
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-33
|
JAVA PROGRAMMING
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-34
|
THEORY OF COMPUTATION
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-35
|
OBJECT ORIENTED ANALYSIS AND DESIGN USING UML
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-36
|
S/W LAB – V BASED ON MCA-16-31
|
2.5
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-37
|
S/W LAB – VI BASED ON MCA-16-33 & MCA-16-35
|
2.5
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-38
|
SEMINAR
|
1
|
1/2
|
|
|
50
|
50
|
20
|
OE
|
OPEN ELECTIVE (Students has to select a paper from other department(s) of Faculty of Sciences (Physical Sciences) of KUK)
|
2
|
3
|
35
|
14
|
15
|
50
|
20
|
|
TOTAL__28_____560__224'>TOTAL
|
28
|
|
560
|
224
|
240
|
800
|
320
|
4th Semester
|
MCA-16-41
|
DESIGN AND ANALYSIS OF ALGORITHMS
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-42
|
COMPILER DESIGN
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-43
|
DATA WAREHOUSING AND MINING
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-44
|
COMPUTER GRAPHICS
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-45
|
LINUX AND SHELL PROGRAMMING
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-46
|
S/W LAB–VII BASED ON MCA-16-44
|
2.5
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-47
|
S/W LAB-VIII BASED ON MCA-16-45
|
2.5
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-48
|
SEMINAR
|
1
|
1/2
|
|
|
50
|
50
|
20
|
|
TOTAL
|
26
|
|
525
|
210
|
225
|
750
|
300
|
5th Semester w.e.f. Academic Session 2018-19 (CHOICE BASED CREDIT SYSTEM (CBCS))
|
MCA-16-51
|
ADVANCED WEB TECHNOLOGIES
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-52
|
HIGH PERFORMANCE NETWORKS
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-53
|
MOBILE APPLICATION DEVELOPMENT
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-54
|
ELECTIVE-I
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-55
|
ELECTIVE-II
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-56
|
S/W LAB–VII BASED ON MCA-16-51
|
2.5
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-57
|
S/W LAB-VIII BASED ON MCA-16-53
|
2.5
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-58
|
SEMINAR
|
1
|
1/2
|
|
|
50
|
50
|
20
|
|
TOTAL
|
26
|
|
525
|
210
|
225
|
750
|
300
|
ELECTIVE-I
-
ARTIFICIAL INTELLIGENCE
-
SECURITY IN COMPUTING
-
INFORMATION SYSTEMS
|
ELECTIVE-II
-
DIGITAL IMAGE PROCESSING
-
CLOUD COMPUTING
-
OPERATIONAL RESEARCH
|
6th semester
|
MCA-16-61
|
ADVANCED JAVA TECHNOLOGIES
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-62
|
PYTHON PROGRAMMING
|
4
|
3
|
75
|
30
|
25
|
100
|
40
|
MCA-16-63
|
MINOR PROJECT
|
8
|
|
150
|
60
|
50
|
200
|
80
|
|
TOTAL
|
16
|
|
300
|
120
|
100
|
400
|
160
|
OR
|
MCA-16-66
|
MAJOR PROJECT
|
16
|
|
300
|
120
|
100
|
400
|
160
|
|
TOTAL
|
16
|
|
300
|
120
|
100
|
400
|
160
|
|
GRAND TOTAL
|
150
|
|
2995
|
|
1255
|
4250
|
1700
|
Note: Size of Groups for all practicals should not be more than thirty students.
MCA-16-31 DATABASE SYSTEMS
Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.
Objectives: The objective of the course is to provide fundamental concepts necessary for designing, using and implementing database systems and database applications; these concepts includes aspects of database modeling & design, database languages, database management systems and database systems implementation techniques. Using these concepts students will be ready for job assignments on database systems and to undertake projects on database design and implementation.
Learning Outcomes: At the end of course the students should be able:
-
To understand overall process of database modeling & design, Implementation
-
To work on assignments on database modeling & design
-
To undertake various projects on database applications
UNIT – I
Basic Concepts: File Systems vs. DMBS, Characteristics of the Database Approach, Abstraction and Data Integration, Database users, Advantages and Disadvantages of a DBMS.
Database Systems Concepts and Architecture: Data Models, Schema and Instances, DBMS architecture and Data Independence, Database languages and Interfaces, DBMS functions and component modules.
Entity Relationship Model: Entity Types, Entity Sets, Attributes & keys, Relationships Types & instances, Roles and Structural Constraints, E-R Diagrams, Design of an E-R Database Schema, Reduction of an E-R schema to Tables.
Relational Data Model: Relational Model Concepts, Integrity Constraints over Relations, Relational Algebra – Basic Operations.
UNIT – II
SQL: Data Definition and Data Types, DDL, DML, and DCL, Views & Queries in SQL, Specifying Constraints & Indexes in SQL.
Relational Database Management System: ORACLE-Basic structure, Database Structure & its manipulation in ORACLE, Storage Organization in ORACLE, Programming ORACLE Applications.
Conventional Data Models: An overview of Network and Hierarchical Data Models.
UNIT – III
Relational Database Design: Functional Dependencies, Decomposition, Normal forms based on primary keys- (1NF, 2NF, 3NF, BCNF), Multi-valued Dependencies,4 NF, Join dependencies,5 NF, Domain Key Normal form.
Practical Database Design: Role of Information systems in Organizations, Database design process, Physical database design in Relational Database.
UNIT – IV
Transaction Processing Concepts: Introduction to Transaction Processing, Transaction & System Concepts, Properties of Transaction, Schedules and Recoverability, Serializability of Schedules.
Concurrency Control Techniques: Locking Techniques, Timestamp ordering, Multi-version Techniques, Optimistic Techniques, Granularity of Data items.
Recovery Techniques: Recovery concepts, Recovery Techniques in centralized DBMS.
Database Security: Introduction to Database Security issues.
Text Books:
-
Elmasri & Navathe: Fundamentals of Database systems, 7th edition, Pearson Education.
-
Thomas Connolly Carolyn Begg: Database Systems, 3/e, Pearson Education.
Reference Books:
-
Korth & Silberschatz: Database System Concept, 6th Edition, McGraw Hill International Edition.
-
Raghu Ramakrishnan & Johannes Gehrke: Database Management Systems, 3rd edition, Mcgraw Hill.
-
Peter Rob, Carlos Colonel: Database system Design, Implementation, and Measurement, Cengage Learning, 8th Ed.
-
Abbey, Abramson & Corey: Oracle 8i-A Beginner’s Guide, Tata McGraw Hill.
-
Ivan Bayross: SQL, PL/SQL- The Program Language of ORACLE,4th Edition BPB Publication.
MCA-16-32 COMPUTER NETWORKS
Maximum marks: 100 (External: 75, Internal: 25) Time: 3 hours Credits: 4
Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.
Objectives: The objective of this course is to provide the in-depth coverage of various concepts of computer networks. Using these concepts students will be able to understand the networking environment in real-world.
Learning Outcomes: At the end of this course students should be able to:
-
Understand various uses and types of computer networks.
-
Understand the concepts of data communication.
-
Understand the various issues in protocols design.
UNIT – I
Introduction to Computer Networks and its uses; Network categorization and Hardware; Topologies; Network Software: Protocols, Services, Network Architecture, Design issues for the layers, OSI Reference model, TCP/IP Reference model, Comparison of OSI and TCP/IP Models. Introduction to Example Networks: Internet, ISDN, X.25, Frame Relay, ATM.
UNIT – II
Data Communication Model, Digital and Analog data and signals, Asynchronous and Synchronous transmission; bit rate, baud, bandwidth, Transmission impairment; Channel Capacity; Guided Transmission Media; Wireless transmission; Satellite communication.
Switching; Multiplexing; Spread Spectrum; local loop; Modems and ADSL; Encoding: NRZ, NRZ-I, Manchester and Differential Manchester encoding; Internet over Cable; ADSL Versus Cable; The Mobile Telephone System;
UNIT – III
Data Link Layer Design issues; Framing, Error Detection and Correction; Flow Control: Sliding Window Protocols; Medium Access Control: Aloha, CSMA protocols, Collision free protocols, Limited Contention Protocols; Wavelength Division Multiple access protocol, Wireless LAN Protocol: MACA; High Speed LANs; Ethernet LAN, Fast Ethernet, Gigabit Ethernet; Binary Exponential Backoff algorithm; Token Ring and FDDI; Introduction to Wireless LANs;
UNIT – IV
Network Layer Design issues , Virtual Circuit and Datagram Subnet, Routing Algorithms: Optimality principle, Shortest path Routing, Flooding , Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast and Multi Cast Routing, Routing for Mobile hosts, Congestion Control Algorithms: General Principals; Congestion control in Virtual – Circuit Subnets; Congestion Control in Datagram Subnets: Choke packets, Load Shedding; Random Early Detection, Jitter Control; Quality of Service: Over provisioning, Buffering, Traffic Shaping, Leaky bucket, token bucket, Resource Reservation, Admission Control, Packet Scheduling;
Dostları ilə paylaş: |