-
1
SATAVAHANA UNIVERSITY - KARIMNAGAR
DEPARTMENT OF COMPUTER SCIENCE
COURSE STRUCTURE OF M.Sc ( Computer Science ) W.E.F 2013 14
SU - M.Sc (CS) I SEMESTER
Paper Code
Title Workload Per Week Marks
Theory Practical Internal University Total
MSCCS 111 Discrete Mathematics 4 -- 20 80 100
MSCCS 112 Computer Organization 4 -- 20 80 100
MSCCS 113 OOPS with JAVA 4 -- 20 80 100
MSCCS 114 Operating Systems 4 -- 20 80 100
MSCCS 115 Web Technologies 4 -- 20 80 100
MSCCS 116 OOPS LAB -- 4 -- 50 50
MSCCS 117 Operating Systems LAB -- 4 -- 50 50
MSCCS 118 Web Technologies LAB -- 4 -- 50 50
SU M.Sc (CS) II SEMESTER
Paper Code
Title Workload Per Week Marks
Theory Practical Internal University Total
MSCCS 121 Data Communications and Networks
4 -- 20 80 100
MSCCS 122 Automata Theory and
Finite Languages 4 -- 20 80 100
MSCCS 123 Software
Engineering 4 -- 20 80 100
MSCCS 124 Microprocessors & Micro
Controllers 4 -- 20 80 100
MSCCS 125 Advanced Java 4 -- 20 80 100
MSCCS 126 Microprocessors LAB -- 4 -- 50 50
MSCCS 127 Advance Java LAB -- 4 -- 50 50
MSCCS 128 Software Engineering LAB -- 4 -- 50 50
-
2
SU M.Sc (CS) III SEMESTER
Paper Code
Title Workload Per Week Marks
Theory Practical Internal University Total
MSCCS 211 Principles of Compiler Design 4 -- 20 80 100
MSCCS 212 Unix Network Programming 4 -- 20 80 100
MSCCS 213 .NET Technology 4 -- 20 80 100
MSCCS 214 Cryptography and
Network Security 4 -- 20 80 100
MSCCS 215 Data Warehousing and
Mining 4 -- 20 80 100
MSCCS 216 UNP LAB -- 4 -- 50 50
MSCCS 217 .NET Technology LAB -- 4 -- 50 50
MSCCS 218 Data Mining LAB -- 4 -- 50 50
SU M.Sc (CS) IV SEMESTER
Paper Code
Title Workload Per Week Marks
Theory Practical Internal University Total
MSCCS 221 Design and Analysis of Algorithms
4 -- 20 80 100
MSCCS 222 Object Oriented Analysis & Design
4 -- 20 80 100
MSCCS 223 Mobile computing 4 -- 20 80 100
MSCCS 224 UML LAB -- 4 -- 50 100
MSCCS 225 PROJECT -- 8 50
(Seminar) 150 200
-
3
MSCCS 111 DISCRETE MATHEMATICS WORK LOAD: 4 PPW UNIVERSITY
MARKS: 80
INTERNAL MARKS: 20 U N I T - I FUNDAMENTALS: Sets, Relations and
functions, Fundamentals of logic, Logical inferences, First order
logic, Quantified propositions, Mathematical induction ELEMENTARY
COMBINATORICS: Combinations and Permutations, Enumeration - with
repetitions, with constrained repetitions, The Principle of
Inclusion - Exclusion. (Chapter 1-2) U N I T - II RECURRENCE
RELATIONS: Generating functions, Coefficients of Generating
functions, Recurrence Relations, Inhomogeneous Recurrence Relations
(Chapter-3) U N I T - III RELATIONS AND DIAGRAMS: Relations and
diagrams, Binary relations, Equivalence relations, Ordering
relations, Lattices, Paths and Closures, Directed graphs, Adjacency
matrices - Applications, Sorting and Searching (Chapter - 4) U N I
T - IV GRAPHS: Graphs, Isomorphism, Trees, Spanning trees, Binary
trees, Planar graphs, Eler Circuits, Hamiltonian graphs, Chromatic
numbers, Four-colour problem, Network flows (Chapter 5) TEXT-BOOK:
1. DISCRETE MATHEMATICS FOR COMPUTER SCIENTISTS, BY - J L MOTT,
A
KANDEL AND T P BAKER REFERENCE BOOKS: 1. DISCRETE MATHEMATICAL
STRUCTURE - (TMH) BY - TREMBLEY AND MANOHAR 2. DISCRETE MATHEMATICS
WITH ALGORITHMS - (JOHN WILEY) BY - M.O.
ALBERTSON AND J.P.HUTCHINSON 3. ELEMENTS OF DISCRETE
MATHEMATICS-(TMH, SECOND EDITION) BY - C.L.LIU 4. DISCRETE
MATHEMATICS - (PHI, THIRD EDITION) BY - BURNORD KOLMAN 5. DISCRETE
MATHEMATICS BY KH ROSSEN (TMH) 6. DISCRETE MATHEMATICS BY S
LIPSCHUTZ AND M. LIPSON SCHAUMS SERIES
(TMH) 7. DISCRETE MATHEMATICS FOR COMPUTER SCIENCE BY GARRRY
HAGGARD, J.
SCHILPF & S WHITE SIDES (THOMSON PRESS) 8. DISCRETE &
COMBINATORIAL MATHEMATICS BY RALPH P GRIMALDI (PEARSON
EDUCATION) 9. DISCRETE MATHEMATICAL STRUCTURES BY DS MALLIK
& M K SEN (THOMSON
PRESS)
MSCCS 112 COMPUTER ORGANIZATION WORK LOAD: 4 PPW UNIVERSITY
MARKS: 80
INTERNAL MARKS: 20 U N I T - I 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,
Programmable Logic Devices (PHDs), Field-Programmable Gate Arrays,
Sequential Circuits.
-
4
BASIC STRUCTURE OF COMPUTER HARDWARE AND SOFTWARE: Functional
units, Basic operational concepts, Bus structures, Software,
Performance, Distributed Computing. ADDRESSING METHODS: Basic
Concepts, Memory Locations, Main Memory Operations, Addressing
Modes, Assembly Language, Basic I/O operations, Stacks and Queues,
Subroutines. (Chapter 1, 2.1 to 2.8, A.1 to A.13) U N I T - II
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 Multiplication, Fast Multiplication, Integer
Division, Floating-Point Numbers and Operations. (Chapter 3, 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) UNIT - 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.
(Chapter 5, 9.1, 9.2) TEXT BOOK: 1. COMPUTER ORGANIZATION, TMH (IV
EDITION) BY - V.C. HAMACHER REFERENCE BOOK: 1. COMPUTER
ORGANIZATION, (PHI) BY - MORIS MANO 2. COMPUTER ARCHITECTURE &
ORGANISATION 3. BY - HAYES, (TMH) 4. 3. COMPUTER SYSTEMS
ORGANISATION & ARCHITECTURE BY - CARPINELLI,
(ADDISON WESLEY) 5. THE ARCHITECTURE OF COMPUTER HANDWONE AND
SYTEMS HANDWONE BY -
I ENGLANDER (WILEY) 6. COMPUTER SYTEMS DESIGN AND ARCHITECTURE
BY - VP HEURING, HF
JORDAN (PEARSON) 7. COMPUTER ORGANIZATION & ARCHITECTURES BY
- STALLINGS (PEARSON,
PHI) 8. COMPUTER ORGANIZATION & DESIGN BY PP CHAUDARI
(PHI)
MSCCS 113 OOPS WITH JAVA WORK LOAD: 4 PPW UNIVERSITY MARKS:
80
INTERNAL MARKS: 20 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
-
5
Understanding Paradigms: Program Structure Types Access
Modifiers Lifetime Modifiers. (Chapters 1 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
TIMOTHY
BUDD (PEARSON) REFERENCE BOOKS: 1. THE COMPLETE REFERENCE JAVA 2
(Fourth Edition) BY - PATRICK NAUGHTON &
HERBET SCHILDT (TMH) 2. PROGRAMMING JAVA - DECKER&HIRSH
FIELD VIKAS PUBLISKING (2001)
(THOMSON LEARNING ) (SECOND EDITON) 3. INTRODUCTION TO JAVA
PROGRAMMING - Y.DANIEL LIANG PHI(2002) 4. OBJECT ORIENTED
PROGRAMMING THROUGH JAVA 2 BY - THAMUS WU
(Mc.Graw Hill) 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 (JOHN WILEY) 8. STARTING OUT WITH JAVA JONY GADDIS (DREAM
TECH PRESS) 9. JAVA PROGRAMMING SCHAUMS SERIES 10. OBJECT ORIENTED
APPLICATION DEVELOPMENT USING JAVA ER DOXE ETC.
(THOMSON PRESS) 11. THINKING IN JAVA BY BRUCE ECKEL (PEARSON)
12. PROGRAMMING & PROBLEM SOLVING WITH JAVA JM SLACK
(THOMSON)
-
6
13. COMPUTING CONCEPTS WITH JAVA2 ESSENTIALS - CAY HORSTMANN
(JOHNWILEY)
MSCCS 114 OPERATING SYSTEMS WORK LOAD: 4 PPW UNIVERSITY MARKS:
80
INTERNAL MARKS: 20 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 1 to 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. Unprocessor 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
MODERM 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)
-
7
MSCCS 115 WEB TECHNOLOGIES WORK LOAD: 4 PPW UNIVERSITY MARKS:
80
INTERNAL MARKS: 20 UNIT I HTML- Basic HML, The document body,
Text, Hyperlinks, Adding More Formatting, Lists, Using Color and
Images, Images, Tables, Frames, Forms-Toward Interactivity
Cascading Style sheets Introduction, Inline Styles, Embedded Style
Sheets, Linking external sheets, Backgrounds, text flow and box
model. (Text Book 1 chapters 4, 5 and 6) UNIT II JavaScript-
Introduction, simple programming, Obtaining User Input with prompt
Dialogs, Operators(arithmetic, Decision making, assignment,
logical, increment and decrement) Control Structures - if else
selection statement, while, do while repetitions statement, for
statement, switch statement, break and continue statements.
Functions program modules in JavaScript, programmer defined
functions, function definition, Random-number generator, scope
rules, global functions, recursion, JavaScript: Arrays. (Text Book
1 chapters 7, 8, 9 and 10) UNIT III JavaScript: Objects Math
Object, String Object, Date Object, Boolean & Number Object,
document and window Objects. Event Model onclick, onload, onerror,
onmouseover, onmouseout, onfocus, onblur, onsubmit, onreset, more
DHTML events. Filter and Transitions flipv, fliph, chroma, masks,
invert, gray, xray, shadow to text, alpha, glow, wave, dropshadow,
light, blendTrans, revealTrans. (Text Book 1 chapters 11, 12, 14
and 15) UNIT IV PHP Introduction to PHP, including PHP in a page,
Data Types, program control, Arrays, User-defined functions,
Built-in Functions, regular expression, using files. Building Web
Applications with PHP- tracking users, using databases, handling
xml. Introduction, XML Basics, Structuring Data, XML Namespaces ,
Document Type Definitions (DTDs), W3C XML Schema Documents, XML
Vocabularies, MathML, Other Markup Languages, Extensible Stylesheet
Language and XSL Transformations, Document Object Model (DOM). (PHP
from Text Book 2 chapters 7, XML from Text Book 1 chapter No. 20)
Books: 1. Internet & World Wide Web- H. M. Deitel, P.J. Deitel,
A. B. Goldberg-Third Edition 2. Web Programming Chris Bates Third
edition.
MSCCS 116 OOPS LAB WORK LOAD: 4 PPW UNIVERSITY 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.
-
8
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. a. 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 of file. 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 each line. 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)
MSC117 OPERATING SYSTEMS LAB WORK LOAD: 4 PPW UNIVERSITY 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 8. Simulate Paging
Techniques of memory management.
MSCCS118 WEB TECHNOLOGIES LAB WORK LOAD: 4 PPW UNIVERSITY MARKS:
50 1. Create a simple HTML page which demonstrates 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.
-
9
5. Create a leave letter using different text formatting tags.
6. Create a table format given bellow using rowspan and
colspan.
RNO NAME MARKS
M1 M2 M3 M4 M5 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.
FRAME1 FRAME2
FRAME3 9. Divide a web page as shown bellow.
F1 Course: PG UG
F2
10. Create a student Bio-Data, using forms. 11. Create a web
page using following style sheets
i. Inline style sheets. ii. Embedded style sheets. iii. External
style sheets
12. Create a web page using class style sheets with different
border-width property values like thick, medium, thin, grove,
inset, outset, red & blue. 13. Accept marks from bellow form,
calculate total and average, results must be shown in alert box.
14. Write a JavaScript program to accept two values from form and
apply any 5 mathematical functions. 15. Display the current date
and time in both GMT and local form. 16. Write a javascript program
onmouseover, onmouseout & onblur events. 17. Write a XML
program using document type definitions 18. Write student database
with XML. PHP 1. Write a PHP program to Display Hello 2. Write a
PHP Program to display the todays date. 3. Write a PHP Program to
read the employee details. 4. Write a PHP Program to display the 5.
Write a PHP program to prepare the student marks list. 6. Write a
PHP program to generate the multiplication of two matrices. 7.
Write a PHP Application to perform demonstrates the college
website. 8. Write a PHP application to add new Rows in a Table. 9.
Write a PHP application to modify the Rows in a Table. 10. Write a
PHP application to delete the Rows from a Table. 11. Write a PHP
application to fetch the Rows in a Table. 12. Develop a PHP
application to make following Operations
i. Registration of Users. ii. Insert the details of the Users.
iii. Modify the Details.
-
10
iv. Transaction Maintenance. A) No of times Logged in B) Time
Spent on each login. C) Restrict the user for three trials only. D)
Delete the user if he spent more than 100 Hrs of transaction.
(All exercises from the text book must be practiced in addition
to the above problems)
-
11
MSCCS121 DATA COMMUNICATION AND NETWORKS
WORK LOAD: 4 PPW UNIVERSITY MARKS: 80 INTERNAL MARKS: 20
UNIT I BASIC CONCEPTS: Line Configuration Point-to-Point,
Multipoint Topology Mesh, Star, Tree, Bus, Ring, Hybrid topologies
Transmission Mode simplex, Half-Duplex, Full-Duplex Categories of
Networks LAN, MAN, WAN InterNetworks. THE OSI LAYER: The Model
Layered structure Functions of the Layers Physical layer, Data Link
layer, Network Layer, Transport Layer, Session Layer, Presentation
Layer, Application Layer TCP/IP Protocol suite TRANSMISSION OF
DIGITAL DATA: INTERFACES AND MODEMS: Digital Data Transmission
Parallel Transmission, Serial Transmission DTE-DCE Interface Data
Terminal Equipment (DCE),Data Circuit-Terminating Equipment(DCE),
Standards, EIA-232 Interface Other interface Standards EIA-449,
EIA-530, X.21 MODEMS Transmission Rate Modem standards 56KMODEMs
Traditional Modems, 56K Modems Cable Modems MULTIPLEXING: Many to
One Downloading, Uploading/ One to Many Frequency-Division
Multiplexing(FDM) wave Division Multiplexing(WDM) Time Division
Multiplexing(TDM) Inverse Multiplexing Multiplexing Application
Common Carrier Services, Analog Services, Digital Services Digital
Subscriber Line(DSL) ADSL, RADSL, HDSL, SDSL, VDSL FTTC FTTC in the
Telephone Network, FTTC in the cable TV Network. (Chapter 2, 3, 6
& 8) UNIT-II ERROR DETECTION AND CORRECTION: Types of Errors
Single-Bit Error, Burst Error Detection Redundancy Vertical
Redundancy check(VRC) Longitudinal Redundancy Check(LRC) Cyclic
Redundancy Check(CRC) Checksum Error Correction Single-Bit Error
Correction, Hamming Code, Burst Error Correction. DATA LINK
CONTROL: Line Discipline ENQ/ACK, Poll/Select Flow Control
Stop-and-wait, Sliding Window Error Control - Automatic Repeat
Request (ARQ), Stop-and-wait ARQ, Sliding window ARQ. LOCAL AREA
NETWORK: Project 802 IEEE 802.1, LLC 371, MAC 371, Protocol Data
Unit (PDU) Ethernet Access Method: CSMA/CD, Addressing, Electrical
Specification, Frame Format, Implementation - Other Ethernet
Networks Switched Ethernet, fast Ethernet, Gigabit Ethernet Token
Bus Token Ring - Access Method: Token Passing, Addressing,
Electrical Specification, Frame Format, Implementation FDDI -
Access Method: Token Passing, Addressing, Electrical Specification,
Frame Format, Implementation: Physical Medium Dependent(PMD) Layer.
SWITCHING: Circuit Switching Space-Division Switches, Time-Division
Switches, TDM Bus, Space and time-division Switching Combinations,
Public Switch Telephone Network(PSTN) Packet Switching Datagram
Approach, Virtual Circuit Approach, Circuit-Switched Connection
versus Virtual Circuit Connection Message Switching. (Chapter 9,
10, 12 and 14) UNIT III INTEGRATED SERVICES DIGITAL NETWORK (ISDN):
Services Bearer Services, Tele services, Supplementary Services
History Voice Communication over Analog Networks, Voice and data
Communication over Analog Networks, Analog and Digital Services to
Subscribers, Integrated Digital Network(IDN), Integrated Services
Digital Network(ISDN) subscriber Access to the ISDN B Channels, D
Channels, H Channels, User Interfaces, Functional Grouping,
Reference Points The ISDN Layers Physical Layer, Data Link Layer,
Network Layer Broadband ISDN services, Physical specifications
Future of ISDN.
-
12
X.25: X.25 Layers Physical Layer, Frame Layer, Packet Layer, PLP
Packets Other Protocols related to X.25 X.121 Protocol, triple-X
Protocols. NETWORKING AND INTERNETWORKING DEVICES: Repeaters Not an
Amplifier Bridges Types of Bridges, Bridges Connecting Different
LANs Routers Routing concepts Gateways Other Devices Multiprotocol
Routers, Brouters, switches, Routing Switches Routing algorithms
Distance Vector Routing - Sharing Information, Routing Table Link
State Routing Information Sharing, The Dijkstra Algorithm. (Chapter
16, 17 and 21)Other Devices Multiprotocol Routers, Brouters,
switches, Routing Switches Routing algorithms Distance Vector
Routing - Sharing Information, Routing Table Link State Routing
Information Sharing, The Dijkstra Algorithm. (Chapter 16, 17 and
21) UNIT IV TRANSPORT LAYER: Duties of Transport Layer End-to-End
Delivery, Addressing, Reliable Delivery, Flow control, Multiplexing
Connection Connection Establishment, connection Termination The OSI
Transport Protocol Transport Classes, Transport Protocol Data
Unit(TPDU), Connection-oriented and Connectionless services. UPPER
OSI LAYERS: Session layer Session transport Interaction,
Synchronization points, Session Protocol Data Unit - Presentation
Layer Translation, Encryption/decryption, Authentication, Data
Compression Application Layer Message Handling System(MHS), File
transfer, Access and Management(FTAM), Virtual Terminal(VT),
Directory Services(DS), Common Management Information
Protocol(CMIP). TCP/IP PROTOCOL SUITE: Overview of TCP/IP TCP/IP
and the Internet, TCP/Ip and OSI, Encapsulation Network Layer
Internetwork Protocol(IP) Addressing classes, Dotteddecimal
Notation, Nodes with More Than One Address, A Sample Internet
Subnetting Three Levels of Hierarchy, Masking, Finding The
Subnetwork Address Other Protocols In the Network Layer Address
Resolution Protocol(ARP), Reverse Address Resolution
Protocol(RARP),Internet Control Message Protocol(ICMP), Internet
Group Message Protocol(IGMP) Transport Layer User datagram
Protocol(UDP), Transmission Control Protocol(TCP). (Chapter 22, 23
and 24)
TEXT BOOK: 1. DATA COMMUNICATIONS AND NETWORKING BY BEHROUZ A.
FOROUZAN (TATA Mc.Graw Hill) REFERENCE BOOK: 1. BUSINESS DATA
COMMUNICATION & NETWORKS By - FITZ GERALD (Jhon Wiley) 2. DATA
& COMPUTER COMMUNICATIONS W STALLINGS (PEARSON, PHI) 3.
COMPUTER COMMUNICATIONS & NETWORKING TOPOLOGIES MA GALLO, 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)
MSCCS 122 AUTOMATA THEORY AND FORMAL LANGUAGES WORK LOAD: 4 PPW
UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 U N I T I FINITE AUTOMATA AND REGULAR
EXPRESSIONS : Preliminaries, Finite state systems,
Non-deterministic finite automata (NFA), Deterministic finite
automata (DFA), NFA TO DFA conversion Regular expressions,
interconversions, Two-way finite automata, finite automata with
output, State minimization applications.
-
13
PROPERTIES OF REGULAR SETS : Pumping Lemma, closure properties
of regular sets. (Chapters 1, 2, 3.1 and 3.2) U N I T - II CONTEXT
FREE GRAMMARS (CFG) : Context free grammars Derivation tree,
simplification of context - Free grammars, Normal forms. (Chapter
4.1 to 4.6) PUSHDOWN AUTOMATA: Informal description, Definitions,
pushdown automata design. (Chapter 4 and 5) U N I T - III
PROPERTIES OF CONTEXT FREE LANGUAGES (CFL): Pumping Lemma, closure
properties, decision algorithms for CFLs. TURING MACHINES (TM): The
turing machine & model, computable languages and functions,
design of TM, modification of TM, Church's hypothesis. (Chapter 6
and 7) U N I T - IV RECURSIVE & RECURSIVELY INNUMERABLE
LANGUAGES: UNDECIDABILITY: Properties of recursive and recursively
innumerable languages, Universal turing machine, post
correspondence problem. Decidable and Undecidable problems;
examples, universal turing machine, Rice's theorem, undecidability
of CFLs & they being regular. THE CHOMSKY HIERARCHY: Regular
grammars, Unrestricted grammars, interconversions between regular
grammars and finite automata, context - sensitive languages,
telementary treatment of languages. (Chapter 8.1 to 8.8 and chapter
9) TEXT BOOK: 1. INTRODUCTION TO AUTOMATA THEORY LANGUAGES AND
COMPUTATION By -
J.E. HOPCROFT, J.D. ULLMAN (Narosa) 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) 5. THE THEORY OF
COMPUTATION BERNARD M MORET (PEARSON) 6. INTRODUCTION TO THEORY OF
COMPUTATION M SIPSER (THOMSON) 7. INTRODUCTION TO THEORY OF
COMPUTER SCIENCE EV KRISHNA MURTHY
(EWP) 8. AN INTRODUCTION TO FORMAL LANGUAGES & AUTOMATA
PETER LINZ
(NAROSA) 9. AUTOMATA & COMPULABILITY DC KOZEN (SPINGER) 10.
THOERY OF COMPUATATION SK AZAD (DHANPAT RAI & CO)
MSCCS 123 SOFTWARE ENGINEERING WORK LOAD: 4 PPW UNIVERSITY
MARKS: 80
INTERNAL MARKS: 20 U N I T I INTRODUCTION TO SOFTWARE
ENGINEERING: The Evolving Role of Software Software The Changing
Nature of Software Software myths. A GENERIC VIEW OF PROCESS:
Software Engineering-A Layered technology A Process frame work The
capability Maturity Model Integration (CMMI) Process Patterns
-
14
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. (Chapters 1,
2 and 3) UNIT- II SOFTWARE ENGINEERING PRACTICE: Software
engineering Practice Communication Practice Planning Practices
Modeling Practices Construction Practice deployment SYSTEM
ENGINEERING: Compute-Based systems The System Engineering Hierarchy
Business Process Engineering: An Overview Product Engineering: An
Overview System Modeling REQUIRMENT ENGINEERING: A Bridge to Design
and Construction Requirements Engineering Tasks Initiating the
Requirements Engineering Process Eliciting Requirements Developing
Use 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 AND 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 and 26) TEXT
BOOK: 1. SOFTWARE ENGINEERING BY R.S. PRESSMAN (Mc. Graw Hill Sixth
Edition) REFERENCE BOOKS: 1. SOFTWARE ENGINEERING BY GHEZZI (PHI)
2. SOFTWARE ENGINEERING FUNDAMENTALS BY BEHFOROOZ AND HUDSON
OXFORD UNIVERSITY PRESS SOFTWARE ENGINEERING BY FAIRLEY (Mc.Graw
Hill)
-
15
MSCCS 124 MICROPROCESSORS & MICRO CONTROLLERS WORK LOAD: 4
PPW UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 UNIT - I
Digital Systems Number Systems, Logic Gates, Boolean Algebra,
Flip Flops, Registers,
Encoders, De coders, Multiplexers, Demultiplexers, Counters, D/A
and A/D Converters, DC
Power Supplies, SMPS, UPS (Block diagram, with technical
information). (Text-1:Ch-2; Ref-
3:Ch-13)
UNIT - II
Micro processors 8085 Evolution of Microprocessors and Digital
Computers, memory
(Storage Type and De vices), Buses, Bus Architecture. Intel
8085, Instruction Cycle, Timing
Diagrams, Addressing Modes and Instructions with simple
examples. (Text 1: Ch - 1, 3, 4)
UNIT - III
Microprocessors 8086 Intel 8086, Block Diagram and Operations,
Registers, Interrupts,
Bus Cycle, Assembler Directives and Operators, Addressing Modes
and Instructions with
simple examples. Interfacing peripheral devices PPI 8257, PIC
8259, 8253 Counter /
Timer. (Text 1:Chs-7, 11; Text 2,3; Ref-4)
UNIT - IV
Micro Controllers 8051 Detailed Architecture of Single chip
Micro controller 8051,
Register s, Flags and PSW, Internal Memory, Special Function
Registers, I/O Lines,
Interrupts, Instructions with simple examples. Other 8 bit, 16
bit and 32 bit Micro controllers
(block diagram only). (Text 1:Ch 10; Text 3:Ch 16; Text
4:Ch3)
Special Devices CRT, Floppy, Hard Disk and Printer Contollers,
KBD 8279, Memory
Controllers, cache controllers, CRT Display Printers, scanners
(Brief Technical
Descriptions). (Tex t 1:Ch 7; Text 2,3; Ref4)
TEXT BOOKS:
1. Fundamentals of Microprocessors and Microcomputers by B. Ram,
Dhanapat Rai
Publications (P) Ltd, New Delhi.
2. Microprocessors Architecture, Pr ogramming and Applications
with the 8085, by Ramesh
S. Gaonkar, 4th Edition, Penram Inte rnational Publishing
(India).
3. Advanced Microprocessors and Peripherals, Architecture,
Programming and Interfacing
by A.K. Ray and K.M. Bhurchandi, TMH, India.
4. The 8051 Microcontrolle r Architecture, Programming &
Applications, 2nd Edition by
Kenneth J.Ayala, Penram International Publishing (India).
REFERENCE BOOKS AND DATA BOOKS:
1. Digital Systems, Princi ples and Applications, by Ronald J.
Toccl, Neal S. Widmer, 8th
Edition, Pearson Education Pvt, Ltd., India.
2. Digital Principles & Applications by Albert Paul Malvino
and Donald P. Leach TMH,
India.
3. Fundamentals of Digital Circuits by A. Anand Kumar PHI,
India.
4. ICS & Microprocessors Data Hand Book, BPB Publications,
India
-
16
5. The Intel Microprocessors 8085/86, 8088, 80186/286/386,
Pentium ProProcessor
Architecture, Programming and Interfacing by Barry B. Brey,
4thEdition, PHI, India.
6. Microprocessors and Interfacing, Programming and Hardware By
Douglas V. Hall, TMH,
India
7. Microprocessor Systems - The 8086/8088 Family, Arch, Prog,
and Design by Yu-cheng
Liu and Glenn A. Gibson, PHI, India
8. The 8051 Microcontroller and Embedded systems by Muhammed Ali
Mazidi, Janice
Gillispie Mazid, Pearson Education Pvt, Ltd, India.
9. Programming and Customizing The 8051 Micro controller by Myke
Predko, TMH, India
MSCCS 125 ADVANCED JAVA WORK LOAD: 4 PPW UNIVERSITY MARKS:
80
INTERNAL MARKS: 20 U N I T - I MULTITHREADING: Introduction,
Class Thread: An Overview of the Thread Methods, Thread States:
Life Cycle of a Thread, Thread Priorities and Thread Scheduling,
Thread Synchronization, Producer/Consumer Relationship without
Thread Synchronization, Producer/Consumer Relationship with Thread
Synchronization, Producer / Consumer Relationship: The Circular
Buffer, Daemon Threads, Runnable Interface, Thread Groups. JAVA
DATABASE CONNECTIVITY (JDBC): Introduction, Database Systems,
Relational Database Model, Relational Database Overview: The
Books.mdb Database, Structured Query Language, A First Example,
Reading, Inserting and Updating a Microsoft Access Database,
Transaction Processing. (Chapter 15 and 18) U N I T - II SERVLETS:
Introduction, Overview of Servlet Technology, Downloading the Java
Servlet Development Kit, Handling HTTP GET Requests, Handling HTTP
POST Requests, Session Tracking, Multitier Applications: Using JDBC
from a Servlet, Electronic Commerce, Servlet Internet and World
Wide Web Resources. REMOTE METHOD INVOCATION (RMI): Introduction,
Case Study: Creating a Distributed System with RMI, Defining the
Remote Interface, Implementing the Remote Interface, Define the
Client, Compile and Execute the Server and the Client. (Chapter 19
and 20) U N I T - III NETWORKING: Introduction, Manipulating URLs,
Reading a File on a Web Server, Establishing a Simple Server (Using
Stream Sockets), Establishing a Simple Client (Using Stream
Sockets), Client/Server Interaction with Stream Socket Connections,
Connectionless Client/Server Interaction with Datagrams,
Client/Server Tic-Tac-Toe Using a Multithreaded Server, Security
and the Network. (Chapter 21) U N I T - IV JAVABEANS: Introduction,
Bean Box Overview, Preparing a Class to Be a Java Bean, Creating a
Java Bean: Java Archive Files and the jar Utility, Adding Beans to
the Bean Box, Connecting Beans with Events in the Bean Box, Adding
Properties to a Java Bean, Creating a Java Bean with a Bound
Property, Specifying the Bean Info Class for a Java Bean, JavaBeans
World Wide Web Resources. (Chapter 25) TEXT BOOK:
-
17
1. JAVA How to Programming BY DEITEL & DEITEL (PEARSON
Education - Third Edition-2001)
REFERENCE BOOKS: 1. JAVA TUTORIAL CONTINUED CAMPIONE (Addison
Wesley) 2. THE COMPLETE REFERENCE JAVA 2 (Fourth Edition) BY -
PATRICK NAUGHTON &
HERBET SCHILDT (TMH) 3. PROGRAMMING JAVA - DECKER&HIRSH
FIELD VIKAS PUBLISKING (2001)
(THOMSON LEARNING ) (SECOND EDITON) 4. INTRODUCTION TO JAVA
PROGRAMMING - Y.DANIEL LIANG PHI(2002) 5. OBJECT ORIENTED
PROGRAMMING THROUGH JAVA 2 BY - THAMUS WU
(Mc.Graw Hill) 6. JAVA 2 - DIETEL & DIETEL (PEARSON
EDUCATION) 7. INTRODUCTION TO JAVA BALA GURU SWAMY 8. INTRODUCTION
TO PROGRAMMIND & OOD USING JAVA JAINO NINE & FA
HOSCH (JOHN WILEY) 9. STARTING OUT WITH JAVA JONY GADDIS (DREAM
TECH PRESS) 10. JAVA PROGRAMMING SCHAUMS SERIES 11. OBJECT ORIENTED
APPLICATION DEVELOPMENT USING JAVA ER DOXE ETC.
(THOMSON PRESS) 12. THINKING IN JAVA BY BRUCE ECKEL (PEARSON)
13. PROGRAMMING & PROBLEM SOLVING WITH JAVA JM SLACK (THOMSON)
14. COMPUTING CONCEPTS WITH JAVA2 ESSENTIALS - CAY HORSTMANN
(JOHNWILEY) 15. JAVA PROGRAMMING ADVANCED TOPICS J WIGGLESWORTH,
P LUMBY
(THOMSON LEARNING)
MSCCS 126 MICROPROCESSORS LAB WORK LOAD: 4 PPW UNIVERSITY MARKS:
50 I. Digital Systems:
1. Verification of The Logic Gates, Flip Flops
2. Encoder/ Decoder, Mux / Demux
3. Design of Counters
II. Microprocessors 8085, Interf acing and Assembly Language
programs:
1. Addition, Subtraction, Multiplication and Division
2. Find Ones and Twos complement of a number
3. Find Square and Square root of a number
4. Find Largest and Smallest Number in Data Array / from a
Series of Numbers
5. To Arrange a Data / a Series of Numbers in Ascending and
Descending Order
6. Write a Delay Subroutine Program using One, Two or More
Registers
7. Measurement of Physi cal Quantities Temperat ure, Speed of a
Motor (using a Tacho
generator).
8. Interfacing a Stepper Motor, with forward and Reverse
Steps
9. To Generate a Square Wave of Pulse
(Text 1: Chs- 6,9)
III. Micro processors 8086
1. Addition, Subtraction, Multiplication and Division of the
given Operands.
-
18
2. Find Largest and Smallest Number in Data Array / from a
Series of Numbers
3. To Arrange a Data Array / a Series of Numbers in Ascending
and Descending order
4. Display the Message on the Monitor, String Operations Page 9
of 34
5. Write a Program to generate a De lay of 100 ms, 100 sec, 1
minute and 10 minutes
6. To Generate Waveforms of Sawt ooth, Triangular, Pulse, Sine,
by Interfacing DCA
By using 8086 Kit, DEBUG of DOS utility, MASM or TASM (Text
3:Chs 3,4,9,5)
IV. Micro controllers 8051
1. Setting up UMPS and getting a program to assemble
2. Arithmetic Operations
3. Direct and Indirect Bank Register Addressing
4. RAM Direct addressing
5. Subroutines
6. State Machines
Experiments with Universal Microprocessor Program Simulator
(UMPS) (Ref 9:Ch 9)
MSCCS 127 ADVANCED JAVA LAB WORK LOAD: 4 PPW UNIVERSITY MARKS:
50
Programs are to be practiced on the basis of topics covered in
corresponding theory paper. MSCCS 128 Software Engineering Lab WORK
LOAD: 4 PPW UNIVERSITY MARKS: 50 By Using the Calculator 1. Perform
GUI Regression test using Rapid Test Script Wizard(RTSW). 2.
Perform Bit map Regression test using RTSW. 3. Perform User
Interface test using RTSW. 4. Perform Test template test using
RTSW. 5. Perform GUI checkpoint for single property. 6. Perform
checkpoint for single property. 7. Perform GUI checkpoint for
multiple objects. 8. Perform Bitmap checkpoint for object/window.
9. Perform Bitmap checkpoint for screen area. By Using the Sample
Visual Basic Application 10. Perform GUI Regression test using
Rapid Test Script Wizard for Visual Basic Application 11. Perform
Bit map Regression test using RTSW for Visual Basic Application.
12. Perform User Interface test using RTSW for Visual Basic
Application. 13. Perform Test template test using RTSW for Visual
Basic Application. 14. Perform GUI checkpoint for single property
for Visual Basic Application. 15. Perform checkpoint for single
property (use VB Application) 16. Perform GUI checkpoint for
multiple objects for Visual Basic Application. 17. Perform Bitmap
checkpoint for object/window for Visual Basic Application. 18.
Perform Bitmap checkpoint for screen area for VB Application.
-
19
Test Cases Preparation 19. Prepare a Test case to evaluate the
process of changing the password of a user (Use Visual Basic
Application). 20. Prepare a Test Case to evaluate the Calculator
Operations. (Develop an Visual Basic Application). REFERENCE: 1.
SOFTWARE TESTING TOOLS BY Dr.K.V.K.K.Prasad, Dream Tech 2. SOFTWARE
TESTING TOOLS BY Nageshwar Rao Pusuluri, Dream Tech
-
20
MSCCS211 PRINCIPLES OF COMPILER DESIGN WORK LOAD: 4 PPW
UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 UNIT - I Introduction to Compilers: Compilers
and translators, Why do we need translators?, The structure of a
compiler, Lexical analysis, Syntax analysis, Intermediate code
generation, Optimization, Code generation, Book keeping, Error
handling, Compiler writing tools, Getting started Programming
languages: High-level programming languages, Definitions of
programming languages, The lexical and syntactic structure of a
language, Data elements, Data structures, Operators, Assignment,
Statements, Program units, Data environments, Parameter
transmission, Storage management UNIT - II Finite automata and
lexical analysis: The role of the lexical analyzer, A simple
approach to the design of lexical analyzers, Regular expressions,
Finite automata, From regular expressions to finite automata,
Minimizing the number of states of a DFA, A language for specifying
lexical analyzers, Implementation of a lexical analyzer, The
scanner generator as Swiss army knife The syntactic specification
of Programming Languages: Context-free grammars, Derivations and
parse trees, Capabilities of context-free grammars. Basic Parsing
Techniques: Parsers, Shift-reduce parsing, Operator-precedence
parsing, Top-down parsing, Predictive parsers UNIT - III Automatic
Construction of Efficient Parsers: LR parsers, The canonical
collection of LR(0) items, Constructing SLR parsing tables,
Constructing canonical LR parsing tables, Constructing LALR parsing
tables, Using ambiguous grammars, An automatic parser generator,
Implementation of LR parsing tables, Constructing LALR sets of
items Syntax-Directed Translation: Syntax-directed translation
schemes, Implementation of syntax-directed translators,
Intermediate code, Postfix notation, Parse trees and syntax trees,
Three-address code, quadruples, and triples, Translation of
assignment statements, Boolean expressions, Statements that alter
the flow of control, Postfix translations, Translation with a
top-down parser UINIT - IV Introduction to code optimization: The
principle sources of optimization, Loop optimization, The DAG
representation of basic blocks, Value numbers and algebraic laws,
Global data-flow analysis Code generation: Object programs,
Problems in code generation, A machine model, A simple code
generator, Register allocation and assignment, Code generation from
DAGs, Peephole optimization. TEXT BOOK: 1. Principles of compiler
design -A.V. Aho . J.D.Ullman; Pearson Education. 2. Modern
Compiler Implementation in C- Andrew N. Appel, Cambridge University
Press. REFERENCES : 1. lex &yacc John R. Levine, Tony Mason,
Doug Brown, Oreilly 2. Modern Compiler Design- Dick Grune, Henry E.
Bal, Cariel T. H. Jacobs, Wiley dreamtech. 3. Engineering a
Compiler-Cooper & Linda, Elsevier. 4. Compiler Construction,
Louden, Thomson.
-
21
MSCCS 212 UNIX NETWORK PROGRAMMING WORK LOAD: 4 PPW UNIVERSITY
MARKS: 80
INTERNAL MARKS: 20 U N I T - I Interprocess 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) U N I T - 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. (Chapters 7, 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)
MSCCS 213 .NET TECHNOLOGY WORK LOAD: 4 PPW UNIVERSITY MARKS:
80
INTERNAL MARKS: 20 UNIT - I
Manage code, CLR Intermediate language, Metadata, JIT
compilation, automatic memory
management, object, visual studio.NET.
Elements: Variables and constants data types declaration,
operators types,
precedence expressions. Decision statements if..else, select ..
case, Loop statements
While..end, while..do loop, for..next, for..each..next.
Types: Value data types structures, enumerations, reference data
types. Single
dimension array, multidimensional array, jagged arrays, dynamic
arrays.
UNIT II
Creating windows forms, windows controls button, check box,
combo box, label, list box,
radio button, text box. Events click, close, deactivate, load,
mouse move, mouse down,
mouse up. Creating Menus Menu items, context menu, user dialog
boxes, showDialog().
XML: XML serialization, .NET Framework, SOAP fundamentals, using
SOAP with .NET
framework.
-
22
UNIT III
Introduction to web services: web services protocol and
standards, WSDL, UDDI, calling a
web service from browser & proxy, creating a simple web
service, creating and calling a web
service by using visual studio .NET.
ADO.NET: Architecture of ADO.NET, ADO.NET providers, connection,
command, data
adapter, data set.
Accessing data with ADO.NET : Connecting to data source,
accessing data with data and
data reader. Create an ADO.NET application using stored
programs.
UNIT- IV
ASP.NET features : Change the home directory in IIS, Add a
virtual directory in IIS, set a
default document for IIS, change log file properties for IIS
stop, start, pause a website.
Web Controls : Web controls HTML controls, using Intainic
controls, using input validation
controls, selecting controls for applications, adding web
controls to a page server controls
Types of server controls, adding ASP.NET code to a page.
TEXT BOOK: 1. VB.NET PROGRAMMING (BLACK BOOK) BY STEVEN HOLZNER
(Dreamtech- 2003) REFERENCE BOOKS: 1. VB.NET PROGRAMMING BY T.
GADDIS (Dreamtech) 2. Microsoft Visual Basic. Net step by step By
Halvosrson (PHI) 3. OOP with Microsoft Visual Basic.Net By Reynold
Hacrtte (PHI)
MSCCS 214 CRYPTOGRAPHY AND NETWORK SECURITY WORK LOAD: 4 PPW
UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 U N I T - I INTRODUCTION:- Attacks, Services,
and Mechanisms, Security Services. CONVENTIONAL ENCRYPTION:
CLASSICAL TECHNIQUES: Steganography, Classical Encryption
Techniques. CONVENTIONAL ENCRYPTION: MODERN TECHNIQUES:- Simplified
DES. The Data Encryption Standard, Differential and Linear
Cryptanalysis, Block Cipher Modes of Operation. U N I T - II
CONFIDENTIALITY USING CONVENTIONAL ENCRYPTION:- Traffic
Confidentiality, Random Number Generation. PUBLIC-KEY CRPTOGRAPHY:-
Principles of Public-Key Cryptosystems, The RSA Algorithm,
Diffie-Hellman Key Exchange, Elliptic Curve Cryptography.
INTRODUCTION TO NUMBER THEORY:- Prime and Relatively Prime Numbers,
Fermat's and Euler's Theorem, Euclid's Algorithm, The Chinese
Remainder Theorem, Discrete Logarithms. U N I T - III MESSAGE
AUTHENTICATION AND HASH FUNCTIONS:- Authentication Requirements,
Authentication Functions, Message Authentication Codes, Hash
Functions, Security of Hash Functions and MACs.
-
23
DIGITAL SIGNATURES AND AUTHENTICATION PROTOCOLS:- Digital
Signatures, Authentication Protocols, Digital Signature Standard. U
N I T - IV ELECTRONIC MAIL SECURITY: S/MIME. IP SECURITY: 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) TEXT
BOOK: 1. CRYPTOGRAPHY AND NETWORK SECURITY principles and Practice
FOURTH
Edition By Willam Stallings (Pearson Asia)
REFERENCE BOOKS: 1. DAVIES & PRICE : SECURITY FOR COMPUTER
NETWORKS - Wiley (1984) 2. MAYER & MATYAS : CRYPTOGRAPHY Wiley
B. SCHNEIER : APPLIED
CRYPTOGRAPHY - (John Wiley)
MSCCS 215 DATA WAREHOUSING AND DATA MINING WORK LOAD: 4 PPW
UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 UNIT-I What is Data Mining, Data Mining
Functionalities, and classification, Data Mining Task, Integrating
a Data Mining System, Major issues in Data Mining, Descriptive Data
Summarization, and Data Cleaning.(Chapters 1,2.1 to 2.3) UNIT-II
Data Integration and transformation, Data reduction, Data
Discrimination and concept Hierarchy Generation. What is Data
Warehouse, Multidimensional Data Model, Data Warehouse
Architecture, Data Warehouse Complementation, From Data Warehouse
to data mining. (Chapters 2.4 to 2.6, 3) UNIT-III Basic Concepts of
frequent patterns, Frequent Item sets, mining methods, Association
rules, what is classification and Prediction, Classification By
Decision Tree Induction, Bayesian Classification, Rule-Based
Classification. (Chapters 5.1, 5.2.1, 5.2.2, 5.3.1, 6.1, 6.2,
6.3.1, 6.3.3, 6.4.1, 6.4.2, 6.5.1 and 6.5.2) U N I T IV What is
Cluster analysis, types, Partitioning methods, Hierarchical
methods, Density Based methods, Grid Based methods, and Model-Based
Clustering methods, Outlier analysis? (Chapters 7.1 to 7.8 and
7.11) TEXT BOOK: 1. DATA MINING CONCEPTS & TECHINIQUES BY
JIAEEI HAN, MICHELINE & KAMBER (2nd EDITION) Harcourt India
(Elsevier Publishing Company) REFERENCE BOOKS: 1. Data Mining
Introductory and advanced topics MARGARET H DUNHAM, EDUCATION 2.
Data Mining Techniques ARUN K PUJARI, University Press.
-
24
3. Data Warehousing in the Real World SAM ANAHORY & DENNIS
MURRAY. Pearson Edn Asia. 4. Data Warehousing Fundamentals PAULRAJ
PONNAIAH WILEY STUDENT EDITION 5. DATA WAREHOUSING, DATA MINING
& OLAP BY ALEX BERSON AND STEPHEN J. SMITH (TMH)
MSCCS 216 UNIX NETWORK PROGRAMMING LAB WORK LOAD: 4 PPW
UNIVERSITY MARKS: 50
Programs Using UNIX or LINUX 1) Shell Programming 2) Simple
Program using the commands - PS, Nohup, Wail, Kill, Nice, At,
Batch, Cron, Sh, Cd, Empr etc. 3) File Locking & Record Locking
4) Pipes 5) Message Queues 6) FIFO 7) Semaphore 8) Client-Server
example. 9) Shared memory 10)Socket Programming
MSCCS 217 .NET TECHNOLOGY LAB WORK LOAD: 4 PPW UNIVERSITY MARKS:
50
Unit-I: Elements:
1. How does one compare strings in C#?
2. Convert a string to an integer in C#?
3. Write a program to display all the arithmetic function
results for given 2 numbers
a. Results should be in this format as
i. Addition of the given 2 numbers
ii. Subtraction of the given 2 numbers
iii. Multiplication of the given 2 numbers
iv. Division of given 2 numbers
4. print multiplication table for the given number (using for
loop)
5. Write a program to display all the arithmetic function
results for given 2 numbers using
switch-case
6. Write code to declare enumerator and display the values?
7. Create Single dimensions array with 10 numbers and print them
in 10 rows.
8. Declare and fill the 2D array and print the values in sorting
order
9. Write a program to print the factorial number
10. Write a program to print Fibonacci Series
11. Write a program for Bubble sort using Arrays.
UNIT- II 12. Create a form with a Dropdown and a text box and
display the selected text from
dropdown to Text box.
-
25
13. Create a form with 2 text boxes one text box should accept
numbers only another one
should accept text only. Both the text boxes should not accept
any special characters.
14. Create a form with a text box and button. Display a message
while click on the button
with the Textbox data.
15. Create a form with a textbox (validate for only numbers). If
the entered value is < 18 and
>60, then prompt a message to the user
16. Create a form with List box with State Names. Selected state
should be displayed in the
Label with Red color.(Put one list box and Label on the
form)
Create an MDI (Multi Document Interface) form with menu
controls. UNIT - III 17. Create a web service with a method
GetEmployeeData and call the web service from
browser
18. Create a web service with GetEmployeeData and show the WSDL
code on the browser
19. Create a web service and consume that service using Proxy in
web application.
20. Create a connection to database using ADO.Net connection
object and display a
message as successfully connected.
21. Create a connection and get the data from database. Display
the data in Grid using
Connection object, Data Adapter and Dataset.
22. Create a form with First, Next, Previous, Last buttons, 4
text boxes (Name, Age,
Designation, Sal). Create a connection with Connection object
and display the data
using Data Reader. Write the functionality to navigate the
records by click on the First ,
Next, Last and Previous buttons.
23. Create a form with Data grid and display the employee data
into that using stored
procedure.
24. Add 2 Data Grids in a form. Fill one Data grid with employee
data including Salary field.
Add one text box to enter the age, add one button to filter the
data. Once a number
enter in the Textbox and click on the Button, 2nd Data grid
should show the filtered Data
compared to first one.
UNIT - IV
25. Create a Virtual directory in IIS and map to Local web
application folder.
26. Create a web form with a textbox and validation control to
validate the Email validation.
27. Create a web form with 2 textboxes to compare using
CompareValidator, Required field
validator to validate Mandatory for the First Textbox.
28. Create Student Data form with Web controls
a. Textboxes (Name, Age, Address, Class)
b. Check Box (Languages Known like : Telugu, English, Hindi,
Others)
c. Radiobutton (Gender)
d. Dropdown (state, Country)
e. Button (submit, update,search and delete)
f. Textbox for search (Enter roll number and click on the search
button, data
should filled in the above controls from Database).
-
26
MSCCS 218 DATA MINING LAB WORK LOAD: 4 PPW UNIVERSITY MARKS:
50
Weka is a collection of machine learning algorithms for data
mining tasks. The algorithms
can either be applied directly to a 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; ArffViewer; Converters;etc.,
REFERENCES & RESOURCES:
Manuals and Software:
http://www.cs.waikato.ac.nz/ml/weka/index.html
Collections of Datasets:
http://www.cs.waikato.ac.nz/ml/weka/datasets.html
-
27
MSCCS 221 DESIGN AND ANAYSIS OF ALGORITHMS WORK LOAD: 4 PPW
UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 UNIT- I
Introduction and elementary data structures order notation
Analysis of algorithm
Review of elementary data structures - head and Heap Sort
Hashing sets representation
- UNION, FIND operation.
UNIT- II
Divide and conquer and the Greedy Model The General Method,
binary search,
finding, maximum and minimum - Merge sort Quick sort and
selection sort Knapsack
problem - Optimal storage on tapes, job sequencing with
deadlines optimal merge pattern,
minimum spanning trees and single source shortest pattern.
UNIT-III
Dynamic Programming and traversal techniques Multistage graphs,
all pairs shortest
pattern Optimal binary search trees O/I Knapsack reliability
design, travelling sales
man problem game trees, disconnected components and depth first
search.
UNIT-IV
Back Tracking and branch bound Technique 8 queens problem, graph
colouring,
Hamiltonian cycles Knapsack problems, O/I Knapsack problems,
Travelling sales person
problems, Lower Bound theory. NP hard and NP-Completeness, Basic
concepts, cooks
theorem NP Hard Graph problem and scheduling problem NP Hard c
ode generation
problem decision problem node covering theorem.
TEXT BOOK:
1. E. Horowitz and S. Sahini, Fundamentals of Computer
Algorithms, Galgotia Publications,
1984.
2. A.V. Aho, J.V. Hopcraft and J.D. Ullmann, The design and
analysis of computer
algorithm, Addison Wesley Publications Company 1974.
MSCCS 222 OBJECT ORIENTED ANALYSIS AND DESIGN WORK LOAD: 4 PPW
UNIVERSITY MARKS: 80
INTERNAL MARKS: 20 UNIT - I Introduction: An Overview of Object
-Oriented system development, Object Oriented Methodologies, Object
Oriented systems development life cycle, Object Basics, Importance
of modelling, Object Oriented Modelling, An overview of the UML, A
Conceptual Model of the UML, Software Development life cycle,
Building blocks of the UML, Rules of the UML, Common Mechanisms,
UML Architecture. UNIT - II Structural modelling: Classes,
Relationships, Common Mechanisms, Diagrams, Class Diagrams,
Advanced Structural Modelling: Advanced Classes, Advanced
Relationships, Interfaces, Types, Roles, Packages, Instances,
Object Diagrams.
-
28
UNIT - III Behavioural modelling: Interactions, Use Cases, Use
Case Diagrams, Interaction Diagrams, Activity Diagrams, Advanced
Behavioural Modeling: Events and Signals, State Machines, Processes
and Threads, Time and Space, Space Chart Diagrams. UNIT-IV
Architectural Modelling: Components, Deployment, Collaborations,
Patterns, and Frame works, Component Diagrams, Deployment Diagrams,
Systems, and Models. TEXT BOOKS : 1. Ali Bahrami, Obj ect Oriented
Systems Development, McGraw-Hill International Editions, 1999. 2.
Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling
Language User Guide, Pearson Education. 3. Hans-Erik Eriksson,
Magnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, WILEY-
Dreamtech India Pvt. Ltd. REFERENCE BOOKS: 1. Meilir Page-Jones:
Fundamentals of Object Oriented Design in UML, Pearson Education.
2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-
Dreamtech India Pvt. Ltd. 3. Atul Kahate: Object Oriented Analysis
& Design, The McGraw-Hill Companies. 4. Mark Priestley:
Practical Object-Oriented Design with UML,TATA McGrawHill 5.
Appling UML and Patterns: An introduction to Object Oriented
Analysis and Design and Unified Process, Craig Larman, Pearson
Education. MSCCS 223 MOBILE COMPUTING WORK LOAD: 4 PPW UNIVERSITY
MARKS: 80
INTERNAL MARKS: 20 UNIT - I Introduction to Mobile
Communications and Computing: Mobile Computing (MC): Introduction
to MC, novel applications, limitations, and architecture. GSM:
Mobile services, System architecture, Radio interface, Protocols,
Localization and calling, Handover, Security, and New data
services. (Wireless) Medium Access Control: Motivation for a
specialized MAC (Hidden and exposed terminals, Near and far
terminals), SDMA, FDMA, TDMA, CDMA. UNIT - II Mobile Network Layer:
Mobile IP (Goals, assumptions, entities and terminology, IP packet
delivery, agent advertisement and discovery, registration,
tunneling and encapsulation, optimizations), Dynamic Host
Configuration Protocol (DHCP). Mobile Transport Layer: Traditional
TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast
recovery, Transmission /time-out freezing, Selective
retransmission, Transaction oriented TCP. UNIT - III Database
Issues: Hoarding techniques, caching invalidation mechanisms,
client server computing with adaptation, power-aware and
context-aware computing, transactional models, query processing,
recovery, and quality of service issues. Data Dissemination:
Communications asymmetry, classification of new data delivery
mechanisms, push-based mechanisms, pull-based mechanisms, hybrid
mechanisms, selective tuning (indexing) techniques.
-
29
UNIT - IV Mobile Ad hoc Networks (MANETs): Overview, Properties
of a MANET, spectrum of MANET applications, routing and various
routing algorithms, security in MANETs. Protocols and Tools:
Wireless Application Protocol-WAP. (Introduction, protocol
architecture, and treatment of protocols of all layers), Bluetooth
(User scenarios, physical layer, MAC layer, networking, security,
link management) and J2ME. TEXT BOOKS : 1. Jochen Schiller ,Mobile
Communications,Addison-Wesley. (Chapter 4,7,9,10,11), second
edition, 2004. 2. Stojmenovic and Cacute, Handbook of Wireless
Networks and Mobile Computing, Wiley, 2002, ISBN 0471419028.
(Chapters 11, 15, 17, 26 and 27) REFERENCE BOOKS : 1. Reza
Behravanfar, Mobile Computing Principles: Designing and Developing
Mobile Applications with UML and XML, ISBN: 0521817331, Cambridge
University Press, October 2004, 2. Adelstein, Frank, Gupta, Sandeep
KS, Richard III, Golden , Schwiebert, Loren, Fundamentals of Mobile
and Pervasive Computing, ISBN: 0071412379, McGraw-Hill
Professional, 2005. 3. Hansmann, Merk, Nicklous, Stober, Principles
of Mobile Computing, Springer , second edition, 2003. 4. Martyn
Mallick, Mobile and Wireless Design Essentials, Wiley DreamTech,
2003 MSCCS 224 UML LAB WORK LOAD: 4 PPW UNIVERSITY MARKS: 50
UML diagrams to be developed are:
1. Use Case Diagram.
2. Class Diagram.
3. Sequence Diagram.
4. Collaboration Diagram.
5. State Diagram
6. Activity Diagram.
7. Component Diagram
8. Deployment Diagram.
9. Test Design.
Description for an ATM System
The software to be designed will control a simulated automated
teller machine (ATM) having
a magnetic stripe reader for reading an ATM card, a customer
console (keyboard and
display) for interaction with the customer, a slot for
depositing envelopes, a dispenser for
cash (in multiples of Rs. 100, Rs. 500 and Rs. 1000), a printer
for printing customer receipts,
and a key-operated switch to allow an operator to start or stop
the machine. The ATM will
communicate with the bank's computer over an appropriate
communication link. (The
software on the latter is not part of the requirements for this
problem.)
-
30
The ATM will service one customer at a time. A customer will be
required to insert an ATM
card and enter a personal identification number (PIN) - both of
which will be sent to the bank
for validation as part of each transaction. The customer will
then be able to perform one or
more transactions. The card will be retained in the machine
until the customer indicates that
he/she desires no further transactions, at which point it will
be returned - except as noted
below.
The ATM must be able to provide the following services to the
customer:
1. A customer must be able to make a cash withdrawal from any
suitable account linked to
the card, in multiples of Rs. 100 or Rs. 500 or Rs. 1000.
Approval must be obtained from the
bank before cash is dispensed.
2. A customer must be able to make a deposit to any account
linked to the card, consisting
of cash and/or checks in an envelope. The customer will enter
the amount of the deposit in
to the ATM, subject to manual verification when the envelope is
removed from the machine
by an operator. Approval must be obtained from the bank before
physically accepting the
envelope.
3. A customer must be able to make a transfer of money between
any two accounts linked
to the card.
4. A customer must be able to make a balance inquiry of any
account linked to the card.
5. A customer must be able to abort a transaction in progress by
pressing the Cancel key
instead of responding to a request from the machine. The ATM
will communicate each
transaction to the bank and obtain verification that it was
allowed by the bank. Ordinarily, a
transaction will be considered complete by the bank once it has
been approved. In the case
of a deposit, a second message will be sent to the bank
indicating that the customer has
deposited the envelope. (If the customer fails to deposit the
envelope within the timeout
period, or presses cancel instead, no second message will be
sent to the bank and the
deposit will not be credited to the customer.)
If the bank determines that the customer's PIN is invalid, the
customer will be required to re-
enter the PIN before a transaction can proceed.
If the customer is unable to successfully enter the PIN after
three tries, the card will be
permanently retained by the machine, and the customer will have
to contact the bank to get
it back.
If a transaction fails for any reason to her than an invalid
PIN, the ATM will display an
explanation of the problem, and will then ask the customer
whether he/she wants to do
another transaction.
The ATM will provide the customer with a printed receipt for
each successful transaction
The ATM will have a key-operated switch that will allow an
operator to start and stop the
servicing of customers. After turning the switch to the "on"
position, the operator will be
required to verify and enter the total cash on hand. The machine
can only be turned off when
it is not servicing a customer. When the switch is moved to the
"off" position, the machine
will shut down, so that the operator may remove deposit
envelopes and reload the machine
with cash, blank receipts, etc.
MSCCS 226 PROJECT WORK WORK LOAD: 8 PPW UNIVERSITY MARKS:
150
SEMINAR MARKS: 50