With effect from the academic year 2024-2025

GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD

DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
(Course under Choice Based Credit System)
SEMESTER – I

Workload Per Marks

Paper Title/Subject
Paper No Week CREDITS
Internal External Total
(L+T+P)
MSCCS111 DISCRETE 4+0+0 30 70 100 4
MATHEMATICS
MSCCS112 COMPUTER 4+0+0 30 70 100 4
ORGANIZATION
MSCCS113 OOPS WITH JAVA 4+0+0 30 70 100 4
MSCCS114 OPERATING 4+0+0 30 70 100 4
SYSTEMS
MSCCS115 COMPUTER 4+0+0 30 70 100 4
NETWORKS
MSCCS116 OOPS 0+0+4 -- 50 50 2
LABORATORY
MSCCS117 COMPUTER 0+0+4 -- 50 50 2
NETWORKS
LABORATORY
MSCCS118 OPERATING 0+0+4 -- 50 50 2
SYSTEM
LABORATORY
SEMINAR 02 25 25 1
675 27

SEMESTER-II

Workload Per Marks

Paper Title/Subject
Paper No Week CREDITS
Internal External Total
(L+T+P)
MSCCS121 WEB 4+0+0 30 70 100 4
TECHNOLOGIES
MSCCS122 AUTOMATA 4+0+0 30 70 100 4
THEORY AND
FINITE LANGUAGES
MSCCS123 UNIX NETWORK 4+0+0 30 70 100 4
PROGRAMMING
MSCCS124 PYTHON 4+0+0 30 70 100 4
PROGRAMMING
MSCCS125 ARTIFICIAL 4+0+0 30 70 100 4
INTELLIGENCE
MSCCS126 WEB 0+0+4 -- 50 50 2
TECHNOLOGY
LABORATORY
MSCCS127 UNIX 0+0+4 -- 50 50 2
PROGRAMMING
LABORATORY
MSCCS128 PYTHON 0+0+4 -- 50 50 2
PROGRAMMING
LABORATORY
SEMINAR 02 25 25 1
675 27

MSCCS111 DISCRETE MATHEMATICS DM

WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
PPW MARKS: 70
Unit – I
Mathematical Logic: propositional logic, propositional equivalences, predicates & quantifiers, rule of
inference, direct proofs, proof by contraposition, proof by contradiction.
Boolean Algebra: Boolean functions and its representation, logic gates, minimizations of circuits by
using Boolean identities and K-map.
Unit – II
Basic Structures: Sets representations, set operations, functions, sequences and summations. Division
algorithm, modular arithmetic, solving congruences, applications of congruences.
Recursion: Proofs by mathematical induction, recursive definitions, structural induction, generalized
induction, recursive algorithms.

Unit – III
Counting: Basic counting principle, inclusion-exclusion for two-sets, pigeonhole principle, permutations
and combinations, Binomial coefficient and identities, generalized permutations and combinations.
Recurrence Relations: introduction, solving linear recurrence relations, generating functions, principle of
inclusion-exclusion, applications of inclusion-exclusion.

Relations: relations and their properties, representing relations, closures of relations, equivalence relations,
partial orderings.

Unit – IV

Graphs: Graphs definitions, graph terminology, types of graphs, representing graphs, graph isomorphism,
connectivity of graphs, Euler and Hamilton paths and circuits, Dijkstra’s algorithm to find shortest path,
planar graphs–Euler’s formula and its applications, graph coloring and its applications

Trees: Trees definitions–properties of trees, applications of trees –BST, Haffman Coding, tree traversals:
pre-order, in-order, post-order, prefix, infix, postfix notations, spanning tress–DFS, BFS, Prim’s, Kruskal’s
algorithms.

Text Book: Kenneth H. Rosen, Discrete Mathematics and its Applications (7th edition)
References
1. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics
2. Stein, Drysdale, Bogart, Discrete Mathematics for Computer Scientists
3. J.P. Tremblay, R. Manohar, Discrete Mathematical Structures with Applications to Computer
Science
4. Joe L. Mott, Abraham Kandel, Theoder P. Baker, Discrete Mathematics for Computer
Scientists and Mathematicians

MSCCS112 COMPUTER ORGANIZATION CO

WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL
PPW MARKS: 70

UNIT-I
Basic Structure Of Computer Hardware And Software:
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
Functional units, Basic Operational concepts, Bus structures, Software, Performance,
Distributed Computing.
Logic Circuits: Basic Logic Functions, Synthesis of Logic Functions Using AND, OR,
and NOT Gates, Minimization of Logic Expression, Synthesis with NAND and
NOR Gates, Practical Implementation of Logic Gates, Flip- Flops, Registers and Shift
Registers, Counters, Decoders, Multiplexers, Sequential Circuits. (Chapter 1, A.1 to
A.13)

UN I T - II
Addressing Methods : Basic Concepts, Memory Locations, Main Memory Operations,
Addressing Modes, Assembly Language, Basic I/O operations, Stacks and Queues,
Subroutines.
Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction,
Hardwired Control, Performance Considerations, Micro Programmed Control, Signed
Addition and Subtraction, Arithmetic and Branching Conditions, Multiplication of
Positive Numbers, Signed-Operand, Integer Division, Floating-Point Numbers.(Chapter
2.1 to 2.83, 6.4 to 6.10)
U N I T - III
Input-Output organization: Accessing I/O Devices, Interrupts, Processor Examples,
Direct Memory Access, I/O Hardware, Standard I/O Interfaces, The Motorola 680X0
Family, The Intel 80X86 Family, The Power PC Family, The Alpha AXP Family,
Architectural and Performance Comparisons, A Stack Processor. (Chapter 4, 8.1 to 8.6)

U N I T - IV
Memory: Semiconductor RAM memories, Read-Only Memories, Cache Memories,
Performance Considerations, Virtual Memories, Memory Management Requirements.
Introduction To Computer Peripherals: I/O Devices, On-Line Storage.

