You are on page 1of 11

Osmani University offers a 2-year MSc programme in Computer Science.

This master's course is appropriate for students who wish to pursue Research interests in any area of Computer Science Teaching, work for good career in the IT industry. Many colleges in Hyderabad city offering M.Sc Computer Science under Osmania University. An important aspect of this programme is the project that students undertake in the final semester in collaboration with a wellestablished software development company. However, it is upto the student, if they want to prepare for prject themselves. There are few colleges offering Final semester project with collaboration with well establsihed software development company. The syllabus for the course, designed by Osmania University, is broad-based and provides courses of study that cover the current and future challenges in this field. The revised syllabus of Osmani University is given below. Semester I
1.1 Discrete Mathematical Structures 1.2 Modern Operating Systems 1.3 Microprocessors and Microcontrollers ----------------------------1.4 Software Engineering 1.5 Computer Graphics----------------------------------------------------1.6 LAB - Unix & Computer Graphics 1.7 LAB- Microprocessors and Microcontrollers 1 2

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---------------------------------Elective 2.6(a) Advance Computer Architecture--------------------------------2.5(b) Embedded Systems 2.6 Network Programming Lab 2.7 Client-Server Programming Lab 3 4 5 6 7

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----------------------------------------------8 9 10 11

6. 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.8 of (2) UNIT – IV Recurrence relations – – Recurrence relations characteristic roots – Section 3. PER WEEK UNIT .1.6 of TEXT BOOKS: Generating functions of sequences – calculating coefficients of generating functions – Solving recurrence relations by substitution and generating the method of Solution of inhomogeneous linear recurrence relations.Network Security 3.1. cycles etc.1 to 2.3. Section 5.12 Mobile Computing-----------------------------------------------.1 to 1..1 to 6. Sc.3. (2) . Discrete mathematical Structures 4 Hr. Euler & Hamiltoniah paths. Complete Syllabus ************************************************************************************* Semester I M.6 of (1) UNIT – II Graph Theory – Basic ideas and definitions – Planer Graphic – Connectivity – Computer representations of graphs – Directed graphs and trees – paths. Section 1.13 Academic Project. COMPUTER SCIENCE 1. 6.OOSD Semester IV DWs & DM-----------------------------------------------------.7 LAB . Section 2.1 to 3. to 3.Dijkstra‟s algorithm.Binomial coefficients – the binominal and multinomial theorem – the principle of inclusion – exclusion.3 of (1) UNIT – III Elementary Combinations –Basics of counting – combinations and permutations – their enumerations with repetitions – Engineering permutations with constrained repetitions .1 to 5.9.I Mathematical Logic and proofs – Propositions from old ones – Algorithms.6 LAB .

Allocation or frames. combined approach to deadlock handling UNIT – II Introduction. voting protocols. COMPUTER SCIENCE 1. Scheduling algorithms. deadlock prevention. demand segmentation. The critical section problem synchronization. Prentice Hall. logical clocks. directory implementation. Swapping. inherent Limitation of distributed system. NJ. thrashing. Discrete Mathematics. a Unified approach Mc Graw Hill International edition. Distributed shared memory.2 Modern Operating System 4 Hr. Operating System Structures : Architecture of distributed system. Computer Science Series. 1986. Monitors. Discrete Mathematics. Real times scheduling. CPU Scheduling: Criteria. interrupt and exception handling. Recovery from dead lock. dead lock detection. Multiple processor scheduling. issues in distributed operating system. disk management.Baker. available (if any) 2. PER WEEK UNIT – I Introduction to Operating Systems: Computer System Structure. inter process communication. commit protocols. Dead locks: System model. Critical regions.1. Sc. Discrete Mathematics for Computer Scientists and Mathematics. Basic approaches.Rosen.Stephen a Wiitala. Mc. Algorithm evaluation. Two case studies – one on Unix/ Linux / Solaris and another Windows Server. global state.Mott. Dead lock characterization. Logical versus physical address space. swap – space management. Deadlock avoidance. concurrency controls.Kenneth H. Methods of handling Dead locks. Graw Hill International Editions. multiprocessor synchronization. Abraham Kandel. access methods. other considerations. check – Fault tolerance. Process concepts. *********************************************************************************************************** **************************** M. classification of failure. directory structure and protection. 1987. file concept. secondary Storage structure. disk scheduling. REFERENCE BOOKS: 1. free space management. Theodore P. Failure recovery. disk structure. . process scheduling. new editions. system service dispatching. Atomic transactions. File system implementation: system structure allocation Methods.Joe L. UNIT – III Security: Goals of protection and security Management: Revocation of access rights. lock time safe ordering. Thread scheduling and dispatching.

