osmania university m.sc. computer science i semester 1.1

1

Osmania University

M.Sc. Computer Science – I Semester

1.1 Discrete Mathematics 4 Hrs/Week Work Load : 60 Hrs

Objective: To get hands on experience in Mathematical Logic and Proofs, Graph theory,

Elementary combinations, Binomial coefficients, and Recurrence relation.

Unit I 15 Hrs

Mathematical Logic and Proofs – Propositions – New Propositions from old ones Truth tables

and Tautologies – Equilent Propositions – The conditional and BiConditional – Argument and

Proofs – Predicate Logic – Logic and Electric Circuits – Boolean Algebra – Boolean Functions

some applications – Minimization. Section 1.1 to 1.9 & 3.1 to 3.6 of (1)

Unit II 15 Hrs

Graph Theory – Basic Ideas and Definitions – Planar Graphs – Connectivity – Complete

representation of graphs – Directed Graphs and Trees – Paths, Cycles etc. – Dijkstra‘s Algorithm

– Euler and Hamiltonian paths. Section 5.1 to 6.1 & 6.3 of (1)

Unit III 15 Hrs

Elementary combinations – Basics of counting – Combinations and permutations - Their

enumerations with repetitions - – Binomial coefficients – The Binomial and Multinomial

theorem – The principle of inclusion – Exclusion. Section 2.1 to 2.8 of (2)

Unit IV 15 Hrs

Recurrence Relation – Generating Functions of Sequences – Calculating coefficients of

generating functions - Recurrence Relations – Solving Recurrence Relations by substitution and

generating the method of characteristic roots – Solution of nonhomogeneous linear Recurrence

Relations. Section 3.1 to 3.6 of (2)

Outcome: Student will be perfect in learning and implement Mathematical Logic and Proofs,

Graph theory, Elementary combinations, Binomial coefficients, and Recurrence relation.

Textbooks

1. Stephen a Witala - Discreet Mathematics, A Unified approach Mc Graw Hill

International Edition, Computer Science Series 1987 (New editions available if any)

2. Joe. L. Mott, Abraham Kandel, Theodore P. Baker: Discreet Mathematics for Computer

Scientists and Mathematics, Prentice Hall, NJ, 1986

Ref. Books

1. Kenneth H. Rosen: Discreet Mathematics, Mc Graw Hill Editions

2


1.2 MODERN OPERATING SYSTEM 4 Hrs/Week Work Load : 60 Hrs

Objective: To understand Different Operating Systems, CPU Scheduling, Deadlock handling,

Memory-File Management, Security Mgt., Unix/Linux System Administration.

UNIT-I 20 Hrs

Introduction to operating systems: Computer system. structure, operating system structures :

Architecture of distributed system, issues in distributed operating system, inherent Limitation of

distributed system, logical state. Distributed shared memory. Process concepts, process

scheduling, inter process communication.

CPU Scheduling: Criteria, scheduling Algorithms, Multiple Processor scheduling, real time

scheduling, Algorithm evaluation. The critical section problem, synchronization hardware,

semaphores, classical problems of synchronization. Critical regions, Monitors, Atomic

transactions..

Dead locks: System model, Deadlock characterization. Methods of handling deadlocks,

deadlock prevention, deadlock avoidance, deadlock detection. Recovery from deadlock,

combined approach to deadlock handling. ( III- Ch. 1,2,3,4,6.1 to 6.6 , 8), (II- 4.3 to 4.5, 5.2,

9.1 to 9.3, 10.1, 10.2)

UNIT—Il 15 Hrs

Memory management: Introduction, logical versus physical address space. Swapping,

contiguous allocation, paging, segmentation with paging. Allocation of frames, thrashing other

considerations, demand segmentation. Thread scheduling and dispatching, interrupt and

exception handling, system service - dispatching, multiprocessor synchronization, file concept,

access method, directory structure and protection.

File system implementation : File system structure allocation methods, free space management,

directory implementation, secondary storage structure, disk structure, disk scheduling, disk

management, swap space management. ( III- Ch. 9, 10.2 to 10.6, 10.8, 12.1 to 12.5, 11.3, 12.3

to 12.5 )

UNIT-III 10 Hrs

Security : Goals of protection and security management . Revocation of access rights. Two case

studies — one on unix/linux/solaris and another windows server. Failure, recovery, classification

of failure, basic approaches, check pair- fault tolerance, commit protocols, voting protocols,

concurrency control, lock time safe ordering. (III – Ch. 18, for case study III – 20, 21, 22 ), (II

– 12.3, 12.5, 17.8, 13.4, 13.6, 19.1 to 19.5)

UNIT-IV 15 Hrs

System Administration commands for — unix / linux / solaries : User management, resource

management, network management, security management, process management, backup and

recovery. (IV – Ch. 6, 7, 10, 17, 20, 21)

Outcome: Student will be cable to understand and implement understand Different Operating

Systems, CPU Scheduling, Deadlock handling, Memory-File Management, Security Mgt.,

Unix/Linux System Administration.

TEXTBOOKS:

3

I. Andrew S. Tanen Baum Modem Operating system Prentice Hall of India Easter Economy

Edition, 1998.

II. M.Singhal and H.G. Shivarathi, Advanced concepts in operating system, Mc Grawllill,1994.

III. Araham Silberschatz and Peter B. Gavilin, Operating System concepts, Addison Wesley

Publishing Company, Fifth edition, 1998.

IV. Evi Nemath, Garth Snyder, Scott Seebass, Trent R. Hem — Unix System Administration

Hand book, Printicel Hall 1995.

REFERENCE BOOKS:

1. Achyut S. Godbole, operating Systems with case studies in UNIX Netware and

Windows Nt. Tata Mc Graw Hill Publishing Co., New Delhi 1998.

2 Custer Helen, Inside Windows NT, Microsoft press, 1992.

3. Complete Reference — Red hat Linux 9 Tata Mc Graw Hill Publications New Delhi.

4

M.Sc. Computer Science– I Semester

1.3 MICROPROCESSOR AND MICRO CONTROLLERS 4 Hrs/Week Work Load : 60 Hrs

Objective: The objective of this course is to introduce the students to the fundamentals of

microprocessor, microcontroller and microprocessor programming and enable them to

apply these concepts for solving real world problems

UNIT-I1

Digital systems- Number systems; Logic gates, Boolean algebra, Flip-flops, Registers,

Encoders, Decoders, Multiplexers, Demultiplexers, Counters, DC Power supplies, UPS

(Block diagram, with technical information).(Text-I ch2, Ref-3, ch 13)

Special Devices- CRT, Floppy, Hard Disk and Printer Controllers, KBD 8279, Memory

controllers, cache controllers, CRT Display printers, scanners (Brief technical

descriptions).(Text — 1, ch 7, Text 2,3 Ref- 4)

UNIT—II

Micro processors, 8085 — Evolution of Microprocessors and Digital computers, memory

(Storage type and devices), Buses, Bus Architecture, Intel 8085, Instruction cycle,

