VIKRAMA SIMHAPURI UNIVERSITY, NELLORE _ 524 324

DEPARTMENT OF COMPUTER SCIENCE

Structure & Syllabus for Master of Computer Applications (2 Year Programme) for V.S. University Constituent Collcgc(s) and
@ Affiliated Colleges under thc i urisdiction of Vikrama Simhapuri Universitr'' Ncllore rr'ith cffcct from thc Academic Ycar 202'l-'25.

Semester -l
Course Course Total
S.\o Title of the Course Courses H/W ('rcdits SEI li\
Category Code Marks
Core Course 101 Core Course - I Data Structures & Algorithms 4 4 l0 i0 100

l Core Course
102
Core Course - 2 a. Discrete Mathematical Structures
(Elective) h Com uter Networks 4 3 50 25 75

.,)
Core Course Core Course - 3 a Operating Systems
(Elective)
l0i b. Design & Analysis olAlgorithms 4 , 50 25 75

"1 Practical - l
Practical 104
(Related to cc 2 & 3)
CoreCourse-2&3 6 2 35 15 50

5 Skill Oriented Course I il Advanced Java Programming

Skill Oriented 4 50 25 75
Course 105 b. Ethical Hacking
Elective)
(r Skill Oriented Course 2 il. Database Management Systems
Skill Orie ntcd l5
Course 106 b. Principles of Python Programming 4 50 75

Elective)
7 Practical -2 t5
Practical 101 Skill Oriented Course 1 & 2 6 2 35 50
Related to SOC I & 2
tt Open Online OOCs (NPTEL/ SWAYAM) - I: Any 12
Open Online
Transdisciplinary eek Course on Management/ Mathematic 0 l
Transdisciplinary 108
pplied Mathematics/ Statistics olfered by othe
Course - l
Course
an Com uter Science.
9 Indian Knowledge 0 0
Audit Course a Indian History and Culture 4 0 0
109 Systems -I
Elective b Inlormation Technolo Act
Total ,16 22 3.10 160 500

Page I ol' 5
$$dLe-F=4 U&,*"D- G uuaal a^&l\'vi
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE _ 524 324
DEPARTMENT OF COMPUTER SCIENCE
Structure & S1'llabus for Master of Computer Applications (2 Year Programme) for V.S. University Constituent College(s) and Affiliated Collcgcs
under thc u risdiction of Vikranra Sirnha uri Universi , Ncllorc rvith effcct from the Acadcmic Year 202.1-'25.
Scmester -lI
Course Course Total
[Link] Title of the Coursc Courses H/W Clrcdits SET] IA
Category, Code Marks
I Core Course 201 Core Course - 4 Enterprise Soft ware Engineering 4 4 70 30 l(x)
2 702 Core Course -5 a Artifi cial Intelligence
Core Course b. Cryptography and Network Security 1 J 50 l5 75

l 203 Core Course - 6 a Block Chain Technology

Core Course b. Data Science
.+ J 50 25 75

.+ 204 Practical -3
Practical
(Related to CC 5 & 6)
Core Course -5 & 6 6 ) 3-s 15 50

205 Skill Oriented Course 3 a Devops

Skill Oriented
Course b. Web Development using .Net
I J -s0 25 75

Technologies
6 206 Skill Oriented Course 4 a. C'loud Computing
Skill Oriented
Course b. User Interface and User Experience (UI
.+ J 50 25 75
& UX) Design
l Practical
207 Practical -4
Skill Oriented Course 3 & 4 6 2 35 l5 50
(Related ro SOC 3 & 4)
ti Open Online 208 Open Online MOOCs (NPTEL/ SWAYAM) - II:
Any 12 Week
Transdisciplinary Transdisciplinary Course onManagement/ Mathematics/ Applied 0 1

Course Course -2 Mathematics/ Statistics offered by

other than
Computer Science.
()
209 lndian Knowledge
Audil Clourse I Sanskrit and Classical Languages 4 0 0 0 0
Systems - 2
b. Vedic Mathematics
Total 36 )1 -1,1() 160 500

\jt$p-Q-tJ 0-o\o^{aorq\'*'
Pase 2 ol'5
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE - 524 324
DEPARTMENT OF COMPUTER SCIE,NCE
Structure & Syllabus for Master of Computer Applications (2 Year Programme) for V.S. Univcrsity- Constituent College(s) and Affiliated Collcges
undcr thc j urisdiction of Vikrama Simhapuri Universitl, Nellore u ith effect from the Academic Year 2024-'25.

Semcstcr -l I I
Course Course Total
[Link] Titlc of the Course Courses II/W Credits SI'E I,{ Marks
Categorv Code
I 301 Core Course - 7 Software Project Management ,t 1 7o 30 1(X)
Core Course
l 302 Core Course -8 a. Mean Stack Development
Core Coursc .+ J 50 25 75
b. Internet of Things
l 303 Core Course - 9 a Digital Image Processing
Core Course b. Machine Leaming 4 .) 50 25 75
-1 30.+ Practical -5 )
Practical (Related to CC 8 & 9) CoreCourse-8&9 6 35 15 50

5 Skill Oriented 305 Skill Oriented Course-5 a Mobile Apptication Development

.+ J 50 25 75
Course b. Web Interface Design
6 Skill Oriented 306 Skill Oriented Course - 6 ll Data Analysis using Power BI
50 l5 75
4
Course b. NoSQL with MongoDB -1

l Practical 307 Practical -6

i5 l5 50
(Related to Soc 5& 6) Skill Oriented Course 5 & 6 6 2

Seminar / Tutorials / Remedial Classes and Quiz as part of Intemal Assessment 4 0

