m.sc. it sllabus updated

School of Mathematical Sciences & Engineering

DDeeppaarrttmmeenntt ooff IInnffoorrmmaattiioonn TTeecchhnnoollooggyy

____________________________

Syllabus

For

Master of Science in Information Technology (M.Sc.-IT)

For the year 2013, 2014, 2015.

BABA GHULAM SHAH BADSHAH UNIVERSITY, RAJOURI,

J&K-185131

Website: www.bgsbuniversity.org

http://www.bgsbuniversity.org/

Department of Information Technology, BGSB University, Rajouri. M.Sc.-IT Syllabus for the year (2013-2015)

P a g e | 2

COURSE SCHEME & SYLLABUS FOR M.Sc.-IT FOR THE YEAR

2013, 2014, 2015

M.Sc.-IT – SEMESTER-I

IA – Internal Assessment

UE – University Examination

Course

Code Course Title Credits

Scheme of Examination

Duration Marks

Hours IA UE Total

MIT-131 Mathematical Foundations 4 3 30 70 100

MIT-132 Fundamentals of IT 4 3 30 70 100

MIT-133 Programming & Problem Solving

through C++ 4 3 30 70 100

MIT-134 Digital Electronics 4 3 30 70 100

MIT-135 Operating System Concepts 4 3 30 70 100

MIT -161 Lab on MIT-132 2 - 25 25 50

MIT -162 Lab on MIT-133 2 - 25 25 50

Total Marks 200 400 600


P a g e | 3

Course Code: MIT-131 Course Title: Mathematical Foundations Credits: 4

Maximum Marks : 100 University Examination: 70 Internal Assessment: 30 Duration of Examination:3 Hours

Objective The objective of the course is to introduce fundamentals of discrete mathematics to students for application in Computer Science & Engineering. Through examples and exercises, it will raise the student’s general mathematical sophistication, i.e. the ability to deal with and create complex structures and convincing arguments.

Unit-I Set Theory and Matrices: Basic set theory: sets, types of sets, subsets, operations on sets, Algebra of set theory, Relations, Functions: Composite Functions, Floor functions, Ceiling Functions; Mathematical Inductions, Matrices and Determinants: Addition and Multiplication of Matrices, Transpose and Inverse of Matrices. Unit-II Logic and Propositional Calculus: Propositions, Basic Logical Operations, Tautologies and Contradictions, Algebra of Proposition, Logical Implications and Equivalence, Propositional Functions, Quantifiers, Normal Forms, Rules of Inference. Unit-III Counting Technique: Basic Counting Principle, Permutation, Combination, Permutation with Repetitions, Pigeonhole Principle, Generating Functions, and Recurrence Relations. Unit-IV Introduction to Graph Theory: Introduction, Graphs, Pseudo graphs, Sub graphs, Connected Graphs, Disconnected Graphs, Euler Graphs, Operations on Graphs, Hamiltonian Paths and Circuits, Applications of Graph theory, the Travelling Salesman Problem. Unit-V Spanning Trees & Planer Graphs: Trees, Spanning Trees, Fundamental Circuit, Planer Graphs, Murkowski’s Two graphs, Detection of Planarity, Euler’s Formula, Matrix Representation of Graphs, Coloring and Covering of Graphs, Directed Graphs(digraphs).


P a g e | 4

Note for Paper Setting: The question paper will be divided into three sections. Section A will include 15 very short answer

type questions eliciting answers not exceeding 20 words / multiple choices / fill in the blanks, each

carrying 1 mark equally distributed from all units. The candidate will be asked to answer all the

questions. Section B will contain two (02) short answer questions from each unit with internal

choice, and the candidates will be required to answer one from each unit. Each question of this

section will carry 5 marks. Section C will comprise five long answer questions, one from each unit.

Each question will carry 10 marks and candidates will be required to answer any three.

Text Books: 1. Seymour, L (2001), Discrete Mathematics, 2nd Ed. Tata McGraw Hill, New Delhi.

2. Tremblay, J. P & Manhor, R (2004), Discrete Mathematical Structure with Application to Computer Science, 21st Ed. Tata McGraw Hill. New Delhi.

References:

1. Deo, N (2005), Graph Theory with applications to Engineering and Computer Science,PHI. 2. Liu,C. L (2004), Elements of Discrete Mathematics, 2nd Ed. Tata McGraw Hill, New Delhi.

3. Rosen,K. H (2004), Discrete Mathematics & its Applications, 5th Ed. Tata McGraw Hill.


P a g e | 5

Course Code: MIT-132 Course Title: Fundamentals of IT Credits: 4


Objective

The main objective of this course is to develop the basic IT concepts. Due to rapid growth &

advancement of technology, the demand of IT professionals is increasing day by day. Keeping

this in mind, the course has been designed to develop the IT learning skills.

Unit I

INTRODUCTION TO WINDOWS

Introduction to Operating System, Overview of different operating systems, Functions of

operating system, Fundamentals of disk operating system (DOS), Understanding DOS prompt,

working with DOS commands. Introduction to Windows, Working with Accessories (Notepad,

WordPad and Paint), Personalizing Windows (Installing and Removing Applications, Optimize

your system performance etc).

Unit II

INTRODUCTION TO MS-OFFICE

Introduction to MS Office, Fundamentals of MS-Word, Working with menus and Toolbars,

Introduction to Macros, Overview of Excel, Working with cells, creating worksheets, working

with Formulae bar Introduction to PowerPoint, Creating and Designing slides, working with

Animation and Hyperlinks.

Unit III

INTRODUCTION TO CYBER SECURITY

Security Policies and Management, Security Policy Design, Designing Security Procedures, Risk

Assessment Techniques. Application Security( Databases, Email and Internet etc). Cyber

Forensics, Introduction to forensic tools, Evaluation of crime scene and evidence collection, Usage

of tools for disk imaging and recovery processes, IT Act, Copy Right Act.

Unit IV

INTRODUCTION TO HTML

HTML tags, formatting text, Controlling fonts, Lists, Tables, Adding Pictures, Hyper links,

Adding audio and video. Setting up frames. Working with Forms and form elements: text boxes,

radio buttons, check boxes, dropdown menu, submit button.


P a g e | 6

Unit V

INTERNET TECHNOLOGIES

Using Network & Internet Shared Folders, Browsers (Internet Explorer, Mozilla Firefox, Opera,

and Google Chrome), and Opening Web Pages, Creating Bookmarks & Shortcuts, E-mails,