Timing Diagrams, Addressing modes and instructions. (Text- I ch 1,3,4)

UNIT—III

Micro processors, 8086- Intel 8086, Block diagram, and operations, Registers, Interrupts,

Bus cycle, Assembler Directives and operators, Addressing modes and instructions with

examples.

Interfacing peripheral devices- PPI 8257, PlC 8259, 8253 Counter, Timer. (Text- 1 ch 7,

ii; Text- 2,3; Ref-4)

UNIT-IV

Micro controllers, 8051- Detailed Architecture of single chip Micro controller — 8051,

Registers, Flags and PSW, Internal Memory, Special Function Registers, I/O Lines,

Interrupts, Instructions with simple examples. Other 8 bit, 16 bit and 32 bit

Microcontrollers (block diagram only). (Text- 1 ch 10, Text- 3 ch 16, Text- 4 ch 3).

Outcome: Student will be perfect in understanding the fundamentals of microprocessor,

microcontroller and microprocessor programming and enable them to apply these

concepts for solving real world problems.

TEXT BOOKS:

1. Fundamentals of Microprocessors and Microcomputers by B.Ram dhanpat, Rai

publications (P) Ltd, New

Delhi.

2. Microprocessors Architecture, Programming and Application with the 8-85, 4 Edition

Ramesh S. Gaonkar

Penram International Publishing (India).

3. Advanced Microprocessors and Peripherals, Architectures, Programming and

Interface by A.K Ray and K.M

Bhurchandi TMH, India.

5

4. The 8051 Microcontroller architecture, Programming and applications, 2 Edition by

Kenneth 3. Ayala

Penram International Publishing (India)

REFERENCE BOOKS:

1. Digital Systems Principles and Applications, Edition by Ronald J tocci, Neal S.

Widmer Person Education Pt. Ltd, India.

2. Digital Principles and Applications by — Albert Paul Malvino, and DonaldP Leach

TMH, India.

3. Fundamentals of Digital Circuits by A. Anand Kumar PHI, India.

4. IC‘s and Microprocessors- Data Hand book BPB Publications, India.

5. The Intel Microprocessors 8-856/8088, 80186/188, Pentium Pro Professor

architechture, Programming and Interfacing 4th Edition by Barry B. Berry PHI, India.

6. Microprocessors and Interfacing, Programming and Hardware by Douglas V.HalI

TMH, India.

7. Microprocessor Systems- the 8086/ 8088 Family, arch, Prog, and Design by Yucheng

Liu and Glenn A. Gibson PHI, India.

8. The 8051 Microcontroller and Embedded systems by Muhammed Au Mazidi,

JaniceGillispie Mazid pearson Education Pvt. Ltd. India.

9. Programming and Customizing the 8051 Micro controller by Myke predko TMH,

India.

6

M.Sc. Computer Science- I Semester

1.4 SOFTWARE ENGINEERING

4 Hrs/Week Work Load : 60 Hrs

Objective: To impart the knowledge of software concepts, importance of software development

within time and budget.

UNIT –I: 15 Hrs.

Introduction to Software Engineering project size. And its categories planning a software

project – software developing life cycle – planning and organizational structure.

UNIT – II: 15 Hrs.

Software cost estimations, Least factor – cost estimation techniques – maintenance cost

estimation – Software requirement specifications – formal specification techniques.

UNIT – III: 15 Hrs.

Software Design – Fundamental design concepts and relations of Modularization – Module

design techniques Implementation issues – Structures coding techniques – coding style –

standards and guidelines – Documentation – verification and validation techniques – quality

assurance – walk through and inspection – testing.

UNIT – IV: 15 Hrs.

Software tools – overview of CASE – Software reliability –Object Oriented Software

Engineering- Object Oriented Concepts and Principles - Software Maintenance –

Management aspects of maintenance – Maintenance tools and techniques.

(Chapter 20).

Outcome: At the end of the course, student will acquire knowledge on software concepts,

importance of software development within time and budget.

TEXT BOOKS

R S Pressman – Software Engineering. McGraw Hill Publishing Co. 1987

REFERENCE BOOKS

Richard Fairley – Software Engineering, Mc Graw Publishng Co. 1986.

7


1.5 COMPUTER GRAPHICS 4 Hrs/Week Work Load : 60 Hrs

Objective: This course is designed to provide a comprehensive introduction to computer

graphics leading to the ability to understand contemporary terminology, progress, issues, and

trends.

UNIT — I 15 Hrs

A Survey of computer graphics, overview of graphic systems, Video Display devices,

Raster scan systems, Random scan systems, graphic input devices, Hard copy devices, Graphic

software.

Output Primitives: Line-Drawing Algorithms DDA, Bresenham line Algorithm, Midpoint

circle Algorithm, Ellipse Algorithm.

Computer animation: Design of animation sequence, general computer animation functions,

raster animation, computer animation languages (introduction only).

Polygons fill Algorithms: Scan-line, Boundary fill, Flood fill Algorithms.

UNIT-II 15 Hrs

Attributes of output primitives: Line Attributes, Curve Attributes, Area- fill and character

Attributes

Two dimensional transformations: Basic transformations, homogenous representation,

composite transformation, reflection and shear transformation.

UNIT —III 15 Hrs

Two dimensional viewing: Viewing pipeline, window to view coordinate transformation

Clipping Operations Cohen- Sutherland line clipping, Liang Barsky line clipping,

Nicholl-Lee Nicholl-Line Clipping, Sutherland-Hodgman polygon clipping,

Weiler Autherton polygon clipping

UNIT-IV 15 Hrs

Three dimensional objective representations, polygon surfaces, polygon tables, plane

Equations, cubic Bezier curves, B-spline, Octrees

3D - transformations: Translation, Rotation, Rotation about a arbitrary point.

Projections: Perspective projections and parallel projections.

Visible surface detection: Back faced detection; Z-buffer Algorithm, Depth sorting algorithm,

Area subdivision Algorithm.

Outcome: At the end of the course, student will be perfect in introduction to computer graphics

leading to the ability to understand contemporary terminology, progress, issues, and trends.

TEXT BOOKS

1. M.Pauline Baker, Computer Graphics, C-Version, Prentice Hall of India, Second

Edition 1995.

REFERENCE BOOKS

Computer Graphics by Harrington, Mc Graw Hill Publishing Co. 1987.

8

PRACTICALS

1.6 Lab - Computer Graphics (Using C) - A

Week-1

1. Line drawing algorithms using DDA algoritham. Week-2

2. Line drawing algorithms using Bresenham‘s method. Week-3

3. Circle and ellipse drawing algorithms— parametric method Week-4

4. Circle and ellipse drawing algorithms— bresenham‘s method. Week-5

5. Algorithm for polygon inside tests and testing convexity. Week-6

6. Polygon filling using scan conversion method. Week-7

7. Transformation of 2-d composite objects. Week-8

8. Line clipping algorithms — Cohen Sutherland Week-9

9. Line clipping algorithms out code method and parametric methods. Week-10