Text Book:
1. Computer Organization, TMH (IV Edition) By - V.C. Hamacher
References:
1. Computer Organization, (Phi) By - Morris Mano
2. Computer Architecture & Organization by - Hayes, (TMH)
3. Computer Systems Organization & Architecture By - Carpinelli,
(Addisonwesley)
4. The Architecture Of Computer Handwone And Sytems
Handwone By-Englander (Weily).
5. Computer Sytems Design And Architecture By- VP Heuring, HF Jordan(Pearson).
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS113 OOPS WITH JAVA OOPS
WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL
PPW MARKS: 70
UNIT - I
Object - Oriented Thinking: Messages and Methods - Classes and Instances - Class
Hierarchies - Inheritance - Method Binding, Overriding, and Exceptions. A Brief History
Of Object - Oriented Programming: The History of Java - Client - Side Computing -
Java Language Description. Object - Oriented Design: RDD - CRC cards - Components
and Behavior - Software Components-Formalizing the Interface – Implementing
components Integration of Components. Understanding Paradigms: Program Structure -
Types - Access Modifiers - Lifetime Modifiers. (Chapters1 to 4)
UNIT - II
Data Fields - Constructors - Inheritance - The Java Graphics Model - Multiple Objects of the
Same Class. Adding User Interaction - Inner Classes - Interfaces - The Java Event Model -
Window Layout. Understanding Inheritance: An Intuitive Description of Inheritance -
Subclass, Subtype, and Substitutability - Forms of Inheritance - Modifiers and Inheritance -
The Benefits of Inheritance -The Costs of Inheritance. Mechanisms For Software
Reuse: Substitutability-Combining Inheritance and Composition - Dynamic Composition.
(Chapters 5, 6, 8, 10)
UNIT - III
Implications of Inheritance: The Polymorphic Variable - Assignment - Equality Test -
Garbage Collection. Polymorphism: Polymorphic Variables - Overloading - Overriding -
Abstract methods - Pure Polymorphism. Input and Output Streams: Input Streams -
Output Streams - Object serialization - Piped Input and Output - Readers and Writers.
Exception Handling: Information Transmitted to the Catch Block - The Finally Clause -
Throwing Exceptions - Passing on Exceptions. (Chapters 11, 12, 14,16)
UNIT - IV
The AWT: The AWT Class Hierarchy - User Interface Components – Panels Dialogs.
Understanding Graphics: Color - Rectangles - Fonts - Images. Multiple Threads of
Execution: Creating Threads - synchronizing Threads. Collection Classes - Multiple
Threads of Execution - Exception Handling. Applets and Web Programming: Applets
and HTML - Security Issues - Applets and Applications - Obtaining Resources Using an
Applet - Combining Applications and Applets. (Chapters 7, 13, 18, 20, 21)
Text Book:
1. Understanding Object-Oriented Programming With Java By – Timothybudd (Pearson)
Reference Books:
1.The Complete Reference Java 2 (Fourth Edition) By - Patrick Naughton & Herbetschildt (TMH)
2. Programming Java - Decker&Hirsh Field Vikas Publisking(2001) (Thomsonlearning) (Second
Editon)
3. Introduction To Java Programming - Y.Daniel Liang Phi (2002)
4. Object Oriented Programming Through Java 2 By - Thamus Wu (Mc.Grawhill)
5. Java 2 - Dietel & Dietel (Pearson Education)
6. Introduction To Java - Bala Guru Swamy
7. Introduction To Programmind & Ood Using Java - Jaino Nine & Fa Hosch (Johnwiley)
8. Starting Out With Java - Jony Gaddis (Dream Tech Press)
9. Java Programming - Schaum‟S Series
10. Object Oriented Application Development Using Java - Er Doxe Etc.(Thomsonpress)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS114 OPERATING SYSTEMS OS
WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL
PPW MARKS: 70

UNIT - I
Computer System Overview - The Memory Hierarchy - I/O Communication Techniques.
Operating System Overview - The Evolution of Operating Systems - Microsoft Windows
Overview - Modern UNIX Systems - Linux. Process Description and Control - Process States -
Process Description - Process Control - UNIX SVR 4 Process management. Threads, SMP,
and Micro kernels – Processes and Threads - symmetric Multiprocessing - Micro Kernels.
(Chapters 1to 4)

UNIT - II
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 - Dining Philosophers Problem - UNIX
Concurrency Mechanisms. (Chapters 5, 6)

UNIT - III
Memory Management - memory management Requirements - Memory Partitioning- Paging
- Segmentation. Virtual Memory - Hardware and Control Structures - Operating System
Software. Uniprocessor Scheduling - Types of Processor Scheduling - Scheduling
Algorithms - Traditional UNIX Scheduling. (Chapters 7, 8, 9)

UNIT - IV
I/O Management and Disk Scheduling - I/O Devices - Organization of the I/O Function-
Operating System Design Issues - Disk Scheduling - Disk Cache.
File Management - File Organization and Access - File Directories - File Sharing – record
Blocking - Secondary Storage Management - UNIX File Management. (Chapter 11, 12)
Text Book:
1. Operating Systems - By - William Stallings (V Edition)
Reference Books:
1. Operating Systems A Modern Perspective (Second Edition)By - Gary Nutt (Pearson)
2. Applied Operating System By - Siler Schatz, Galvin (John Wiley)
3. Modern Operating System By - Tananbam (Phi)
4. Operating System Principles By - Silberschatz, Galivn. Gagne (John Wiley)
5. Operating Systems By - DM Dhamdhere (TMH)
6. Under Standing Operating Systems By - IM Flynn, AM McHocs (Thomson press)
7. Operating Sytems - Dietel (Pearson)
8. Operating Systems - Rc Joshi, S. Tapaswi (Dream Tech)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS115 COMPUTER NETWORKS CN

WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL

PPW MARKS: 70

UNIT-I
Computer Networks And The Internet: What is the Internet?, What is a Protocol?, The
Network Edge, The Network Core, Access Networks and Physical Media, Delay and
Loss in Packet-Switched Networks, Protocol Layers and Their Service Models, Internet
Backbones, NAPs, and ISPs, A Brief History of Computer Networking and the Internet.
Application Layer: Principles of Application Layer Protocols,
The World Wide Web: HTTP, File Transfer: FTP, Electronic Mail in the Internet,
DNS - The Internet's Directory Service. (Chapter 1 and Chapter 2.1 to 2.5)

U N I T - II
Transport Layer: Transport-Layer Services and Principles, Multiplexing and DE
multiplexing Applications, Connectionless Transport: UDP, Principles of Reliable Data
Transfer, Connection-Oriented Transport: TCP, Principles of Congestion Control.
(Chapter 3.1 to 3.6)

U N I T - III
Network Layer And Routing: Introduction and Network Service Models, Routing
Principles, Hierarchical Routing, Inter Protocol, Routing in the Internet, What’s Inside a
Router? (Chapter 4.1 to 4.6)

U N I T - IV
Link Layer And Local Area Networks: The Data Link Layer: Introduction, Services,
Error Detection and Correction Techniques, Multiple Access Protocols and LAN's, LAN
Addresses and ARP, Ethernet, Hubs, Bridges, and Switches, IEEE 802.11 LANs, PPP:
The Point-to-Point Protocol, Asynchronous Transfer Mode (ATM), X.25 and Frame
Relay. (Chapter 5.1 to 5.10)
Text Book:
1. ComputerNetworking A Top-Down Approach Featuring The Internet By –
James F. Kurose And Keith W. Ross (Pearson)
Reference Books:
1. Business Data Communication & Networks By - Fitz Gerald (John Wiley)
2. Data & Computer Communications - W Stallings (Pearson, Phi)
3. Computer Communications&Networking Topologies- Magallo,
V.M.Hancock(Thomson)
4. Data Communication & Computer Networks - R. Agarwal, Bb Tiwari (Vikas)
5. Computer Networks - As Tanenbaum (Phi)
6. Computer Networks - Black (Phi)
7. Under Standing Communications & Networks – Wa Shay (Thomson)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS116 OOPS LAB OOPSL

WORK LOAD: 4 REVIEW ASSESSMENT EXTERNAL