Attachments, Search Engines, Groups & Directories, Web Use Ethics.

Note for Paper Setting: The question paper will be divided into three sections. Section A will include 15 very short answer







Text Books:

1. Srikanta Patnaik, First Text Book on Information Technology, Danpat Rai & Co. 2. P. K. Sinha , Computer Fundamentals,2005, BPB, New Delhi.

3. Taxali, PC Software, 2005, Tata McGraw Hills, New Delhi.

4. Robbins Judd, Mastering DOS, 1994, BPB New Delhi.

5. Sanjay Saxena, MS Office for Everyone, 2005, Vikas Publications.

6. Jeans Andrews, A+ Guide to Managing & Maintaining Your PC ,2007,CENGAGE Learning

7. Deitel & Deitel, (2005), “Internet & www How to Program”, 3rd Edition, PHI.

References: 1. Andrews, J (2007),A+ Guide to Managing & Maintaining Your PC, CENGAGE Learning 2. Basandra, Suresh K (2005),Computers Today, Galgotia Publications. 3. Dyson, P (2000), Understanding Norton Utilities, AET Publications. 4. Saxena, S (2005),MS Office for Everyone, Vikas Publications.


P a g e | 7

Course Code: MIT-133 Course Title: Programming & Problem Solving

using C++ Credits: 4


Objective:

The objective of the course is to make students understand the basics of object oriented concepts

and their implementation through C++.

Unit I

An Overview of C++:

The Origin of C++, Object Oriented Programming and traits, Output operator, character and

Literals. Variables and their Declarations, Program Tokens, Keywords, Initializing Variables,

Object Variables and Constants, The input operator, Numeric data Types, The Boolean type,

enumeration types, Character Types, Integer Types, arithmetic operators, Increment and

decrement operators, Composite assignment Operators, Comparison operators, floating point

Types ,Type conversions, Numeric overflow , Round Off Errors.

Unit II

Arrays, Functions and Control Statements

The If… Statement, the If... Else Statement, Nested selection Statements, The Switch statement, the

while Statement, The Do while Statement, The for statement, the break and continue statement,

goto statement.

Arrays: introduction to arrays, processing arrays, Initializing an array, Two- Dimensional arrays.

Functions: Introduction to Functions, types (Standard C++ Library Functions, User defined

Functions), Function declarations and definitions. Inline Functions, Friend Functions.

Unit III

Classes and Objects

Class, introduction to classes, Class declaration, Function definitions, Objects, Accessing Class

Members, Arrays within a Class, Memory allocation For Objects Static data members, static

member functions Arrays of Objects, Objects As function Arguments, Scope Resolution Operator.

Constructor: Introduction to constructors, parameterized constructors, multiple constructors in a

class, Constructors with Default arguments, Dynamic Initialization of Objects.

Unit IV

Function overloading and operator overloading:


P a g e | 8

Function Overloading, Overloading Constructors, default function arguments, default arguments

vs. overloading, Function Overloading and ambiguity.

Operator overloading: Introduction, Overloading Unary Operators, Overloading Binary

Operators, Overloading Binary operators using Friend Functions, rules for Overloading

Operators.

Unit V

Inheritance and Virtual Functions:

Inheritance: Introduction, types (Single, Multiple, Multilevel, Hierarchical and Hybrid), The

protected Access Specifier, Overriding Member Functions. Virtual Base Class, Virtual Functions,

Virtual attribute is Inherited, Virtual functions are hierarchical, Pure Virtual Functions, Abstract

Class, early binding vs. Late binding.

Note for Paper Setting:

The question paper will be divided into three sections. Section A will include 15 very short answer







Text Books:

1. E. Balagurusamy Oop C++, thord Edition. The MCGraw Hill Companies.

References :

1. Schaum’sb Outlines Programming with C++, John R Hubbard, second edition.

2. Herbert schidlt, The complete Refernce C++ Fourth Edition. Tata McGraw Hill Edition.

3. Robert Lofore object oriented programming In turbo C++. The Waite groups, 2005.


P a g e | 9

Code: MIT-134 Course Title: Digital Electronics Credits: 4


Objective

The course is designed to get the students acquainted with digital electronics and basic number

crunching concepts of digital machines.

Unit I

Digital Logic Circuit and Binary codes

Digital and Analog quantities, Number system (Binary, Octal Decimal, Hexadecimal), Number

Based Conversions, Binary Arithmetic, Compliments (1’s and 2’s compliments of binary

numbers). Weighted and Non-weighted Codes, BCD Codes, excess-3 Codes, gray codes, ASCII

codes, EBCDIC codes.

Unit II

Boolean Algebra and Combinational Logic

Logic Gates Logic Gates (NOT,OR,AND,), Universal Gates (NAND,NOR), X-OR,X-NOR, Boolean

Algebra an Logic Simplification, Boolean Operation and Expressions, Laws and rules of Boolean

algebra, De-Morgan’s Theorems, Simplification using Boolean Algebra, The Karnaugh Map. Half

Adder, Full Adder, BCD Adder, Basic Binary Decoder,4 bit decoder, BCD to Decimal Decoder,

BCD to 7 segment decoder, Decimal to BCD Encoder, Octal to Binary Encoder, Priority Encoder.

Unit III

Sequential Circuits: Introduction, Latches (SR Latch , D Latch) , Flip Flops (RS,T,D, JK).

Conversion of Flip-Flops (SR Flip-Flop To JK Flip-Flop, JK Flip-Flop to SR Flip-Flop),Application

of Flip-Flops.

Unit IV

Counters: Asynchronous Counters: 2-bit Asynchronous Binary Counter, 3-bit Asynchronous

Binary Counter, Asynchronous Decade Counter,4-bit Asynchronous Binary Counter,

Synchronous Counters: 2-bit Synchronous Binary Counter, 3-bit Synchronous Binary Counter,

4-bit Synchronous Binary Counter, 4-bit Synchronous Decade Counter.

Unit V

Shift Registers and Logic Families


P a g e | 10

Registers: Introduction, Basic Shift Register functions, Serial IN/ Serial OUT Registers, Parallel

IN/ Serial OUT Registers, Parallel IN/ Serial OUT Shift Registers. Parallel IN/ Parallel OUT Shift

Registers.

Logic Families: Introduction, Terminology (Threshold Voltage, Propagation Delay, Power

Dissipation, Fan-in, Fan-out), Transistor Transistor Logic (TTL), Emitter –Coupled Logic (ECL).