10. Polygon clipping using Sutherland — Hodgman method Week-11

11. 3-D transformation on a cube. Week-12

12. Bezier curves drawing.

9

Lab – Unix - B

Week-1 1. Basic Unix operations.

Week -2

2. Shell program using ‗case‘, ‗then‘ and ‗if‘ & ‘else‘.

Week-3 3. Shell programs on looping statements.

Week-4 4. To identify the type of a give file.

Week-5

5. Inter process communication using pipes.

Week-6

6. To wish salutation depending on the time.

Week-7 7. Programmes using system calls

Week-8

8. Implementation of cp command of unix.

Week-9

9. To create a child process using fork() and exec() system calls.

Week-10

10. Process communication using signals.

Week-11

11. To convert upper case to lower case letters of a given ASCII file.

Week-12 12. Program to demonstrate system calls.

Week-13 13. Program to search the given pattern in a file.

Week-14 14. Implementation of Signals in unix.

10

M.Sc. COMPUTER SCIENCE- I Semester

1.7 Lab - Digital Systems, Microprocessors and Micro controllers

I. Digital Systems

Week-1:

Verification of the logic gates.

Week-2:

Encoder/ Decoder

Week-3:

Mux/ Demux

Week-4:

Design of Counters

II. Microprocessors — 8085, Interfacing and Assembly Language programs

Week-5:

I. Addition, Subtraction, Multiplication and Division.

2. Find One‘s and Two‘s complement of a number

Week-6:

3. Find square and square root of a number

4. Find largest and smallest number in data array / from a series of numbers.

Week-7:

5. To arrange a data? a series of numbers in ascending and descending order

6. Program to move the block of data form one location to other location.(Text 1, ch 6,9)

III. Microprocessors — 8086

Week-8:

1. Addition, Subtraction, Multiplication and Division of the given Operands.

2. Find largest and smallest number in data / array / from a series of N numbers.

Week-9:

3. To arrange a data array / a series of numbers in ascending and descending order.

4. Display the Message ―-------― on the Monitor, String operations.

Week-10:

5. Program to move the block of data form one location to other location.

By using- 8086 kit, DEBUG of DOS utility, MASM or TASM (Text—3,ch3,4,9,5)

IV. Micro controllers — 8051

Week-11:

1. Setting up SMPS and getting a program to, assemble.

Week-12:

2. Arithmetic operations (Addition, Subtraction, Multiplication and Division.)

Week-13:

3. Dirdect and Indirect Bank Register addressing.

Week-14:

4. RAM Direct addressing.

5. Subroutines

Experiments with Universal Microprocessor Program Simulator (UMPS) (Ref 9, ch 9)

11

Osmania University

M.Sc. Computer Science, II Semester

2.1 AUTOMATA LANGUAGE AND COMPUTATION 4 Hrs/Week Work Load : 60 Hrs

Objective: The purpose of the course is to introduce the concepts of finite state automata and

regular expressions. The course includes conversion of DFAs, NFAs, and regular expressions. It

also covers pushdown automata and Turing machines.

UNIT – I 15 Hrs

Alphabets and Languages-Graphs and Tress Finite automata and regular Expression-finite State

Systems- deterministic finite automata, Non deterministic finite automata, Finite automata with

E-moves, Equivalence between NFA with and without e-transitions regular expression.

Language recognizers.

UNIT –II 15 Hrs

Two-way finite automate-finite automata with output- Regular sets, regular expressions, identity

rules, Constructing finite Automata for a given regular expressions, and vice versa Pumping

lemma for regular sets. Closure properties of regular sets-Decision algorithms for regular sets-

The MyhillNerode theorem, minimization of finite automata.

UNIT – III 15 Hrs

Context-free grammars-Motivation and introduction-Context-free grammars-derivation trees

Chomsky normal form-Greibach normal form, .Push down automata. Acceptance of CFL,

acceptance of CFL and PDA Properties of CFL.

UNIT-IV 15 Hrs

Turing machines-Introduction-Turing machine model Computable languages: and functions

Church‘s hypothesis-Regular grammars-unrestricted grammars, Context Sensitive languages -

Chomsky hierarchy. Definition of P and NP problems, NP complete

and NP hard problems.

1111Outcome : At the end of the course, student will gain the knowledge of finite state

automata and regular expressions. The course includes conversion of DFAs, NFAs, and regular

expressions. It also covers pushdown automata and Turing machines.

SUGGESTED BOOKS

1. E.Hopcroft and Jeffery D.Ullman introduction to Automata Theory, Languages and.

Computation, Narosa Pubi ishing House, New Delhi, 1994. .

12

M.Sc.(Computer Science) II Semester

2.2 ADVANCED JAVA PROGRAMMING 4 Hrs/Week Work Load : 60 Hrs

Objective: To impart the knowledge in Advanced Java Programming for developing client-

server applications.

UNIT – 1 15 Hrs

J2EE Architecture, Directory Services, RMI, JDBC.

UNIT – 2 15 Hrs

Web Containers, Java Servlets – Life Cycle, Implementation, Request-response, Servlet

sessions, Context- Collaborations, JSP – Basic and Architecture, Tag extensions.

UNIT -3 15 Hrs

JSP Tag Libraries, Java Mail, JMS, J2EE Connector Architecture.

UNIT – 4 15 Hrs

EJB – Architecture and Design, Session Beans, Entity Beans, Container Services.

Outcome: At the end of the course, student gets hands on practice in Advanced Java

Programming for developing client-server applications.

Text Books:

1. Subrahmanyam Allamaraju etc; - Professional Java Server Programming J2EE 1.3

edition, Wrox Press 2001.

Reference Book :

1. Ed Roman – Mastering Java Beans – Wiley 1999 2.Valesky- Enterprise Java Beans-

Edition 2000.

13

M.Sc.(Computer Science) II Semester 2.3 COMPUTER NETWORKS AND INTERNET PROTOCOLS.


Objective : This course provides the overview of networking. It deals with the seven layers of

OSI/ISO Model in detail and Wireless TCP.

UNIT–I: 15 Hrs

A communication model – Data communications Networking – Protocols and Protocol

architecture – Standards – Analog and Digital Data transmission – Transmission Impairments –

Guided and Unguided transmission. Data Encoding – Digital data – digital signal, Digital data –

Analog signal, Analog data – Digital signal, Analog data – Analog signal.

[Chapter 1,2,3,4 of Book II]

UNIT–II: 15 Hrs.

The Data communication interface – Asynchronous and Synchronous Transmission, Line

configurations, Interfacing. Data Link Control – flow control – Error detection – Error Control –

High Level Data Link Control Protocol (HDLC) – Other Data Link protocols. Multiplexing –

Frequency division Multiplexing – Time division Multiplexing – statistical time division

multiplexing.

[Chapter 5,6,7 of Book II]

UNIT-III: 15 Hrs

LAN Technology – LAN Architecture . Wireless LANs. LAN Systems - Ethernet and Fast

