# M.Sc (Computer Science), Osmania University

Hello Friends,

This article is about the syllabus of M.Sc (cs). M.Sc in Osmania University is a very good choice. Because the course is very effective and it covers all necessary subjects. Only B.Sc with Mathematics or Computer Science candidate eligible for entrance test. It is a two year course i.e., 4 semesters. I had tried many times to search the syllabus for this course on Internet. But I did not find any information. Actually, before taking admission, I want to check the syllabus. However, I did not find any resource or information about the syllabus. I think it is important for some students who are planning to take admission in M.Sc (cs).

Here is the complete Syllabus of all semesters.

********************************************************************************

OSMANIA UNIVERSITY

Semester I

**********

Discrete Mathematical Structures

Modern Operating Systems

Microprocessors and Microcontrollers

Software Engineering

Computer Graphics

LAB - Unix & Computer Graphics

LAB- Microprocessors and Microcontrollers

Semester II

***********

2.1 Automata, Languages, and Computation

2.2 Client Server Programming (using Java)

2.3 Computer Networks and Internet Protocols

2.4 Design and Analysis of Algorithms

2.5 Embedded Systems

2.6 Network Programming Lab

2.7 Client-Server Programming Lab

Semester III

************

3.1 Quantitative Techniques

3.2 Artificial Intelligence

3.3 Object Oriented System Development with UML

3.4 Network Security

3.5 Parallel Programming

3.6 LAB - Network Security

3.7 LAB- OOSD

Semester IV

***********

Project

********************************************************************************

Semester I

1.1. Discrete mathematical Structures

4 Hr. PER WEEK

UNIT - I

Mathematical Logic and proofs – Propositions from old ones – Algorithms, Truth Tables

and Tautologies – Equilent Propositions – the conditional and biconditional – argument

and proofs 0 predicate Logic – Logical 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

Graph Theory – Basic ideas and definitions – Planer Graphic – Connectivity – Computer

representations of graphs – Directed graphs and trees – paths, cycles etc.- Dijkstra’s

algorithm. Euler & Hamiltoniah paths.

Section 5.1 to 5.6, 6.1 to 6.3 of (1)

UNIT – III

Elementary Combinations –Basics of counting – combinations and permutations – their

enumerations with repetitions – Engineering permutations with constrained repetitions -

Binomial coefficients – the binominal and multinomial theorem – the principle of

inclusion – exclusion.

Section 2.1 to 2.8 of (2)

UNIT – IV

Recurrence relations – 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 inhomogeneous linear

recurrence relations.

Section 3.1. to 3.6 of (2)

Text Books:

Discrete Mathematics - A unified Approach By Stephen A Witala, McGraw Hill International Edition

Discrete Mathematics for Computer Scientists and Mathematics By Abraham Kandel, Prentice Hall

Reference:

Discrete Mathematics By Kenneth H Rosen, McGraw Hill International Edition

********************************************************************************

1.2 Modern Operating System

4 Hr. PER WEEK

UNIT – I

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 clocks, global state, Distributed shared

memory, Process concepts, process scheduling, inter process communication.

CPU Scheduling: Criteria, Scheduling algorithms, Multiple processor scheduling, Real

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

Critical regions, Monitors, Atomic transactions.

Dead locks: System model, Dead lock characterization. Methods of handling Dead

locks, deadlock prevention, Deadlock avoidance, dead lock detection.

Recovery from dead lock, combined approach to deadlock handling

UNIT – II

Introduction, Logical versus physical address space.

Swapping. Allocation or frames, thrashing, other considerations, demand segmentation.

Thread scheduling and dispatching, interrupt and exception handling, system service –

dispatching, multiprocessor synchronization, file concept, access methods, directory

structure and protection.

File system implementation: system structure allocation Methods, free space

management, directory implementation, secondary Storage structure, disk structure, disk

scheduling, disk management, swap – space management.

UNIT – III

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 – Fault tolerance, commit

protocols, voting protocols, concurrency controls, lock time safe ordering.

UNIT – IV

System Administration commands:

For – Unix / Linux / Solaris : user management, resource management, network

management, security management, process management, backup and recovery.

Text Books:

Modern Operating Systems By Andrew S Tanenbaum, Prentice Hall

Advanced Concepts in Operating System By M Singhal & H G Shivarathri, McGraw Hill

Operating System Concepts By Abraham Silberschatz & Peter Galvin, Addison Wesley

********************************************************************************

1.3. Micro processor and Micro Controllers

4 Hr. PER WEEK

UNIT I

Digital System- Number System, Logic Gate, Boolean Algebra, Flip-Flops, Registers,

Encoders, Decoders, Multiplexers, Demultiplexers, Counters, D/A and A/D Converters,

DC Powder 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 Devices), 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, 8085 – 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 – Ch: 7,11, 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 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, Ch:3)

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

Controllers, cache controllers, CRT display printer, scanners, (Brief Technical

Descriptions).

Text books:

1.Fundamentals of Microprocessors and Microcomputers by B.Ram Dhanapat Rai

Publicaitons (P)Ltd, India.

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

Edition Ramesh S. Gaonkar Penram Inernational Publising (India).

3.Advanced Microprocessors and Peripherals, Architecture, Programming and

Interface by A.K.Ray and K.M.Bhurchandi TMH, India.