Text Books:

1. Digital Fundamentals, Floyd and jain, first impression 2006, Pearson Education

References :

1. Fundamentals of Digital circuits, Kumar A.Anand, PHI.


P a g e | 11

Course Code: MIT-135 Course Title: Operating System Concepts. Credits: 4


Objective

The course aims at introducing students to the fundamental concepts of operating systems. The emphasis is on making students familiar with the principles and processes of operating systems, in context of process management, input/output, memory management and file systems. Unit-I Operating System: Introduction, Evolution (Serial processing, Batch Processing, Multiprogramming), Types of OS (Multi-Programming, Time-Sharing, Distributed, and Real-Time Systems), Operating System Structure (Monolithic, Layered, Kernel, Virtual Machine, Client Server Model). Unit-II Process Management: Process Concept, Process states, Implementation of process, PCB, Threads, CPU Scheduling, Types of Schedulers, Scheduling Criteria, Scheduling Algorithms (FCFS, SJF, Priority Based, Round Robin, Multilevel Queue). Unit-III Inter-process Communication & Synchronization: Race condition, Critical Section Problem, Mutual Exclusion, Synchronization Hardware, Peterson’s Solution, Producer -Consumer Problem, Semaphores. Deadlocks: Model, Prevention, Avoidance, Detection and Recovery. Unit-IV

Memory Management-I: Basic Hardware, Address binding, Concept of Logical and Physical Addresses, Dynamic loading, Swapping, Single Process Monitor, Multiprogramming with Fixed Partition and Dynamic Partition, Paging (Basic method, Hardware support (TLB)), Segmentation (Basic method, Hardware support). Unit-V Memory Management-II: Virtual Memory and its Advantages, Demand Paging (Basic concept), Page Replacement algorithms (FIFO, Optimal Page replacement, Least Recently Used). Disk management: Concept of Files and Directories, Disk allocation methods (Contiguous, Non-contiguous, Indexed), Disk Scheduling Methods (FCFS, Shortest seek Time first, Scan Scheduling).


P a g e | 12









Text Books:

1. Siberscatz A & Galvin, P (2004), Operating System Concepts, Willey Pub.

References: 1. Milankovic. M (2004), Operating System Concepts & Designs, TMH.

2. Tanenbaum, A. S (2000), Modern Operating System, PHI.


P a g e | 13

COURSE SCHEME & SYLLABUS FOR B.Sc.-IT FOR THE YEAR

2013, 2014, 2015

M.Sc.-IT – SEMESTER-II



Course



Duration Marks

Hours IA UE Total

MIT-231 Data & File Structure 4 3 30 70 100

MIT-232 RDBMS 4 3 30 70 100

MIT-233 Software Engineering 4 3 30 70 100

MIT-234 Artificial Intelligence 4 3 30 70 100

MIT-235 Data Communication &

Networking 4 3 30 70 100

MIT-261 Lab on MIT-231 2 - 25 25 50

MIT-262 Lab on MIT-232 2 - 25 25 50



P a g e | 14

Course Code: MIT-231 Course Title: Data & File Structure. Credits: 4


Objective

The objective of the course is to introduce implementation, evaluation and analysis of the

fundamental structures for representing and manipulating data.

Unit-I

Introduction to Data Structure: Concept, Basic Terminology, Elementary Data Structures,

Abstract Data Type, Arrays & its representation, Operations on Arrays, Sparse Arrays, Pointers,

Linked List (Singly, Double & Circular), Operations on Linked List (Traversing, Insertion,

Deletion etc.), Introduction to Garbage Collection.

Unit-II

Stacks and Queues: Basic Concept, implementation, Applications: Recursion (Fibonacci Series, Factorial & Tower of Hanoi problem), Polish Expressions and their Compilations (Infix, Prefix, Postfix), Queues and their implementation, De-Queues, Priority Queues. Unit III Trees: Concept, Binary Trees, Tree Traversal Techniques (Preorder, Post order, In order), Complete Binary Trees, Binary Search Tree & Operations on Binary Search Tree (Searching, Insertion & Deletion), Height Balance and Concept of AVL Trees and purpose of B-Trees. Unit IV Graphs: Concept, Directed Graphs, Graph Representation (Adjacency Matrix and Linked Representation), Dijkstra’s shortest Path Algorithm, Graph Traversal Techniques (Breadth First Search & Depth First Search). Searching and Sorting: Linear & Binary Search, Merge Sort, Heap Sort, Quick sort. Unit-V Files: Basic terminology Attributes of a File, Classification of Files. File Organizations: Sequential File Organization, Relative File Organization, Indexed Sequential File Organization (Primary, Clustering and Secondary). Hashing: Basic concept, Hash Table, Hash Function.


P a g e | 15









References:

1. Seymour Lipschutz(SCHAUM’S ouTlines), “DATA STRUCTURES”, Tata McGraw Hill, 2006.

2. R. Kruse, "Data Structures & Program Design in "C"", Pearson Education, 2004.

3. Dr. PrabhakarGupta,VineetAgarwal, Manish Varshney, “ Data Structure Using ‘C’, FIREWALL MEDIA ,2007

4. Baluja G. S. , “Data Structures Through C++”, DhanpatRai& Co. 5. Tanenbaum, "Data Structures Using "'C" & "C++"", 2nd Ed. PHI Publication,2005.


P a g e | 16

Course Code: MIT-232 Course Title: RDBMS. Credits: 4


Objective

The aim of the course is to introduce students to the fundamental concepts necessary for

designing, using and implementing database systems. It emphasizes relational database

modelling & design and the languages and facilities provided by the relational database

management systems.

Unit-I Database System Concepts & Architecture: Concept, Characteristics of database, Database system Vs file system, Introduction to DBMS, Advantages, Disadvantages of DBMS, Database users. Database System Concept & Architecture: Concept, schemas and instances, DBMS architecture & data independence, Components of DBMS.

Unit-II Data models: Data modeling using ER-Approach (Concept, ER-Notations, Entities, Entity types, Attributes, Attribute types, Relationships Keys concept). Conventional Data Models & Systems: Network data model concept, Hierarchical model concept. Relational Data Model: Concept, Relational model Constraints (Entity Integrity, Referential Integrity, Key Constraints, Domain Constraints), Codd’s Rules, Relational Algebra (Fundamental Operations).