Total 3(r 20 .1.10 t60 500

ti,,^l-- @-e-l Ucs.,,r4t & u,,5"r1*-1.^rrr\-

Page 3 of5
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE - 524 324
DEPARTMENT OF COMPUTER SCIENCE
Structure & Syllahus for Master of Computer Applications (2 Ycar Programme) for V.S. University Constituent College(s) and Affiliated Collcges
under the jurisdiction of Vikrama Simhapuri University, Nellore rvith effect from the Academic Year 202,1-'25.

Scmcstcr -lV
Coursc Course Total
S. No
Category Code
Titlc of the Coursc Courses Hnv ('rcdits SEE IA Marks
l Open Online Skill 401 Open Online Skitl *MOOCS ( NPTEL/ SWAYAM) - III: Any 12 Week
Development Development Courses duration course related to Computer Science which is 0 .+

Course not listed in the course structure

2 Open Online Skill 402 Open Online Skill *MOOCs ( NPTEL/ SWAYAM) - IV: Any l2 Week
Development Development Courses duration course related to Computer Science which is 0 +
Courses not listed in the course structure
Project Work 40i Project Work Project Work 6 t2 200 l(x) 300

Total 06 20 200 I00 .100

Students may be allowed to register and appear for any l2 / 8 Weeks (4 Credits) or any Two Four Weeks (2 X 2 Credits = 4 Credits) MOOCs
courses from the first semester itself.
However, Students are to complete the MOOCs Courses successfully and submit pass certificate of the same to the university through the
principal of the College concerned for approval and endorsement ol the same on grade cards and PCs and ODs as per the regulations of the
University.

trq"1"\o^f*V^-'
GI$dI--@.+--(

Page ,l of 5
Total number of credits at the end of coursc:
s. Scmcster Ilours ('red its Total Marks

No.
1 I 36 )) 500
1 II 36 22 500
3 III 36 20 500
4 06 20 300
Total l16 8{ t 800

Procedure for Project Evaluation and Viva-Voce:

The Project Evaluation and Viva-Voce for 200 marks shall be conducted by a committee consisting of Intemal and Extemal Examiner nominated
by the University. The Intemal Evaluation for 100 marks shall be made by the departmental committee (HEAD, Project Supervisors') on the basis of
three review presentations given by each student on the approved topic ofhis/ her Project.

C.r1^""L0^"/"*'
\J}(^&-+-r.--, W*p-W

Page 5 of 5
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@
#=* DEPARTIVIENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Afliliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yeat 2024:25.

Programme MCA Semester First

DATA STRUCTURES
Course Code l0l Course Name
& ALGORITHMS
I- t- P
Course Hours/Week
CORECOURSE I 4 0 0
Clategory
Clred its 4
Course r To understand the usage of algorithms in computing.
Objectives . To learn and use hierarchical data structures and its operations
. To leam the usage ofgraphs and its applications.
. To select and design data structures and algorithms that is appropriate for
problems.
. To study about NP Completeness of problems.
[Link] -1 ROLE OF ALGORITHMS IN COMPUTING: Algorithms. Algorithms as a
Technology. Insertion Sort, Analyzing Algorithms, Designing Algorithms, Growth
of Functions: Asymptotic Notalion, Standard Notations and Common Functions,
Recurrences: The Substitution Method, The Recursion-Tree Method.
LINIT.2 HIERARCHICAL DATA STRUCTURES: Binary Search Trees: Basics.
Querying a Binary search tree, Insertion and Deletion. Red-Black trees: Properties
of Red-Black Trees, Rotations, Insertion. Deletion. B-Trees: Definition of B-trees,
Basic operations on B-Trees, Deleting a key from a B-Tree. Fibonacci Heaps:
structure. Mergeable-heap operations. decreasing a key and deleting a node-
Bounding the maximum degree.
LINIT -3 Elementary Graph Algorithms: Representations of Graphs, Breadth-First Search,
Depth-First Search. Topological Sort, Strongly Connected Components. Minimum
Spanning Trees: Growing a Minimum Spanning Tree, Kruskal and Prim, Single-
Source Shortest Paths: The Bellman-Ford algorithm, Single-Source Shortest paths
in Directed Acyclic Graphs. Dijkstra's Algorithm; All-Pairs Shortesl Paths:
Shortest Paths and Matrix Multiplication, The Floyd- Warshall Algorithm.
UNIT -4 ALGORITHM DESIGN TECHNIQUES: Dynamic Programming: Matrix-Chain
Multiplication. Elements of Dynamic Programming. Longest Common
Subsequence. Greedy Algorithms: An Activity-Selection Problem. Elements of the
Greedy Strategy. Hulfman Codes.
NP COMPLETE AND NP HARD: NP-Completeness: Polynomial Time,
Polynomial-Time Verification, NP- Completeness and Reducability. NP-
Completeness Proofs, NP-Complete Problems.
Text Books I . Alfred V. Aho. John E. Hopcroft, Jeffrey D. Ullman, Structures and
Algorithms, Pearson Education. Reprint 2006.
-Data
2. Robe( Sedgewick and Kevin Wayne. ALGORITHMS, Fourth Edition, Pearson
Education.
Reference [Link]. "Design and Analysis of Algorithms", First Edition, Oxford
Rooks University Press. 2014.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
to Algorithms. Third Edition. Prentice-Hall, 201 I .
-lntroduction

I r$""r{- 3.q \.,,J L4

7 \lg.^t"rL- 1of31
 VIKRAMA SIM HAPU RI U NIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yea( 2024:25.

Course Outcomes : After completion of the course student able lo

Klowledge
Course Outcome Description
Level
col Design data structures and algorithms to solve computing problems K6
Design algorithms using graph structure and various string matching K6
co2
algorithms to solve real-life problems
Apply suitable design strategy for problem solving KJ
co3
Use appropriate linear/non-linear data structure operations for solving a K2
co4 given problem
Kl- [Link]. K2- Understanding. K3- Appl_,"ing. K4- Anallzing. K5- Ll aluating. K6- Crcating
COURSE AND PROGRAMMI] OUTCOMI]S MAPPING

POI PO2 PO3 P()4 PO5 PO6 PO7 PO8 P09 POl0 PSOI PS()2 PSO3
COl 2 3 I
co2 2 2
co3 2 2
co4 3 )
I -Low, 2-Medium, 3-High

3 Q"1.1n1"^*\t""
l' dd"d€-
9
Uk-"*q-

2of31
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@ DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Afflliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024!25.

Programme MCA Semester First

DISCRETE I\,IATHEMATICAL
Course Code 102 Course Name
STRUCTURES

CORE COURSE 2A. Hours/Week

L f P
Course - l 0 0
Category (ELECTIVE)
Credits J
Course . Introduce the concepts of mathematical logic
Objectives . Gain knowledge in sets. relations and functions
r Solve problems counting techniques and combinatorics.
. To introduce generating functions and recurrence relations
. Use Graph Theory for solving real world problems.
UNIT.I Mathematical Logic: Introduction. Statements and Notation, Connectives. Well-
formed formulas, Tautology, Duality law. Equivalence, Implication. Normal
Forms. Functionally complete set of connectives, Inference Theory of Statemenl
Calculus. Predicate Calculus, Inference theory of Predicate Calculus.
UNII'-2 Set theory: Basic Concepts ofSet Theory. Relations and Ordering, The Principle of
Inclusion- Exclusion, Pigeon hole principle and its application. Functions
composition of functions, Inverse Functions, Recursive Functions. Lattices and its
properties. Algebraic structures: Algebraic systems-Examples and General
Properties, Semi groups and Monoids. groups, sub groups. homomorphism.
Isomorphism.
UNIT.3 Elementary Combinatorics: Basics of Counting, Combinations and Permutations,
Enumeration of Combinations and Permutations, Enumerating Combinations and
Permutalions with Repetitions. Enumerating Permutations with Constrained
Repetitions, Binomial Coefficients. The Binomial and Multinomial Theorems.
Recurrence Relations: Generating Functions ol Sequences, Calculating
Coefficients of Generating Functions. Recurrence relations. Solving Recurrence
Relations by Substitution and Generating functions, The Method of Characteristic
roots. Solutions of I nhomogeneous Recurrence Relations.
UNIT.4 Graphs: Basic Concepts, Isomorphism and Sub-graphs, Trees and their Properties,
Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler's Formula.
Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic, The Four Color
Problem.
-l'cxt
IJooks l. Joe L. Mott, Abraham Kandel and Theodore P. Baker. Discrete Mathematics for
Computer Scientists & Mathematicians. 2nd Edition, Pearson Education.
2. J.P. Trembtay and R. Manohar. Discrete Mathematical Structures with
Applications to Computer Science. 'fata McGraw Hill. 2002.

Reference l. Kenneth H.
Rosen,Discrete Mathematics and its Applications with
Books Combinatorics and Graph Theory. 7th Edition, McGraw Hill Education (lndia)
Private Limited.
2. Graph Theory with Applications to Engineering and Computer Science by
Narsingh Deo.

\ tlr^,k-@-"-,( L
tts^-rU ,, Q*.r"tJq**-
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@ DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Mast€r of Computer Applications for V.5. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024r25.

Coursc Outcomes : After completion o1'the coursc student able to

Knowledge
Course Outcome Description
Level
col Make use of mathematical logic to solve [Link] K1

co2
Analyse the concepts and perform the operations related to sets, K4
relations and functions.
co3 Identify basic counting techniques to solve combinatorial problems. KJ

CO4 Evaluate solutions by using recurrence relations K5

co5 Utilize Graph Theory in solving computer science problems K3

Kl- Rcnrcrnbering. K2- Understanding, K3- Applying, K4- Anall'zing. K5- l:valuating. K6- Creating
COURSE AND PROGRAMME OUTCOMES MAPPING

l,ol PO2 PO3 P()4 PO5 PO6 PO7 PO8 PC)9 POl0 PSOI PSO2 PSO3
col 2 -1 3
co2 -i 2 2 2
co3 3 3
co4 -j 3 -1

I -Low, 2-Medium, 3-High

.[Link]\.^-/
3
!A{d!-- a
Uu,-q-- , G-u1'*1'

4of31
 VIKRAMA SIMHAPURI
@ DEPARTMENT OF COMPUTER SCIENCE
UN IVERSITY, N ELLORE

Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024-'25.

Programme M(]A Semester First

Course Code 102 Course Name COMPUTER NETWORKS
L T I)
Course CORE COURSE _ 28 IIours/Week .+ 0 0
Category (ELECTIVE)
Credits J
Course . To understand the fundamentals of Computer Networks.
Objectives . To get familiarized with Various Layers of Computer Networks.
r To understand the working principles ofVarious Protocols.
. To get familiarized with Network Security.
T]NIT -I Introduction: Uses of Computer Networks . Network Hardware, Network
Software. Reference Models, Example Networks: APRANET. NSFNET. Intemet,
Network Topology. Network Architecture. Physical Layer: Transmission media.
LINIT.2 The Data Link Layer: Data Link Layer design issues, Error Detection and
Correction Methods, Elementary Data Link Protocols, Sliding Window Protocols
Protocol. Channel Allocation Multiple Access protocols. Wireless LANs,
Bluetooth, RFID.
UNIT -3 The Network Layer: Network Layer design issues, Routing algorithms,
Congestion Control algorithms, Quality of Service, Intemetworking Network
Layer in Intemet.
The Transport Protocols: Transport Service, Transport Protocols. Intemet
Transport Protocols, UDP, TCP, Performance issues.
LTNIT.4 The Application Layer: Application Layer design issues, Domain Name System.
Electronic Mail. World Wide Web, Other Applications, Network Security, Basic
Cryptography, Symmetric and Asymmetric Cryptography.
Text Books I . Andrew S. Tanenbaum, Computer Networks, 5th edition, 2014.
2. William Stallings, Cryptography and Network Security: Principles and
Standards, Prentice Hall India, 4th Edition, 2005.
Reference Behrouz Forouzan, Data Communications and Networking, McGraw Hill,
Books 4thEdition. 2017.
Course Outcomes : After completion of the course student able to
Course Outcome Description Knowledge Level
Ability to understand the various hardware and software components of K2
col computer networks.
co2 Ability to understand the layered network architecture K2
co3 Ability to configure networks and debug issues in networks. K3
Kl- [Link]. K2- tJndcrstanding. K3- Apptying. K4- Anal_vzing. K5- Ei,aluating. K6- Creating
COURStT AND PRO(;R^MMli OTJTCOMES MAPPING
POt PO2 PO:l l,( ).1 PO5 P06 PO7 PO8 PO9 POl0 PSOI PSO2 PSO3
3
c0l ', 1

2 )
co2
co3 2 )
I -Low. 2-Medium. 3-Hi lr

\ $..."q{-Gt=r< 2 Uk^,)4-_ t, Q*g"1*-t"r&B,.1^1

 VIKRAMA SI MHAPURI U N IVERSITY, N ELLORE
@ DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024r25.

Programme MCA Semester First

Course Code 103 Course Name OPERATING SYSTEMS
_ L T l)
Course CORE COURSE 3A.. Hours/Week
Category (ELECTIVE)
I t) 0
Credits J
Course . To understand the fundamental concepts and techniques of Operating Systems.
Objectives . To study the concepts in process management and concurrency control
mechanisms 3. To understand the concepts in memory managements and
deadlocks
. To study on file management and storage structures
LINIT -I Computer System Overview: Basic Elements, Processor Registers, Instruction
Execution, Interrupts, The Memory Hierarchy, Cache Memory. l/O
Communication Techniques.
Operating System Overview: Operating System Objectives and Functions .The
Evolution of Operating System, Major Achievements ,Developments Leading to
Modern Operating Systems, Microsoft Windows Overview, Traditional UNIX
Systems, Modem UNIX Systems, Linux.
UNIT -2 Process Description and Control: What is a Process, Process Stales. Process
Description , Process Control. Execution of the Operating [Link] lssues,
UNIX SVR4 Process Management.
Threads, SMP, and Microkernels: Processes and Threads, Symmetric
Multiprocessing (SMP), Microkemels ,Windows Vista Thread and SMP
Management ,Solaris Thread and SMP Management ,Linux Process and Thread
Management.
UNI l'-l Concurrency Mutual Exclusion and Synchronization: Principles of
Concurrency, Mutual Exclusion: Hardware Support, Semaphores,Monitors.
Message Passing. Readers/Writers Problem.
Concurrency Deadlock and Starvation: Principles of Deadlock, Deadlock
Prevention. Deadlock Avoidance. Deadlock Detection. An Integrated Deadlock
Strategy. Dining Philosophers Problem. LNIX Concurrency Mechanisms, Linux
Kemel Concurrency Mechanisms, Solaris Thread Synchronization, Primitives,
Windows Vista Concurrency Mechanisms.
L]NIT.4 Memory Management: Memory Management Requirements, Memory
Partitioning , Paging , Segmentation. Security Issues.
Uniprocessor Scheduling: Types of Scheduling ,Scheduling Algorithms,
Traditional UNIX Scheduling.
Text Books William Stallings: Operating Systems: Intemals and Design Principles, 6th Edition,
Prentice Hall.
Reference l. Silberschatz, Galvin, Gagne: Operating System Concepts, 8th Edition. Wile;
Books 2008.
2. Andrew S. Tanenbaum, Albert S. Woodhull: Operating Systems. Design and
Implementation, 3rd Edition, Prentice Hall, 2006.
3. Pradeep K Sinha: Distribute Operating Systems, Concept and Design. PHl.
2007.
4. Gary Nutt: Operaling Systems,3rd Edition, Pearson,20l4.