Ethernet (CSMA/CD) – Token Ring and FDDI. BRIDGES – Bridge Operations – Routing with

bridges.

[Chapter 12,13,14 of Book II]

UNIT–IV: 15 Hrs

Network Layer: Network layer design issues. Routing algorithms: Shortest path routing

algorithm, distance vector routing algorithm. Link State Routing. Internetworking: Tunneling, IP

Protocol, IP Addresses and Internet control protocols.[ICMP,IGMP,ARP] .

Transport layer: Elements of Transport Protocols, Addressing, connection Establishment,

Connection Release.

Internet Transport Protocols : TCP segment Header, TCP Transmission policy, TCP Congestion

Control, TCP Timer management, Wireless TCP.

[Chapter 5,6 of Book I]

Outcome: At the end of the course, student will gain the knowledge in overview of networking.

It deals with the seven layers of OSI/ISO Model in detail and Wireless TCP.

TEXT BOOK:

I. Computer Networks - Andrew S. Tenenbaum (Fourth Edition), Prentice Hall of

India, New Delhi, 2002.

II. William Stallings, Data and Computer Communications (Fifth Edition), Prentice Hall

of India, New Delhi 1998.

14

M.Sc. Computer Science, II Semester

2.4 DESIGN AND ANALYSIS OF ALGORITHMS 4 Hrs/Week Work Load : 60 Hrs

Objective : It helps the student to learn different Sorting- searching methods. Different

algorithms on Divide and Conquer, Dynamic Programming – Back tracking and NP hard and NP

completeness.

UNIT-I 15 Hrs

Introduction and elementary data structures – order notation – analysis of algorithm-review

of elementary data structures, Heap and Heapsort – Hashing – Sets representation – UNION,

FIND operations.

UNIT –II 15 Hrs

Divide and conquer and the greedy models – 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 15 Hrs

Dynamic programming and traversal techniques – multistage graphs, all pairs shortest pattern

– optimal binary search trees – 0/1 knapsack – reliability design, travelling sales man problem –

game trees, disconnected components and depth first search.

UNIT – IV 15 Hrs

Back Tracking and branch bound technique – 8 queen problem, graph coloring, Hamiltonian

cycles – knapsack problem, 0/1 knapsack problem. Traveling sales person problem, lower –

bound theory. NP hard and NP completeness, basic concepts, cook‘s theorem – NP Hard graph

problem and scheduling problem – NP hard code generation problem – decision problem – node

covering theorem.

Outcome: Student gain experience in different logics involved in basic data structures- divide

and conquer, Dynamic programming, Back tracking, and branch bound techniques with

implementation.

TEXT BOOKS

1. E. Horowitz and S. Sahani, Fundamentals of Computer algorithms, Galgotia Publications,

1984.

2. A.V. Aho, J.V.Hopcraft and J.D. Ullmann. The Design and Analysis of Computer

Algorithms, Addison Wesley Publications Company, 1974.

15

M.Sc. COMPUTER SCIENCE, II Semester 2.5(a) ADVANCED COMPUTE ARCHITECTURE (ELECTIVE)


Objective: It gives the environment to study computational Model, pipelined processing, view

architecture, data parallel architecture and CORBA architecture.

UNIT – I 15 Hrs

Computational model — concept, Van Neumann computational model, key concepts relating to

computational models. Ch : (1.1 to 1.4)

Introduction to parallel processing — Basic concepts, types and loads of parallelism,

classification, basic parallel techniques. Ch: (3.1 to 3.4)

Introduction to ILP processor — Evolution dependencies between instructions, instructions

scheduling. Ch (4.1 to 4.3)

Pipelined processors — basic concepts, design space, pipelined instruction processing, pipe lined

execution to integer instructors.

UNIT-Il 15 Hrs

VIEW Architecture Overview. Ch( 6.1 to 6.3)

Super scalar processors — Introduction, parallel decoding, instruction issues, scaling register

renaming , parallel execution, preserving sequential consistency, case study of Pentium

processor. Ch (7.1 to 7.8)

Processing of control instructions Introductions, basic approaches, delayed branching, branch

processing. Ch (8.1 to 8.4)

UNIT-III 15 Hrs

Data parallel architecture.— introduction , connecting SIMD Architecture — Design space, Fine

space, Fine grained SIMD, Cases gained SIMD, Association and Neural Architectures Data

Parallel pipe line and symbolic architectures; vector, architecture.(Ch: 10,11, 12,13 & l4to 14.7)

UNIT — IV 15 Hrs

MIMD architectures. Multi threaded architectures — introduction, computational models, and

data flow architecture. CORBA – Distributed Systems – Purpose – Exploring CORBA

alternatives – Architecture overview – CORBA and networking model – CORBA object model –

IDL – ORB – Building an application with CORBA.

. (Ch,: 15,16.1 to 16.2, 16.4,18 and 2nd

Text Book)

Outcome : At the end of the course, student will gain knowledge in computational Model,

pipelined processing, view architecture, data parallel architecture and CORBA architecture.

TEXT BOOKS 1. Advanced Computer Architectures by Dezso Sima, Terence Fountain, Peter Kascuk, 2002.

2. Jason Pritchard,‖COM and CORBA side by side‖, Addison Wesley,2000.

REFERENCES

Advanced Computer Architectures by Kai Hwang, Mc Graw Hill, 1993.

16

M.Sc. COMPUTER SCIENCE, II Semester

2.5(b) FINITE DIFFERENCE AND FINITE ELEMENT

METHODS 4 Hrs/Week Work Load : 60 Hrs

Objective: It gives knowledge in Partial differential equations, different methods for hyperbolic

ONE and TWO space dimension, elliptic, variation principal- weighted residual methods.

UNIT-I 15 Hrs

Partial differential equations-introduction-difference methods-finite difference approximation to

derivatives-Difference methods for parabolic PDE-convergence and scalability-Solution of-

Frankel formula- Adam-Bashforth scheme-Grank-Nicholson and Lasonean ADI Method.

UNIT-II 15 Hrs

Different methods for hyperbolic PDE-One space and Two space Dimension- First order

equations-System of First order equations-Lax 0 end of explicit method-Wendroff implicit

approximations-Numerical solution by the method of characteristics.

UNIT—Ill 15 Hrs

Different methods of elliptic PDF-Difference methods for Linear boundary value problem-Five

point Formula-general second order equations-Finite difference in polar coordinates Analysis of

discrimination error of five point approximation.

UNIT-IV 15 Hrs

Variation principle-Weighted residual methods -Least. square method: partition method ;

Galerkin method, Momeñt method, and collocation method-ritz method. Finite Elements : Line

segments elements, Triangular element rectangular element-numerical Integration over finite

elements-ritz finite element method, Least square finite element method Galerkin finite element

method-Assembly of element equations. Application to initial and Boundary value problems.

Outcome: At the end of the course, student will gain knowledge in Partial differential equations,

different methods for hyperbolic ONE and TWO space dimension, elliptic, variation principal-

weighted residual methods.

SUGGESTED BOOK