Unit-III PL/SQL: Introduction, Concept, Characteristics of SQL, Advantages of SQL, Data definition in SQL, literals, Operators, Specifying Constraints in SQL, Data manipulation in SQL, Views & Queries, Insert, Update & Delete Operations, Creating users, Grant and revoke object privileges. Introduction to PL/SQL: variable, constants, data types, Pl/SQL block structure, Condition and iterative control statements, Concept of cursors, types of cursors.

Unit-IV Relational Database Design & Normalization: Concept of Functional dependencies (Fully, partial, Transitive), Normalization of relational database, Norm forms (1NF, 2NF, 3NF, BCNF), Multivalued dependency (4NF), Join dependencies. Unit-V Transaction Management & Recovery: Concept, Transaction states, Transaction properties (ACID Test), Serializability, Recoverability.


P a g e | 17

Concurrency Control & Recovery Techniques: Concurrency control Concept, Concurrency control techniques, Locking (concept, types), Time stamp ordering, Granularity of data items, Dead lock & its Resolution. Recovery Concepts, Recovery Techniques, Introduction to Object Oriented & Multimedia Databases, Introduction to Database Security. Note for Paper Setting:








Text Books:

1. Elmarsi, Navathe, S B (2004) ,“Fundamentals of database Systems”, Pearson Education. 2. Leon(2004), “Database Management Systems”, Vikas Publications.

3. Silbebschatz, A. Korth, H,F. Sudarshan ,S (2006) ,“Database System Concepts”, TMH .

4. Bayross. I, “Commercial Application Development using Oracle Developer 2000”, BPB Pub. References: 1. Date, C J (2005), “An Introduction to Database Systems”, Addison Wesley. 2. Desai, B C (2002), “An introduction to database Systems”, Galgotia Publications.


P a g e | 18

Objective:

This paper aims to help students to comprehend the role and scope of software engineering and

equip them with the ability to apply Software Engineering practices.

Unit-I

Introduction to Software Engineering: Program vs. Software, Software Myths, Software

Characteristics, Software Crisis, Software Engineering Challenges (Scale, Quality Productivity,

Consistency and Repeatability, Change), Software Engineering Approach, Concept of Agile and

Extreme programming.

Unit-II

Software Process Management: Characteristics of Software Process, Introduction to Software

Process Models: Waterfall, Incremental Process Models, Evolutionary Process Model; Capability

Maturity Model Integration (CMMI), Planning, Estimation, COCOMO Model, Project Scheduling

and Staffing (Overall Scheduling, Related Scheduling, Team Structure).

Unit-III

SRS: Introduction to Software Requirement Analysis and Specification, Software Requirement,

(Need for SRS Requirement Process), Problem Analysis (Informal Approach, Data Flow

Modeling, Prototyping), Requirement Specification (Characteristics, Components), Metrics (Size

& Quality).

Unit-IV

Software Design: Design Engineering, Function Oriented Design, Design Principles, Coupling

and Cohesion, Design Notations & Specifications, Structured Design Methodology, Design

Verification.

Unit-V

Software Testing: Introduction, Error, Fault, Failure, Test Case, Test Criteria, Psychology of

Testing, A Strategic Approach to Software Testing, Verification and Validation, Test Strategies for

Conventional Software testing (Unit, Integration Testing), Validation Testing (Validation Test

Criteria, Configuration Review), System Testing, Testing Techniques ( Black Box, White Box

Testing).

Course Code: MIT-233

Course Title: Software Engineering.

Credits: 4

Maximum Marks : 100

University Examination: 70

Internal Assessment: 30

Duration of Examination:3 Hours


P a g e | 19

Note: The assignment or presentation component of the internal evaluation should be based on

case study.









Textbooks:

1. Pressman, R S (2006), “Software Engineering – A Practitioner’s Approach”, Sixth edition,

TMH. 2. Jalote, P(2005), “An Integrated Approach to Software Engineering”, 3

Rd Edition, Narosa

Publication.

References:

1. SCHAUM’S Outlines (2005), “Software Engineering”, TMH.

2. Sommmerville (2000), “Software Engineering”, Addison Wesley.


P a g e | 20

Course Code: MIT-234 Course Title: Artificial Intelligence. Credits: 4


Objective

The objective of the course is to introduce students to the basic concept of Artificial Intelligence. The course is appropriate both, for students of computer science & engineering who wish to acquire general understanding of Artificial Intelligence as well as for students preparing for more advanced courses and research in Artificial Intelligence.

Unit-I Introduction to Artificial Intelligence: Foundation and History of Artificial Intelligence, Intelligent Agents, Structure of Intelligence Agents; Knowledge Based Agent and Environments.

Unit-II Knowledge Representation: Introduction, Hypothesis, Knowledge Levels, Knowledge Classification, Knowledge Representation Schemas; Logic Based, Procedural, Network and Structural Representations. Unit-III LISP Programming: Introduction to LISP, Syntax and Numeric Functions, Basic List Manipulation Functions in LISP, Functions, Predicate and Conditionals, Input, Output and Local Variables, Iteration and Recursion.

Unit-IV Searching and Problem Solving: Searching in Problem Solving, Problem Solving Agents; Uninformed Search Strategies, Breadth First Search, Iterative Deepening Search, Bidirectional Search, Informed Search Strategies; Action and Path Costs, Heuristic Functions, Greedy Best First Search, A* Search, IDA* Search.

Unit-V Machine Learning: Introduction To Planning & Machine Learning: Planning Components, Planning in Situational Calculus, Practical Planners, Non Linear Planning, Baye’s Rule, Supervised and Unsupervised Learning, Introduction to Artificial Neural Network, Perceptron and Perceptron Learning Rules.


P a g e | 21









Text Books:

1. Russel,S and Norvig, P (2006), “Artificial Intelligence, A Modern Approach”, PHI.

References:

1. Night, R (2005), “Introduction to Artificial Intelligence”, TMH.

2. Patterson, D W (2005) “Introduction to Artificial Intelligence and Expert Systems”, Indian

Reprint, PHI.


P a g e | 22

Course Code: MIT-235 Course Title: Data Communication &

Networking Credits: 4