\ $t-!4-@-&-{ L :, C.,.,.j1 -I"*.[,y 31

 VI KRAMA SIMHAPURI U NIVERSITY, NELLORE
DEPARTIVIENT OF COMPUTER SCIENCE
Syilabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024 '25.

Course Oulcomes : After completion of the course student able to

Knowledge
Course Outcome Description
Lcvel
Demonstrate the Mutual exclusion, Deadlock detection and agreement K3
col protocols of Distributed operating system.
Learn the various resource management techniques for distributed KI
co2
systems.
co3 Identify the different features ofreal time and mobile operating system. K2

Modify existing open source kemels in terms of functionality or features r\)

co4
used.
K1- Remenrbering. K2- Understanding. K3- Appl-"-ing. K4- Analyzing. K5- Evaluating. K6- Creating
COURSE AND PROGRAMME OUTCOMES MAPPING

POI PO2 PO3 P04 PO5 PO6 PO7 PO8 PO9 PO10 PSOl PS()2 PSOS
3 )
col
CO2
3 2
CO3

co4 -'t

l-Low. 2-Medium. 3-High

\ \lk"^!L- 3, \-d
"\10"1
..-(-r^lq[*.^'

7 of 3l
 VIKRAMA SIM HAPU RI U NIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024-'25.

MCA Scnrcstcr First

Programme

Course Code 103 Course Name

DESIGN & ANAI-YSIS OF
ALCORITHMS
L
't. I)
Course CORE COURSE 38. HoursiWeek .l 0 0
Category (ELECTIVE)
Credits -)
Course . To understand the basic ideas of algorithms, its performance analysis. the
Objectives concepts olmerging and sorting using parallel algorithms.
. To understand the concepts of sorting techniques, and the concepts of Greedy
method.
r To understand graph traversal algorithms: BFS. DFS, dynamic programming and
backtracking.
. To understand the state space terminology. the concepts of NP-Hard and NP-
Complete
UNIT -1 Introduction: Definition of an Algorithm- Algorithm Specification - Analysis of
Algorithm. PRAM Algorithms: Merging- Sorting. String Algorithms: The Naive
String Matching Algorithm, Robin - Karp Algorithm.

UNIT -2 Divide and Conquer: Merge Sort-Quick Sort- Strassen's Matrix Multiplication -
Convex Hull. Greedy Method: The General Method-Job Sequencing with
Deadlines- Knapsack Problem- Minimum Cost Spanning Trees- Huffman Codes -
Single Source Shortest Path Method.

UNIT -3 Dynamic Programming: The General Method- Optimal Binary Search Tree- 0/l
Knapsack-Traveling Sales Person Problem. Ford Fulkerson.
Backtracking: The Eight Queens Problem - Graph Coloring - Knapsack Problem.

UNIT -4 Branch and Bound: 0/l Knapsack Problem- Traveling Sales Person Problem. NP
Hard and NP Complete Problems: Basic Concepts- Cook's Theorem.
NP Hard Graph Problems- CDP. NCDP. AOG.

Text Books 1. Fundamentals of Computer Algorithms, Ellis Horowitz, Sartajsahni and

Sanguthevar Rajasekaran, 2nd Edition. University Press, 2008.
2. Introduction to algorithms. Cormen, Leizerson & Rivest, 3rd Edition, Prentice-
Hall,2002.
3. Algorithm Design. Jon Kleinberg and Eva Tardos, Pearson Education. 2006.
4. Algorithms, Robert Sedgewick and Kevin wayne, 4th edition, Addison Wesley
Prof., (201l)
Reference [Link] to Design and Analysis of Algorithms, Anny Levitin, 2rd Edition,
Books Person Education Press. (2007).

( Ul$.l{- @r*4 L
Vp"^^rV 7 ^ C.u,5o1Jog1\*o,r,
 VI KRAMA SIMHAPU RI U NIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024:25.

Course Outcornes : After completion of the course student able to

Knowledge
Course Outcome Description
Level
Understand the concepts of mathematics to find space and time
COI K2
complexities of various algorithms including string matching algorithms.
Apply the problems that can be solved by using Divide and Conquer and
co2 K3
Greedy Method.
Analyze the problems that can be solved by using Dynamic
co3 K4
Programming and Backtracking.
Analyze the problems that can be solved by using Branch and Bound
co4 K4
and NP-Hard Graph problems.

Kl- Rcmenrbering. K2- llndcrstanding. K-j- Applf ing. K4- Anallzing. K5- Er,aluating. K6- C'[Link]
COURSE AND PROCRAMME OUTCOMES MAPPING

POI PO2 PO3 P()4 PO5 PO6 PO7 PO8 PO9 POl0 PSOI PSO2 PSO3

col J ) 2

J J 2 2
co2
2 -) 2 2
co3 -1

2 J .) 2 1
c04
l -l-ow, 2-Medium, 3-High