PPW MARKS: 50
1. Write a Java Program for sorting a given list of names in ascending
order using Command line arguments.
2. Write a Java Program to multiply two given matrices.
3. Programs Illustrating Overloading & Overriding methods in Java.
4. Programs Illustrating the Implementation of Various forms of
Inheritance.(Ex. Single, Hierarchical, Multilevel
inheritance….)
5. Program which illustrates the implementation of multiple Inheritance
using interfaces in Java.
6. Program illustrates the implementation of abstract class.
7. Programs to create packages in Java.
8. Program to Create Multiple Threads in Java.
9. Program to Implement Producer/Consumer problem using synchronization.
10. Program to Write Applets to draw the various polygons.
11. Create and Manipulate Labels, Lists, Text Fields, Text Areas & Panels
12. Handling Mouse Events & Keyboard Events.
13. Using Layout Managers.
14. Create & Manipulate the Following Text Areas, Canvas, Scroll bars, Frames,
Menus, Dialog Boxes.
15. Programs which illustrate the manipulation of strings. Ex. 1 Sorting an array
of Strings.
16. Frequency count of words & Characters in a text.
17. Programs which illustrates the use of files & Streams.
18. Java Program that reads on file name from the user and displays
the contents offile.
19. Java Program that displays the no. of characters, lines & words in a text file.
20. Java Program to display the contents of file along with a line
number before eachline.
21. Java Program to read & write the data using Random Access File

Text Book:
1. The Complete Reference Java J2SE 5th Edition By - Herbert Schildt (TMH).
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS117 COMPUTER NETWORKS NAPL
LAB
WORK LOAD: 4 REVIEW ASSESSMENT EXTERNAL
PPW MARKS: 50

NETWORKS LABORATORY

Part A – Simulation Exercises

The Following Experiments Shall Be Conducted Using Either Ns228/Opnet Or Any
other Simulators.

1. Simulate a three nodes point-to-point network with duplex links between

them. Set the queue size vary the bandwidth and find the number of
packets dropped.
2. Simulate a four node point-to-point network, and connect the links as follows:
n0- n2, n1-n2 and n2-n3. Apply TCP agent between n0-n3 and UDP n1-n3.
Apply relevant applications over TCP and UDP agents changing the
parameter and determine the number of packets by TCP/UDP.
3. Simulate the different types of Internet traffic such as FTP a TELNET over a
network and analyze the throughput.
4. Simulate the transmission of ping messaged over a network topology
consisting of6 nodes and find the number of packets dropped due to
congestion.
5. Simulate an Ethernet LAN using N-nodes(6-10), change error rate and data rate
and Compare the throughput.
6. Simulate an Ethernet LAN using N nodes and set multiple traffic nodes
and determine collision across different nodes.
7. Simulate an Ethernet LAN using N nodes and set multiple traffic nodes and
plot congestion window for different source/destination.
8. Simulate simple ESS and with transmitting nodes in wire-less LAN by
simulation And determine the performance with respect to transmission
of packets.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science

MSCCS118 OPERATING SYSTEMS LAB OSL

WORK LOAD: 4 REVIEW ASSESSMENT EXTERNAL
PPW MARKS: 50

1. Simulate the following CPU Scheduling algorithms

a) Round Robin
b) SJF
c) FCFS
d) Priority
2. Simulate all file allocation strategies.
a) Sequential
b) Indexed
c) Linked
3. Simulate MVT and MFT
4. Simulate all File organization techniques.
a) Single level directory
b) Two level
c) Hierarchical
d) DAG
5. Simulate Bankers Algorithm for Dead Lock Avoidance
6. Simulate Bankers Algorithm Dead Lock Prevention.
7. Simulate all Page replacement algorithms.
a) FIFO
b) LRU
c) LFU
d) Etc….
8. Simulate Paging Techniques of memory management.
9. Shell Programming.
a) Writing Simple shell scripts
b) Control structures - sequence, selection, iteration
c) Pipes & Redirections
d) Passing arguments to shell programs
e) Simple programs using system calls
10. UNIX System Administration:
a) User account maintenance
b) Security
c) Print jobs
d) Backup
e) Package installations
f) Resource management
g) Device drivers
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science

SEMESTER-II

MSCCS121 WEB TECHNOLOGIES WT

WORK LOAD: INTERNAL MARKS: 30 EXTERNAL
4 PPW MARKS: 70
UNIT-I
Introduction to XHTML, Headers, Hyperlinks, Lists, Images, Tables,
Frames, Forms.
Cascading Style sheets - Introduction, Inline Styles and Embedded Style Sheets,
Linking external sheets.
JavaScript- Introduction, simple programming, Obtaining User Input with prompt
Dialogs, Functions - program modules in JavaScript, programmer defined
functions, function definition-Arrays. (Text Book 1 chapters 4, 5, 6, 7, 10 and 11)
UNIT-II
JavaScript- Objects - Math Object, String Object, Date Object, document and
window Objects. Event Model – on click, on load, on error, on mouse over, on
mouse out, on focus, on blur, on submit, more DHTML events.
Extensible Markup Language (XML)- Introduction, Structuring Data, Document
Type Definitions (DTDs), Document Object Model (DOM), DOM Methods, XSL.
(Text Book 1 chapters 12, 14 and 20)

UNIT-III
JDBC- Introduction, Drivers, API‟s, classes and interfaces, Exploring JDBC
Processes with the java.sql. Package and javax.sql package, working with
Transactions. (Text Book 2 -Chapter 3)

UNIT-IV
Servlets- Features of Servlets, servlet API, servlet Life Cycle, creating simple servlet,
working with HttpServletRequest and HttpServletResponse interfaces, Forward,
include, redirect, session tracking and cookes.
JSP-introduction, features, advantages of JSP, Architecture of JSP, Life Cycle,
JSP Tags and Implicit Objects, Action Tags in JSP. (Text Book 2 - Chapter
4, 5 and 7)
Text Book:
1. Internet& World Wide Web- H. M. Deitel, P.J. Deitel, A. B. Goldberg-Third Edition
2. Java Server Programming Java EE6 Black Book, Dreamtech press.

NOTE: One of the bits in each question should be a problem.

 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS122 AUTOMATA THEORY AND FINITE AFL
LANGUAGES
WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL
PPW MARKS: 70

UNIT - I
Finite Automata And Regular Expressions : Preliminaries, Finite state
systems, Nondeterministic finite automata (NFA), Deterministic finite automata
(DFA), NFA TO DFA conversion Regular expressions, inter conversions, Two-way
finite automata, finite automata with output, State minimization applications.
Properties Of Regular Sets: Pumping Lemma, closure properties of regular sets.
(Chapters 1, 2, 3.1 and 3.2)

UNIT - II
Context Free Grammars (CFG): Context free grammars Derivation tree,
simplification of context - Free grammars, Normal forms.
Pushdown Automata: Informal description, Definitions, pushdown automata design.
(Chapters 4.1 to 4.6, 5)

UNIT - III
Properties Of Context Free Languages (CFL): Pumping Lemma, closure properties,
decision algorithms for CFLs.
Turing Machines (Tm): The turning machine & model, computable languages and
functions, design of TM, modification of TM, Church's hypothesis. (Chapters 6, 7)

UNIT- IV
Recursive & Recursively Innumerable Languages Undecidability: Properties of
recursive and recursively innumerable languages, Universal turing machine, post
correspondence problem. Decidable and Undecidable problems, universal turing
machine, Rice's theorem.
The Chomsky Hierarchy: Regular grammars, Unrestricted grammars, inter conversions
between regular grammars and finite automata, context-sensitive languages,(Chapters
8.1 to 8.8, 9)
Text Book:
1. Introduction To Automata Theory Languages And Computation
By – J.E. Hopcroft, J.D. Ullman (Narosa)
Note: For Examples Refer The Book. Introduction To Computer Theory - Dia Cohen
(John Wiley)