KBD 8279. Buses Bus Architecture. Abraham Silberschatz and Peter B. PIC 8259. Hard Disk and Printer Controllers. resource management.3: ref.Bhurchandi TMH. Andrew S. 1994. Programming & Applications. *********************************************************************************** M. Demultiplexers. Assembler Directives. (text – 1. Floppy. Interfacing peripheral devices – PPI 8257. SMPS. 8085 – Intel 8086. COMPUTER SCIENCE 1. 3. Fifth edition.UNIT – IV System Administration commands: For – Unix / Linux / Solaris : user management. 8051 – Detailed Architecture of Single chip Micro controller – 8051.Singhal and H. 2nd Edition .Graw Hill. Decoders.3.Fundamentals of Microprocessors and Microcomputers by B.Gavilin. I/O Interrupts. (text – 1. Bus Cycle. Micro processor and Micro Controllers 4 Hr. cache controllers. process management. Addressing Modes and Instructions with simple examples. 2. DC Powder Supplies. 8085 – Evolution of Microprocessors and Digital Computers. Boolean Algebra.The 8051 Microcontroller Architecture. Timing Diagrams. 1998. (Brief Technical Descriptions). India. Only) (text – 1: Ch: 10 text 3.3. Operating System concept. Ch:2.Ram Dhanapat Rai Publicaitons (P)Ltd. Registers.Tenen Baum Modern Operating System Prentice Hall of India Easter Economy Edition.Shivarathi.Microprocessors Architecture. security management. Ch. Advanced concepts in operating system. Ch:3) Special Devices – CRT. 4. Multiplexers. Other 8 bit.K. UPS (Block diagram. Text. Intel 8085. PER WEEK UNIT I Digital System.M. (text – Ch: 7. Architecture. Interrupts.3 Ch. Gaonkar Penram Inernational Publising (India). Addressing Modes and Instructions with simple examples. D/A and A/D Converters. network management. CRT display printer. Memory Controllers. backup and recovery. scanners. Internal Memory.Number System. 16 bit and 32 bit Micro controllers (block diagram. Ch: 16. with technical information). Instruction Cycle. M.11. Logic Gate.4) UNIT – III Microprocessors. Encoders. India. Instructions with simple examples. Programming and Application with the 8-85.Ray and K. Programming and Interface by A. and Operators.G. Flags and PSW. 1. Sc. Addison Wesily Publishing Company. Registers. 8253 Counter / Timer. memory (Storage Type and Devices).4. 3. 2.13) UNIT – II Micro Processors.4) UNIT – IV Micro controllers.Advanced Microprocessors and Peripherals. Registers. Flip-Flops. Block Diagram and Operations. Mc. 2. Counters. Ref. TEXT BOOKS: 1. Text books: 1. Special Function Registers. 1998. 4th Edition Ramesh S.