Objective The main objective of this course is to make student familiar with the basic data communication concepts. UNIT-I Data Communication: Components Of Data Communication, Data Flow (Simplex, Half duplex and Full Duplex), Transmission impairments (attenuation, Distortion and Noise), Data rate limits (Nyquist bit rate and Shannon capacity), Bit rate and Baud rate, transmission modes (Parallel and serial). Introduction to OSI reference model and TCP/IP protocol suite. Transmission media: Guided media (Twisted pair cable, co-axial cable, fibre optic cable) Unguided media: Radio waves and Microwave. UNIT-II Digital Transmission: Digital to Digital Conversion: Line coding schemes (Unipolar, polar and bipolar), analog to Digital Conversion: Pulse Code Modulation (PCM). Analog Transmission: Digital to Analog Conversion: Amplitude Shift Keying, Frequency shift Keying, Phase Shift keying. Analog to Analog Conversion: Amplitude Modulation, Frequency Modulation, Phase Modulation. Multiplexing: Frequency Division Multiplexing, Time division Multiplexing and Wavelength Division Multiplexing

UNIT-III Error Detection: Parity checking, checksum, CRC.

Forward Error Correction: Block Parity (LRC, VRC), Hamming code. Framing: Fixed Size Framing and Variable Size framing. Reverse Error Correction: Noiseless channel protocols (Simplest Protocol, Stop wait Protocol), Noisy Channel protocols (Stop and Wait ARQ, Go Back N ARQ, Selective Repeat ARQ).

UNIT-IV Internetworking: Concept of internetworking, Circuit switching, Message switching and Packet switching (Datagram Switching, virtual circuit packet switching). IP Addressing:Class full IPv4 addressing, Sub netting, IPv4 Datagram format, IPv6 format ,Tunnelling. Routing Protocols: RIP, OSPF, and BGP. Multicasting Routing Protocols: Uncast, Multicast and Broadcast,


P a g e | 23

Unit-V TCP and UDP:-Connectionless versus Connection oriented Service, introduction to UDP (well known ports for UDP, User datagram format) and TCP (Well known ports for TCP, TCP Segment Format, TCP connection establishment Phase). Concept of Internetworking Devices: - Hub, Repeater, Bridge, Router and Gateway

Firewall: Packet Firewall and Proxy Firewall.









Text Books:

1. Behrouz A. Forouzan , “Data communication & Networks” , Fourth Edition 2006, TMH.

References:

1. Tannenbaum, ”Computer Networks” , Fourth Edition 2004 PHI. 2. Uyless D.Black ,“Data Communication & Distributed Networks” , 3rd Edition 2004, PHI.


P a g e | 24

COURSE SCHEME & SYLLABUS FOR B.Sc.-IT FOR THE YEAR

2013, 2014, 2015

M.Sc.-IT – SEMESTER-III



Course



Duration Marks

Hours IA UE Total

MIT-331 Dot Net Technologies through C# 4 3 30 70 100

MIT-332 Java Programming 4 3 30 70 100

MIT-333 Wireless and Mobile

Communication 4 3 30 70 100

MIT-334 Theory of Computation 4 3 30 70 100

Elective-I (Any one of the

following MIT-335 to MIT-339)

4 3 30 70 100

MIT-335 Data Ware Housing and Data

Mining

MIT-336 Linux/UNIX with shell

Programming

MIT-337 Software Project Management

MIT-338 Cryptography and Network

Security

MIT-339 Multimedia Applications

MIT-361 Lab on MIT-331 4 3 50 50 100

MIT-362 Lab on MIT-332 4 3 50 50 100



P a g e | 25

Objective:

The course is designed to introduce students to the concept the .Net framework. The course shall

cover Visual Basic .Net as well as ADO .Net. Emphasis of the course is on enhancing

programming skills of students for developing projects.

Unit-I

.Net Framework and IDE : Introduction To .Net Framework, .Net Architecture, Advantages of

Dot Net Frame Work, Common Language Runtime, MSIL And JIT, Class Library, Integrated

Development Environment (IDE): IDE Components, Windows Forms and Basic Controls,

Windows Forms And Events, Message Box, Basic Controls like Command Buttons, Text Box, List

Box, Radio Buttons, Labels, Link Labels, Combo Box, Building Small Applications.

Unit-II

C# Basics: C# Literals, Variables & Data Types, Operators and Expressions.

Working with Events and Event Driven programming

Conditional Logic: Introduction, Decision Making With If Statement, Simple If Statement,

If…Else Statement, Nesting Of If …..Else Statements, Else If Ladder, Switch Statement,?

Operator.

Looping Logic: Introduction, The While Statement, The Do Statement, For Statement, For Each

Statement, Jumps In Loops.

Branching Logic: Arguments, Call by value, Call by reference, Passing Objects and Lists

Unit-III

Manipulating Strings: Introduction, Creating Strings, String Methods, Inserting Strings Using

System, Comparing Strings, Finding Substrings, Mutable Strings, Arrays of Strings.

Managing Errors and Exceptions: Introduction, Types of Errors, Exceptions, Syntax of

Exception Handling Code, Multiple Catch Statements. Working with Date and Time

Unit-IV

Classes and Objects: Introduction, Inheritance – Single and Multiple, Polymorphism- Function

Overloading and Operator Overloading.

Interfaces: Introduction, Defining an Interface, Extending an Interface, Implementing Interfaces,

Interfaces and Inheritance, Abstract Class and Interfaces.

Delegates and Events: Introduction, Delegates, Delegate Declaration, Delegate Methods,

Delegate Instantiation, Delegate Invocation, Using Delegates.


Course Title: Dot Net Technologies using C#

Credits: 4

Maximum Marks : 100





P a g e | 26

Unit-V

Data Base Connectivity: Data Access with ADO .Net, Using Databases, Server Explorer, Data

Adapter and Datasets, Working with ADO .Net, Architecture of ADO .Net.

Using Data controls: Data Grid, Data Binding, Creating New Data Connection in Code.

Crystal Reports: Creating Crystal Reports, Creating Custom Reports, Report Field Validation

&Exporting Reports.









Text Books:

1. Platt ,D S (2005), “Introducing Microsoft .Net”, Microsoft Press,PHI.

2. Simon et. al(2005) , “ C# for Begineers”, Wrox Publications.

3. Simon et. al(2005) , “Professional C#”, Wrox Publications.

References:

1. Schildt,H(2005), “The Complete Reference C #”,TMH.


P a g e | 27

Course Code: MIT-332 Course Title: Java Programming. Credits: 4


Objective

This course acquaints students with object oriented programming concepts and other advanced

features and their implementation in Java language.

Unit-I