Reference Books:

1. Introduction To Computer Theory-Daviel I.A.Cohen (John Wiley, Iind Edition)

2. Introduction To Languages And Theory Of Computation By -John C.Martin
(Second Edition Tmh)
3. Theory Of Computation By - Chandra Sekharan & Misra (Phi)
4. Introduction To Automata Thoery, Languages & Computation – Je Hopfcroft, R.
Motwani, Jd Ullman (Pearson)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS123 UNIX NETWORK PROGRAMMING UNP
WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL MARKS:
PPW 70

UNIT -I
Inter-process Communication: Introduction, File and Record
Locking, Simple Client- server Pipes, FIFO's, Streams and Messages, Name Spaces,
System V IPC, Message Queues, Semaphores, Shared Memory, Socket and TLI.
(Chapters 3, 3.1 to 3.12)

UNIT -II
A Network Primer Communication Protocols: Introduction, TCP/IP, XNS, SNA,
NetBIOS, OSI Protocol, UUCP, Protocols Comparisons. (Chapters 4, 5, 5.1 to 5.8)

U N I T -III
Berkeley Sockets: Introduction, Overview, Unix Domain Protocols, Socket
Addresses, Elementary Socket System Calls, Simple Examples, Advanced Socket
System Calls, Reserved Ports, Stream Pipes, Passing File Descriptors, Socket Options,
Asynchronous I/O, Input / Output Multiplexing, Out-of-Band and Data, Sockets and
Signals, Internet Super server, Socket Implementation. (Chapters 6, 6.1 to 6.17)

U N I T - IV
Transport, Overview, Transport Endpoint Addresses, Elementary TLI
Functions, Simple Example, Advanced TLI Functions, Streams, TLI Implementation,
Stream Pipes, Passing File Descriptors, Input/output Multiplexing, Asynchronous I/O,
Out-of-Band Data. (Chapter 7.1 to 7.13)
Text Book:
1.Unix Network Programming By W. Richard Stevens

Reference Books:
1. Unix Systems Programming - K.A. Robbins, S. Robbins (Pearson)

2. Unix The C Odyssey - M. Gandhi, Shetti, Shah (Bpb Publications)

 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS124 PYTHON PROGRAMMING PP
WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL MARKS:
PPW 70
Unit – I
Introduction to Python Programming: How a Program Works, Using Python, Why Python, Input,
Processing, and Output, Displaying Output with the Print Function, Comments, Variables, Reading Input
from the Keyboard, Performing Calculations (Operators. Type conversions, Expressions), More about Data
Output, Indentation.
Decision Structures and Boolean Logic: if, if-else, if-elif-else Statements, Nested Decision Structures,
Comparing Strings, Logical Operators, Boolean Variables.
Repetition Structures: Introduction, while loop, for loop, Calculating a Running Total, Input Validation
Loops, Nested Loops.
Unit – II
Functions: Introduction, Defining and Calling a Void Function, Designing a Program to Use Functions, Local
Variables, Passing Arguments to Functions, Global Variables and Global Constants, Value -Returning
Functions-Generating Random Numbers, Writing Our Own Value- Returning Functions.
Modules-Importing module, creating and exploring modules: math module, Numpy module, time module,
random module, OS, calendar, sys., Storing Functions in Modules.
Unit – III
Lists and Tuples: Sequences, Introduction to Lists, List slicing, Finding Items in Lists with the in Operator,
List Methods and Useful Built-in Functions, Copying Lists, Processing Lists, Two- Dimensional Lists,
Tuples.
Strings: Basic String Operations, String Slicing, Testing, Searching, and Manipulating Strings.
Dictionaries and Sets: Dictionaries, Sets, Serializing Objects.
Recursion: Introduction, Problem Solving with Recursion, Examples of Recursive Algorithms.
File and Exceptions: Introduction to File Input and Output, Using Loops to Process Files, Processing
Records, Exceptions.

Unit – IV
OOPs Concept : Introduction to OOP, Classes and objects, Inheritance Method overloading and method
overriding, Abstract method and Abstract class, Interfaces in python, Abstract class VS Interfaces,
constructor, instance methods ,class methods, static methods.
GUI Programming: Graphical User Interfaces, Using the tkinter Module, Display text with Label Widgets,
Organizing Widgets with Frames, Button Widgets and Info Dialog Boxes, Getting Input with Entry Widget,
Using Labels as Output Fields, Radio Buttons, Check Buttons.

Text Book: Tony Gaddis, Starting Out With Python (4th edition)
References
1. Kenneth A. Lambert, Fundamentals of Python
2. Clinton W. Brownley, Foundations for Analytics with Python
3. James Payne, Beginning Python using Python 2.6 and Python 3
4. Charles Dierach, Introduction to Computer Science using Python
5. Paul Gries, Practical Programming: An Introduction to Computer Science using Python 3
1.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS125 ARTIFICIAL INTELLIGENCE AI
WORK LOAD: 4 INTERNAL MARKS: 30 EXTERNAL
PPW MARKS: 70
UNIT- I
Artificial Intelligence: Its Roots And Scope , AI : History And Applications : From Eden to
ENIAC: Attitudes toward Intelligence, Knowledge, and Human Artifice, Overview of
AIApplication Area
Artificial Intelligence As Representation And Search: Introduction, The Prepositional
Calculus, The Predicate Calculus, Using co Rules to Produce Predicate Calculus
Expressions, Application: A Logic-Based Financial Advisor. (Chapters 1 and 2)

UNIT - II
Structures And Strategies For State Space Search: Introduction, Graph Theory, Strategies for
State Space Search, Using the State Space to Represent Reasoning with the
Predicate Calculus.
Heuristic Search: Introduction, An Algorithm for Heuristic Search, Admissibility, Monotonicity,
and Informed ness, Using Heuristics in Games, Complexity Issues.
Control and Implementation of State Space Search: Introduction, Recursion-Based
Search, Pattern-Directed Search, production Systems, The Blackboard
Architecture for Problem Solving. (Chapters 3, 4 and 5)

U N I T - III
Representation And Intelligence: The AI C h a l l e n g e : Knowledge
Representation: Issues in Knowledge Representation, A Brief History of AI
Representational Systems, Conceptual Graphs: A Network Language, Alternatives to Explicit
Representation, Agent Based and Distributed Problem Solving.
Strong Method Problem Solving: Introduction, Overview of Expert System Technology, Rule-
Based Expert Systems, Model-Based, Case Based, and Hybrid Systems, Planning. (Chapters
6and 7)