M.K:JAfN: numerical solution &Ordinary& partial Differential equations

REFERENCE BOOKS

I. J.N.Reddy, Introduction To Finite Element Methods

2. Desai-and Abel Finite Element Methods

3. Zuncowitz: Finite Element Methods

17

M.Sc.(CS), II Semester

2.5(c) EMBEDDED SYSTEMS (ELECTIVE) 4 Hrs/Week Work Load : 60 Hrs

Objective: To understand Embedded System- its components, Memory System. Real time O.S.,

and its interaction with devices. It is the subject to give knowledge about Embedded System

development and programming stream.

UNIT-I: 15 Hrs

Introduction to Embedded systems – components, examples, embedded processors – 8 bits

architectures, micro controllers, JNEL processors, Motorola processors, RISC processors.

Memory systems – Technology, SRAM, EPROM, Flash, organization, polity Associations,

packing, DRAM interface DRAM refresh techniques, cache memory (Text 2: chs: 2 & 3)

UNIT-II: 15 Hrs

Peripherals – ports, timers, ATC, Serial ports, UART, DMA, interfacing to the analog world –

A/D connections, codes, power control, interrupts and exceptions – source, recognitions,

mechanisms, RISC exceptions, interrupt controllers, latency (Text 2: chs: 4, 5, 6).

UNIT-III: 15 Hrs

Real time operating system – Multi tasking, scheduling algorithms, priority inversion, tasks,

threads and processors, memory model, memory management, address translators, commercial

Operating Systems, resource protections, Linux, disk partitioning (Text 2: ch: 7)

UNIT-IV: 15 Hrs

Development of embedded system- requirement engineering, architecture and design,

implementation aspects, validation and debugging Embedded relative systems, programming

stream. (Text 1: Chs. 8, 9 10, 12)

Outcome: At the end of the course, student will gain knowledge in Embedded System- its

components, Memory System. Real time O.S., and its interaction with devices. This subject

give knowledge about Embedded System development and programming stream.

TEXT BOOKS: 1. Sree Ram V. Iyer/ Pankaj Gupta: Embedded Real time Systems Programming ,Tata Mc-Graw

Hill.

2. Steve Heath – Embedded Systems Design II Edition.

REFERENCE BOOKS: 1. M. Beack et al. Linux Kernel Internals, Pearson Education, Second Edition, 1999.

2. David E. Simnon An Embedded Software Primer, Pearson Education, 1999.

18

2.6 LAB (NETWORK PROGRAMMING)

Week 1 to Week 5:

Socket Programming System Calls Explanation

Week 6:

1. Program to Implement TCP Server

Week 7:

2. Program to Implement TCP Client

Week 8:

3. Program to Implement Connection Oriented Concurrent Echo Server

Week 9:

4. Program to Implement Connection Oriented Iterative Echo Server

Week 10:

5. Program to Implement Connection Oriented Echo Client

Week 11: 6. Program to Implement UDP Server

Week 12: 7. Program to Implement UDP Client

Week 13:

8. Program to Implement Echo Datagram Server

Week 14:

9. Program to Implement Echo Datagram Client

19

2.7 Lab- Advanced JAVA Programming

Week-1 1. Write a jdbc program to create a student table with student no., and name.

Week-2 2. Write a jdbc program to insert 2 records and update one student record.

Week-3 3. Write a jdbc program to delete a student record.

Week-4

4. Write a jdbc program to demonstrate PreparedStatement

Week-5

5. Write a jdbc program to demonstate CallableStatement

Week-6

6. Write a jdbc program to demonstrate Scrollable ResultSets.

Week-7

7. Write a jdbc program to demonstrate Batch Updations.

Week-8

8. Write a program to demonstrate RMI.

Week-9

9. Write a servlet program to demonstrate Http doGet and doPost Methods.

Week-10

10. Write a servlet program to demonstrate Sessions.

Week-11

11. Write a servlet program to demonstrate Cookies.

Week-12

12. Write a program to demonstrate life cycle of servlet.

Week-13

13. Write a jsp program to demonstrate scripting elements.

Week-14

14. Write a program to demonstrate JSP database connectivity.

Osmania University

M.Sc.(Computer Science) - III Semester 3.1- .NET Technology

4 Hrs. per week Work Load: 60 Hrs Objective: To acquire the knowledge about .net framework, objects, XML, developing

applications in Console, windows and web environments. Introducing ASP.NET, ADO.NET

with web controls and services.

Unit-I

.NET Introduction, advantages, features. .NET Frame Work – Architecture, CLR, MSIL,

JIT. C# introduction – data types, variables, constants, literals, operators, condition and

looping statements. Arrays & String operations.( I- Ch. 1,2,3,5,6)

Unit – II

Name spaces – creation, accessing, standard namespaces, versioning and inheritance. I/O

statements. Windows form controls, event handling. ADO.NET and database connectivity.

( I – Ch. 11,12, 14, 15)

Unit – III

ASP.NET – Introduction, creating web form, web controls, server controls. Web services

and windows services. IIS, AJAX technology, MVC. ( I – Ch. 18, 19, II- Ch. 25)

Unit – IV

XML – Creating XML file, reading XML document, Writing data from XML documents.

.NET Assemblies & attributes. Introduction , features and format of Crystal Reporting.

(I – Ch. 23, 24 )

Outcome:

Student gets hands on experience in Console applications, Windows applications, ADO.NET

applications, ASP.NET applications and XML documents and Crystal Report generation.

Prescribed Books

I. .NET Framework with C#, Sweeta Bansal, Apex Publishing

II. .NET 4.0 Black Book, Dreamtech Press.

Reference Book

I. Introducing Microsoft .NET, David S.Platt, PHI publications.

M.Sc.(Computer Science) - III Semester

3.2- ARTIFICIAL INTELLIGENCE 4 Hrs. per week Work Load: 60 Hrs OBJECTIVE: This course is about the theory and practice of AI, to make intelligent

decisions towards achievements of goals by using Knowledge representation, Expert systems,

Learning & Planning techniques and Neural Networks.

UNIT—I 15 Hrs.

Definition, Introduction to AT techniques. Problems, Problem spaces & search — state space

search problem, Production system, Problem characteristics.

Heuristic Search: Generate & Test, Hill Climbing, Breadth-First search, Problem reduction,

Constraint Satisfaction. Knowledge Representation, issues, representation & mapping,

approaches, issues, Frame Problem. Knowledge representation using predicate logic,

predicate logic, unification, resolution.(Ch – 1 to 5)

UNIT—II 15 Hrs.

Procedural v/s Declarative knowledge, Logic programming, Forward v/s Backward

Reasoning, matching Declarative knowledge representation. semantic nets, Frames,

Conceptual dependency, scripts, CYC.

Symbolic reasoning under uncertainty, non-monotonic reasoning, logic for nonmonotonic

Reasoning, implementation of depth-first search & breadth-first search. Statistical reasoning,

Certainty factors & rule based systems, Bayesian. networks, . Dempster-Shafer theory, Fuzzy