4.The 8051 Microcontroller Architecture, Programming & Applications, 2nd Edition

by Kenneth J.Ayala Penram International Publising (India).

Reference Books and Data books:

1.Digital Systems Principal and Applications, 8th Edition by Ronald J.toccl, Neal S.

Widmer Pearson Education PTe, Ltd, India

2.Digital Principles & Applications by – Albert Paul Malvino and Donald P, Leach

TMH, India.

********************************************************************************

1.4 Software Engineering

4 Hr. PER WEEK

UNIT – I

Introduction to Software Engineering project size and its categories planning a software

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

UNIT – II

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

estimation – Software requirement specifications -formal specification techniques.

UNIT- III

Software Design – Fundamental design concepts and relations o Modularization –

Module design techniques – detailed design consideration – Implementation issues –

Structures coding techniques – coding style – standards and guidelines – Documentation

– verification and validation techniques – quality assurance – walk through and

inspection – testing – format verification.

UNIT – IV

Software tools – overview of CASE – Software reliability – Software errors – Faculty –

Repairs and availability – Software maintenance – Management aspects of maintenance –

maintenance tools and techniques.

TEXT BOOKS:

1.RS. Pressman – Software Engineering. Mc. Graw Hill publishing Co. 1987.

Reference: Books:

1.R.Facles – Software Engineering, Mc. Graw Hill Publishing Co. 1986.

******************************************************************

1.5 COMPUTER GRAPHICS

4 Hr. PER WEEK

UNIT – I

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

Raster Sean systems, Random scare systems, graphic input devices, Hard copy devices.

Graphics software.

Output Primitives: Line-Drawing Algorithms

DDA, Bresenhan line Algorithm, Midpoint circle Algorithm, Ellipse Algorithm,

Polygon fill Algorithms, : Scar – line, Boundary fill, Floodfill Algorithms.

UNIT – II

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

Attributes

Two dimensional transformations: Basic transformations, homogeneous representation,

composite transformation, reflection and shear transformation.

UNIT – III

Two – dimensional viewing : Viewing – pipeline, windows to view coordinate

transformation

Clipping Operations: Cohen – Sutherland line clipping liang – barsky lion clipping,

Nicholl-Lee Nicholl – Line Clipping – Hodgman polygone clipping, weiler Autherton

polygon clipping.

UNIT – IV

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

Equations, cubic Berier curves, B-spline, octrees.

3D – transformations : Translation, Rotaiton, Rotations about a arbitrary point

Projections: Perspective projections and parallel projections

Visible surface detection: Back faced detection: Z-buffer Algorithms Depth sorting

Algorithm, Area subdivision Algorithm.

TEXT BOOKS:

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

Edition 1995.

Reference Books:

1.Computer Graphics by Harinton, Mc.Graw Hill Publishing Co. 1987.

******************************************************************

1.6 (LAB UNIX AND COMPUTER GRAPHICS)

6 Hr. PER WEEK

UNIT – I

a) Shell Programming

1. Using ‘case’, them and ‘if’ Loop

2. To identify the type of a given file

3. Inter process communicating using pipes

4. To wish ‘Good morning’ and good evening’ depending on the time

b) Programmes Using System Calls:

5. Implementation of Cp(Copy) command of UNIX

6. To create a child process using fork ( ) and exce ( ) system calls

7. Process communication using signals

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

UNIT – II

Computer Graphics (using C)

9. Line drawing algorithms – DDA and Bresenham’s method

10. Circle and eclipse drawing algorithms – parametric and Bresenham’s method

11. Algorithm for polygon inside tests and testing convexity

12. Polygon filling using scan conversion method

13. Transformation on 2-D composite objects

14. Line clipping algorithms – Sutherland – Hodgman method

15. Polygon clopping using Sutherland – Hodgman method

16. 3 – D transformation on a cube

17. Bezier curves drawing.

******************************************************************

1.7 LAB – DIGITAL SYSTEMS, MICROPRECESSORS AND MICROCONTROLLLERS

6 Hr. PER WEEK

UNIT – I

Digital Systems:

1. Verification of The Logic Gates, Flip – Flops

2. Encoder / Decoder, Mux / Demux

3. Design of Counters

UNIT – II

1. Addition, Subtraction, Multiplication and Division

2. Fine Ones and Two’s complement of a number

3. Find Square and Square root of a number

4. Find Largest and Smallest Number in Data Array / form a Series of Numbers

5. To Arrange a Data / a Series of Number in Ascending and Descending Order

6. Write a Delay Subroutine Program, using One, Two or More Registers

7. Measurement of Physical Quantities of – Temperature, Speed of a Motor (using a

Tacho generation)

8. Interfacing a Stepper Motor, with forward and Reverse Steps

9. To Generate a Square Wave of Pulse

(text – 1, Ch; 6,9)

UNIT – III

Microprocessors – 8086

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

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.

5. Write a Program to generate a Delay of 100 ms, 100 sec, 1 minute and 10 minutes

6. To Generate Waveforms of – Sawtooth, Triangular, Pulse, Sine, by Interfacing

DCA

By using – 8086 Kit, DEBUG of DOS utility, MASM or TASM.

UNIT – IV

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)

Good job! you saved me a more time! you guy mean so much to me and i appreciate your support so much!

I was searching MSc in Computer Science at Osmania University.

Thanks