RTMNU MSC Computer Science Syllabus

I have got admission in Msc Computer Science course offered at Rashtrasant Tukadoji Maharaj Nagpur University . Will you please provide the syllabus ?

[Quick Sam]

As you are looking for the syllabus of Rashtrasant Tukadoji Maharaj Nagpur University Msc Computer Science course ,here I am providing same for you .

Semester-I
Discrete Mathematical Structure
Programming in Java
Digital Electronics and Microprocessor
Advanced DBMS and Administration
Practical-I based on theory paper-1 and 2
Practical-II based on theory paper-3 and 4
Seminar

Semester-II
Windows Programming using VC++
Theory of Construction Computation and Compiler
Computer Architecture and Organization
Computer Graphics
Practical-I based on theory paper-1 and 2
Practical-II based on theory paper-3 and 4
Seminar

Semester-III
Data Communication and Networks
Software Engineering
Neural Network
Elective-1
1.1 Mobile Computing 1.2 Multimedia Technologies 1.3 ASP.NET
Practical-I based on theory paper-1and 2
Practical-II based on theory paper-3 and 4
Seminar

Semester-IV
Data Mining
Artificial Intelligence & Expert System
Design and Analysis of Algorithm
Elective-2
2.1 Embedded System
2.2 Pattern Recognition
2.3 Parallel Computing
Practical-I based on theory paper-1 to 4
Project
Seminar
RTMNU Msc Computer Science Syllabus
M.Sc. Part I
Semester -1
Paper I : Discrete Mathematical Structure
Hours/Week : 4
Credits : 4
Unit-1 :
Fundamental – Sets and Subsets, operations on sets, sequence, Division in the integer, Matrices,
Mathematics Structures. Logic-Proposition and Logical Operation Conditional Statements,
Methods of Proof, Mathematical Induction,
Mathematics Logic- Statements and Notation, Connectives ,Normal Forms ,The Theory of
Interface for the statement Calculus ,Inference Theory of the Predicate Calculus,
Unit-2 :
Counting- Permutation, Combination, The pigeonhole Principle, Recurrence Relations.
Relational and Digraphs- Product sets and Partitions, Relations and Digraphs, Paths in Relations
and Digraphs Properties of Relations, Equivalence Relations, Computer Representation of
Relations and Digraph, Manipulation of Relations, Transitive Closure and Warshall’s Algorithms.
Functions-Definition and Introduction, Function for Computer Science, Permutation Functions,
Growth of Functions.
Unit-3 :
Graph Theory : Basic Concept of Graph Theory, Euler Paths and Circuits, Hamiltonian Paths and
Circuits. Other relations and Structure- Partially Ordered Sets, Lattices Finite Boolean-Algebra,
Functions of Boolean Algebra’s, Boolean function as Boolean Polynomials. Tree-Introduction
Unidireted Tree, Minimal Spanning Trees.
Unit-4 :
Semigroups and Groups: Binary Operations Revisited, Semigroups, Products and Quotations of
Groups. Introduction to computability –Languages Finite –State Machines, Semigroup,
Machines and Language.
Books :
1. Discrete Mathematical Structures By Bernard Kolman c,Busby & Sharon Ross [PHI]
2. Discrete Mathematical Structures with Application to computer science By J.P.Tremblay &
R.Manohar [Tata McGraw –Hill]
3. Combinational Mathematics By.C.J.Liu
Reference Books:
1.Discrete Mathematics with Graph Theory By Goodaire[PHI]
2. Discrete Mathematics by J.K.Sharma(McMillan)
3. Discrete Mathematics and its Applications By Kenneth Rosen (TMH)
4. Discrete Mathematics By Seymour Lipschutz, Marc Lipson (TMH)
5. Discrete Mathematics : Rajendra Akerkar, Pearson
Paper II : Programming in Java
Hours/Week : 4
Credits : 4
Unit-1 :
Java and Internet, Features of java: security, portability, multithreading, etc, Bytecode,
Datatypes, variables and Arrays, Operators, Classes : declaring objects, methods, constructor,
overloading constructor, garbage collection, finalize() method, static variable and method, final
variable, command line argument. Inheritance: super keyword, final with inheritance. Packages
and Interfaces.
Exception handling : Overview, types, Uncaught exception, try -catch block, multiple catch,
nested try, throw, throws, finally, bulit-in and user- defined exception.
Multithreading : Life Cycle, Thread class and Runnable Interface, isAlive(), join(),Priorites,
Synchronization : sleep() , run(). Interthread communication : wait(), notify(), notifyAll(),
deadlock. String Handling.
Unit-2:
Wrapper classes, Applet: Applet Class, Architecture, Life Cycle, Display methods, HTML
APPLET Tag, Passing parameter to Applet
AWT : working with Windows, Controls, Layout Manager, Menus. Swings. Event handling.
Unit-3:
JDBC : Architecture, JDBC-ODBC bridge driver, SQL Package, ResultSet and its methods.
Networking : Socket, Reserve socket, Internet Addressing, InetAddress, TCP/IP client socket,
TCP/IP server socket, URL, URL Connection, Datagram.
RMI : Introduction, Architecture, Remote Interface, java.rmi. server package, class naming,
creating Rmi server and client ,transmitting files using rmi, client side callback,
RMISECURITYMANAGER class, RMI Exception, Stub and Skeleton.
Unit-4:
Servlet : Life Cycle, Tomcat, javax. servlet package, reading servlet parameter, javax.servlet.http
package, handling http request and response with HTTPGET and HTTPPOST, cookies,session
tracking. JSP : Introduction, Types of JSP tags, Application using JSP and Servlet.
JavaBeans : Advantages of Beans, BDK, JAR files, Introspection, Developing Beans using
BDK.
Books:
1. Complete Reference by Herbert Schildt (TMH)
2. Programming with Java By C Muthu (McGraw Hill)
3. Black Book on java.
Paper III : Digital Electronics and Microprocessor
Hours/Week : 4
Credits : 4
Unit-1 :
Number System and Data Representation
Number System : Binary, Octal, Decimal and Hexadecimal number system and their inter
conversion. Binary Codes : BCD, Excess3 , Parity, Gray, ASCII, EBCDIC codes and their
advantages and disadvantages. Data Representation : Positive , negative ,maximum and
minimum number representation (related to 8 bit number), real number representation,
underflow, overflow , range and accuracy. Binary Arithmetic : Binary addition, decimal
subtraction using 9’s and 10’s compliment, binary subtraction using 1’s and 2’s compliment,
multiplication and division. Logic gates: Truth table, properties and symbolic representation of
NOT, AND, OR, NOR , NAND, EXOR, EXNOR gates. NOR and NAND gates as a universal
gates .
Unit-2 :
Boolean Algebra: Laws and Identities of Boolean algebra, DeMorgan’s Theorem , use of
Boolean Algebra for simplification of logic expression, K-Map for 2,3,4 variables, simplification
of SOP and POS logic expression using K-Map.
Combinational circuits: Half adder, Full Adder, Parallel adder, Half subtractor, Full Subtractor,
4-bit binary adder subtractor, Multiplexer, Demultiplexer, Decoder, Encoder, Parity detector.
Unit 3 :
Sequential Circuits : Flip-Flops : Construction and working of RSFF, JKRSFF, DFF, TFF, JKFF,
and JKMSFF . Counters : Construction and working of asynchronous, synchronous, up-down
counter, shift registers and their types, Ring counter, Jonhson counter with their time diagram.
Unit-4 :
Architecture of 8086 and Assembly Language Programming
Block diagram of 8086, Pin diagram of 8086, Addressing modes, Instruction set: Data transfer,
Arithmetic, Logical, String manipulations, Control Transfer, Unconditional branch, Conditional
branch, Flag, Processor control. Assembler directives and operators, simple assembly programs.
Books:
1.Digital Electronics by Gothman(PHI)
2.Digital and analogue technique by Navaneeth, Kale and Gokhale
3.Fundamental of Micropocessor by B Ram
4.Microcomputers Systems: The 8086/8088 family by Liu. Gibson
5. Modern Digital Electronics By Jain (TMH)
Paper IV : Advanced DBMS and Administration
Hours/Week : 4
Credits : 4
Unit-1 :
Relational Database design: Functional dependencies, and Normalization Normal forms based
on primary keys (1 NF, 2 NF, 3 NF, BCNF, 4 NF, 5 NF) Loss less joins and dependency
preserving decomposition Query Processing: Query Processing Stages, Query Interpretation,
Equivalence of Expressions, Query Resource Utilization, Query Execution Statistics, Query
Execution Plan, Estimation of Query Processing Cost, Table Scan, Sample Index Access, Fill
Factor, Multiple Index Access, Methods for Joining Tables (Nested Loop, Merge Join, Hybrid
Join, Multiple Join) Structure of a Query Optimizer
Unit-2 :
Transaction Processing & Concurrency Control: Concept and definition of transaction, ACID
properties, serializibility, Prioritization, states of transaction, Types of failure, desirable
properties of transaction schedules and recoverability, serial usability of schedules, levels of
transaction consistency, deadlocks, long duration transactions, transaction performance,
transaction processing as implemented in contemporary database, management system.
Concurrency Control, locking techniques, techniques based on time-stamp ordering, multiple
granularity. Crash Recovery: failure classification, recovery concepts, database backup, recovery
concepts based on deferred update and on immediate update. Shadow paging, check points, online
backup during database updates, crash recovery techniques.
Client/Server database: Evolution of client concept, Client/Server environment, characterization
of Client/Server computing. Functions of clients server , application partitioning, the two-layer
and three-layer architectures, communication between clients and servers.
Unit-3 :
Oracle Database Architecture and Administration: Oracle database architecture, Design,
Creation, Migration and Management of Oracle Databases and related database schemes, Data
Dictionary views and standard package Maintaining the control, Redo Loa files, Managing
Tablespaces and Data Files, Storage structure and relationships, Managing rollback segment,
Managing tables, Indexes, Managing data Integrity, Managing password security and resources,
Managing users, Privileges, roles.
Oracle Backup and Recovery Strategies: Backup and recovery considerations, Oracle recovery
structure and processes, Oracle backup and recovery configuration, Physical backup, Complete
recovery of an Oracle database, Incomplete recovery of an Oracle database with Archiving,
Oracle Export / Import utilities, Oracle standby database.
Unit-4 :
Oracle Tuning and Troubleshooting:Oracle performance tuning methodology,'Oracle alert and
trace files, Tuning the shared pool, Buffer Cache, Redo Log buffer, Database configuration and
I/O issues, Using Oracl Blocks efficiently, Optimizing sort operations, Rollback segment tuning,
Monitoring and detecting lock contention, SQL issues and tuning considerations for different
application. Integrity, Security: Need for Database Integrity, Integrity Constraints, Non-Procedural
and Procedural Integrity Constraints Specifications in SQL, Introduction to Database Security
issues, Authorization and use.
Books :
1. Fundamental of Database Systems by R. Elmasri; S. Navate; Benjamin Cummings;
2. Introduction to database systems by C. J .Date
3. Database system concept by Korth
4. DBA Handbook oracle press by Loney
Reference Books:
1. Principles of Database Management by James Martin
2. Relational database design for Micro computers Application by Prentice Hall (Jackson)
3. Database Management Systems by Bipin Desai
M.Sc. Part I
Semester -2
Paper I : Windows Programming using VC++
Hours/Week : 4
Credits : 4
Unit-1 :
Windows, Visual C++, Application Frameworks Fundamentals and MFC Libraries View Class.
Introduction, MFC, ATL and WFC, Windows Programming Model, Components, Application
Framework, MFC Library, Event Handling, Mapping Modes and Scrolling Views, Graphic
Device Interface, Colors and Fonts, Modal Dialog and Windows Common Control, Modeless
Dialog and Windows Common Dialog, ActiveX Controls and Internet Explorer Common
Controls, Win32 Memory Management, Bitmaps, Message Processing and Multithreaded
Programming.
Unit-2 :
Document View Architecture : Menus, Keyboard Accelerators, Rich Edit Control and Property
Sheets, Tool bar and Status Bars, Reusable Frame Window Base Class, Separating the
Documents from its View, Reading and Writing Documents- SDI applications, MDI
applications, Printing and Print Preview, Splitter Windows and Multiple Views, Context-
Sensitive Help, DLL’s, MFC Programs without Documents or View Classes
Unit-3 :
Active X: COM, Automation and OLE : Component Object Model, Automation, Uniform Data
Transfer- Clipboard Transfer and OLE, Drag and Drop, Structured Storage, OLE Embedded
Components and Containers, Introducing the Active Template Library, ATL and ActiveX
Controls.
Unit-4 :
Database Management: Database Management with Microsoft ODBC, Database Management
with Microsoft Data Access Objects, OLE DB Templates.
Programming for the Internet: TCP/IP, Winsock, WinInet, Programming the Microsoft Internet
Information Server, ActiveX document Servers and the Internet, Introducing the Dynamic
HTML, Visual C++ for Windows CE.
Books :
1. Programming Microsoft Visual C++ by D. J. Kruglilski, G Shepherd and Scot Wingo
Publication : Microsoft Press Fifth Edition.
Reference Books:
1. Visual C++ 6 From The Ground Up: Mueller: TMH Publication
2. VC++ 6 The Complete Reference: Pappas, TMH Publication
Paper II : Theory of Computation and Compiler Construction
Hours/Week : 4
Credits : 4
Unit-1 :
Finite Automation and Regular Expression : Finite State systems, Basic Definitions, Non -
deterministic finite Automata, Finite Automata with moves, Regular Expressions, Two way finite
automata, Finite automata with output, Application on Finite Automata.
Properties of Regular Sets : The pumping lemma for Regular Sets, Close properties of Regular
sets, Decision Algorithms for Regular Sets.
Context Free Grammars : Motivation and Introduction, Context Free Grammar, Derivation Tree,
Simplification of context Free Grammars, Chomsky Normal form, Greibach normal form, The
existence of inherently ambiguous context free languages.
Properties of Context free languages : The pumping lemma for CFL’s , Closure properties of
CFL’s, Decision Algorithm for CFL’s
Unit-2 :
Push Down Automata : Informal description, Definitions, Push – Down Automata & Context
free languages.
Turing Machine : Introduction, The Turing Machine Model, Computable languages and
functions , Techniques Turing Machine construction, Modification of Turing Machines, Churchs
Hypothesis, Turing Machine as enumerators, Restricted Turing Machine equivalent to the basic
model. Undecidability : Problems, properties of recursive and recursively enumerable problem,
Turing Machine and undecidable problem, Rice theorem, Tool for proving CFL undecidable,
Greibach’s Theorem.
The Chomsky : Regular Grammars, Unrestricted Grammars, Context – Sensitive languages,
Relation between classes of languages.
Unit-3 :
Introduction to Compilers :
Compilers and translators, need, the structure of a compiler, Lexical Analysis, Syntax analysis,
Intermediate code Generation, Optimization, Code Generation, Book keeping, Error Handling,
Compiler writing tools. Basic parsing Techniques: Parsers, Shift-reduce parsing, Operator
precedence parsing, Top-down parsing, predictive parsers, automatic construction of efficient
parsers : LR parsers the canonical collection of LF (O) items, constructing SLR parsing tables,
constructing LALR parsing tables, Ambiguous grammar.
Unit-4 :
Syntax directed translation : syntax directed translation schemes, implementation, intermediate
code,postfix notation, parse tree and syntax trees, tree- address code, quadruple, triple, translation of
Symbol Table: Data Structure, Representation of Scope Information,
Code Optimization: The principal source optimization, Loop optimization, The DAG
Representation of basic blocks, Value number and algebraic laws, Global data-flow analysis.
Code Generation : Object Programmers Problems in code generation, A machine model, a simple
code generator, Register Allocation and assignment, Code Generation from DAG’s Peephole
Optimization.
Books :
1. Introduction to Automata Theory, Languages and Computation: John E. Hoperott & Jeffery
D. Ullman.
2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson Education.
3. Theory of Computer Science : E. V. Krishmamoorty.
4. Theory of computer Science : K. L. P. Mishra.
Reference Books:
1. D. I. A. cohen : Introduction to Computer Theory (JW)
2. H. R. Lewis & C. H. Papadimitrion : Elements of Theory Of Computation (PHI)
3. J. Caroll and D. Long : Theory of Finite Automata (PHI)
4. M. Davis & Weyukur : Computability, Complexity & Languages.
5. M. Machtey & P. R. Young : An introduction to Genral Theory of Algorithm ( Elsevier).
6. Zvihohavi : Switching and Finite Automata Theory (TMH).
Paper III : Computer Architecture and Organization
Hours/Week : 4
Credits : 4
Unit-1 :
Principle of computer design : Software, hardware interaction, layers in computer architecture,
central processing and machine language instruction, addressing modes, instruction types,
instruction set selection, instruction and execution cycle.
Unit-2 :
Control Unit : Data path and control path design, microprogramming v/s hardwired control,
pipelining in CPU design, RISC v/s CISC, superscalar processors.
Unit-3 :
Memory subsystem : Storage technologies, memory array organization, memory hierarchy,
interleaving , cache memory and virtual memory including architectural aids to implement these.
Unit-4 :
Input/ Output Processing : Bus Interface, Data transfer techniques, I/O interrupts and channels,.
Performance evaluation : SPECmarks , Transaction Processing Benchmarks.
Books :
1. Computer Architecture and Organization by Tenenbaum
2. Computer Architecture and Organization by J. P. Hayes.
3. Parallel Processing by Hwang
4. Computer Organization by Hamacher, Vranesic, Zaky (TMH)
Paper IV : Computer Graphics
Hours/Week : 4
Credits : 4
Unit-1 :
Introduction of computer Graphics and its applications, Overview of Graphics systems, Video
display devices, Raster scan display, Raster scan systems, video controller, Raster scan display
processor, Random scan display, random scan systems, color CRT monitor, Flat panel display,
Interactive input devices, Logical classification of input devices, Keyboard, mouse, Trackball
and spaceball, Joysticks, Image scanner, Light pens, Graphics software, Coordinates
representations, Graphics functions.
Unit-2 :
Line drawing algorithms, DDA, Bresenham’s, Circle generating, Mid-point circle algorithm,
Ellipse generating, Polygon , Scan-line polygon fill, Boundary fill.
Unit-3 :
Basic transformation’s, Translation, Rotation, Scaling, Matrix representation’s & homogeneous
co-ordinates, Composite transformation’s, Reflection, Two dimensional viewing, Two
dimensional clipping, Line, Polygon, Curve, Text. 3D-transformation, Projection, Viewing,
Clipping.
Spline representation, Cubic spline, Bezier curve, Bezier surfaces, Beta spline, B-spline surfaces,
B-spline curve, Hidden surfaces, Hidden lines, Z-buffer.
Unit-4 :
Fractal’s geometry Fractal generation procedure, Classification of Fractal, Fractal dimension,
Fractal construction methods. Color models, XYZ, RGB, YIQ, CMY & HSV, Shading
algorithms, Shading model, Illumination model, Gouraud shading, Phong shading.
Books :
1. Computer Graphics by M. Pauline Baker, Donald Hearn, 2
nd
Edition PHI.
2. Mathematical Element for Computer Graphics By. David F. Roger., J. Alan Adams, 2nd
Edition, Tata McGHill.
Reference Books:
1. Principles of Interactive Computer Graphics By. William. M. Newmann. 2nd
Edition Mc.
Graw Hill.
2. Procedural Element for Computer Graphics By. David F. Roger. Mc. Graw Hill.
3. Computer Graphics By A.P. Godse, 2nd
Editio TPPublication,
4. Computer Graphics By V.K. Pachghare, 2nd
Edition, Laxmi Publication
5. Computer Graphics By Apurva Desai (PHI)
Semester -3
Paper I : Data Communication and Network
Hours/Week : 4
Credits : 4
Unit-1 :
Introduction: Network structure and architectures and services OSI reference model.
The Physical Layer: theoretical basis for data communication, transmission media. Analog
Transmission, Digital Transmission, Transmission and Switching, ISDN.
The Data Link Layer: Design issues, Error detection and correction, Elementary data link
protocols, sliding window protocol, protocols performance, protocols specification and
verification. Examples of the Data link layer.
Network Layer: Design issues, routing algorithms, Congestion control algorithms, Internet
working, Examples of the network layer.
Unit-2 :
The Transport Layer: Design issues, Connection Management.
The session layer: Design issues and remote procedure call.
The Presentation Layer: Design issues, data compression techniques, cryptography.
The Application Layer: Design issues, file transfer, access and management, virtual terminals.
Unit-3 :
Network Security Fundamentals: Introduction, security Vulnerabilities and Threats,
Classification of Security Services.
Cryptography: Encryption principles, Conventional Encryption DES, IDEA, Algorithms, CBC,
Location of Encryption Devices key Distribution.
Unit-4 :
Message Digests and Checksums, Message Authentication, Message Digests, Hash Functions
and SHA, CRCs. Public key Systems: RSA Diffie-Heliman, DSS, Key Management.
Intruders: Intrusion Techniques, Intrusion Detection, Authentication, Password- Based
Authentication, Address- Based Authentication, Certificates, Authentication Services, Email
Security, Firewalls, Design Principles, Packet Filtering, Access Control, Trusted Systems,
Monitoring and Management.
Books :
1. Computer Networks – Andrew S Tanenbum (PHI)
2. Network Security and Essentials: Application and standers
3. Willam Stalling – Pearson Education.
4. Cryptography and network security
5. Willam Stalling – Pearson Education.
Reference Books:
1. Internet Security: Timspeed, Juanita Ellis, Digital Press Publication
2. Internet Security: Jan L. Harington, Morgan Kaufmann Publication
3. Firewall Network System: John R. Vacca, Scott R. Ellis, Digital Press
4. Network Algoritm, George Varghese, Morgan Kaufmann Publication
5. TCP/IP Addressing: Buck Graham, Morgan Kaufmann Publication
6. Data Communication and Networking: Behrouz A. Forouzan, TMH.
For detailed syllabus , here is the attachment;

Originally Posted by Unregistered

I have got admission 2023-24 in Msc Computer Science course offered at Rashtrasant Tukadoji Maharaj Nagpur University accredited college Dr.Arun motghare college kondha kosra tah.pavni. Will you please provide the syllabus ?

plz note- because I am confused in website also NEP 2020 new syllabus provided .so which syllabus is valid for msc 1St year 1St and 2nd sem.