Logic.(Ch. 6, 8, 9, 10)

UNIT—Ill 15 Hrs.

Game playing, min-max search, alpha-beta Heuristics - refinement, iterative depending.

Planning-components -Goal tack planning - Non linear planning, hierarchical.. planning,

learning-rote learning, Learning by taking advice, fromexmp1es & explain based learning-

Connectionist models, Neural networks ,applications, natural language processing semantic

& pragmatic processing, perception. Expert system representation & using domain

know1ege, Expert system shells , Explanation knowledge acquisitions.

(Chap 12,13,15,17,18,20)

UNIT-IV 15 Hrs.

The Brain as a dynamical system, Neurons as functions, signal monotonicity, Biological

Activations & signals, Neuron fields. Theory of fuzzy sets: Definition, dilation,

Concentration, Normalization, Reasoning with fuzzy logic, Natural Language Computations,

Fuzzy Matching algorithms. (Ref. Book 1: Chap 2, 5,10& Ref. Book 3)

Outcome: At the end of the course, student is capable to understand theoretical aspects of

AI, to make intelligent decisions towards achievements of goals by using Knowledge

representation, Expert systems, Learning & Planning techniques and Neural Networks.

Prescribed Book:

1. Artificial Intelligence by Elaine Rich, Tata-McGraw Hill

Reference Books:

1. Introduction to Artificial Intelligence & Expert System by Dan.W.Patterson , Prentice Hall

of India

2. Programming in PROLOG, W.F.Clocksin&C.S.Mellish, Spinger International Student

Edition

3.Artificial neural networks by BART KOSKO.


3.3 - OBJECT ORIENTED SYSTEM DEVELOPMENT WITH UML

4 Hrs. per week Work Load: 60 Hrs Objective: A way to express the ―blueprints‖ of application system. Used to create a

requirement model using UML diagrams based on statements of user requirements.

UNIT—I 15 Hrs.

Introduction.: An overview of Object oriented system development , object basics , Object

Oriented systems development life cycle, object oriented Methodologies, Importance of

modeling , Object oriented modeling, An overview of the UML, A conceptual Model of the

UML, Software Development Life Cycleof UML, Building blocks of the UML, Rules of

the UML, common Mechanisms, UML Architecture. ( I: ch-1 to 4) ( II : ch-1 &2).

UNIT—II 15 Hrs.

Structural modeling: Classes, Relationships, Common Mechanisms, Diagrams, Class

Diagrams.

Advanced Structural Modeling : Advanced classes, advanced relationships, interfaces,

Types, Roles, Packages, instances, Object Diagrams.Case Studies. (II : ch-4 to 14)

UNIT-III 15 Hrs.

Behavioral modeling: Interactions, Use cases, Use case Diagrams, Interaction Diagrams,

Activity Diagrams. Case Studies. Advanced Behavioral Modeling: Events and Signals,

State Machines, Processes and Threads, Time and Space, State Chart Diagrams.Case

Studies. (II : ch-15 to 24 )

UNIT —IV 15 Hrs.

Advanced-Modeling: Components, Deployment, Collaborations, Patterns and Frame works,

Component diagrams, Deployment Diagrams, Systems and Models. Case Studies.

( II : ch-25 to 31).

Note:Refer TEXT BOOK I for case studies.

Outcome: At the end of the course, student is able to perform ―blueprints‖ of application

system. Used to create a requirement model using UML diagrams based on statements of user

requirements.

Prescribed Books:

I. Ali Bahrami, ―Object Oriented Systems Development‖,McGraw-Hill International

Editions.1999.

II. Grady Booch, James Rumbaugh, lvar Jacobson,

―The Unified Modeling Language-User Guide‖, Pearson Education, Addison-

Wesley, 1999

References :

I. Manual of Rational Rose.


3.4 - NETWORK SECURITY 4 Hrs. per week Work Load: 60 Hrs

Objective : This course provides the basic principles and standards of computer network

security. The course includes the conventional and public key cryptosystem algorithms.

Algorithms to provide Authentication and Digital Signatures.

Unit-I 15 Hrs.

Conventional encryption, Security attacks, Security, Model for network security,

conventional encryption model, encryption techniques, DES, Triple DES, key distribution,

random number generation. [Ch. 1,2,3]

Unit-II 15 Hrs.

Public – key cryptology, principles of public – key cryptosystems, RSA algorithm, key

management, distribution of public keys, public key – distribution of secret keys. [Ch. 9,10]

Unit-III 15 Hrs.

Authentication and digital systems, authenticate requirements – functions cryptographic

checksum, hash function, digital signatures authentication protocols, Kerberos, X-509

directory, authentication services Diffie – Hellmann key exchange, digital signature

standards. [Ch. 10,11,13,14]

Unit-IV 15 Hrs.

Cryptographic algorithms, The MD 5 message digest algorithm, Secure Hash algorithm,

international data encryption algorithm, LUCA public key encryption – Electronic mail and

management security – pretty good privacy (PGP),

privacy enhanced mail, Secure Socket Layer, Secure Electronic Transaction, Firewalls.

[Ch. 12,17,20]

Outcome: At the end of the course, student is able to perform security issues principles and

standards of computer network security. The course includes the conventional and public key

cryptosystem algorithms. Algorithms to provide Authentication and Digital Signatures.

Prescribed Book:

1. William Stallings, Network and Internet work Security, Prentice Hall of India.

Reference:

1.William Stallings, Cryptography and Network Security – Principles and Practice, Sixth

Edition, Kindle Edition.


3.5 (a) - NEURAL NETWORKS AND FUZZY LOGIC (ELECTIVE) 4 Hrs. per week Work Load: 60 Hrs Objective: It gives knowledge about Neural Networks, Fuzzy intelligence – Biological

neuron networks- learning techniques – Fuzzy sets, controls – machine learning and Hopfiled

networks.

UNIT – I

Introduction – knowledge based information processing. Neural and fuzzy machine

intelligence – fuzziness as multi valance – dynamical system approach to machine

intelligence. The brain as a dynamical system – intelligent behaviors as adaptive model free

estimation (p 2-32).

UNIT – II

Neural Dynamics – activation of signals – Neurons as function – Biological activation and

signal function plug – coded signal function (p 39 – 50). Activation models neuronal

dynamical, system - additive neuronal dynamics – additive neuronal feedback – additive

activation and Bivalent Model (p 55-73).

UNIT – III

Learning – Supervised and unsupervised statistical learning – All learning – Neural network

learning, back propagation algorithm and derivation – stopping criteria complexity of

generation (p 111-127 and 180-212).

UNIT – IV

Fuzzy Logic – Fuzzy sets and systems – universal as a fuzzy sets(p 263, 268-274). Fuzzy

and neural function estimation (p 302-307). Fuzzy and meta-model controllers – real line

target tracking – fuzzy controller – fuzzy and kalman – filter controller surfaces ( p 379-394).

Hopfiled Networks – Hopfield network algorithm. Bollizman’s machine algorithm- Neural