Q"1a-,[Link]'l\"-,'
\. Uk^d4- UrE -S- 3

9of31
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024r25.

Programme MCA Scnresler Iiirst

Course DISCRETE MATHEMATICAL
Course Code r01
Name STRUCTURES
I- T I)
Course PRACTICAL _ I IIours/Week
0 0
Category CORE PAPER.24'
Credits 2
List of Progranrs
Set Theorr
I . Write a program to implement Inclusion-Exclusion principle
2. Write a program to implement Power Sets.
3. Write a program to implement Mathematical lnduction.
Functions and Algorithms
4. Write a program to implement Recursively defined functions.
Counting
5. Write a program to implement Permutations with repetitions.
6. Write a program to implement Combinations with repetitions.
Recurrence relations
7. Write a program for solving recunence relations by substitution and Generating functions.
Graph Theory
7. Write a program to implement Four Colour problem
8. Write a program to Construct Spanning Trees.

\. G\.r"co{- Z
Urr"rpqi- ) QU'I.^,y{a$i^'/

10 of 3L
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@
eI DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.5. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024r25.

Programme MCA Semester First

Course
Course Code 104 [Link] NEI'WORKS
Name
L T P
Course PRACTICAL I Hours/Week
J 0 0
Category CORE PAPER _ 28.
Credits 2
List of Programs

L Demonstrate to establish LAN using two desktop computers.

2. Write a program to implementation of any error detection and correction technique
3. Write a program to implement Simplex Stop-and-Wait Protocol of Data Link Layer.
4. Write a program to implement Simplex Protocol for a Noisy Channel of Data Link
Layer.
5. Write a program to implement the Sliding Window Protocol using Go Back N
6. Write a program to implement the Sliding Window Protocol using Selective Repeat.
7. Write a program to implement Multicasl Routing of Network Layer.
8. Write a progrzrm to implement Transfer a File from one system to another system using
FTP.

(u11o1,[arl\^^,t
Ue,,^*)ll
9
l. d+.de- Ar44

11 of 31
 /a\\ VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@
fi-. DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.s. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yeat 2024'25.

Programme MCA Senrcstcr F- irst

Course
Course Code 104 oPERAI'ING SYSTI]MS
Name
I- T I)
Course PRACTICAL. I HoursiWeek
,1 0 0
Category CORE PAPER - 3A.
Credits 1

Lisl of Programs
I . Write a Program for implementation of File Operations.
2. Write a Program to display process properties.
3. Write a program to create a new process and display parent and child process details.
4. Write a Shell script that displays list of all the files in the current directory to which the
user has read. Write and execule permissions.
5. Write a Shell script that receives any number olfile names as arguments checks if every
argument supplied is a file or a directory and reports accordingly. Whenever the
argument is a file, the number of lines on it is also reported.
6. Write a Shell script to list all of the directory files in a direcrory.
7. Write a program to implement IPC problem Dining Philosophers Problem.
8. Write a program for controlling accessing to a pool of resources using mutexes and
condition variables.

3'. Gu,1..1*Q-^u\^*'
\
" Ua*^^;rp-'

L2 of 31.
 VIKRAMA SIMHAPU RI U NIVERSITY, N ELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.s. University Constituent Colleges{5) and Affiliated Colleges
,"der the jrrisdic

Programme MCA SemestL'l' First

Course DI]SIGN & ANALYSIS OF
Coursc Codc 104
Name ALGORITHMS
I, T I)
Course PRACTICAL - I Ilours/Week
J 0 0
Category CORE PAPER _ 38.
Credits 2
List of Programs

I . Write a program to implement Merge Sorting.

2. Write a program to implement Quick So(.
3. Write a program to implement Strassen's Matrix Multiplication
4. Write a program to implement Shortest Path.
5. Write a program to implement Optimal Binary Search Tree.
6. Write a program to implement The Eight Queens Problem.
7. Write a program to implement Graph Coloring.
8. Write a program to implement Traveling Sales Person Problem.

l. fur4_ 3 Ct.-,,1 a1 "-to-r-r\ "r'

U,k^N| 9---

13 of 31
 VIKRAMA SI MHAPU RI U NIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the jurisdiction of Vikrama 5imhapuri University, Nellore with effect from the Academic Year 2024-'25.

Programme MCA Semester First

ADVANCED JAVA
Course Code 105 Course Nante
PROGRAMMING
Course
SKILL OzuENTED
Hours/Weck
I, T I)
COURSE_ IA. 1 0 0
Category
(ELECTIVE) Credits ,)

Course . To understand the multi-tier architecture implementation.

Objectives . To know the Client-Server communication process.
. To enable students 10 understand the concepts underlying technologies in JAVA
Enterprise edition with Swings and multithreading, configuring Apache tomcat
server, Java beans and Enterprise Java Beans.
. To learn Remote Method Invocation and Database programmrng.
UNIT -1 J2EE MULTI -TIER ARCHITECTURE: Introduction to J2EE and J2SE.
Distributive Systems, The Tier, J2EE Muti - Tier Architecture, Client Tier
Implementation, Web Tier Implementation, Enterprise JavaBeans Tier
Implementation, Enterprise Information Systems Tier lmplementation. Challenges.
J2EE BEST PRACTICES: Enterprise Application Strategy, The Enterprise
Application, Clients, Sessions Management, Web Tier and Java Server Pages.
Enterprise JavaEleans Tier. The Myth of Using Inheritance. Maintainable Classes.
Performance Enhancements, The Power of lnterfaces, The Power of Threads. The
Power of Notification.
LINIT -2 J2EE DATABASE CONCEPTS: Data, Database. Database Schema. The art of
Indexing. JDBC OBJECTS: The Concept ofJDBC, JDBC Driver Types. JDBC
Packages, A Briel Overview oi the JDBC Process. Database Connection,
Associating the JDBC/ODBC Bridge with the Darabase. Srarement Objects.
ResultSet, Transaction Processing. Metadara. JDBC AND EMBEDDED SQL -
Model Programs, Tables, Indexing, Inse(ing Data into Tables, Selecting Data
from a Table. Metadata. Updating Tables. Deleting Data tiom a Table. Joining
Tables, Calculating Data. Grouping and Ordering Dara. Subqueries. View.
UNII-.3 JAVA AND XML: Generating an XML Document. Parsing XML, Quick
Reference Cuide. JAVA SERVLETS: Java servlets and Common Gateway
Interface Programming, A Simple Java Servlet, Anatomy of a Java servlet. Reading
Data lrom a Client, Reading HTTP Request Headers, Sending Data to a Client and
Writing the HTTP Response Header. Working with Cookies. Tracking Sessions.
JAVA SERVER PAGES: JSP, JSP Tags, Tomcat, Request String, User Sessions,
Cookies, Session Objects.
UNIT.4 ENTERPRISE JAVABEANS: Enterprise JavaBeans, Deployment Descriptors.
Session Java Bean. Entity Java Bean, Message Driven Bean. The JAR File.

JAVA INTERFACE DEFINITION LANGUAGE AND CORBA: The Concept

of Object Request Brokerage. Java IDL and CORBA. The IDI- Interface. l'he
Client Side. The Server Side. Running the Code. JAVA REMOTE METHOD
INVOCATION: Remote Method Invocation Conccpt. Server Side. Client Side.

\ z U*^"4- 9, (,,0*-l-^(l f 31
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024r25.

'fext Rooks [Link] Complete Reference J2EE by Jim Keogh. Tata McGraw - Hitl Edition
Reference 1. H. Schildt: Java 2: The Complete Reference. Mc Graw Hill
Books 2. Kogent Solutions Inc.: Java Server Programming Java EE 7 (J2EE 1.7). Black
Book, Dreamtech Press
3. Subrahmanyam Allaramaju et al.: Professional JSP J2EE 1.3 Edition. Wrox
Press
4.
K. Qian et al.: Java Web Development Illuminated. Narosa
5.
Robert W. Sebesta: Programming the World Wide Web. Pearson
Course Outcomes : After completion of the course student able to
Knowledge
Course Outcome Description
Level
Understanding on J2EE Archilectures, Client & Server communication
COI process, software components, Servlets, JSP. K2

co2 llandle Errors and Exccptions in Web Applications K3

Anall se clll'clivcnr'ss o1'clcating dl nantic ricb paucs using Sen lcl and
co3 .ISP K4

I)er elops Wcb Applications using Java Sen let and .lSP
co4 K6