U N I T - IV
Reasoning In Uncertain Situations: Introduction, Logic-Based Abductive Inference, Abduction:
Alternatives to Logic, The Stochastic Approach to Uncertainty. (Chapter 8)
Text Book:
1. Artificial Intelligence By George F Luger, Pearson Education.
Reference Books:
1. Artificial Intelligences By Ritch & Neight.
2. Introduction To Artificial Intelligence And Expert Systems by W.Patterson (Phi-200)
3. Artificial Intelligence By Patrick Henry Winston
4. Principles Of Artificial Intelligence (Narosa)
5. Artificial Intelligence Byshiartrussel Peter Novvig (Phi)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS126 WEB TECHNOLOGIES LAB WTL
WORK LOAD: 4 REVIEW ASSESSMENT EXTERNAL MARKS:
PPW 50
1. Create a simple HTML page which demonstrate all types of lists.
2. Create a letter head of your college using following styles
i. image as background
ii. use header tags to format college name and address
3. Create a web page, which contains hyper links like fruits, flowers, animals. When
you click on hyper links, it must take you to related web page, these web pages must
contains with related images.
4. Create a hyperlink to move around within a single page rather than to load another
page.
5. Create a leave letter using different text formatting tags.
6. Create a table format given bellow using row span and
column span. Insert 5 records.
7. Create a table with different formats as given bellow.
i. Give different background and font colors to table header, footer and
body.
ii. Use table caption tag.
8. Divide a web page vertically and horizontally with scroll bars, name them as shown
bellow decorate it with some items. F1
9. Create a student Bio-Data, using forms.
10. Create a web page using following style sheets
i. Inline style sheets.
ii. Embedded style sheets.
iii. External style sheets

11. Create a web page using “class” style sheets with different “border-width”
property values like thick, medium, thin, grove, inset, and outset, red & blue.
12. Accept marks from bellow form, calculate total and average, results must be shown in
alert box.

13. Write a JavaScript program to accept name and index of name character from prompt
box, convertname into uppercase and display name and index char in dialogbox.

14. Write a JavaScript program to accept two values from form and
apply any 5mathematical functions.
15. Display the current date and time in both GMT and local form.
16. Write a JavaScript program on MouseOver, MouseOut, blur events.
17. Write a XML program using document type definitions
18. Write Student database with XML.
19. Write a XML program using XS
(All exercises from the text book must be practiced in addition to the above problems)

Note: Programs are to be practiced on the basis of topics covered in corresponding theory paper
for III & IV Unit.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS127 UNIX NETWORK PROGRAMMING UNPL
LAB
WORK LOAD: 4 REVIEW ASSESSMENT EXTERNAL MARKS:
PPW 50

Programs Using UNIX or LINUX

1. Write a program that takes one or more file/directory names as command line input
and reports the following information on the file:
a. File type
b. Number of links
c. Time of last access
d. Read, Write, Execution permissions.
2. Write a „C‟ program that illustrates how to execute two commands
concurrently with a command pipe.
3. Write a „C‟ program that illustrates the creation of child process using fork system call.
4. Write a „C‟ program that illustrates the real time of a day every 60 seconds.
5. Write a „C‟ program that illustrates implementation of ls command.
6. Write a „C‟ program that illustrates simple file locking.
7. Write a „C‟ program that illustrates to read or write from a file.
8. Write a „C‟ program that illustrates the following
a. Creation of FIFO
b. Reading from FIFO
c. Writing on to the FIFO.
9. Write a „C‟ program that illustrates sending the data from parent to child
using PIPE System Call.
10. Write a „C‟ program which displays the current working directory by using popen.
11. Write a „C‟ program that illustrates the file locking using semaphores.
12. Write a „C‟ program that illustrates Read or Write operation using semaphore.
13. Write a „C‟ program that illustrates the creation of shared memory.
14. Write a „C‟ program that illustrates inter-process communication using
shared memory system calls.
15. Write a „C‟ program that illustrates the following
a. Creating a message queue
b. Writing to a message queue
c. Reading from a message queue

Book For Reference:

1. Unix The C Odyssey - M. Gandhi, Shetti, Shah (Bpb Publications)

2. Unix Network Programming - W. Richard Stevens

MSCCS128 PYTHON PROGRAMMING LAB PPL

WORK LOAD: 4 REVIEW ASSESSMENT EXTERNAL
PPW MARKS: 50

1. Write a program that displays the following information: Your name, Full address, Mobile
number, College name, Course subjects.
2. Write a program to find the largest three integers using if-else and conditional operator.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
3. Write a program that asks the user to enter a series of positive numbers (The user should enter a
negative number to signal the end of the series) and the program should display the numbers in
order and their sum.
4. Write a program to find the product and sum of two matrices [A]mxp and [B]pxr using Numpy
5. Write recursive and non-recursive functions for the following:
a. To find GCD of two integers.
b. To find the factorial of positive integer
c. To print Fibonacci Sequence up to given number n
6. Write a program to display two random numbers that are to be added, such as: 247 + 129, the
program should allow the student to enter the answer. If the answer is correct, a message of
congratulations should be displayed. If the answer is incorrect, a message showing the correct answer
should be displayed.

7. Write a function to demonstrate variable length arguments.

8. WAP to Demonstrate about Fundamental Data types (sequential and non-sequential) in Python
Programming using type function.

9. Write a program to create file, write the content and display the contents of the file.

10. In a program, write a function that accepts two arguments: a list and a number n. The
function displays all of the numbers in the list that are greater than the number n.
11. Write a program with a function that accepts a string as an argument and returns the no. of vowels
that the string contains. Another function to return number of consonants.
12. Write a program that opens a specified text file and then displays a list of all the unique words
found in the file. (Store each word as an element of a set.)
13. Write a program to analyze the contents of two text files using set operations.
14. Write a program to implement the inheritance and dynamic polymorphism.
15. Write a GUI program that converts Celsius temperatures to Fahrenheit temperatures.
16. Write a GUI program that displays your details when a button is clicked.

Note: Handle the Exceptions raised from File Operations.

M.SC.II YEAR I SEMESTER:

Workload Marks
Paper No Per Week
Paper Title/Subject CREDITS
Internal External Total
(L+T+P)
MSCCS211 CLOUD COMPUTING 4+0+0 30 70 100 4
MSCCS212 SOFTWARE 4+0+0 30 70 100 4
ENGINEERING
MSCCS213 MOBILE APPLICATION 4+0+0 30 70 100 4
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
DEVELOPMENT
CRYPTOGRAPHY
MSCCS214 AND NETWORK SECURITY 4+0+0 30 70 100 4

MSCCS215 DATA WAREHOUSING AND 4+0+0 30 70 100 4

MINING
MSCCS216 MOBILE APPLICATION 0+0+4 00 50 50 2
DEVELOPMENT
LABORATORY
MSCCS217 DATA MINING 0+0+4 00 50 50 2
LABORATORY
SOFTWARE
MSCCS218 ENGINEERIG 0+0+4 00 50 50 2
LABORATORY
MSCCS219 SEMINAR 02 25 25 1
675 27
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS211 CLOUD COMPUTING CC
WORKLOAD: INTERNALMARKS:30 EXTERNAL
4 PPW MARKS:70

UNIT–I
INTRODUCTION: Essentials, Benefits and need for Cloud Computing -Business
andITPerspective-CloudandVirtualization-CloudServicesRequirements-Cloud and
Dynamic Infrastructure - Cloud Computing Characteristics Cloud Adoption.
CLOUD MODELS: Cloud Characteristics - Measured Service - Cloud Models -
SecurityinaPublicCloudPublicversusPrivateClouds-CloudInfrastructureSelf
Service. CLOUD AS A SERVICE: Gamut of Cloud Solutions - Principal
Technologies - Cloud Strategy Cloud Design and Implementation using SOA
-Conceptual Cloud Model-Cloud Service Defined