Microprocessors and Interfacing.Gibson PHI. India. Leach TMH. Prog. UNIT.Ics & Microprocessors . Pressman – Software Engineering.toccl. India. 80186/188. 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. 8. Graw Hill Publishing Co. ********************************************************************************** M. Sc. Programming and Cuistomizing The 8051 Micro controller by Myke Predko TMH. and Design by Yucheng Liu and Glenn A.Ayala Penram International Publising (India).4 Software Engineering 4 Hr. Sc. 8th Edition by Ronald J.Digital Principles & Applications by – Albert Paul Malvino and Donald P. 9. Widmer Pearson Education PTe.R. India. ************************************************************************************* M. Ltd. Pentium Pro Professor Architecture. maintenance cost estimation – Software requirement specifications -formal specification techniques. Reference: Books: 1. India 5. Reference Books and Data books: 1.Data Hand Book BPB Publications. India. 3. UNIT – II Software cost estimation. Neal S.by Kenneth J. 1987. Anand Kumar PHI. India.Fundamentals of Digital Circuits by A. 7. Microprocessor Systems – The 8086/8088 Family. COMPUTER SCIENCE 1. India. Programming and Interfacing 4th Edition By – Barry B. India 2. Programming and Hardware By Douglas V.Facles – Software Engineering. India. TEXT BOOKS: 1. Arch.Hall TMH. Mc. Mc. 1986. The Intel Microprocessors 8-856/8088.5 COMPUTER GRAPHICS . The 8051 Microcontroller and Embedded systems by Muhammed Ali Mazidi. 6. Least factor – cost estimation techniques.Digital Systems Principal and Applications. COMPUTER SCIENCE 1. 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. Ltd.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.RS.Brey PHI. Graw Hill publishing Co. Janice Gillispie Mazid person Education Pte. 4.

Boundary fill. Graphics software. plane Equations. weiler Autherton polygon clipping. Transformation on 2-D composite objects . Bresenhan line Algorithm. PER WEEK UNIT – I a) Shell Programming 1. Process communication using signals 8. Reference Books: 1. UNIT – III Two – dimensional viewing : Viewing – pipeline. graphic input devices. Midpoint circle Algorithm. PER WEEK UNIT – I A survey of computer graphics. To convert upper case to lower case letters of a given ASCII file UNIT – II Computer Graphics (using C) 9. COMPUTER SCIENCE 1. Area subdivision Algorithm. UNIT – IV Three dimensional objective representations. Random scare systems. plygon tables. Rotaiton. octrees. Prentice Hall of India Second Edition 1995. 1987. cubic Berier curves. Curve Attributes. Ellipse Algorithm. B-spline. To wish „Good morning‟ and good evening‟ depending on the time b) Programmes Using System Calls: 5. Polygon filling using scan conversion method 13. Rotations about a arbitrary point Projections: Perspective projections and parallel projections Visible surface detection: Back faced detection: Z-buffer Algorithms Depth sorting Algorithm. To identify the type of a given file 3. 3D – transformations : Translation. Area fill and character Attributes Two dimensional transformations: Basic transformations. : Scar – line. TEXT BOOKS: 1.6 (LAB UNIX AND COMPUTER GRAPHICS) 6 Hr. Implementation of Cp(Copy) command of UNIX 6. windows to view coordinate transformation Clipping Operations: Cohen – Sutherland line clipping liang – barsky lion clipping. Mc. composite transformation. homogeneous representation. Sc. Circle and eclipse drawing algorithms – parametric and Bresenham‟s method 11. Floodfill Algorithms.M. Computer Graphics. Nicholl-Lee Nicholl – Line Clipping – Hodgman polygone clipping. them and „if‟ Loop 2. To create a child process using fork ( ) and exce ( ) system calls 7. Video Display devices. polygon surfaces. reflection and shear transformation.Computer Graphics by Harinton. overview of graphic systems. Raster Sean systems.4 Hr.Pauline Baker.Graw Hill Publishing Co. Line drawing algorithms – DDA and Bresenham‟s method 10. Polygon fill Algorithms. Inter process communicating using pipes 4.Output Primitives: LineDrawing Algorithms DDA. Hard copy devices. C-Version. UNIT – II Attributes of output primitives: Line Attributes. Using „case‟. ********************************************************************************** M. Algorithm for polygon inside tests and testing convexity 12.