Kl- Rernc-mbering. K2- IJndcrstanding. K3- Applf ing. K4- Anal-v-zing. K5- Evaluating. K6- ('reating
COI]RSF] AND PROGRAMME OUI'COMES MAPPING

POI PO2 PO3 P04 PO5 PO6 PO7 PO8 PO9 POl0 PSOI PSO2 PSO3
2 J 2
col -1

2 2 )
co2
co3 -) -l l 2

co4 ., )
1-Low, 2-Medium, 3-High

l. \st$sk- ? 9, G"1o,pla+'nL*'

15 of 31
 /=O^\
\t6r.,,
VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
E DEPARTMENT oF CoMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024 '25.

Programme M('A Scnrester Irirst

Course Code 105 Course Name ETIiICAI- TIACKIN(J
Course
SKILL ORIENTED
Hours/Week
L I- l)
COURSE- IB + 0 0
Category
(ELECTIVE) Credits -)

Course . Teach students to think tike an ethical hacker and at the same time fbllow the
Objectives code ofprofessional ethics and the prescribed cyber laws.
. Make oneself aware of the cybercrimes that are taking place in the real world.
. Leam about the different hacking tools and techniques and practically use these
tools to gain better understanding ofthe ethical hacking concepts.
. Provide a deep understanding of security issues, threats and concems in the
cyber world and provide countermeasures to curb hacking.
UNIT -I Inlroduction to ethical hacking. Types of hacking. advantages. disadvanlages and
purpose of hacking, Types of hackers, Code of ethics, Types of attacks and aftack
vector types, Prevention from hackers, The Indian IT Act 2000 and Amendments
to the Indian IT Act (2008), Phases ofhacking.
Footprinting and Reconnaissance: Introduction to footprinting. Active and passive
footprinting, purpose of footprinting, objectives of footprinting, footprinting
threats, Types of lool printing. footprinting countermeasures.
IJNIT -2 Scanning networks, Enumeration and sniffing: Scanning networks: Network
scanning and its types, objectives of network scanning. scanning live systems,
scanning techniques-TCP Connecl / Full Open Scan, Types of Stealth scans. port
scanning countermeasures, IDS evasion techniques. Banner grabbing and its tools,
vulnerability scanning, proxy servers! anonymizers. IP spoofing and its
countermeasures.
Enumeration and Sniffing: Introduction to Enumeration, Enumeration techniques,
Enumeration types. Enumeration countermeasures. sniffing. Wiretrapping and its
types. packet sniffing, sniffing threats. working of sniffers. sniffing methods-ARP
spoofing and MAC flooding, active and passive sniffing, types of sniffing attacks.
snif fi ng countermeasures. sniffi rr g detection techniques.
UNIT.3 Trojans and other Attacks: Worms, viruses. Trojans, Types of worms, viruses and
worms, Preventing malware attacks. types of attacks: (DoS /DDoS), Waterhole
attack. brute force, phishing and fake WAP, Eavesdropping, Man-in{he-middle,
buffer overflow, DNS poisoning, ARP poisoning. Identity Theft, IoT Atracks,
BOTs and BOTNETs, Steganography - text, image and audio and video. types of
Social Engineering: Physical social engineering. Remote social engineering and
hybrid social engineering.
Hacking web servers. web applications and sql injection: Session hijacking:
Inlroduction to session hijacking, session hijacking techniques. session hijacking
process. Types of session hijacking, session hijacking countermeasures: protecting
and preventing.
LINIT.4 Hacking web servers and web applications: Causes of web servers being
compromised, web server attacks. stages of web server attacks. defending against
web server attacks, web application components, its working. architecture. web
server attack vectors. web application threats and counter measures.

-)
7, Qu1'1 .14^A
1
U[-^d&- 16 of 31
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@ DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under thejurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024-'25.

SQL Injection:
Introduction to SQL injection, SQL injection threats. SQL injection attacks, SQL
injection detection. Types of SQL injection, SQL injection methodology, SQL
injection prevention and countermeasures.
Wireless network hacking, cloud computing security. cryptography. Pen testing:
Types of wireless Architecture, wireless encryption techniques-WEP and WPA,
breaking WEP/WPA and defending WPA encryption, wireless Sniffing,
Characteristics. types of cloud computing services, models and benefits, threats
and attacks. cryptography and its objectives, cryptography types, cryptography
attacks, Pen Testing, need for pen testing, types and techniques of pen testing,
phases of pen testing.
Text Books l. Matt Walker. All-ln-One-CEH-Certifi ed-Ethical-Hacker-Exam-Guide.
2. Manthan Desai Basics ofethical hacking for beginners.
3. SunitBelapure and Nina Codbole, Cyber Security: Understanding Cyber Crimes,
Computer Forensics and Legal Persp ectlves
Relerence l. Srinivasan, J. Suresh, Cloud Computing: A practical approach for learning and
Books implementation, Pearson.
2. Sean-Philip Oriyano, Sybex, Certified Ethical Hacker Study Guide v9, Study
Guide Edition, 2016.
3. Emmett Duley and Chuck Easttom ,Comptia Security+ Study Guide.
4. TutorialsPoint Professionals, Ethical Hacking by TutorialsPoint.
Course Outcomes : After completion of the course student able to
Knowledge
Course Outcome Description
Level
Recall the networking. sql, and encryption algorithm concepts to further K1
cor study ethical hacking techniques, threats, tools and prevention against
attacks.
co2 Understand ethical hacking concepts, cases, ethics and cyberlaws. K2
Apply available hacking tools to find a solution to a given hacking KJ
co3 rssue.
Analyze and classify the real-world hacking cases and situations. K4
co4
Kl- Rernembering. K2- tJnderstanding. K3- Applying. K4- Anal.v-zing. K5- Evaluating. K6- C'reating
COI]RSE AND PROGRAMME OUTCOMES MAPPING

POI PO2 PO3 PO.+ POs P06 PO7 PO8 PO9 POl0 PSOI PSO2 PSO3

col I 2 I 3 I

c02 2 ) -) I

co3 2 -) 1

co4 2 I .,! I

l-Low, 2-Medium. 3-High