Introduction: An overview to Java, Comparison with other languages (C & C++), Java and Internet, Features of Java, Introduction to Java Virtual machine, Object Oriented Programming Concepts: Abstraction, Encapsulation, Inheritance and Polymorphism. Data types: Integers, Floating point, Character type and Boolean. Variables: Assignment, Initialization and Conversions. Operators: Arithmetic, Assignment, Modulus, Relational, Boolean and Bitwise. Unit-II Arrays: Single and Multidimensional. Control statements: Conditional statements, Iteration Statements and Jump Statements. Classes & Methods: Class Fundamentals, Declaring Objects, Creating Methods, Constructors, Command Line Arguments & Argument Passing. Unit-III Inheritance: Basics Of Inheritance, Super Class, Member Access, Creating a Multilevel Hierarchy, Method Overriding, Dynamic Method Dispatch & Abstract Class, Static and Super Keywords Packages & Interfaces: Defining and Importing Packages, Understanding Class path, Access Protection, Defining and Implementing Interfaces. Exception Handling: Fundamentals of Exceptions, Exception Types, Using Try and Catch, Throwing Exceptions, Built-In Exceptions in Java, User Defined Exceptions. Unit-IV Multithreaded Programming: Java Thread Model, Creating & Working with Threads, Thread Priorities, Introduction To Synchronization and Dead Locks. String Handling: String Constructor, String Operations, Character Extraction, String Searching & Comparison, String Buffer Class, String Buffer V/s String Class. Unit-V I/O Streams: Stream Classes, Reading & Writing to Console, Accessing files & Directories, File Input and Output Stream, Byte Array Input & Output Stream. Applets: Overview, Life cycle of an Applet, HTML tag, Parameter Passing, Applet vs. Applications. AWT: Introduction, working with awt controls, layout managers. JDBC: Introduction to JDBA, Connection, Statement, Resultset Classes.


P a g e | 28









Text Books:

1. Schildt, H (2004), “The Complete Reference Java-2 “, Sixth Edition , TMH.

References:

1. Dietel & Dietel (2006), “Java: How to Program Java 2”, Sixth Edition, Pearson

Education.

2. Horstmann & Cornell (2006), “Java2 Vol-1 & Vol-2”, Seven Indian Reprint, Pearson

Education.


P a g e | 29

Course Code: MIT-333 Course Title: Wireless & Mobile

Communication. Credits: 4


Objective

The objective of the course is to make the students acquainted with the technologies involved in

wireless communications and make them understand the mobile communication infrastructure

and operating environments.

Unit I

Introduction to Wireless Communication: Various types of wireless communication systems

(paging system, Cordless telephone systems, Cellular telephone systems); Comparison of

common wireless communication systems; Applications of wireless communication; Introduction

to various generations of mobile phone technologies and future trends; Concept of Mobile

originated & Mobile terminated calls.

Unit II

Introduction to Cellular concept: Cell fundamentals; Frequency reuse; Channel assignment

strategies; Handoff strategies (Prioritizing & Practical handoff considerations); Concept of

coverage area, Cell splitting and sectoring.

Unit III

Wireless transmission concepts: Concept of signals; Antennas, Types of antennas; Signal

propagation (Path-loss of radio signals, Multi-path propagation); Concept of multiplexing,

Comparison of FDM, TDM, CDM techniques; Basic Concept of spread spectrum (SS) techniques

(Direct sequence and Frequency hopping spread spectrum).

Unit IV