4. Find Largest and Smallest Number in Data Array/from a Series of Numbers\ 3. Flip – Flops 2. Direct and Indirect Bank Register Addressing 4. To Generate Waveforms of – Sawtooth.14. RAM Direct addressing 5. Verification of The Logic Gates. Arithmetic Operations 3. Sc. Find Square and Square root of a number 4. Write a Program to generate a Delay of 100 ms. String Operations. by Interfacing DCA By using – 8086 Kit. Display the Message “………………” on the Monitor. Setting up UMPS and getting a program to assemble 2. *********************************************************************************** M. Subtraction. 100 sec. Interfacing a Stepper Motor. Bezier curves drawing. COMPUTER SCIENCE 1. 6. Addition. Multiplication and Division 2. Ch. 2. Sine. using One. 5. Ch. Triangular. Mux / Demux 3. PER WEEK UNIT – I Digital Systems: 1. To Generate a Square Wave of Pulse (text – 1. Write a Delay Subroutine Program. Fine Ones and Two‟s complement of a number 3. DEBUG of DOS utility. MICROPRECESSORS AND MICROCONTROLLLERS 6 Hr. Speed of a Motor (using a Tacho generation) 8. Two or More Registers 7. 1 minute and 10 minutes 6.9) UNIT – III Microprocessors – 8086 1. Encoder / Decoder. Design of Counters UNIT – II 1.7 LAB – DIGITAL SYSTEMS. MASM or TASM. State Machines Experiments with Universal Microprocessor Program Simulator (UMPS) (Ref: -9. with forward and Reverse Steps 9. Find Largest and Smallest Number in Data Array / form a Series of Numbers 5. Pulse. 3 – D transformation on a cube 17. Measurement of Physical Quantities of – Temperature.9) ********************************************************************************** . UNIT – IV 1. Multiplication and Division of the given Operands. To Arrange a Data / a Series of Number in Ascending and Descending Order 6. Addition. Polygon clopping using Sutherland – Hodgman method 16. Subtraction. Line clipping algorithms – Sutherland – Hodgman method 15. To Arrange a Data Array/ a Series of numbers in Ascending and Descending order. Subroutines 6.

C. Queuing Theory: Queuing system and characteristics of a queue. per week .W. Fourth Edition. 2. Initial basic feasible solution by North – West Corner rule. COMPUTER SCIENCE 3. Taha. Optimum solution by modified distribution method. Montogemery. Operations Research and Introduction Prentice Hall of India New Delhi(1998). sampling distribution and standard error t. Hamdi A. t. Use of artificial variables and special cases in simplex algorithm. REFERENCE BOOKS: 1. Uniform. variance (s) and proportion (s) and goodness of fit test based on Z. Assignment Problem (AP): Formulation of its as LPP.. F and Chi – square distributions. K. Addition and Multiplication rules of probability. parallel and K – out of n systems. Testing of hypotheses – Tests of mean (s). Kedarnath and Ramnath and Co. Binomial. ************************************************************************************* 3. TEXT BOOKS: 1. C. Prentice Hall of India.1 QUANTITATIVE TECHNIQUES 4 Hr. Trivedi. Poisson. System reliability of series. Reliability : Concept of reliability . 2. Definition of dual problem and economic interpretation of duality. cumulative distribution function and Mathematical expectation of a random variable. and Borror. D. UNIT IV: Transportation Problem(TP) : Formulations of it as LPP. probability density function. (2002). Normal. Asia Private Limited(2003).Semester III M. Solution of LPP by simplex algorithm.. S. Conditional Probability and Bayes Theorem . UNIT III: Linear Programming Problem (LPP) : Formulation and solution by Graphical method of LPP. F and Chi – square distributions. Hines. W. Sharma. failure density and Hazard function. Consistency and efficiency Methods of maximum likelihood and moments. Dual simplex method.D: Operations Research. Exponential and Gamma distributions. Queuing and Computer Applications.M. Interval estimation and confidence limits of parameters of normal distribution.S: Probability and Statistics with Reliability. Optimum solution by Hungarian Method.SC. probability mass function. Concepts of sample.2 ARTIFICIAL INTELLIGENCE 4 Hr. Statistical and axiomatic definitions of Probability. Mean and variance of these distributions. New Delhi(1999). M/M/1 queuing system without proofs. D. UNIT II: Statistical Inference: Estimation of Parameters – Unbiasedness. Standard LPP form and its basic solutions. per week UNIT I: Probability models: Mathematical. John Wiley and Sons. Goldsman.M: Probability and Statistics in Engineering. Discrete and continuous random variables. Least cost and Vogel‟s approximation methods.

