P. 1


|Views: 2|Likes:
Published by Prashant Jain

More info:

Published by: Prashant Jain on Sep 26, 2013
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Syllabus Prescribed For M.Sc.

Computer Science
Session 2010-2011 & Onwards Two years Full-Time Program Department of Mathematics and Computer Science Rani Durgavati University, Jabalpur.
M.Sc.( FirstSemester ) S.No. Title of the Paper 101 Computer Organization & Assembly Language 102 Programming and Problem Solving through C++ 103 Discrete Structure 104 Numerical and Statistical Analysis 105 Communication Skill & Job oriented Training Program Remark TH & PR TH & PR TH TH & PR TH TH +PR+ Sess. 40+25+10 40+25+10 40+10 40+25+10 40+10

Total M.Sc.( Second Semester ) S.No. Title of the Paper 201 Data And File Structure using C++ 202 System Programming using Linux 203 Computer System Architecture And Parallel Processing 204 Design and Analysis of Algorithms 205 Java Programming


Remark TH TH & PR TH & PR TH TH & PR Total

TH+PR+ Sess. 40+10 40+25+10 40+25+10 40+10 40+25+10 325


Virtual Memory (Address Space and Memory Space) Optical Memories (CD-ROM. subroutines. Memory Hierarchy. Symbolic and Numeric Manipulations and I/ O. Architecture of 8086/8088 Microprocessor. Counters (Binary. SOP (Sum of Products) and POS (Products of Sum) forms. Magnetic Tapes. CPU Registers. Use of Assembly language. Addressing Modes & Instruction Formats of 8086/8088. The Loop and Loop-Handling Instructions. Marks 16 Unit-I: Basic Building Blocks of Computers:. Ripple). Memory Connection to CPU. Direct. Sequential Circuits.. down.Sc. D. Binary codes-BCD. Unit. Subtractors. Unit – II Page No. Read/write Operation).Types and Organizations. Software model of 8086/8088 Microprocessor. Octal & Hexadecimal Numbering systems and their inter-conversion. Auxiliary Memory (Magnetic disks. Logic Diagrams of Boolean Expressions. Associative Memory (Hardware Organization. Logic. Moris Mano : Computer System Architecture. Cache Memory( Associative. Alphanumeric Representation. Data Transfer. – 101 Computer Organization & Assembly Language Max. ROM. Evolution of Computer Systems. Classification of Computers. Unit-III: Memory Organization:. Shift and Rotate Instructions. The Instruction set of 8086/8088. 2 .). RAID etc. up. DVD-ROM etc. Unit – III Page No. WROM. Decoders etc.IV Page No. Logic Gates. T). Data Representation in Computers Binary. Arithmetic. Unit-II: Basic Computer Organization:.Block Diagram. Match Logic. Input-Output Interface. Direct Memory Access).Concepts of Boolean Algebra. Semiconductor Main Memory RAM. Set-Associative Mapping). Jump Instructions. Error detection and correction codes. Multiplexers. 381-423. Instructions for specific programs for typical problems like table Search. Introduction to Microprocessor. Text Books: 1.). Unit-V: Introduction to 8086/8088 Programming:- Program Structure of 8086/8088 Assembly Language Program. Gray. Adders. Combinational Circuits. Input-Output Processor(IOP).M. JK. M. 67-69. Interrupt driven Input/output. Minimization Techniques. 445-483. Registers (Shift Register). 1-58. Fixed Point and Floating representation of numbers. Flag Control Instructions. EBCDIC. Unit-IV: I/O Organization & Overview of 8086 CPU:.Commonly used Peripheral Devices. Flip-Flops (SR. Input-Output Techniques (Programmed Input/output. PHI Unit-I page No. Format of Assembler Instruction. Complements. String and String-Handling Instructions. Parity. Marks 40 Pass. Compare Instructions. Subroutines and Subroutine-Handling Instructions.

Hardware & Application. Dhanpat Rai & Sons. 3 . 2. 3. Peter Norton : Assembly Language for the PC. PHI. 4. Triebel and Avtar singh: 8088 and 8086 Microprocessors Programming. Andrew S. TMH. PHI. 7. Tanenbaum : Structure Computer Organization.Software. 6. Willam Stallings: Computer Organization and Architecture. PHI. Watter A. Albert Paul Malvino : Digital Principles. Ram: Microprocessors & Microcomputer. B. 5. Yu-Cheng-Liu & Gibson : Microcomputer system. Interfacing. John P. Reference Books: 1. The 8086 family.2. Hayes: Computer Architecture and Organization McGraw-Hill.

The unix system interface. representation of algorithm. formatted output. C Programming Language Dennis Ritchie IInd ed.H.P. Arrays of structure. wait( ). Dromey (P. Bitwise operators.Sc.down. Text Books: 1.C functions. line input and output. pointers to structure self-referential structure. UNIT-IV :. Assignment operators and expressions conditional expressions.Basics of structures. close. create. input and output. Relational and logical operators. Arithmetic operators. Top. Unix by stephen Prata (B. precedence and order of evaluation on. variable and arithmetic expressions.1994 2. Pointers and addresses arithmetic.I). Marks 40 Pass. Recursion. Low level I/O Read and write open. Random access & lseek.M. UNIT-V:. Publication) 4 . multidimensional arrays.H. unions Bit-fields. Block structure initialization.1994 References Books:1. Unix system calls. for R ( ). structure and functions.G. initialization of pointer arrays command line arguments. Header files Static variables. Adv. type conversion. How to solve it by Computer by R. UNIT-II:-Introduction to C language. example exercise involving the use of above Unix system calls. Register variable. input scanf file access error Handling stderr and exit.B. Increment and decrement operators. Bottom up approaches for problem solving. Marks 16 UNIT-I:. print I/O formatted. Basics of function and functions returning Non integers. pointers to functions. Divide and conquer principles. file descriptors. stepwise refinement. signal ( )etc. external variables. – 102 Programming and Problem Solving through C++ Max. Algorithm for sorting and searching and Merging lists. unlink.Techniques of Problem solving. Algorithm Development. (P.II). Table look-up Typed if. UNIT-III:. C control statement. Simple exercises. scope Rules. symbolic constants Declaration.

Paths and Circuits: Isomorphism. Manohar. Well formed formulas. Unit-IV: Graph Theory: Introduction and Applications of graphs. examples.. Sub-lattices. Sub-algebra. Boolean algebra.L. Lattices as algebraic systems. Conjunctive normal forms. – 103: Discrete Structure Max. McGraw Hill Book Co. Lattices as partially ordered sets. Disconnected graphs and Components. Disjunction. 2. Duality law. Tremblay and R. and its Properties. Pendant vertex and Null graph. Direct product and Homomorphism. 5 . Elements of Discrete Mathematics. Operations on graphs. Principal conjunctive normal forms. Tautologies. Negation. McGraw Hill Book Co.P. Unit-II: Normal forms. Rank and nullity of a graph. Walks. Marks: 40 Pass. Hamiltonian paths and Circuits. Values of Boolean expressions. Discrete Mathematical Structures with Applications to Computer Science. Connected graphs. Equivalence of formulas. Boolean forms. Conjunction. Principal disjunctive normal forms. Direct product and Homomorphism. Tautological implications. J. Some properties of lattices. Sub-graphs.Sc. Lattices: examples. S. Connectives. 2. Paths and Circuits. Tata McGraw Hill Ed. Unit-III: Some special lattices. examples. PHI. Discrete Mathematics – A Unified Approach. Isolated vertex. Disjunctive normal forms. Marks: 16 Unit-I: Mathematical Logic. Graph Theory with Applications to Engineering and Computer Science. Liu. Conditional and Bi-conditional. Trees. and III). Incidence and Degree. Reference Books: 1. II. Narsingh Deo. Boolean functions. Spanning trees. minterm and maxterm. Witala.M. Unit-V: Euler graph: Introduction. Pendant vertices in a tree. 1995 (For Units IV and V). C. Text Books: 1. Statement formulas and truth tables. 2003 (For Units I. Rooted and Binary trees.

Unit-V: Numerical Solution of the differential equations. Finite difference analogues of partial differential equation in Laplace form.. Hermite Interpolation. Picard method. Numerical Methods for Scientific and Engineering Computational. Newton Raphson and Muller method for real and complex roots. and Kapoor. Solution by five point formula. Gauses chebyshew method. Polynomial curve fitting. . F test for homogeneity of two variances. Binomial & Poisson distributions. point and interval estimates. Predicter Corrector method. Least square Approximation. Ltd. Chand & Co. S.S. Continuous probability distributions: Exponential and normal distributions (for all prob. errors.104 Numerical and Statistical Analysis Max. Eigen values and Eigen vectors . Taylor series method. S. Gauses Legendre method. Objectives. Numerical integration. Mathematical Statistics. Correlation & regression coefficients & lines.R. Chi-square for independence of two attributes (mXn) table & goodness of fit.M. Bivariate Interpolation. Iyengar. Solution of algebraic and transcendental equations. S. Jacobi and House hold method. New Delhi.K. M. Testing of hypothesis. Simpson rule. Method based on undetermined coefficients. Sastry. Euler method. Distributions simple properties & applications).K. Gupta S. . Unit-III: Floating point arithmetic.tests for variables. Testing of single and two mean z and T. Marks 16 Unit-I: Probability Distributions and Statistical Inference. ADI. Prentice Hall of India. Cubic Spline method. Fitting of a regression plane. Discrete Probability distribution. Willy Eastern Ltd. 1998. Gauses Laguerre method. Marks 40 Pass. Introductory Methods of Numerical Analysis. 3. Reliability of estimates and predictions. Jain. rate of Convergence. 1993. Text Books: 1. 2. and Jain. Unit-IV: Langrange and Newton Interpolation. .Sc. Unit-II: Correlation and Regression Analysis.. Bairstrow method. R. 6 . Multiple correlation coefficients. method. Runge Kutta method. Spline Interpolation. Partial correlation coefficients and partial regression coefficients.K.C.

Scott. process. – 105 Communication Skill & Job oriented Training Program Max. Dos and Don’ts. Marks 40 Pass.III : Group Discussions : (PPP) Definitions. FIRO-B (PPP). “ Business Communication” Pearson Education. commonly asked questions. Chturvedi. forms of communication. Johan & et. Masterson.M. Robbins 3. barriers. Interview (PPP) Types of. importance. Ltd. Unit-IV: Transactional Analysis: (PPP) Transactional analysis. Points to be borne in mind as an interviewer or an Interviewee.Sc. process of communication. Johari Window. exercises and cases/incidents for practice. Unit-II: Advance Communication (PPP and Exercises on handouts) Why communication ? Art of communication. Key elements of IP communication. Quizzes. OB by Fred Luthans 2. V3 communication. P. Benefits. be a better listener.al (1989). points to be borne in mind while participating. approaches. Singapore Pvt. 7 . Dos and Don’ts. Foreman and Co. documentation. “Invitation to Effective Speech Communication. importance. channels. exercises and cases.D. Unit. Practice-if time permits or to be covered in PDP. Practice – if time permits or to be covered in PDP. Listening (PPP): Def. Marks 16 Unit-I: Fundaments of Communication (OHP & PPP): Definitions. Importance. OB by Stiphen P. and Chaturvedi Mukesh (2004). preparation of manuals and project reports Text Books: 1. 4. Unit-V: Written Communication: Report writing. barriers and strategies to overcome barriers of communication. business correspondence.

Decker Bert(). Jaico Publishing House. Mumbai. 3. “Essential DK Managers: Communication Clearly”. “ The Business of Listening”. London. Feb 2001. 8 . “ Last Minute Interview Tips”. a Fifty-Minute Series Book Crisp Publications. Heller Robert (1998). Bone Diane(). 5. 2. Inc. 4. “ The Art of Communication”. Dorling Kindersley. Business Communication by ICMR. Toropov Brandon (2000). California.Reference Books: 1.

depth first search. AVL trees. drums. dynamic storage management. polynomial manipulation. B. logical and pointer information. Breadth first search.W. binary tree traversal.Sc. P. storage of information.H. pointers and linked allocation. Unit-V: File Structure : Magnetic tapes. Threaded binary trees. 2. matrix representation. B* trees. operations on linked lists. Queues. representation of binary trees.M. H. Marks 16 Unit-I: Information and its storage representation. Mc-Graw Hill. Mass storage devices and their characteristics. evaluation of binary search trees. Sc. Non. Hasning functions. Searching Haah-table method. list structure. linked dictionary. sequential file structure and processing of fixed sequential files (ISAM. storage structure for arrays. linked linear lists. Unit-III: Nonlinear Data structures: Trees.B. selection sort. application of trees. generating extended initial runs. merge sort. simulation. operation on binary trees. text handing analysis. Loomis : Data Management and File Processing. oscillating sorting. radix sort. recursion. address calculation method. controlled list Length.9. Text Books: 1.12 from Data Management and file Processing by E. disks. cellular partitioned structures. storage representation of string manipulation application.(Chapter 8.S. Marks 40 Pass. operations on data structure. Lomis) graphs and their representation. primitive data structure. multilist organization.P. 9 . binary search trees. Reference Books: 1. Trembly & P. definitions and concepts of general trees and binary trees.primitive data structures. Unit-II: Linear Data structure and their sequential representation. circulatory linked list. application of linked lists. tree sorts. M. inverted list. external sorting. binary tree representation of general tree. Press. partition exchange sort. transmission of information. doubly links list. multiple precision arithmetic. external searching. representation and manipulation. sorting on disks. linked storage representation. direct files. Sahnis : Fundamentals of Data Structures. operations on queues. nature of information.I. .S. Summary of Sorting methods. Way search trees and B-trees and B-trees. bubble sort. run list sorting. other representation of graphs. trees. definition and operations on stacks. record organization. priority queues. Comp. application of graphs. inverted list organization. polyphase sorting. structure and processing. Sorrenson : An Introduction to Data Structure with application. stacks. . J.11. application of stack. polish expressions and their manipulation. real numbers. integer.G. E. Collision resolution techniques. Unit-IV: Sorting and Searching : Notation and concepts. – 201 Data and File Structure using C++ Max. maintenance of multilist. character information. maintenance of constrained list and cellular structures.

2. 10 . Knuth : The Art of Computer Programming. Addition Wesly. D.E.

Macros and Macro processor. Linking and Relocation. Unit-II: Loading. Running a Linux System. evolution of s/w.M. Entering command. Assemblers. The shell Customizing shell. program relocatability. functions of shell. Using Basic Administrator Tools. Trent R. linux Command information. linux and Unix history. A linkage editor for IBM PC. Hein. linux distribution. Principles of maintaining linux system. Reference Books: 11 . Unit-IV: Using graphical Systems with Linux. Marks 40 Pass. Networking overview. Unit-III: The Arrival of Linux. Creating Scripts and Automated Procedure. 3. different type of shells. the Spirit of linux the strengths of linux. The shell and text files. Hardware Redundancy and Fault Tolerance. Using Text Editors text processing. object Module format.202 System Programming using Linux Max. BPB Publication. start-up process. Components of s/w. Text Books: 1. Assembly process. Unit-V: The Role of the System Administrator. Design of two pass assemblers. linking and loading Schemes. the Shell prompt. . Marks 16 Unit-I: What is system software. Linux Complete by Grant Taylor.Sc. Basic Administration Tasks. overview of Linkage editing schemes. linking for program overlays. Linux Networking. System specific information. Installing linux. Guide to Linux Installation and Administration by Nicholas Wells 2. Design of linkage editor. Translators and Loaders. Linux Administration Handbook by Evi Nemeth.

with 2’s Complement Data) Multiplication Algorithms – (Hardware Implementation for Signed-Magnitude data. Divide Overflow. Stack Organization. Instruction Pipeline & RISC Pipeline with examples. General Consideration in pipelining. Parallel Computer Structures : Pipeline Computers. Marks 40 Pass. Crossbar Switch. Register stack. Arithmetic Pipeline. Multiprocessor System. Types of Interrupts Reduced Instruction Set Computer (RISC). Unit-III: Introduction to parallel processing : Parallel Processing Mechanisms. Array Multiplier) Division Algorithm ( Hardware Implementation for Signed-Magnitude data. Cache Coherence. Attached Array processor and SIMD Array processor. Interprocessor Arbitration. Hardware Algorithm. Hwang. PHI 2. Hardware Algorithm). Floating Point Arithmetic Operations. Unit-V: Multiprocessors: Characteristic of Multiprocessors. Data Transfer and Manipulation. Multiport memory. Matrix Multiplication. Supercomputers. Interprocessor Communication and Synchronization. Hardware Algorithm. Performance of Parallel Computers. Subroutine Call and Return. M. Text Books: 1. Array Computers. Multiplication. Division). Parallelism in Uni-processor System. Mutual Exclusion with a Semaphore. McGraw-Hill. Hypercube Interconnection). Architectural Classification Schemes. Memory Interleaving. Instruction Formats. Addressing Modes. Marks 16 Unit-I: Central Processing Unit : General Register organization. – 203 Computer System Architecture and Parallel Processing Max. Multiprocessor Architecture and Programming Functional Structure. Booth’s Algorithm. Characteristics of RISC/CISC. Program Interrupt. Addition and Subtraction. 12 .Sc. Memory stack. Program Control. Moris Mano : Computer System Architecture. Applications of Parallel Processing. Unit-II: Computer Arithmetic: Arithmetic algorithms – Addition and Subtraction (with Signed-Magnitude Data. Interconnection Networks (Time shared or Common bus.M. Reverse Polish Notation Evaluation of Arithmetic Expressions. Hardware Implementation. Vector Processing. Dataflow and New Concepts. Multistage Switching Network.(Register Configuration. Unit-IV: Pipeline and vector processing : Principles of linear pipelining. Briggs : Computer Architecture and Parallel Processing.

Principal of Mathematical Induction. T. Dynamic Programming: The problem of Making Change. Turning machine Formal definition and example. Flow networks. Text Books: 1. problems and instances. DFS. The Design and Analysis of Computer Algorithms. Minimum Spanning Trees.Ellis Sahni. Traversing Trees. 13 . Chained Matrix Multiplication Matrix multiplication using Dynamic Programming. minimal spanning tree. . Analysis of Non-Recursive Control structure. 1990.204 Design and Analysis of Algorithms Max. Ulman. Solving Recurrences. Concept of Efficiency of an Algorithm. CFG. Quick sort. Formal Language & Grammer. 2. Outline of Algorithms. Instantaneous Description and Transition Diagram. Marks 16 Unit-I: Elementry Algorithms-examples. Wesley’s 74. Unit-III: Design Techniques: Divide and Conquer. Kurth. Average Case & Amoritzed Analysis. Computer Algorithms. The principle of optimality. Strassen’s matrix multiplication.Control abstraction binary search. 2. Kruskal and prims algorithm. all paths shortest paths. Well known Asymptotic Function & Notation. Some useful Mathematical Functions & Notation. characteristics. Finite Automata. Galgotia. Topological sort. Problem: Available Tools & Algorithms. The Art of Computer Programming. strongly connected component. Wesley. Unit-II: Analysis of Algorithm-simple example. Reference Books: 1.Resursive algorithms(Tower of Honoi. Exponentiation. Cormer & Rivest. Unit-IV: Graph algorithms: Examples. Permutations). Floyd-Marshall algorithm. Kruskal’s Algorithm). MIT Press. Mathematical Expectation. well known Sorting Algorithms Best-Case and Worst –Case Analysis. merge sort. Dijkstra’s Algorithm. Recursive Constructs. Unit-V: Models for Executing algorithms: Regular Expressions. Building Blocks of Algorithms. BFS & Minimax principle.M. Marks 40 Pass. Regular language. Aho. PDA. Algorithms.Sc. Greedy methods (Formulization of Greedy Technique.

for etc. variables and data types.Sc. classes object and methods. Services like E-mail. Video. Naming Conventions. Protocols (SNMP). Creating packages. Java virtual machine. Cryptography. Herbert. Applet Tag. switch while.else. Authentication Protocols. Logical. FTP. Thread priority. Digital Signature. Unit-III: Operations and expressions. Tanenbaum. WWW. Public-key algorithms. Multimedia. life cycle of a Thread. Hiding classes. Computer Networks By A. Audio. Marks 16 Unit-I: Understanding the Internet.I. operator precedence and Associability various control flow statement like if…. Exploring Java : Patrick Nieaneyer and Joshna Peck O. do. By Patrick Naaghton. managing Input/Output files in Java. Relational. 1999 By Harley Hahn. 2. Java and Internet. GUI Concepts in Java. Unit-V: Exceptions. Bit-Wise operators. Multiple inheritance defining Interface. . Inc. Accessing Interface variables. Java API Packages. Java environments. Creating threads. 3. Constants. Multi threaded programming. How Java differs from C and C++ . Balaguruswamy Publisher: Tata McGraw Hill publication. P. Hardware and Software requirements. Arrays strings and vectors. Graphics programming.M. Visibility control. creating executable Applet.H. A Printer. P. How TCP/IP makes the Internet work. Running an applet. E. Telnet etc. extending Interfaces. Internet security.205 Java Programming Max.S. Marks 40 Pass. Reference Books: The Complete reference Java 2. Arithmetic. Implementations a Java Program. Simple Java Program. Hareliy Hahn Teacher the Internets. who runs the Internet.H. Thread exception. Applet life Cycle. Accessing a package. Java and WWW. 14 . Java statements. Unit-II: Java History. Applet programming. Java Program Structure. Reilley S Associates. Domain Name System (DNS). 3rd Edi.I. Unit-IV: Interfaces. Schild Tata Mc-Graw Hill. Overview of the Internet. Implementing Interfaces. 2. Java Tokens. Adding a class to a package. What in the Internet. Programming with JAVA. 1. Text Books: 1.. extending thread class. Simple Network Management. Java features. Inheritance extending a Class. Data Compression. execution Handling in Java. passing parameters to applet.

Java 2 exam Guide : Barry Boone / William Stanck Tata Mc-Graw Hill.4. 15 .

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->