network and fuzzy system application (p 92, 253-255).

Outcome : Student acquire knowledge about Neural networks – Learning techniques – Fuzzy

Logic, Sets, Controls- other knowledge networks.

Prescribed Book:

1. Bart Kosko, Neural Networks of Fuzzy structures, Prentice Hall of India, 1994.

Reference Books

1. Limin Fr. Neural networks in computer intelligence, MC GRAW HILL publications,

1995.

2. James A Freeman, Similarity neural networks, Addison Wesley publications company

M.Sc.(Computer Science) - III Semester 3.5 (b) - IMAGE PROCESSING (ELECTIVE)

4 Hrs. per week Work Load: 60 Hrs Objective: To gain knowledge in Digital image representation, Image transform, Image

enhancement, Image edge and ending.

UNIT - I

Image formation and description-Digital image representation — Elements of Visual

perception — Sampling and quantisation Elements of digital image processing systems (p 1-

16 and 21-45).

UNIT – II

Image transform, Digital Image transforms — Fourier transform — Extension to 2D.DCT

Walsh, Hadamard Transforms (P 8 1-143).

UNIT - III

Image Enhancements and Segmentation — Histograms modification image smoothing —

Image Sharpening — Thresholding —Edge detection—segmentation point and region

dependent techniques (P. 162, 187, 143 —423and 443 —445). Color image processing: Color

fundamentals, color models psuedu- color image processing’— intensity slicing gray Ievel to

color transformation, filtering approach, full— color image processing .

UNIT—IV

Image ending — fidelity criteria— transform compression — K.L., Fourier, DCT spatial

compression run length coding—Hoffman coding —contour coding restoration -Restoration

models, inverse filtering— Least squares filtering - Recursive Filtering. (P.307 — 315, 343

— 358, 331 — 339, 148 — 150, 189 — 209,207—280).

Outcome: At the end of the course, student will be able to perform Digital image

representation, Image transform, Image enhancement, Image edge and ending.

Prescribed Book

1. Gonzalez R.C., Woods -R.B.,Digital Image processing, Addison Wesley, 1992.

Reference Books

1. Rosenfeld A, Kak A.C., Digital picture processing, vol. 1 & 11, Academic press,

Second Edition) 1982.

2. Fundamentals of Digital Image Processing Anil K. Jam, Printice — Hall of india

Pvt. Ltd., New Delhi.


3.5 (c ) - PARALLEL PROGRAMMING (ELECTIVE)

4 Hrs. per week Work Load: 60 Hrs Objective: To introduce Parallel computing with physical organization, design algorithms,

mapping techniques. Analytical modeling, MPI(Message Passing Interface) topologies.

Providesknowledgeon Programming shared address space. Introduction of Matrix operations,

Sorting Technique in Parallel Computing Environment.

UNIT — I

Introduction to parallel computing - Motivation, scope, parallel programming platforms —

implicit parallelism, limitations of memory system performance, dichotomy, physical

organization, communication costs, principles of parallel algorithm design — preliminaries,

decomposition techniques. (I-Ch. 1.1, 1.2, 2.1 to 2.5, 3.1, 3.2)

UNIT-Il

Tasks and interaction, mapping techniques for load balancing, methods for containing

interaction overheads, parallel algorithm models.Basic communication operations — one-to-

all broadcasts and all-to-one reduction arid all-to-all broadcast and reduction, scatter and

gather.Analytical modeling of parallel programs — performance metrics,.effect of

granularity, scalability.

(I-Ch. 3.3 to 3.6, 4.1, 4.2, 4.4, 5.2 to 5.4)

UNIT — III

Programming using message passing- building blocks, message passing interface (MPI),

Topology and embedding, non-blocking communication operations, collective

communication and computation operations. Programming shared address space — threads,

synchronization, controlling threads, read-write locks, barriers, open MP.(I-Ch. 6.2 to 6.6,

7.1, 7.4 to 7.6, 7.8, 7.10)

UNIT-IV

Dense matrix a1gorithms — matrix-vector multiplication, matrix-matrix multiplication,

solving a system of linear equations Sorting algorithms — Issues, sorting networks, Bubble

sort, Quicksort. Fast-Fourier transform — serial algorithm, binary exchange algorithm,

transpose algorithm.

(I-Ch. 8.1 to 8.3, 9.1 to 9.4, 13.1 to 13.3)

Outcome:At end of the course, student is capable of Parallel computing with physical

organization, design algorithms, mapping techniques. Analytical modeling, MPI(Message

Passing Interface) topologies. Provides knowledge on Programming shared address space.

Introduction of Matrix operations, Sorting Technique in Parallel Computing Environment.

Prescribed Book:

1. AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar — introduction to

parallel computing, second Edition, Pearson 2003.

Reference Books :

1.Grgory V. Wilson, Practical progaramm9ing, PUT 1998

2. Michael J. Quinn — Parallel Programming in C with MPI and Open MP, Tata Mc Graw

Hill.


3.6 (Lab) - . NET Technology

Week - 1

1. Write a program to print the factorial number.

2. Writea program to print Fibonacci series.

Week - 2

3. Write a program for bubble sort using arrays.

4. 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 the given 2 numbers.

Week - 3

5. Print multiplication table for the given number (using for loop).

6. Create an MDI (Multi Document Interface) form with menu controls.

Week - 4

7. Write a program to navigate the records using first, last, next, previous buttons in windows

applications.

8. Write a program with list boxes for interchanging data from one list to another list.

Week - 5

9. Create a web services with a method GetEmployeeData and call the web services from

browser.

10. Create a web services and consume that services using Proxy in web application..

Week - 6

11. Create a XML schema with emp no, name, salary, designation.

12. Create a webpage with validation controls to validate the data given in textboxes.

Week - 7

13. Create a form with Data grid and display the employee data into that using stored

procedure.

Week - 8

14. Create a webpage with a data grid view display with employee data.

Week - 9

15. Passing a value from one page to another page in web applications.

Week - 10

16. Create a virtual directory in IIS and map to local web application folder.

Week - 11

17. Create student data form with web controls to perform

a. Textboxes (Name. Age, Address, Class)

b. CheckBox (Languages Known like: Telugu, English, Hindi,

Others)

c. Radio button (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).

Week – 12 to Week – 14 : Similar programs using ADO based Windows Applications &

Web Applications.


3.7 (Lab) – System Security

Implementation of these algorithms using Java.

Week 1:

1. Program to perform the Caesar Cipher technique

Week 2:

2. Program to perform the Mono alphabetic

Week 3:

3. Program to Rail Fence Technique

Week 4:

4. Program to perform poly alphabetic cipher

Week 5:

5. Program to perform single DES-ENCRYPT Method

Week 6:

6. Program to perform single DES-DECRYPT Method

Week 7: 7. Program to perform Triple DES-ENCRYPT Method.

Week 8: 8. Program to perform Triple DES-DECRYPT Method.

Week 9:

9. Program to generate Secret/Symmetric key

Week 10:

10. Program to generate Private & Public keys