UNIT–II
CLOUD SOLUTIONS: Cloud Ecosystem - Cloud Business Process Management –
Cloud Service Management-Cloud Stack-Computing on Demand (CoD) – Cloud is
sourcing. CLOUD OFFERINGS: Information Storage, Retrieval, Archive and
Protection - Cloud Analytics Testing under Cloud - Information Security - Virtual
Desktop Infrastructure - Storage Cloud. CLOUD MANAGEMENT: Resiliency –
Provisioning - Asset Management - Cloud Governance - High Availability and
Disaster Recovery - Charging Models, Usage Reporting, Billing and Metering.

UNIT–III
CLOUD VIRTUALIZATION TECHNOLOGY: Virtualization Defined - Virtualization
Benefits - Server Virtualization - Virtualization for x86 Architecture - Hypervisor
Management Software-Logical Partitioning (LPAR)-VIO Server-Virtual Infrastructure
Requirements. CLOUD VIRTUALIZATION: Storage virtualization - Storage Area
Networks - Network-Attached storage - Cloud Server Virtualization - Virtualized Data
Center.

UNIT–IV
CLOUD AND SOA: SOA Journey to Infrastructure - SOA and Cloud -SOA Defined -
SOA and IaaS
- SOA-based Cloud Infrastructure Steps - SOA Business and IT Services. CLOUD
INFRASTRUCTURE BENCH MARKING: OLTP Benchmark-Business Intelligence
Benchmark e- Business Benchmark - ISV Benchmarks - Cloud Performance Data
Collection and Performance Monitoring Commands - Benchmark Tools.

TEXTBOOK:
1. Cloud Computing – Insight into New Era Infrastructure, Dr. Kumar Saurabh, Wiley
India.
REFERENCEBOOKS:
1. Cloud Computing, Roger Jennings,WileyIndia
2. Cloud Computing Explained, John Rhoton, Recursive Press
3. Cloud Computing Bible, Barry Sosinsky,Wiley
4. Cloud Computing: Principles and Paradigms, Rajkumar Buyya, James Broberg, Wiley
5. Cloud Computing for Dummies, Judith Hurwiz, Wiley Publishing.
6. The Cloud at your service, Rosenberg and Matheos, Manning Publications
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS212 SOFTWARE ENGINEERING SE
WORKLOAD: INTERNALMARKS:30 EXTERNAL
4 PPW MARKS:70
UNIT-I
INTRODUCTION TO SOFTWARE ENGINEERING: The Evolving Role of Software -
Software - The Changing Nature of Software - Software myths. A GENERICVIEWOF
PROCESS: Software Engineering-A Layered technology - A Process frame work-The
capability Maturity Model Integration (CMMI) - Process Patterns - Process Assessment -
Personal and Team Process Models - process Technology- Product and Process. PROCESS
MODELS: Prescriptive Models- The waterfall Model - Incremental Process Models-
Evolutionary Process Models - Specialized Process Models - The Unified Process.
(Chapters1, 2 and 3)

UNIT-II
SOFTWARE ENGINEERING PRACTICE: Software engineering Practice -
CommunicationPractice-PlanningPractices-ModelingPractices-ConstructionPractice
-deployment
SYSTEM ENGINEERING: Compute-Based systems - The System Engineering
Hierarchy – Business Process Engineering: An Overview –Product Engineering: An
Overview-System Modeling. REQUIRMENTENGINEERING: A Bridge to Design
and Construction - Requirements Engineering Tasks - Initiating the Requirements
EngineeringProcess-ElicitingRequirements-DevelopingUse-Cases-Building the
analysis Model- Negotiating Requirements - Validating Requirements. BUILDING
THE ANALYSIS MODEL: Requirements Analysis - Analysis Modeling Approaches–
Data Modeling Concepts-Object-oriented Analysis-Scenario-Based Modeling - Flow-
Oriented Modeling - Class-Based Modeling - Creating a Behavioral Model. (Chapters
5, 6, 7, 8)

UNIT-III
DESIGN ENGINEERING: Design within the Context of Software Engineering –
design Process and Design Quality - Design Concepts - The Design Model -
Pattern- Based Software Design.
CREATING AN ARCHITECTURAL DESIGN: Software Architecture-Data Design
- Architectural Styles and Patterns - Architectural Design- Assessing Alternative
Architectural Designs - Mapping Data Flow into Software Architecture.
MODELING COMPONENT-LEVEL DESIGN: What is a Component? Designing
Class-Based Component-Level Design Object Constraint Language - designing
Conventional Components. (Chapters 9, 10 and 11)

UNIT-IV
PERFORMING USER INTERFACE DESIGN: The Golden Rules - User Interface
Analysis and Design- Interface Analysis - Interface Design Steps - Design Evaluation.
RISK MANAGEMENT: Reactive vs. Proactive Risk Strategies - Software Risks - Risk
Identification - Risk Projection - Risk Refinement - Risk Mitigation, Monitoring, and
Management - The RMMM Plan. QUALITY MANAGEMENT: Quality Concepts -
Software Quality Assurance - Software Reviews -Formal Technical Reviews - Formal
Approaches to SQA - Statistical Software Quality Assurance -Software Reliability -The
ISO 9000 Quality Standards - The SQA Plan. (Chapters 12, 25, 26)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
TEXTBOOK:
1. SOFTWARE ENGINEERING BY R.S.PRESSMAN(McGraw Hill Sixth Edition)
REFERENCEBOOKS:
1. SOFTWARE ENGINEERING BY GHEZZI(PHI)
2. SOFTWARE ENGINEERING FUNDAMENTALS BY BEHFOROOZ
AND HUDSONOXFORDUNIVERSITY PRESS
SOFTWARE ENGINEERING BY FAIRLEY(McGraw-Hill)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS213 MOBILE APPLICATION DEVELOPMENT MAD
WORKLOAD:4 INTERNALMARKS:30 EXTERNAL
PPW MARKS:70

UNIT-I
INTRODUCTION TO ANDROID OPERATING SYSTEM: Android OS and Features – Android
development framework; Installing and running applications on Android Studio, Creating AVDs,
Types of Android application; Creating Activities, Activity Life Cycle, Activity states, monitoring
state changes;

UNIT-II
ANDROID APPLICATION COMPONENTS – Android Manifest file, Externalizing recourses like
Simple Values, Drivable, Layouts, Menus, etc, Building USER INTERFACES: Fundamental
Android UI design, Layouts – Linear, Relative, Grid and Table Layouts. User Interface (UI)
Components.

UNIT-III
FRAGMENTS – Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments to
Activity, adding, removing and replacing fragments with fragment transactions, interfacing between
fragments and Activities.

UNIT-IV
INTENTS AND BROADCASTS: Using intents to launch Activities, Types of Intents, Passing data
to Intents, Getting results from Activities, Broadcast Receivers – Using Intent filters to service
implicit Intents, Resolving Intent filters.
DATABASE: Introduction to SQLite database, creating and opening a database, creating tables,
inserting retrieving and deleting data.

TEXTBOOK:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012
2. Android Application Development for Java Programmers, James C Sheusi, Cengage Learning, 2013