Introduction to IS-95 CDMA: concept of CDMA channels (Forward and Reverse CDMA channels

for a cell; Concept of code channels within CDMA channel; Purpose of pilot, Sync, Paging and

traffic channels.

General introduction to GPRS, Bluetooth, Infrared technology.

Unit V

Mobile Communication system: Basic GSM architecture; Terminology and interfaces;

Components of wireless communication infrastructure (MS, BTS, BSC, MSC) their basic functions

and characteristics; Mobility management issues – initiation of handoffs, types of handoffs,

Concept of roaming and Registration; Use of HLR and VLR in mobile networks.


P a g e | 30


The question paper will be divided into three sections. Section A will include 15 very

short answer type questions not exceeding 20 words / multiple choices / fill in the blanks, each


questions. Section B will contain two short answer questions from each unit with internal choice,

and the candidates will be required to answer one from each unit. Each question of this section

will carry 5 marks. Section C will comprise five long answer questions, one from each unit. Each

question will carry 10 marks and candidates will be required to answer any three.

Text Books :

1. Jochen Schiller “Mobile Communication”, 2nd Ed., Pearson edition.

2. K. Pahlavan, P. Krishnamurthy “Principles of Wireless Networks”, PHI, New Delhi.

3. Theodore S. Rappaport “Wireless Communication Principles & Practice”, 2nd Ed. PHI, New

Delhi.


P a g e | 31

Objective:

The objective of the course is to introduce students to the basic concepts of theory of computation.

The students shall also get acquainted with the relationship among formal languages along with

notion of computability and common paradigms of computing.

Unit-I

Mathematical Tools & Techniques: Sets, Relations and Functions, Equivalence Relations,

Strings and languages, Boolean Logic, Fundamental Proof Techniques, Introduction to Grammar.

Unit-II

The Theory of Automata: Definition of an Automaton, Description of a Finite Automaton,

Transition Systems, Acceptability of a String by a Finite Automaton. Nondeterministic Finite State

Machines, The Equivalnce of DFA and NDFA, Minimization of Finite Automata.

Unit-III

Transducers: Mealy and Moore machines, Conversion.

Regular Sets & Regular Grammars: Regular Expressions, Pumping lemma for Regular Sets,

Application of Pumping lemma, Closure properties of regular languages.

Unit-IV

Context Free Grammars: Introduction, Right-Linear Grammar, Left-Linear Grammar,

Derivation Trees, Parsing and Ambiguity, Top-down Parsing, Bottom-up Parsing, Normal Forms

(Chomsky Normal Form, Greibach Normal form).

Pushdown automata: Introduction, Relationship between pushdown automata and context free

languages.

Unit-V

Turing machine, Turing machine Model, Transition Function and Instantaneous Description and

moves for Turing machine, Overview of types of Turing machine (Multi-tape TM, Non

determinism TM, Multi-Dimensional and Multi-head TM), Recursive languages, Recursive

enumerable languages, Concept of Halting problem, Church-Turing Thesis.


Course Title: Theory of Computation

Credits: 4

Maximum Marks : 100





P a g e | 32









Textbook:

1. Eugene Xavier, S.P, “Theory of Automata and Formal Languages and Computation”, New

Age International Publishers, New Delhi.

2. Mishra, K.L.P., and Chandrasekaran, N. (2010), “Theory of Computer Science: Automata,

Languages and Computation”, PHI Learning Private Limited, New Delhi.

References:

1. Hopcroft, J., and Ullman, J. (1979), “Introduction to Automata Theory, Languages and

Computation”, Addison-Wesley.

2. Hopcraft J, R. Motwani, and J. Ullman, “Introduction to Automata Theory, Languages and

Computation, 3rd

Ed. 2006, Addison-Wesley.


P a g e | 33

Course Code: MIT-335 Course Title: Data Warehousing & Data Mining Credits: 4


Objective:

The course will introduce concepts and techniques of data mining and data warehousing,

including concept, principle, design, application of data warehousing and data mining.

Unit-I Data warehouse: Definitions, features, building blocks/ components, data marts, Meta data in data warehouse, planning a data warehouse. Business requirements: data design, the architectural plan, Data storage specifications, Information delivery strategy. Dimensional analysis, requirements gathering methods, Requirements definition: scope and content. Unit-II Architecture and Infrastructure: Concept of data warehouse architecture, operational infrastructure, physical infrastructure, hardware and operating systems, database software, tools. The role of metadata, metadata types, metadata requirements. Principles of dimensional modelling: Objectives, STAR schema, STAR Schema Keys, Advantages of the STAR Schema. Unit-III OLAP in the Data Warehouse: Demand for Online analytical processing, need for multidimensional analysis,, limitations of other analysis methods, OLAP definitions and rules, OLAP characteristics, major features and functions, general features, dimensional analysis. Hypercube: Drill-down and roll-up, slice-and-dice or rotation, OLAP models: overview of MOLAP model and ROLAP model, ROLAP versus MOLAP. Unit-IV Data Mining Basics: Data Mining, The knowledge discovery process, OLAP versus data mining, data mining and the data warehouse, Major Data Mining Techniques (Classification, Clustering and decision trees). Data pre-processing: Data cleaning, Data Integration and Transformation

Unit-V

Applications and Trends in Data Mining: Social Impacts of Data Mining, Data mining and WWW, Mining Text Databases, Mining Spatial Databases, Data Mining tools: Overview of WEKA, Applications and Trends in Data Mining.


P a g e | 34









References:

1. M. Jarke et al. Fundamentals of Data Warehouses (2nd ed.), Springer, 2003, ISBN 3-540-42089-4.

2. J. Han, M Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann, 2001, ISBN 1-55860-489-8.

3. C. Seidman, Data Mining with Microsoft SQL Server 2000 Technical Reference Microsoft Press, ISBN 0-7356-1271-4.

4. Alex Berson, Stephen J. Smith, “Data Warehousing, Data Mining, & OLAP”, McGraw-Hill, 1997.

5. Richard J. Roiger, Michael W. Geatz, “Data Mining & Tutorial-Based Primer”, Addison Wesley, 2003.


P a g e | 35

Course Code: MIT-336 Course Title: Linux/UNIX with shell Programming Credits: 4


Objective The objective of this subject is to make students aware of UNIX in terms of basics and administration. Unit-I Unix Fundamentals: Introduction to Open Source Software & Unix, History of Unix, Features of UNIX Operating System, UNIX System Organization ( The Kernel and the Shell), Directories and Files, Directory Hierarchy and Permission Modes, System Call and Library Functions, Editors ( vi and ed).

Unit-II Shell Scripting: Introduction, Types of Shells , Shell Meta Characters, Shell Variables, Shell Scripts, Shell Commands, The Environment Variables, String Manipulation, Special Command Line Characters , Decision Making and Loop Control, Functions, Arrays, Arithmetic Expression Evaluation, Data Compression Commands, Shell Input & Output. Unit-III Unix System Interface with C: Compiling and Running C Programs Under Unix, Command Line Arguments, Background Processes, Process Scheduling, Process Synchronization, Sharing of Data, User- Id, Group-Id, Pipes, Message Queues, Shared Variables. Unit-IV Unix System Administration: Introduction, File System, Mounting and Unmounting , Creating Files, Formatting File System, Storage of Files , Disk Related Commands, Disk Quotas, Adding User and Group, Deleting User and Group, Password File, System Booting , Shutting Down, Handling User Accounts, Installing and Managing Terminals, Back Up, Security. Unit-V Awk: Introduction, Specifying Patterns (Regular Expressions, Comparison, Compound, Range Patterns, BEGIN and END Sections) Variables Working With (Strings, Numbers, Arrays) Control Statements, Input and Output in Awk.


P a g e | 36





questions. Section B will contain two short answer questions from each unit with internal choice,

and the candidates will be required to answer one from each unit. Each question of this section will

carry 6 marks. Section C will comprise five long answer questions, one from each unit. Each

question will carry 10 marks and candidates will be required to answer any three.

Text Books:

1. Das, S (2002), “Unix Concepts and Applications” , TMH. 2. Kanitkar,Y (2004), “ Unix Shell Programming”, BPB.

References:

1. Kernighan & Pike(2000), “Unix Programming Environment”, PHI. 2. Parata(2002), “Advanced Unix Programming guide,” BPB. 3. Petersen ,R L(2000), “The Complete Reference”, TMH. 4. Rosen, K H (et. al) (2004). “UNIX: The Complete Reference”, TMH.


P a g e | 37

Course Code: MIT-337 Course Title: Software Project Management Credits: 4


Objective This course is intended to address the issues of the planning, monitoring and control of software projects. Unit I Introduction to project management Introduction to project management: What is Project Management, Importance of software project management, Problems with Software Projects, Stages of Project: The Feasibility Study, the Cost-benefit Analysis, Planning, Project Execution, Software development life cycle. The Stakeholder of Project, The Role of Project Manager, Project Management Framework, Software Tools for Project Management. Unit II Project Planning Project Planning: Integration Management: What is Integration Management, Project Plan Development, Plan Execution, and Scope Management, What is Scope Management, Methods for Selecting Projects, Project Charter, Scope Statement, Work Breakdown Structure, Stepwise Project Planning, Main Steps in Project Planning. Unit III Project Scheduling Project Scheduling: Time Management, Importance of Project Schedules, Schedules and Activities, Sequencing and Scheduling Activity, Duration Estimating and Schedule Development, Critical Path Analysis, Program Evaluation and Review Technique (PERT). Unit IV Project Cost Management Project Cost Management: Importance and Principles of Project Cost Management, Resource Planning, Cost Estimating, Types of Cost Estimates, Expert Judgment, Estimating by Analogy, COCOMO Model. Unit V Project Risk Management Project Risk Management: The Importance of Project Risk Management, Common Sources of Risk in IT projects, Risk Identification, Risk Quantification, Risk Response Development and Control.


P a g e | 38

Note for Paper Setting: The question paper will be divided into three sections. Section A will include 15 very short answer type questions not exceeding 20 words / multiple choices / fill in the blanks, each carrying 1 mark equally distributed from all units. The candidate will be asked to answer all the questions. Section B will contain two short answer questions from each unit with internal choice, and the candidates will be required to answer one from each unit. Each question of this section will carry 5 marks. Section C will comprise five long answer questions, one from each unit. Each question will carry 10 marks and candidates will be required to answer any three. References:

1. Hughes Bob and Cotterell Mike, (2005), “Software Project Management” Third Edition, Tata McGraw-Hill.

2. Jalote Pankaj,(2002), “Software Project Management in Practice”. 3. Kelkar S.A., (2003), “Software Project Management, A Concise Study.”

4. Marmel Elaine, (2003), “Microsoft Office Project Bible”, Wiley Publishing Inc. 5. NIIT, (2004), “Basics of Software Project Management”. PHI

6. Schwalbe Kathy, (2003), “Information Technology Project Management “International, Student Edition, THOMSON Course Technology.


P a g e | 39

Course Code: MIT-338 Course Title: Cryptography & Network Security. Credits: 4


Objective

The course is designed to introduce the basic concepts of cryptography & network security to

students.

Unit-I Introduction to concept of security, Need for security, Security approaches (security models, security management practices), Principles of security, Types of attacks (theoretical concepts, practical side of attacks, packet sniffing, packet spoofing)

Unit-II Introduction to Cryptographic Techniques, Plain text, Cipher text, Substitution techniques, Transposition techniques, Encryption, Decryption, Symmetric Key Cryptography (overview of DES), Steganography, Key range, Key size, Possible types of attacks. Unit-III Asymmetric key Cryptography(Overview), RSA algorithm, Digital signatures, Overview of Knapsack algorithm, Public Key Infrastructure (PKI), Digital Certificates, Private Key Management, PKIX Model.

Unit-IV Internet Security Protocols, Basic Concepts, Secure Socket Layer(SSL), Secure Hyper Text Transfer Protocol (SHTTP), Time Stamping Protocol (TSP), Secure Electronic Transaction (SET), Electronic Money, Email Security, Wireless Application Protocol (WAP) Security.

Unit-V User Authentication Mechanism & Network Security, Authentication Basics, Passwords, Authentication Tokens, Certificate based Authentication, Biometric Authentication, Kerberos, Firewalls, IP Security, Virtual Private Networks.


P a g e | 40









Text Books:

1. Atul Kahate, “Cryptography and Network Security”, TMH.

References:

1. William Stallings, “Cryptography and Network Security: Principles and Practices,” PHI.


P a g e | 41

Course Code: MIT-339 Course Title: Multimedia Applications Credits: 4


Objective The course has been framed to introduce basic concepts of image, sound and video to the students and introduce them to Multimedia products like Photoshop and flash.

Unit I Multimedia and personalized computing: Multimedia applications, Distributed multimedia system, Framework for multimedia system: Information model, distributing processing model, Network model, conferencing model.

Unit II Image: Image data types, color lookup tables, popular file formats (Gif, Jpeg, PNG), Color models in images. Video: Fundamental concepts in video, color models in video, introduction to video compression, MPEG-1.

Unit III Sound: Basics of digital audio, Musical Instrument Digital Interface (MIDI). Coding of audio, basic audio compression techniques.

Unit IV Photo shop: Photoshop's Environment, Selections: Editing and Manipulating Images, Painting and Drawing Tools, Color Modes and Models, Adjusting Color, Moving Pixel Paint, Digital Paint, Layers, Effects and Filters.

Unit V Flash: Flash Editor, Panels, Timeline, Tools, Saving & Uploading Files . Grouping, Arranging. Graphic Symbols, Alignment, Layers. Key frames, Frame by Frame, Animation, Onion Skins, and Frame Rate. Motion Tweening, Stop Action, Rotate & Spin, Info Panel, Movie Explorer, Shape Tweening. Publishing and Exporting.


P a g e | 42


The question paper will be divided into three sections. Section A will include 20 very short answer type questions eliciting answers not exceeding 20 words / multiple choices / fill in the blanks, each carrying 1 mark equally distributed from all units. The candidate will be asked to answer all the questions. Section B will contain two short answer questions from each unit with internal choice, and the candidates will be required to answer one from each unit. Each question of this section will carry 6 marks. Section C will comprise five long answer questions, one from each unit. Each question will carry 10 marks and candidates will be required to answer any three.

References: 1. John F. Koegel Buford,(2005) “Multimedia systems” , Pearson .

2. Ze-Nian Li, Mark S. Drew,(2004), “Fundamentals of Multimedia”, Prentice-Hall . PHI,

New Delhi.


P a g e | 43

PROPOSED COURSE SCHEME FOR B.Sc.-IT FOR THE YEAR

2013, 2014, 2015

M.Sc.-IT – SEMESTER-VI



a) Dissertation

Students are required to select a topic for the project work and prepare a dissertation on it. The

student will submit a synopsis at the beginning of the semester for the approval of the project

committee, in a specified format. Synopsis has to be submitted within two weeks. The first

defense, for the dissertation work, will be held within a month. The final Dissertation Report is

required to be submitted in a specified format to the school for evaluation purpose.

b) Seminar & Progress Report

The student will have to present the progress report of the project work through seminars at the

interval of four weeks during the semester. Minimum two seminars will be held during the

semester.

c) Comprehensive Viva Voce

Students are required to appear for viva-voce exam after the completion of project work to defend

the dissertation findings.

Course Code Course Title Credits


Duration Marks

Hours SA UE Total

MIT-431

a) Dissertation 10 - 50 200 250

b) Seminar & Progress

Report

02 - 50 - 50

c) Project Viva Voce 04 - 50 50 100


m.sc. it sllabus updated

Documents