Week 11: 11. Program to encrypt and decrypt the data using RSA Algorithm.

Week 12:

12. Program to generate Message digest using MD5 Algorithm

Week 13:

13. Program to generate Message digest using SHA Algorithm

Week 14:

14. Program to implement Diffie Hellman Key Exchange Algorithm

Osmania University

M.Sc.(Computer Science) - IV Semester 4.1 - DATA WAREHOUSING AND DATA MINING

4 Hrs. per week Work Load: 60 Hrs

Objective:Having knowledge of Data Warehouse Environment, Complete Architecture &

elements of Warehouse. Data mining Techniques and Algorithms. Getting awareness on

Data Warehouse Environment and Mining Techniques.

UNIT-I

Basic elements of Data Warehouse, Dimensional Modeling: Introduction, Data Warehouse

Bus Architecture, Dimensional Modeling Techniques, Extended Dimensional Table Design,

Extended Fact Table Designs, Advanced ROLAP querying and reporting, Building

Dimensional Models. Data Warehouse Architecture: Architectural Framework and Approach,

Technical Architecture. (I-ch 1, ch 5, ch 6, ch 7, ch 8)

UNIT-II

Back Room Technical Architecture: Back Room data stores, Back Room services, Asset

Management. Front Room Architecture: Front Room data stores, Front Room services for

Data access. Aggregates: Aggregation goals and risks, Design goals for Aggregate

Navigation System, Navigation algorithm, Physical Design: Develop standards, Physical

Data Model, Initial Index Plan, Database Instance, Physical Storage Structure, Usage

monitoring, Data Staging: Dimension Table Staging, Fact Table loads and Warehouse

operations. (I- ch 9, ch 10, ch 14, ch 15, ch 16)

UNIT-III

Data mining – Introduction, definitions, KDD, Data Mining Techniques, Problems, Issues,

Challenges, Applications - Association Rules – Introduction, Methods – Apriori, Partition.

Pincer-Search, dynamic itemset counting, FP-tree growth, incremental, Border algorithms,

Clustering Techniques – Introduction, algorithms.

( II-ch 2, ch 3, ch 4, ch 5)

UNIT-IV

Decision trees – Introduction, Best Split, Splitting indices and criteria, Decision tree

construction algorithms, Pruning techniques. Neural Networks – Introduction, learning,

unsupervised learning, Temporal Mining – Introduction, temporal association rules,

sequence-mining, algorithms, episode discovery, event prediction, Time-Series analysis,

Spatial Mining – Tasks, clustering, trends. (II- ch 6, ch 7, ch 9)

Outcome: At the end of the course, student is capable to understand Data Warehouse

Environment, Complete Architecture & elements of Warehouse. Data mining Techniques and

Algorithms. Getting awareness on Data Warehouse Environment and Mining Techniques.

Prescribed Books: 1. Ralph Kimball, Laura Reeves, Margy Ross, Warren Thornthwaite – The Data Warehouse -

Life Cycle tool kit, Wiley 1998.

2. Arun K. Pujari – Data Mining Techniques, University Press 2001.

References:

1.Krish Krishnan, Data Warehousing in the Age of Big Data, Kindle Edition.

M.Sc.(Computer Science) - IV Semester

4.2 - MOBILE COMPUTING

4 Hrs. per week Work Load: 60 Hrs Objective: To impart the knowledge of mobile technology and its applications.

UNIT – I

Introduction: Application, wireless Transmission: Frequencies of radio transmission, signals,

Antennas, Signal Propagation, Multiplexing, Modulation, Spectrum, Cellular system, Media

acce3ss control: Motivation for specialized MAC. SDMA, FDMA, TDMA, Comparisons. (I-

Ch.1 to 3)

UNIT – II

Wireless LAN, Infrared Vs. radio transmission, infrastructure and ad-hoc networks, Mobile

network layer: Mobile IP, Dynamic host configuration protocol, ad-hoc Networks, mobile

transfer layer: Indirect TCP, snooping TCP, mobile TCP, fast transmit/recovery ,

transmission/timeout freezing, selective retransmission transaction oriented TCP. (I – Ch. 7 to

9)

UNIT – III

Wireless Application Protocol: WAP Architecture, components of WAP standards Design

Principles. Wireless Markup language (WML). WML basics Events, Tasks and Bindings.

(II – Ch. 6 & 7)

UNIT - IV

Tailoring content to client , Push messaging , Wireless telephony applications , Building and

deploying End-to-End WAP services. (II – Ch. 11 to 14)

Outcome: At the end of the course, student is able to understand Mobile technology,

environment and its applications.

Prescribed Books:

1. Jochen M. Schiller, Mobile communications Pearson Education 2000.

2. Sandeep Singhal, ―The Wireless Application Protocol‖, Pearson Education 2001. References:

1. Mazliza Othman, Principles of Mobile Computing and Communications

2.Koushik Sinha, Sasthi C. Ghosh, Bhabani P. Sinha, Wireless Networks and Mobile

Computing, ISBN 9781482227932, CRC net BASE.

4.3 -Distributed Systems

4 Hrs./Week 60 Hrs. work load

Objective:Provides the knowledge in distributed environment with

communication, Processes, Naming, synchronization, Fault tolerance, Security

and distributed file systems.

Unit-I 15 Hrs.

Introduction- Distributed Systems, Goals, Hardware Concepts, Software

Concepts, Client-server model. Communication – Layered Protocols, RPC,

Remote object invocation, Message oriented communication. (Ch. – 1,2)

Unit-II 15 Hrs. Processes – Threads, clients, servers, code migration, software agents. Naming

– Naming entities, locating mobile entities, removing unreferenced entities.

Synchronization –Clock synchronization, Logical clocks, global state, election

algorithms, Mutual exclusion, distributed transactions. (Ch. – 3,4,5)

Unit-III 15 Hrs

Consistency and replication – Introduction, data centric consistency models,

client-centric consistency models, distribution protocols, consistency protocols.

Fault Tolerance - Introduction to fault tolerance, process resilience, reliable

client-server communication, reliable group communication, distributed

commit, recovery. (Ch. – 6, 7)

Unit- IV 15 Hrs. Security- Introduction, secure channels, access control, security management.

Distributed Object-based systems - CORBA, COM. Distributed File

Systems –Sun network file system, the coda file system. Distributed

document-based systems – The WWW, Lotus Notes. (Ch. 8, 9, 10, 11)

Outcome:Student gains knowledge in elements of Distributed Systems.

Student should also understand different considerations to develop distributed

environment.

Suggested Reading:

Andrew S. Tanenbaum & Maarten van Steen, Distributed Systems- Principles

and Paradigms, Pearson education.

References:

I - A Text Book of DISTRIBUTED SYSTEMS, Profession Publications, First

Edition

II - George Coulouris, Jean Dollimore, Tim Kindberg, Gordon Blair –

―Distributed Systems Concepts and Design‖, Fifth Edition- Pearson Edition.

osmania university m.sc. computer science i semester 1.1

Documents