g^
t. Gk @!€- L.
Uk*ilr- Ctqal-{X+{,.3,5.
 VI KRAMA SI MHAPU RI U NIVERSITY, N ELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yeat 2024-'25.

Programme MCA Semester F irst

DATABASE MANAGEMENT
Course Code I 0(r Course Name
SYSTEMS

Course
SKILL ORIENTED
Hours/Week
L I' P
coURsE - 2A. 1 0 0
Category
(ELECTIVE) Credits -)
Course . To emphasize the underlying principles of
Relational Database Managemer
Obiectives System.
. To understand the design of databases.
. To acquire knowledge on Parallel and Distributed databases and its applications.
. To understand the emer ging databases like Mobile. XML, Cloud and Big Data
UNIT.I Basics of Database: Introduction and applications of DBMS. Purpose of database.
Views olData. Database Languages. Database architecture. Database users and
[Link] Model: Structure of Relational Databases. Database Schema,
Keys. Relational Operations and Relational Algebra. Entity Relationship Model:
Basic Concepts and definitions. Constraints. Entity Relationship Diagram. Weak
Entity Sets. Ex tended E-R Features, Conversion of ER diagram into relations.
UNI'I'-2 Relational Model and Query Evaluation: Relational Model Concepts, Relational
Algebra, SQL: Basic Queries. Complex SQL Queries. Views. Constrainrs,
Relational Calculus, Tuple Relational Calculus, Domain Relational Calculus,
Overview of commercial RDBMSs, Database Design, Functional Dependencies,
Normal Forms: First Normal form, Second Normal form. Third Normal form,
BCNF, Fou(h Normal form, Fifth Normal form, Algorithms for Executing Query
Operations, Cost Estimation.
Transaction Processing: Transaction Processing, Properties of Transactions,
Seriatizability, Transaction support in SQL, Locking Techniques, Time Stamp
ordering, Validation Techniques, Granularity of Data Items, Recovery concepts.
Shadow paging, Log Based Recovery, Database Security Issues, Access control.
Statistical Dalabase Security.
LTNIT -3 Parallel and Distributed Databases: Database System Architectures: Centralized
and Client-Server Architectures, Server System Architectures, Parallel Systems.
Distributed Systems, Parallel Databases: I/O Parallelism. Inter and Intra Query
Parallelism, Inter and Intra operation Parallelism. Design of Parallel Systems.
Distributed Database Concepts, Distributed Data Storage, Distributed Transactions,
Commit Protocols, Concurrency Control. Distributed Query Processing.
Intelligent Databases: Temporal Databases: Overvieu' of Temporal Databases.
TSQL2. Deductive Databases and Recursive Queries in SQL, Spatial Databases,
Spatial Data Types, Spatial Relationships. Spatial Data Structures-spatial Access
Methods, Spatial DB Implementation.
UNIT -4 XML Databases: XML Data Model, DTD, XML Schema, XML Querying, Web
Databases. Open Database Connectivity.
Mobile Databases: Location and Handoff Management, Effect of Mobility on Data
Management, Location Dependent Data Distribution, Mobile Transaction Models.
Concurrency Control and Transaction Commit Protocols.
Multimedia Databases: Multidimensional Data Structures, Image Databases, Text /
Document Databases. Video Databases. Audio Databases. Multimedia Database
Design.

L 2, 0'Jcut 1,

\
 KRAMA SIMHAPU RI U N IVERSITY, N ELLORE
@ VI
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.5. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024125.

Emerging Technologies: Cloud databases, Streaming Databases, Graph Databases,

New SQL.
Text Books [Link] Silberschatz. Henry F. Korth and [Link] "Database System
Concepts", 6th Edition. McGraw Hi11.2010.
2. C.J. Date, "An Introduction to Database Systems", 8th Edition, Pearson
Education, 2003.
3. Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard [Link],
[Link], Roberto Zicari, Advanced Database Systems. Morgan
Kaufmann publishers,2006.
Reference [Link] Elamassri and Shankant B-Navathe, "Fundamentals of Database
Books Systems", 6th Edition, Pearson Education Delhi, 2010.
[Link] Ramakrishnan. Johannes Gehrke.' Database management systems"
McGraw Hill, 2003.
3. Peter Rob, Carlos Coronel, "Database System Concepts", Cengage Learning,
2008.
4. Frank. P. Coyle, "XML, Web Services and The Data Revolution", Pearson
Education, 2012.
5. Lee Chao, "Database Development and Management". Auerbach Publications,
2010.
6. Peter Rob, Carlos coronel, "Data base system concepts", Ceange Leaming 2008.

Course Outcomes : After completion of the course student able to

Knowledge
Course Outcome Description
Level
co1 To develop skills on databases to optimize their performance in practice. K6
co2 To analyze each type of databases and its necessity. t.+
co3 To design faster algorithms in solving practical database problems. K6

K1- Remembcring. K2- tlnderstanding. K3- Applying. K4- Analyzing, K5- Evaluating. K6- Crcating
COURSE AND PROGRAMME OUTCOMES MAPPING

POI PO2 PO3 P()4 PO5 PO6 PO7 PO8 P(-)9 POl0 PSOI PSO2 PS()3
3 2
cot
2
co2 -1 -3

-i 2 2
co3
l-Low, 2-Medium, 3-High

L 3^ Q"*1o.1 J-o'tq\"^'
Us€rr,e
\
-
19 of 31
 VIKRAMA SIMHAPU RI U NIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024-'25.

Programme MCA Semester First

PRINCIPLES OF PYTHON
Course Code @ toL Course Name
PROGRAMMING
Course
SKILL ORIENTED
Hours/Week
T, t P
COURSE - 28 4 0 0
Category
(ELECTIVE) Credits
Course . To understand the basics of Python.
Objectives . To Understand the usage of Libraries and packages in Pyhon.
. To understand the flask framework.
. To learn about Django in web development applications.

UNIT -I Introduction to Python- Introduction to P),thon programming language - Setting

up development environment - Basic programming concepts. Object-oriented
Programming in Python - Introduction to object-oriented programming - Classes,
methods. and properlies in Plthon - Inheritance. polymorphism, and encapsulation.
L]NIT.2 Python Libraries and Packages - Working with popular Python libraries such as
NumPy. Pandas. and Matplottib - Installing. managing. and publishing Python
packages using pip - Using Py,thon virtual environments eilectively.
UNIT.3 Introduction to Flask framework, Flask Web Development - Flask routes and
views - Templates and rendering in Flask - Forms and user input - Handling API
requests.
UNIT -4 Introduction to Django - Overview of Django framework - Setting up a Django
project - Creating apps in Django - Django models and database
Text Books I Introduction to Python Programming, Gowrishankar.S. Veena A, CRCPress.
2. Flask Web Development, Miguel Grinberg, 2nd Edition. O'Reilly.
3. Django By Example: Build powerful and reliable Python web applications from
scratch, Antonio Mele, 3rd Edition, Packt
Reference [Link] for Beginners: Build Websites with Python & Django, William S
Books Vincent, Volume l. Amazon Digital Services LLC.
2. Head First Pyhon: A Brain-Friendly Guide, Paul Bany.2nd Edition, O'Reilly.
Course Outcomes : Afler completion of the course student able to
Knowledge
Course Outcome Description
Level
col I)escribe the basics ofpython programming Language K2
tlnderstand and Implemcnt the P),thon packages to solve real time
co2 problems.
K2,K3
Apph end-to-end web applications using Flask as the primary web
co3 K3
framework.
,\pph Python and Django framework to develop web applications using
co4 model, views, templates, URLs. forms, and databases
K3
K I - Renrcnrbcring. K2- [ ]nderstanding. K-i- Applying. K-l- Anall zing. K5- I:r'alLrating. K6- ('rcating

(t-{ z ?, (\ lc^tr -[qr.{

t' s$&- 20 of 31
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.5. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yeat 2024:25.

COIJRSE AND PROGRAMME OUTCOMES MAPPING

POI POI PO3 P()4 Ir( )5 PO6 P( )7 PO8 PO9 POl0 PSOI PSO2 PSOJ
('oI J l 1 ) ?. 2

J l ") ) 2 )
co2
J ') J 2 ?. 2
co3
J 2 J 2 2 2
co4
l-Low, 2-Medium. 3-High

9,. Q",p^t ,nop\"^'

2
U*^,*a-

27 of 37
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama 5imhapuri University, Nellore with effect from the Academic Yeat 2024-'25.

Programme MCA Senrester l:irst

Course ADVANCED JAVA
Course Code 107
Name PROGRAMMING
PRACTICAL _ II I, 'f I)
Course llours/Week
SKILL ORIENTED PAPER -) 0 0
Category
- 1A. Credits )
List of Programs

Java Generics
l. Write a Java Program to demonstrate a Generic Class, Generic Methods.
2. Write a Java Program to demonstrate Wildcards in Java Generics.
Web application developmenl using JSP
3. Design loan calculator using JSP which accepts Period of Time (in years) and Principal Loan
Amount. Display the paymenl amount for each loan and then list the loan balance and interest
paid for each payment over the term of the loan for the following time period and interest rate:
a. I to 7 year ar 5.350
b. 8 to 15 year at 5.5o/o
c. 16 to 30 year at 5.75Yo
4. Write a JSP program that demonstrates the use of JSP declaration. scriptlet, directives,
expression, header and footer.
Spring Framework
5. Write a program to demonstrate dependency injection via setter method.
6. Write a program to demonstrate dependency injection via Constructor.
Aspect Oricnted Pro grammina
7. i) Write a program to demonstrate Spring AOP - belbre advice.
ii) Write a program to demonstrate Spring AOP - after advice.
iii) Write a program to demonstrate Spring AOP - around advice.
iv)Write a program to demonstrate Spring AOP after retuming advice.
vi) Write a program to demonstrate Spring AOP - after throwing advice
vii) Write a program to demonstrate Spring AOP - pointcuts
Sprine JDBC
8. Write a program to insert, update and delete records from the given table.
9. Write a program to demonstrate PreparedStatement in Spring JdbcTemplate
10. Write a program in Spring JDBC to demonstrate ResultSetExtractor Interface
I I . Write a program to demonstrate RowMapper interface to fetch the records from the
database.
Sprine Boot and RESTfuI Web Services
12. Write a program to create a simple Spring Boot application that prints a message.
13. Write a program to demonstrate RESTfuI Web Services with spring boot.

\ U!*dp.- Uk;."rfr-P?- 3' Q'lPy^[q'(\

22 of 31
 VIKRAMA SIMHAPU RI U NIVERSITY, N ELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024125.

Programme MCA Senrester First

Course
Course Code 107 ETHICAL HACKING
Name
PRACTICAL - II L t' t,
Course Hours/Week
SKILL ORIENTED PAPER J 0 0
Category
lB. Credits 1

List ol Programs

l. Use software tools/commands to perform footprinting /information gathering and