REFERENCEBOOKS:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
2. Android Application Development (with Kitkat Support), Black Book, Pradeep Kothari, 2014,
Dreamtech Press publisher, Kogent Learning Inc.,2014
3. Android Programming: Pushing the Limits, Erik Hellman, 1st Edition,Wiley Publications, 2014
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS214 CRPTOGRAPHY AND CNS
NETWORK SECURITY
WORKLOAD:4 INTERNALMARKS:30 EXTERNAL
PPW MARKS:70

UNIT-I
INTRODUCTION:- Attacks, Services and Mechanisms, Security Services.
CONVENTIONAL ENCRYPTION: CLASSICAL TECHNIQUES: Steganography,
Classical Encryption Techniques.
CONVENTIONALENCRYPTION: MODERN TECHNIQUES:-Simplified DES.The
Data Encryption Standard, Differential and Linear Cryptanalysis, Block Cipher Modes of
Operation.

UNIT-II
CONFIDENTIALITYUSINGCONVENTIONALENCRYPTION:-Traffic
Confidentiality, Random Number Generation. PUBLIC-KEY CRPTOGRAPHY:-
Principles of Public-Key Cryptosystems, The RSA Algorithm, DiffieHellman Key
Exchange, Elliptic Curve Cryptography. INTRODUCTIONTO NUMBERTHEORY:-
Prime and Relatively Prime Numbers, Fermat's and Euler's Theorem, Euclid's
Algorithm, The Chinese Remainder Theorem, Discrete Logarithms.

UNIT-III
MESSAGE AUTHENTICATION AND HASH FUNCTIONS:- Authentication
Requirements, Authentication Functions, Message Authentication Codes, Hash
Functions, Security of Hash Functions and MACs. DIGITAL SIGNATURES AND
AUTHENTICATION PROTOCOLS:- Digital Signatures, Authentication Protocols,
Digital Signature Standard.

UNIT-IV
ELECTRONIC MAIL SECURITY: S/MIME. IPSECURITY: IP Security Overview,
IP Security Architecture, Encapsulating Security Payload, Key Management.
FIREWALLS: Firewall Design Principles, Trusted Systems. (Chapters
1,2,4,5,6,7,8,10,12,13 and 16)

TEXTBOOK:
1.CRYPTOGRAPHY AND NETWORK SECURITY principles and Practice
FOURTH Edition By William Stallings (Pearson Asia)

REFERENCEBOOKS:

1. DAVIES&PRICE:SECURITYFORCOMPUTERNETWORKS -Wiley(1984)
2. MAYER &MATYAS: CRYPTOGRAPHY- Wiley B. SCHNEIER:
APPLIED CRYPTOGRAPHY -(John Wiley)
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS215 DATA WAREHOUSE DWDM
AND DATA MINING
WORKLOAD:4 INTERNALMARKS:30 EXTERNAL
PPW MARKS:70

UNIT-I
Data Mining-Data Mining Overview, Kinds of Data can be mined, Kinds of patterns
can be mined, Data Mining Functionalities, Technologies used, Data Mining
Applications, Major issues in Data Mining,
Data objects and attribute types, Basic statistical descriptions of data,
Measuring Data Similarity and Dissimilarity. (Chapters 1, 2.1 to 2.2.2, 2.4)

UNIT-II
Data Pre-Processing: Data Cleaning, Data Integration –Data reduction: Overview,
Attribute subset selection, clustering, sampling, Data cube Aggregation, Histograms.
Data Transformation and Data Discretization and concept Hierarchy Generation.
Data Warehouse: Basic Concepts, Data Warehouse modeling, Data Warehouse
Design.
Data Warehouse implementation- Data cube implementation overview and OLAP
server architecture, Attribute oriented induction.
(Chapters 3.1to3.5,4.1,4.2,4.3,4.3.1,4.3.2,4.3.3,4.4,4.4.1,4.4.4,4.5)

UNIT-III
Basic Concepts of frequent patterns- Frequent Item sets, Mining methods, A priori
and FP- Growth, Association rules.
Classification and Prediction: Classification by Decision Tree Induction- Information
gain, Gini Index, Tree Pruning. Classification methods: Bayesian Classification, Rule-
Based Classification. Model evolution and Selection : Metrics for evaluating
(Chapters 6.1,6.2,8.1,8.2, 8.3, 8.4, 8.5)

UNIT-IV
Cluster analysis: Overview of Clustering Analysis Methods, Partitioning Methods-
K-Means, K-Medoids. Hierarchical methods- BRICH. Density-based methods –
DB-SCAN, DENCLUE. Grid Based methods - STING. Evolution of Cluster
Analysis Overview. Outliers, Outlier Analysis.
(Chapters10.1,10.2,10.3,10.3.1,10.3.2,10.3.3,10.4.1,10.4.3,10.5.1,10.6,12.1)

TEXTOOK:

1. DATA MINING CONCEPTS & TECHINIQUES BY JIAEEIHAN,MICHELINE

& KAMBER (3ndEDITION) Harcourt India(Elsevier Publishing Company)

REFERENCEBOOKS:
1. Data Mining Introductory and advanced topics-MARGARET H DUNHAM,
PEARSON EDUCATION
2. Data Mining Techniques - ARUN K PUJARI, University Press.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS216 MOBILE APPLICATION DEVELOPMENT MAD
WORKLOAD: REVIEWASSESSMENT EXTERNAL
4 PPW MARKS: 50

• The concepts covered in the corresponding theory paper are to be implemented.

MSCCS217 DATAMINING LAB DML

WORKLOAD: REVIEWASSESSMENT EXTERNAL
4 PPW MARKS:50

Weka is a collection of machine learning algorithms for data mining tasks. The
algorithms can either be applied directly to datasets #. Weka contains tools for
data pre-processing, classification, regression, clustering, association rules, and
visualization.

Launching WEKA, COMMAND-LINE(simple CLI), EXPLORER-User Interface,

Preprocessing, Classification, Clustering, Associating, Selecting Attributes,
Visualizing; EXPERIMENTER- Simple, Advanced; KNOWLEDGEFLOW-
Introduction, Features, Components; Arff Viewer; Converters; etc.,

RESOURCES:
Manuals and Software:
 http://www.cs.waikato.ac.nz/ml/weka/
index.htmlCollections of Datasets:
 # http://www.cs.waikato.ac.nz/ml/weka/datasets.html
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS218 SOFTWARE ENGINEERING LAB STL
WORKLOAD:4 REVIEWASSESSMENT EXTERNAL
PPW MARKS:50

SOFTWARE TESTING – Introduction, purpose of testing, Dichotomies, model for

testing, consequences of bugs, taxonomy of bugs. Basics concepts of path testing,
predicates, path predicates and achievable paths, path sensitizing, path
instrumentation, application of path testing.
UML: Importance of modeling, principles of modeling, object oriented modeling,
conceptual model of the UML, Architecture and Software Development Life Cycle.
Basic Structural Modeling: Classes, Relationships, Class& Object Diagrams.
Interactions, Interaction diagrams, Use cases, Use case Diagrams, Activity Diagrams,
Component, Deployment, Component diagrams and Deployment diagrams; Caste Study
on Unified Library Application(ULA).