Symbolic reasoning under uncertainty-Non-monotonic reasoning – Implementation of depth-First search and Breadth first search Statistical reasoning. Hill climbing – Breadth – First search. Prentice Hall of India. Artificial Intelligence by Elanine Rich. ************************************************************************************* 3. spinger International Student Edition. Theory of Fuzzy sets.F. Dan. explain based learning – connectist models – Neural networks. TEXT BOOKS: 1. problem reduction. Unit II Procedural versus declarative knowledge-Logic Programming-Forward versus backward reasoning-matching declarative knowledge representation-Semantic NetsFrames-Conceptual dependency Scripts. Expert System Representation and using domain knowledge – Expert system shells – Explanation Knowledge acquisitions. Constraint satisfaction knowledge representation issues – representation and mapping-approaches-issues-the frame problem – knowledge representation using predicate logic – predicate logic. Unit III Game playing-minmax search-alpha-beta heuristics-refinement intertive depending planning-Components-Goal stack planning-Nonlinear planning – hierarchical planning-Learning-Rote learning-Rote learning – Learning by taking advice – Learning from examples. Programming in PROLOG.Patterson. Biological activations and signals. signal monotonicity. Neurons as functions. unification. Certainty Factors and rule based systems-Bayesian Networks – Dempster Shafter Theory – Fuzzy logic. Neurons as functions. Mc Graw Hill Book Company. introduction to AI techniques Problems Problem spaces and search-state space search problem-production system-problem characteristics-Heuristic search – Generate and test.F. . resolution. Hill climbing – Breadth – First search. Semantic and pragmatic processing perception.CLICKSIN and C.Unit I Artificial Intelligence-Definition. REFERENCE BOOK: 1.CLICKSIN and C. reasoning with fuzzy logic.S. Theory of Fuzzy sets. Symbolic reasoning under uncertainty-Non-monotonic reasoning – Implementation of depth-First search and Breadth first search Statistical reasoning. applications Natural Language processing. W. normalizatization. Unit IV The brain as a dynamical system. CYC. Neuron fields. Definition dilation. TEXT BOOKS: 1.MELLISH. 2. Unit IV The brain as a dynamical system. reasoning with fuzzy logic. natural language computation. spinger International Student Edition. Unit III Game playing-minmax search-alpha-beta heuristics-refinement intertive depending planning-Components-Goal stack planning-Nonlinear planning – hierarchical planning-Learning-Rote learning-Rote learning – Learning by taking advice – Learning from examples. explain based learning – connectist models – Neural networks. unification. CYC. concentration. Neuron fields. Fuzzy Maching algorithms. natural language computation.MELLISH. Unit II Procedural versus declarative knowledge-Logic Programming-Forward versus backward reasoning-matching declarative knowledge representation-Semantic Nets-Frames-Conceptual dependency Scripts. signal monotonicity. Certainty Factors and rule based systems-Bayesian Networks – Dempster Shafter Theory – Fuzzy logic. Programming in PROLOG. syntax. concentration. W. Fuzzy Maching algorithms.W. syntax. Introduction to Artificial Intelligence and Expert System. Biological activations and signals.S. problem reduction. Definition dilation. normalizatization. Expert System Representation and using domain knowledge – Expert system shells – Explanation Knowledge acquisitions. resolution.2 ARTIFICIAL INTELLIGENCE 4 Hr. per week Unit I Artificial Intelligence-Definition. applications Natural Language processing. Constraint satisfaction knowledge representation issues – representation and mappingapproaches-issues-the frame problem – knowledge representation using predicate logic – predicate logic. introduction to AI techniques Problems Problem spaces and search-state space search problem-production system-problem characteristics-Heuristic search – Generate and test. Semantic and pragmatic processing perception.