generate analysis report.
2. Use software tools/commands to perform network scanning and sniffing and generate
analysis report.
3. Use software tools/commands to perform malware attacks and other cyber attacks and
generate analysis report.
4. Implementation ofkeyloggers, viruses and trojans.
5. Use of software tools/commands for web servers and web applications hacking and
generate analysis report.
6. Use of software tools/commands for performing sql injection and session hijacking and
generate analysis report.
7. Use of software tools/commands to encrypt and decrypt password. implement
encryption and decryption using Ceaser Cipher.
8. Using Metasploit and metasploitable for penetration testing.

, Q.,-,
J
[Link],.o\r^*'
\ \*."cL 2- Uk"N0)

23 of 3L
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the .iu risdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024!25.

Programme MCA Senrestr'r First

DATABASE
Course
Course Code 107 MANAGEMENT
Name
SYSTEMS
PRACTICAL - II t_ 1' l)
Course Hours/Week
Category
SKILL ORIENTED ',] 0 0
COURSE 24. Credits 1

List of Programs
1 . Create Student (HTNO, Sumame, FirstName, LastName, Percentage_of Marks.
Data_of Joining, Department_lD) and Department(Department ID, Dept_Name. HOD,
ContactNo, E-Mail) tables with relevant Primary Key, Foreign Key and other
[Link] the following
[Link] five student details in five departments.
[Link] all students order by department no.
Display all students in each department who has highest percentage.
c.
2. Design a database for the University Library which include tables I )Student 2)books
3 )lssue. Perform the following queries.

a. Display all the books in the Library.

b. Display the titles of only computer books in the Library.
c. Display the book title which was most issued.
d. Display the book title which was not read by any student.
3. Queries using Aggregate tunctions (COUNT, SUM, AVG. MAX and MIN), GROUP BY,
HAVING and Creation and dropping of Views.
4. Write a PL/SQL block to obtain lactorial ofa number and program for Fibonacci numbers
in PL/SQL.
5. \'ritc PI-/S()t- procedure lor exccption handling.
6. Write PL/SQI- procedure lor an implicit cursor arrd explicit cursor.
7 . Create a trigger in PL/SQL such that on Sunday and Saturday after 1PM no transactions

should take place on the Account table.

8. Design ER-diagram for the following scenario, convert the same into a relational model and
then solve the following queries. Consider a Cricket Toumment *ABC CUP" organized by
an organization. In the toumament there are many teams are contesting each having a
Teamid, Team_name, City, a coach. Each team is uniquely identified by using Teamid. A
team can have many players and a captain. Each player is uniquely identified by playerid,
having a Name, and multiple phone numbers, age. A player represents only one team. There
are many stadiums to conduct matches. Each stadium is identified using Stadiumid, having
a stadium_name,Adress(involves city, area_ name, pincode). A team can play many
matches. Each Match played between the two teams in the scheduled date and time in the
predefined Stadium. Each match is identified uniquely by using Matchid. Each match won
by any of the one team that also wants to record in the database. For each match
man_of the match award given to a player.

4 of 31-
\' G[[Link]{- 2
U*"a-uy 9,
 g VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the .iu risd iction of Vikrama Simhapuri University, Nellore with effect from the Academic Yea( 2024!25.

a. Display the youngest player (in terms of age) Name, Team name, age in which he
belongs of the toumament.
b. List the details of the stadium where the maximum number of matches were played.
c. List the details of the player who is not a captain but got the man_of match award at
least in two matches.
d. Display the Team details who won the maximum matches.
e. Display the team name where all its won matches played in the stadium.

Z Q-u,6c,,n-0-oru1. ,.'
\' $s&- ',
W"r'&-

25 of 31
 /,- .
VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
@ DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrrru S,

I)rogramme MCN Senrester First

Course PRINCIPI-ES OF PYTHON
Course Code 107
Name PROGRAMMING
.T
PRACTICAI, _ II L P
Course Hours/Week
SKILL ORIENTED PAPER .,) 0 0
Category
-28. Credits l
List of Programs
l. Write a Pyhon program about Class variables using Robot Class.
2. Implement Instance variable concept for ATM Machine Class.
3. Write a program to implement Inheritance.
4. Write a progrnm to implement Polymorphism.
5. Write a program to implement Data encapsulation.
6. Write a progmm to implement String manipulation operations using plthon library
Numpy.
7. Write a program to create a series using [Link] library Pandas.
8. Write a program to create a Data lrame using python library Pandas.
9. Write a program to draw a line from position (1,3) to position (8,10) using python
library Matplotlib.
10. Write a program to draw multiple lines(two lines) by specifying the x-values and y-
values for both lines using plthon library Matplotlib.
I l. Write a program to draw Bar chart horizontal and vertical bars using python library
Matplotlib.
12. Write a program to draw a Scatter plot using pyhon library Matplotlib.
13. Develop a Python Django web application: User registration with E-mail confirmation
application.