# To learn and use the testing tools to carry out the functional testing, load/stress
testing and use the following (or similar) automated testing tools to automate
testing:

a) Win Runner/QTP for functional testing.

b) Load Runner for Load/Stress testing.
c) Test Director for test management.
List of Sample Programs/Experiments

1. The student should take up the case study of Unified Library Application (ULA)
which is mentioned in the theory, and Model it in different views i.e Use case view,
logical view, component view, Deployment view, Database design, forward and
Reverse Engineering, and Generation of documentation of the project.

2. Student has to take up another case study of his/her own interest and do the same
whatever mentioned in first problem. Some of the ideas regarding case studies are given in
reference books which were mentioned and it would be referred for some new idea.

REFERENCEBOOKS:
1. Software Testing Tools–Dr.K.V.K.K.Prasad, Dreamtech
2. Software Testing Concepts and Tools, P.Nageswara Rao, Dreamtech Press.
3. Grady Booch, James Rumbaing, Ivan Jacobson : The Unified Modeling
Language User Guide, Pearson Education 2nd Edition
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS219 SEMINAR S
WORKLOAD:02 INTERNALMARKS:25 EXTERNAL
MARKS:00

 This course is meant to give students practice speaking in front of an audience

and to explore topics of their own choosing in detail.
 Students will research topics and organize presentations for faculty and other
students. The topics may be any aspect of the Computer science and must be
approved by the instructor in advance.
 To help students improve as speakers, each student will receive feedback from the
fellow students and the instructor.

Expectations:
 Attendance at each seminar is mandatory for all students enrolled.
 In addition, students are expected to attend all other seminars in the
department, such as invited guest speakers. It is expected that students will
actively participate by asking questions of the speaker.
 The effort by students to meet these expectations will be considered in the
determination of your final grade.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
M.SC. II YEAR II SEMESTER:

Paper Workload Marks

Paper No Per Week
Title/Subject L+T+P Internal External Tota CREDITS
l
MSCCS221 PROGRAMMING 4+0+0 30 70 100 4
WITH R
PROGRAMMING
MSCCS222 WITH R 0+0+4 00 50 50 2
LAB
MSCCS223 MAJOR PROJECT 0+0+10 75 175 250 10
MSCCS224 COMPREHENSIVE 0+0+0 00 50 50 2
VIVA
MSCCS225 SEMINAR 02 25 00 25 1
475 19
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS221 PROGRAMMIG WITH R DAR
WORKLOAD:4 INTERNAL MARKS:30 EXTERNAL
PPW MARKS:70

Unit I
Introduction- What Is R?, Installing R, Choosing an IDE, Your First Program, Installing
Extra Related Software, Scientific Calculator- Mathematical Operations and Vectors,
Assigning Variables, Special Numbers, Logical Vectors; Inspecting Variables- Classes,
Different Types of Numbers, Other Common Classes, Checking and Changing Classes,
Examining Variables, Workspace

Unit II
Vectors, Matrices, and Arrays; Lists and Data Frames-Lists, NULL, Pair lists, Data Frames;
Environments and Functions

Unit III
Strings and Factors, Flow Control and Loops, Advanced Looping; Packages- Loading
Packages, Installing Packages, Maintaining Packages; Dates and Times-Date and Time
Classes, Conversion to and from Strings, Time Zones, Arithmetic with Dates and Times,
Lubricate.

Unit IV
Getting Data-Built-in Datasets, Reading Text Files, Reading Binary Files, Web Data,
Accessing Databases; Cleaning and Transforming- Cleaning Strings, Manipulating
Data Frames, Sorting, Functional Programming; Exploring and Visualizing-Summary
Statistics, Three Plotting Systems, Scatter plots, Line Plots, Histograms, Box Plots,
Bar Charts, Other Plotting Packages and Systems

TEXTBOOK:
1. Richard cotton “A step-by-step function guide to data analysis: Learning R” First
edition, O‟REILLY, 2013.
REFERENCES
1. Michael J. Crawley “The R Book” Second Edition A John Wiley &
Sons, Ltd., Publication, 2013.
2. Garrett Grolemund “Hands-On Programming with R” First Edition, O‟Reilly
Media,2014
3. Roger D. Peng “R Programming for Data Science” Lean pub, 2014-15.

MSCCS222 PROGRAMMING WITH R LAB DARL

WORKLOAD:04 INTERNALMARKS:00 EXTERNAL
MARKS:50

• The concepts covered in the corresponding theory paper are to be implemented.

 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
MSCCS223 MAJOR PROJECT MP
WORKLOAD: INTERNALMARKS:75 EXTERNAL
10 MARKS:175

The Project work constitutes a major component in most professional programmers. It

needs to be carried out with due care, and should be executed with seriousness by the
students. The project work is not only a partial fulfillment of the MSC requirements,
but also provide a mechanism to demonstrate ASK (Attitude, Skills, and Knowledge)
with specialization. The project work should compulsorily include the software
development.Physicalinstallations/configuringofLAN/WANortheoreticalprojectsor
study of the systems, which doesn’t involve s/w development, ARE STRICTLY NOT
ALLOWED.

The students are expected to work on a real-life project preferably in some industry/
R&D Laboratories / Educational Institution / Software Company. Students are
encouraged to work in their interested area. The student can formulate a project
problem with the help of his / her Guide of the concerned college. APPROVAL OF
THE PROJECT PROPOSAL IS MANDATORY by his/her Guide. If approved, the
student can commence working on it, and complete it. Use the latest versions of the
software packages for the development of the project. Project problem domain selected
and the specifications should be genuine.

MSCCS224 COMPREHENSIVE VIVA CV

WORKLOAD:00 INTERNALMARKS:00 EXTERNAL
MARKS:50

 Objective
Viva voce will be conducted towards the end of the semester which will be
covering the complete syllabus. This will test the student’s learning and
understanding during the course of their post graduate programme. In doing so, the
main objective of this course is to prepare the students to face interview both at the
academic and the industrial sector.

 Examination
Every student will be required to undergo comprehensive Viva-voce at the end of
fourth semester of M.Sc.CS. A panel of external and internal examiners conducts
the comprehensive viva-voice examination. The examiners award the marks out of
a maximum of 50 marks.

 Contents
The viva-voce shall normally cover the subjects taught in all the semester of M.Sc.
Computer Science program.
MSCCS225 SEMINARS S
WORKLOAD:02 INTERNALMARKS:25 EXTERNAL
MARKS:00

 This course is meant to give students practice; speaking in front of an audience

and to explore topics of their own choosing in detail.
 With effect from the academic year 2024-2025
GIRRAJ GOVERNMENT COLLEGE (A), NIZAMABAD
DEPARTMENT OF COMPUTER SCIENCE
M.Sc. Computer Science
 Students will research topics and organize presentations for faculty and other
students. The topics may be any aspect of the Computer science and must be
approved by the instructor in advance.
 To help students improve as speakers, each student will receive feedback from
the fellow students and the instructor.

Expectations:
 Attendance at each seminar is mandatory for all students enrolled.
 In addition, students are expected to attend all other seminars in the department,
such as invited guest speakers. It is expected that students will actively
participate by asking questions of the speaker.

The effort by students to meet these expectations will be considered in the determination of
your final grade.