building blocks. 3. Anshul Gupta. mapping techniques for load balancing. Artificial Intelligence by Elanine Rich. Unit III Programming using message passing . effect of granularity. communication costs.Patterson. dichotomy. Mc Graw Hill Book Company. William Stallings. (Page 110-228 from text book). Model for network security. Prentice Hall of India. hash function. principles of public – key cryptosystems. ************************************************************************************* M. Geroge Karypis. OpenMP. collective communications and computation operations. non-blocking communication operations. COMPUTER SCIENCE 3. scatter and gather. controlling threads. distribution of public keys. quicksort. scope.2. 538-560) TEXT BOOK: 1. Sorting algorithms – Issues. public key – distribution of secret keys. *********************************************************************************** M. key distribution. international data encryption algorithm. digital signatures authentication protocols. Analytical modeling of parallel programs – performance metrics. Unit IV Cryptographic algorithms. conventional encryption model. 1 to 109 from text book). Basic communication operations – one-to-all broadcast and all-to-one reduction and all-to-all broadcast and reduction. key management. Dan. Introduction to Artificial Intelligence and Expert System. Privacy enhanced mail. Encryption Techniques. Practical Programming. Michael J. (Pages 23 – 331 of text books) Unit IV Dense matrix algorithms – matrix-vector multiplication.4 NETWORK SECURITY Unit I Conventional encryption. random number generation. Pearson 2003. synchronization. methods for containing interaction overheads. read-write locks. Vipin Kumar – Introduction to Parallel Computing. * Polyalphabetic Ciphers * Transposition techniques * Hill Ciphers * Playfair Ciphers . REFERENCE BOOK: 1. Unit III Authentication and digital systems. binary exchange algorithm. Unit II Public – Key cryptology. decomposition techniques. transpose algorithm. RSA algorithm. secure hash algorithm. Triple DES. PHI 1998. Security attacks. matrix-matrix multiplication. ************************************************************************************** M. digital signature standards. Diffie – Hellman key exchange. physical organization. Prentice Hall of India. TEXT BOOKS: 1. Programming shared address space – threads. Quinn – Parallel Programming in C with MPI and OpenMP.SC. Topology and embedding. x-509 directory. barriers. DES. solving a system of linear equations. scalability. COMPUTER SCIENCE 3. Fast-Fourier transform – serial algorithm.5(C) PARALLEL PROGRAMMING (Elective) 4 Hr.6 Lab – System Security Lab Network Security Practical Implementation of these Algorithms in Java or C/C++ A. bubblesort. sorting networks.W. authentication services. Tata McGraw Hill. parallel programming platforms – Implicit parallelism. Network and Internet work Security. message passing interface (MPI).SC. limitations of memory system performance. Second Edition. (Pages No. Unit II Tasks and interaction. per week Unit I Introduction to parallel Computing – Motivation. parallel algorithm models. COMPUTER SCIENCE 3. encryption techniques. authenticate requirements – functions cryptographic checksum. LUCA public key encryption – Electronic mail and management security – pretty good privacy (PGP). Security. Kerberos. The MD 5 message digest algorithm. (Pages 337-416.Wilson. Gregory V. Ananth Grama. REFERENCE BOOKS: 2.Sc. principles of parallel algorithm design – preliminaries.

Firewall installation & Configuration on Networking O.* Monoalphabetic Ciphers * DES (Data Encryption Standard) Encryption * Double DES * Triple DES B. Public Key Cryptography using RSA * Key Generation * Encryption & Decryption Techniques * Diffie – Hellman key Exchange * Hash Function * Kerboros ( Client & Server ) in Network * MD5 (Message Digest Algorithm) * Secure hash Algorithms(SHA) * Pretty Good Privacy function(services) * Authentication * Confidentiality * Cipher block chaining mode(CBC) * Electronic code book mode(ECB) * Cipher feedback mode * Digital Signature Algorithms * Message Authentication code * Hash message authentication code * Secure Multi purpose Internet mail Extension(S/MIME) * Envoloped Data * Signed Data * Clear Signing * Internet Data Encryption Algorithms * Encryption * Decryption C.S such as Linux Server System .