I gtr,.al ufurr;)D- 9, Qq"{.-["tt["

26 of 3L
 VIKRAMA SI MHAPU RI U NIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated ColleBes
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024r25.

Programme M('A Semesler F-irst

MOOCS(NPTEL/SWAYAM) .
I
Course Course
Any 12 Week Course on
r08 Management / Mathematics i
Code Name
Applied Mathematics I
Statistics offered other than
Computer Science.

Course
OPEN ONLINE
Hours/Week
L 1' P
TRANSDISCIPLINARY 0 0 0
Category
COURSE. I Credits )
MOOCs for Mandatory Additional Requirements (MAR) is provided for encouraging every
student to enter in Digital Content form of Education from well-known Universities or
organizations.
Students can choose any MOOCs 12 week course in Management / Mathematics / Applied
Mathematics / Statistics as per their interest area other than Computer Science. There are 2
credits for MOOCs in MAR as points could be earned as specified in the scheme and the
MOOCs courses which are taken for eaming credits for MCA degree will not be considered in
MAR purpose. The validity of uploaded certificates in the University portal is subject to
acceptance of appropriate committee/expert review.
Evaluation of the MOOCs course
Evaluation of the MOOCs courses would be done by the organization by whom it is being
offered. In extraordinary circumstances, the modality of evaluation through certified personnel,
online or offline, will be decided by the appropriate authority.
Every Alfiliated lnstitution has to upload the details of MOOCs data in respect of each student
time to time in University's examinations portal and/or hard/soft copy as per instruction of the
Controller of Examinations of the University. This is applicable for University's In-House
Programs also from the University regarding mapping of course for credit transfer/assessment
process.

(- Ul+Oq- 9 G"[Link] ruL

U*r*r41-

27 of 3l
 VIKRAMA SIM HAPU RI UN IVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(5) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yea( 2024:25.

Prograrrr nrc MCA Semestcr lrirst

Course Code 109 Course Name

INDIAN HISTORY AND
CULTURE
t. T P
Course INDIAN KNOWLEDGE Hours/Week
4 0 0
Category SYSTEMS IA.
Credits 0
Course o Leam about the changes in society, economy, politics, and culture under
Objectives various dynasties.
o Know mediaeval Indian history and culture.
o Understand the concept and meaning ofculture
o Establish the relationship between culture and civilization
o Discuss the role and impact of culture in human life.
o Trace the influence and significance of geographical features on Indian culture.
LINIT.I Ancient Indian History and Culture; Whal is History-Evolution of Man-Science
and Technology in Harappan Civilisation-Vedic Literature- Difference between
Jainism and Buddhism Philosophy-Ashoka Dhamma Policy-Science and
Technology in Guptha Period- Chronology of Various Dynasties that ruled India
(6th Century BC to 1206 CE).
UNIT.2 History and Culture of Medieval India: Delhi Sultanate: Rulers (Brief). Alla-Ud-Dir
Khitji and Muhammad-Bin-Tuglaq Reforms-Greater Mughals (Brief)-Mughr
Administration-Akbar Religious Policy-Mughal Art and Architecture-Bhakti Saints.
History of Modem lndia: European Settlements-British Revenue Policies-
Economic Impact of British Rule-Socio-Religious Reform Movements-Causes for
1857 Revolt-Indian Freedom Struggle: Vandemataram, Home Rule Movement-
Gandhi's Role: Non-Cooperation Movements. Sah Satya Graha and Quit lndia
Movement-Subash Chandra Bose-Partition of India.
UNI1"3 Introduction to Indian Cullure: Characteristics of Indian culture, Significance of
Geography on Indian Culture. Society in lndia through ages- Ancient period -
vama and jati. family and marriage in india. position of women in ancienl india.
Contemporary period; caste system and communalism. Religion and Philosophy in
lndia: Ancient Period: Pre-Vedic and Vedic Religion, Buddhism and Jainism.
Indian philosophy - Vedanta and Mimansa school of Philosophy.
TINIT.4 Spread of Indian Culture Abroad: Causes. Significance and Modes of Cultura
Exchange - Through Traders. Teachers, Emissaries, Missionaries and Gypsies
Indian Culture in South East Asia India. Central Asia and Western World througl
ages.
Text Books I .
[Link], Ancient India: In Historical Outline, Manohar Publishers, 1999.
2. [Link], [Link] &[Link] Chowdhuri (ed.), An Advanced History r
India, Macmillan, 1948.
3. Sumit Sarkar., Modem India, Pearson India,20l4.
4. Kabir. Humay,un, Our Heritage. National Information and Publications Ltd
Mumbai, 1946.
5. Malik, S. C., Understanding Indian Civilisation : A Framework of Enquiry, India
Institute of Advanced Study, Simla, 1975.
6. Pandey, Govind Chandra. Foundations of Indian Culture, Books and [Link],
Delhi. 1984.

\ U}t-,.re-. Ult^rr-b- ), Qt,j"-rd of 31

 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024 '25.

Reference 1. Satish Chandra., History of Medieval India, 800-1700, Oriental Blackswan,

Books 2007.
2. Harbans Mukhia., The Mughals ollndia, Wiley Publishers, 2008.
3. Bipan Chnadra, [Link], Barunde., Freedom Struggle, National Book Trust,
1987.

Course Outcomes : After completion of the course student able to

Knowledge
Course Outcome Description
Level
Students will have an overall understanding of lndian history and culture K2
col from ancient to modern India.
co2 Understand the greatness ofthe Mughals and their administration. K2
Visualise how the Europeans are settled and how the colonials introduce K1
co3 various economic policies and their impacts.
K-now the stages of the Indian Freedom Struggle and the roles of Gandhi K2
co4 and Subash Chandra Bose.
Kl- [Link], K2- Understanding. K3- Applying. K4- Analyzing. K5- Evaluating. K6- Creating
COURSE AND PROGRAMME OUTCOMES MAPPING

POI P02 PO3 PO4 PO5 PO6 PO7 PO8 PO9 POl0 PSOl PS02 PSOJ

co1 2

co2 2

co3 2

co4 2

l -Low, 2-Medium. 3-High

t
a
Usk^"{- 3 Orlo*-1*'(.o-t'tf'*-.'

29 of 31
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colle8es
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Yeat 2024:25.

Programme MCA Semester First

INFORMATION
Course Code 109 Course Name
TECHNOI-OGY ACT
L T P
Course INDIAN KNOWI-EDGE Hours/Week
4 0 0
Category SYSTEMS _ IB.
Credits 0
Course This course endeavors to give an insightful understanding of fundamental nuances of
Objectives this information technology ecosystem and its legal concerns.
Due emphasis on the social, intellectual property issues and legal analysis of new
emerging technologies of Cyberspace.
The capital idea of this course is to professionally equip sludents with a detailed
understanding of national and international regulatory framework and mechanics of
cyber law.
LINIT -I INTRODUCTION: Origin and meaning of Cyberspace, Cyberspace vs. Physical space,
Legal Issues in Cyberspace, Phases of Cyberspace Regulation, Need of Regulation for
Cyberspace, Different Models oi Cyberspace Regulation: No Regulation, Govemment
Regulation. Self-Regulation and Govemment Regulation. Cyber Libertarianism,
Cyberpattemalism, Network Communitarianism. Symbiotic Regulation, Behavioural
Regulation. Algorithmic Regulation etc.
CYBER JURISDICTION: Concept of Jurisdiction. .lurisdiction in Cyberspace. Issues
and concerns of Cyberspace Jurisdiction in India, International position of Cyberspace
Jurisdiction, Judicial interpretation of Cyberspace Jurisdiction.
LINIT -2 INFORMATION TECHNOLOGY ACT: A brief overview of Information Technologl
Act,2000, IT Act 2000 vs. IT Amendment Act 2008, Relevant provisions from Indiar
Penal Code, Indian Evidence Act, Bankers Book Evidence Act, Reserve Bank of Indiz
Act, etc.
CONCEPT OF ELECTRONIC SIGNATURE AND DIGITAL SIGNATURE: REIEVANCT
of Signature, Handwritten signature vs Digital Signature, Technological Advancemen
and development of signature, Digital Signature: IT Act,2000, Cryptography, Public Kel
and Private Key, Public Key Infrastructure, Electronic Signature, Electronic Signature vs
Digital Signature. UNCITRAL Model Law on Electronic Signature.
UNIT -3 CYBER CRIMES: Cyber Crimes - Definitions - Nature, Conventional Crimes vs
Cyber Crimes, Types of Cyber Crimes, Cyber offences covered under the Information
Technology Act,2000, Cyber offences and other laws (lPC, POCSO etc.). Issues
relating to investigation of cybercrimes in India, Cyber Contravention. Cybercrime vs
Cyber Contravention, Cyber Contraventions -Civil Liabilities and Adjudication.
LAW RELATING TO LIABILITIES OF INTERMEDIARIES: Meaning and concept
of intermediary, Intemational legal framework on intermediary, Liability of intermarry
under the IT Act, Critical analysis of The Information Technology (lntennediary
Guidelines and Digital Media Ethics Code) Rules 2021 and its comparison with old
intermediary guide lines, Recent developments and judicial interpretation of
intermediaries liability.
DATA PROTECTION AND PRIVACY CONCERNS IN CYBERSPACE: NCCd tO
protect data in cyberspace, Types of data, Legal framework of data protection. Data
protection bill -an overview. GDPR. Concept of privacy ,Privacy concems of
cyberspace, Indian Constitutional framework ol privacy and its ludicial interpretation,
Emerging issues of Data protection.

)- g' G"'rt'&ur'leoor31
l. Uk^sc{ Ww*V-
 VIKRAMA SIMHAPURI UNIVERSITY, NELLORE
DEPARTMENT OF COMPUTER SCIENCE
Syllabus for Master of Computer Applications for V.S. University Constituent Colleges(S) and Affiliated Colleges
under the jurisdiction of Vikrama Simhapuri University, Nellore with effect from the Academic Year 2024125.

T INIT .4 APPRECIATION OF ELEC'I'RONIC EVIDENCE: Concept of Electronic Records and

Electronic Evidence, Recognition of electronic records under the IINCITRAL Model
Law & IT Act, Types ofElectronic Evidence. Sources ofelectronic evidence. l-echnical
Issues in collection of electronic Evidence. Chain of custody ol electronic evidence,
Admissibility ofelectronic evidence under Indian laws.
IP PROTECTION ISSUES IN CYBERSPACE:COPYRIGHT ISSUES IN
CYBERSPACE: Fundamental notions of copyright law, Copyright issues in
cyberspace, Copyright infringement in digital environment-Software piracy, Linking,
Framing. Caching, Meta Tagging. Legal protection of copyright in lnternational
Framework-WCT. WPPT. [Link] legal protection of copyright in cyberspace &
concept of DRM.
TRADEMARK ISSUES IN CYBERSPACE: Meaning, Purpose and Kinds of Domain
Name, Domain Name Vs Trademark. Domain Name Registration, ICANN, Domain
Name dispute and Related Laws, Different Form of Domain in Cyberspace, Judicial
Approach.
Text Books l Chris Reed, Intemet Law-Text and Materials, Universal Law Publishing Co., New
Delhi. 2nd Edition, 2005.
2. Ian J Lloyd, Information Technology Law, Oxford University Press, 7th Edition,
2014.
Reference [Link] Sharma, Information Technology Law and Practice, Universal Law Publishing,
Books 2017.
2. Rodney D Ryder & Nikhil Naren. Intemet Law-Regulating Cyberspace and emerging
Technologies, Bloomsbury,2020.
Course Outcomes : After completion of the course student able to
Knowledge
Course Outcome Description
Level
Understand conceptual framework and theoretical foundation of K2
col cyberspace regulatory framework.
co2 Analysis of jurisdictional issues of cyberspace Krl
co3 Critically analyse the Information technology act . 2000 and related rules. K4
Understand Intellectual Property issues and evidentiary concems of K2
co4
cyberspace.
K l- Remernbering. K2- Understanding" K3- Appll ing. K.t- Analyzing. K5- Evaluating. K6- Crearing
COURSE AND PROGRAMME OUTCOMES MAPPING
POr l)( )l PO3 P()4 PO5 PO6 PO7 PO8 P()9 POl0 PSOI PSO2 PSOS

col I 2 1 2

c02 I I

co3 -) 2 I

('o4 -) I I 2

l-Low, 2-Medium, 3-Hi

l.
.L
[Link]^-r&- 9' eut"^('^-[^IqL'
[Link]{-
31 of 31