I want to do M.Sc IT course of Punjabi University so can you please provide me the syllabus of M.Sc IT I year of this University?

Ok, here I am providing you the syllabus of M.Sc IT I year course of Punjabi University.

Punjabi University M.Sc IT I year syllabus

Ist Year

Semester-I

MS-111 Introduction to Information Technology
MS-112 Computer Programming using C
MS-113 Computer Organization & Architecture
MS-114 Mathematical Foundation of Computer Science
MS-115 Operating Systems
MS-116 Programming Lab-I

Semester-II

MS-121 Object Oriented programming Using C++
MS-122 Data & File Structures
MS-123 Visual Basic
MS-124 RDBMS & Oracle
MS-125 Programming Lab-II
MS-126 Programming Lab-III

MS-111 : Introduction to Information Technology

Maximum Marks: 75
Maximum Time: 3 Hrs.
Minimum Pass Marks: 35%
Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.

SECTION A

Computer Fundamentals: Block structure of a computer, characteristics of computers, problem solving with computers, generations of computers, classification of computers on the basis of capacity, purpose, and generation.
Number System: Decimal, hexadecimal, and octal systems, conversion from one system to the other.
Binary Arithmetic: Addition, subtraction and multiplication.

SECTION-B

Memory types: Magnetic core, RAM, ROM, Secondary, Cache, Input and Output Units : functional characteristics ; Overview of storage devices : floppy disk, hard disk, compact disk, tape ; Printers : Impact, non-impact. Graphical I/O devices: Light pen, joystick, Mouse, Touch screen; OCR, OMR, MICR

SECTION-C

Computer languages: Machine language, assembly language, high level language, 4GL. Compiler, Interpreter, Assembler, System Software, Application Software.
Operating system: Functions of an operating system, Batch, multi-programming, time sharing, multi-processor, Multi-tasking.
Data Network and Communication: Network types, Transmission Modes, Network topologies,
Internet: Evolution of Internet, E-mail WWW, FTP, TELNET, IRC, Video Conferencing.

SECTION-D

Information Technology and Society : Applications of Information Technology in Railway, Airline, Banking, Insurance, Inventory Control, Hotel Management, Education, Mobile Phones, Information Kiosks, Weather Forecasting, Scientific Application,
E-Commerce: Meaning, its advantages & limitations, Types of E-Commerce.
Multimedia: Concepts, Components and Application, Entertainment Marketing.

For complete syllabus here is the attachment

Punjabi University M.Sc IT I year syllabus


SECTION A

Computer Fundamentals: Block structure of a computer, characteristics of computers, problem solving with computers, generations of computers, classification of computers on the basis of capacity, purpose, and generation.
Number System: Decimal, hexadecimal, and octal systems, conversion from one system to the other.
Binary Arithmetic: Addition, subtraction and multiplication.

SECTION-B

Memory types: Magnetic core, RAM, ROM, Secondary, Cache, Input and Output Units : functional characteristics ; Overview of storage devices : floppy disk, hard disk, compact disk, tape ; Printers : Impact, non-impact. Graphical I/O devices: Light pen, joystick, Mouse, Touch screen; OCR, OMR, MICR

SECTION-C

Computer languages: Machine language, assembly language, high level language, 4GL. Compiler, Interpreter, Assembler, System Software, Application Software.
Operating system: Functions of an operating system, Batch, multi-programming, time sharing, multi-processor, Multi-tasking.
Data Network and Communication: Network types, Transmission Modes, Network topologies,
Internet: Evolution of Internet, E-mail WWW, FTP, TELNET, IRC, Video Conferencing.

SECTION-D

Information Technology and Society : Applications of Information Technology in Railway, Airline, Banking, Insurance, Inventory Control, Hotel Management, Education, Mobile Phones, Information Kiosks, Weather Forecasting, Scientific Application,
E-Commerce: Meaning, its advantages & limitations, Types of E-Commerce.
Multimedia: Concepts, Components and Application, Entertainment Marketing.

Text Books :
1. Vishal Goyal, Lalit Goyal, Pawan Kumar, A Simplified Approach to Data Structures, Shroff Publications
2. Shubhnandan S. Jamwal, Programming in C, Pearson Publications

References:

3. P. K. Sinha and P. Sinha, "Foundation of Computers", BPB.
4. D. H. Sanders, “Computers Today”, McGraw Hill, 1988.
5. Satish Jain , " Information Technology", BPB 1999.
6. David Cyganski, John A. Orr, “ Information Technology Inside and Outside” Pearson Education 2002.
7. V. Rajaraman, “Fundamentals of Computers” (2nd edition), Prentice Hall of India, New Delhi, 1996.
8. B. Ram, “Computer Fundamentals”, Wiley, 1997.







L T P C
4 1 0 5
MS-112 : Computer Programming using C

Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.


SECTION A
Problem Solving with Computers, c character set, identifier, constants, variables, rules for defining variables, Data types, operators: arithmetic, relational, logical, comma, conditional, assignment, arithmetic expressions, input and output statements, assignment statements.

SECTION B
Decision statement: if, if ---else, nested if, switch statement, break statement, continue statement, go to statement.
Loops and control statements: While loop, for loop and do-while loop, nested loops
Arrays: one dimensional Array, multi dimensional arrays, array initialization.

SECTION C
Pointers: Pointer data type, pointers and arrays, pointers and functions.
Functions: definition, declaration, function prototype, types of functions, call by value, call by reference, recursion, processing character strings.

SECTION D

Structures: Using structures, arrays of structures and arrays in structures, union
Files in C: Sequential files, random access files , Unformatted files, Text files, binary files.

Text Books :

1. Shubhnandan S. Jamwal, Programming in C, Pearson Publications

Reference:

1. Kamthane, “Programming with ANSI and Turbo C”, Pearson Education
2. Rajaraman, V, “Fundamentals of Computers”, PHI
3. E. Balagurusamy, “Programming in C”, Tata McGraw Hill.
4. Kanetkar, “Let Us C”, BPB Publications.


















L T P C
4 1 0 5

MS-113 : Computer Organisation and Architecture


Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.


SECTION A

Concepts about bits, bytes and word, Number System: Number conversions, Arithmetic operations, Integer and floating point representation.
Character codes (ASCII, EBCDIC, BCD, 8421, Excess-3). Boolean expression - Minimization of Boolean expressions -- Minterm - Maxterm - Sum of Products (SOP) - Product of Sums (POS) - Karnaugh map Minimization - Don't care conditions - Quine-McCluskey method of minimization.

SECTION B

Basic Gates, Combinational logic design: half-adder, full adder, half subtractor, full subtractor, binary parallel adder, Multiplexer/ Demultiplexer, decoder, encoder.
Sequential circuits: concept, flip-flops (D, RS, JK, JK-Master-Slave, T), counters (Ripple, Asynchronous, Synchronous, Decade, Mod-5),
Instruction codes, Instruction formats, Instruction cycle, Addressing modes.

SECTION C

Register Transfer Language, Arithmetic, Logic and Shift micro-operations, Arithmetic Logic Shift unit.
Control Memory: Design of control unit, Microprogrammed and Hardwired control unit (overview only), Features of RISC and CISC.

SECTION D
Memory organisation: Concepts of semiconductor memory, CPU- memory interaction, organization of memory modules, Cache memory and related mapping and replacement policies, Virtual memory.
I/O organisation: I/O interface, Modes of data transfer: Programmed I/O, Interrupt initiated I/O, DMA.

References:

1. M.M. Mano, “Computer System Architecture”, Third Edition , Prentice-Hall of India, 2002.
2. A.S.Tannenbaum, “Structured Computer Organisation”, Prentice- Hall of India, 1999
3. William Stallings, " Computer Organosation and Architecture", 6th edition, Pearson Education , 2002.


















L T P C
4 1 0 5
MS-114 : Mathematical Foundation of Computer Science


Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.

SECTION A

Logic: Propositions, Implications, Precedence of Logical Operators, translating English Sentences, System Specifications. Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Order of Quantifiers, Sets, Power Set, Set Operations, Functions, One-to-One Functions and Onto Functions, Inverse and Composition of Functions, Floor Function, Ceiling Function.

SECTION B

Algorithms, Searching Algorithms, Sorting, Growth of Functions, Big-O Notation, Big-Omega and Big-Theta Notation, Complexity of Algorithms, Mathematical Induction, The Basic of counting, The Pigeonhole Principle.

SECTION C

Recurrence Relations, solving recurrence relations, Divide and Conquer Algorithms and Recurrence Relations, Generating functions for sorting recurrence relations, Inclusion-Exclusion.
Relations and their properties, n-any relations and their applications, representing relations, closure of relation, equivalence relations, partial ordering.

SECTION D
Graphs: Introduction, terminology, Representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamiltonian Paths, Shortest Path Problems, Planar Graphs.

Text Books:

1. Rosen, K.H: Discrete Mathematics and Its Applications 5th Edition, TMH Publications.

References Books :

1. Discrete and Combinational Mathematics, Ralph P. Grimaldi 4th Edition, Pearson Education.
2. Elements of Discrete Mathematics, C. L. Luie, TMH Publications.
3. Discrete Mathematics Fiftt Ediion, Richard Johnson Baugh Pearson Education.
4. Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay & R. P. Manohar, 9th Editiion, MGH Publications.
5. Discrete Mathematical Stuctures B. Kotman, R.C. Busbay, S.Ross, PHI.




L T P C
4 1 0 5

MS-115 : Operating System

Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45


Section-A

Introduction to Operating System: Definition, Types of Operating system, Operating system components, Operating system services.
Process Management: Process concept, Process cs. threads, CPU scheduling criteria, Scheduling algorithms, and Algorithm evaluation


Section-B

Memory Management: Background, logical vs. physical address space, Contiguous memory management schemes using Multi partition memory allocation using fixed number of tasks and variable number of tasks, paging and segmentation.
Virtual Memory management: Concept, demand paging and demand segmentation.

Section-C

File Management: File concept, Access methods, directory structure, Allocation methods – contiguous, linked and indexed.
Mass storage structure: Disk structure, disk scheduling algorithms.

Section-D

Deadlocks: Deadlock characterization, Methods for handling deadlocks, Deadlock prevention, avoidance, detection and recovery.
Protection: Goals of protection, Access matrix.
Security: Security problem, Program threats, system threats, User Authentication, Cryptography.

References:
1 Silberschatz and Galvin, "Operating System Concepts", Sixth edition, Addison-Wesley publishing, Co., 1999.
2. Nutt. Gary : "Operating Systems" Addison Wesely Publication, 2000.
3. Hansen, Per Brinch, "Operating System Principles", Prentice-Hall. 1984.
4. N. Haberman, "Introduction to Operating System Design", Galgotia Publication, 1986.
5. Hansen, Per Brich, "The Architecture of Concurrent Programs", PHI, 1978.
6. Shaw, "Logical Design of Operating System", PHI, 1978.




























L T P C
0 0 8 8

MS-116 : Programming Lab-I

Maximum Marks: 100 * Max. Time: 3 Hrs.
Minimum Pass Marks: 35% Practical sessions to be conducted: 60-65

This laboratory course will mainly comprise of exercise based on subject MS-112 (Computer Programming Using C)
.
*Maximum Marks for Continuous Assessment: 25

Maximum Marks for University Examination : 75


L T P C
4 1 0 5

MS-121 : Object Oriented Programming Using C++
Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.
B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.
2. Use of non-programmable scientific calculator is allowed.
SECTION A
Evolution of OOP: Procedure Oriented Programming, OOP Paradigm, Advantages and disadvantages of OOP over its predecessor paradigms. Characteristics of Object Oriented Programming,
Introduction to C++: Identifier, Keywords, Constants,
Operators: Arithmetic, relational, logical, conditional and assignment. Size of operator, Operator precedence and associativity. Type conversion, Variable declaration, expressions, statements, manipulators. Input and output statements, stream I/O, Conditional and Iterative statements, breaking control statements.

SECTION B
Storage Classes, Arrays, Arrays as Character Strings, Structures, Unions, Bit fields, Enumerations and User defined types.
Pointers: Pointer Operations, Pointer Arithmetic, Pointers and Arrays, Multiple indirections, Pointer to functions. Functions: Prototyping, Definition and Call, Scope Rules. Parameter Passing: by value, by address and by reference, Functions returning references, Const functions, recursion, function overloading, Default Arguments, Const arguments, Pre-processor, Type casting.

SECTION C
Classes and Objects: Class Declaration and Class Definition, Defining member functions, making functions inline, Nesting of member functions, Members access control. this pointer. Objects: Object as function arguments, array of objects, functions returning objects, Const member.
Static data members and Static member functions, Friend functions and Friend classes
Constructors: properties, types of constructors, Dynamic constructors, multiple constructors in classes.
Destructors: Properties, Virtual destructors. Destroying objects. Rules for constructors and destructors.
Array of objects. Dynamic memory allocation using new and delete operators, Nested and container classes, Scopes: Local, Global, Namespace and Class.
Inheritance: Defining derived classes, inheriting private members, single inheritance, types of derivation, function redefining, constructors in derived class, Types of inheritance, Types of base classes, Code Reusability.

SECTION D
Polymorphism: Methods of achieving polymorphic behavior.
Operator overloading: overloading binary operator, overloading unary operators, rules for operator overloading, operator overloading using friend function. Function overloading: early binding,
Polymorphism with pointers, virtual functions, late binding, pure virtual functions and abstract base class
Difference between function overloading, redefining, and overriding.
Templates: Generic Functions and Generic Classes, Overloading of template functions.
Exception Handling catching class types, handling derived class exceptions, catching exceptions, restricting exception, rethrowing exceptions, terminate and unexpected, uncaught exceptions.
Files and streams: Classes for file stream operations, opening and closing of files, stream state member functions, binary file operations, structures and file operations, classes and file operations, I/O with multiple objects, error handling, sequential and random access file processing.

References:
1. Herbert Schildt, “The Complete Reference C++”, Tata McGraw-Hill, 2001.
2. Deitel and Deitel, “C++ How to Program”, Pearson Education, 2001
3. Robert Lafore, “Object Oriented Programming in C++”, Galgotia Publications, 1994.
4. Bjarne Strautrup, “The C++ Programming Language”, Addition- Wesley Publication Co., 2001.
5. Stanley B. Lippman, Josee Lajoie, “C++ Primer”, Pearson Education, 2002
6. E. Balagurusamy, “ Object Oriented Programming with C++”, Tata McGraw-Hill, 2001








L T P C
4 1 0 5

MS-122 : DATA & FILE STRUCTURES

Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.

Section A

Data Structure: Introduction to data structure and algorithm Algorithm analysis: Time space trade off algorithms and Big O notation Arrays: Introduction, one dimensional and multidimensional arrays, memory representation of arrays, operations on arrays, sparse arrays and sparse matrices and their implementation, Advantages and limitation of arrays.
Stacks: Introduction; Operation on stacks; Implementation of stacks Application of stacks: matching parenthesis, evaluation of arithmetic expressions, conversion from infix to postfix, recursion.
Queues: Introduction, operation on queues, circular queue, memory representation of queues, dequeues, priority queues, application of queues.

Section-B

Linked List: Introduction; operation on linked list, circular linked list, doubly linked list, header linked list, implementation of linked list, application of linked lists.
Trees: Introduction; Binary Tree; Threaded Binary Trees; Binary Search Tree; Balanced Trees; B-Trees; Heap

Section-C

Graphs: Introduction Graph: Graph terminology Memory Representation of Graphs: adjacency matrix representation of graphs, adjacency list or linked representation of graphs Operations performed on graphs Application of graphs

Sorting: Selection Sort, Insertion Sort, Merge Sort, Bucket Sort, Radix Sort, Quick Sort and Heap Sort
Hashing: Hashing techniques; Collision resolution; Deleting items from a hash table; Application of hashing

Section-D

File Organization: Introduction
External Storage Device: Sequential Access Storage Device (SASD), Direct Access Storage Device (DASD) Sequential File Organization: processing sequential files, operations on sequential files, advantages and disadvantages of sequential file organization Direct File Organization: introduction, processing of direct files, advantages and disadvantages of direct organization Indexed Sequential Organization: introduction, processing of indexed sequential files, advantages and disadvantages of indexed sequential organization

Text Books :
1. Vishal Goyal, Lalit Goyal, Pawan Kumar, A Simplified Approach to Data Structures, Shroff Publications

References:
1. A. Tanenbaum, Y. Lanhgsam and A.J. Augenstein, "Data Structures Using C", Prentice Hall of India, 1990
2. Loomis, “Data and File Structures”,
3. Seymour Lipschultz, “Theory and Practice of Data Structures", McGraw-Hill, 1988.
4. E. Horowitz and S. Sahni, “Data Structures with Pascal", Galgotia, 3rd Edition, 1991.
5. Robert Sedgewick, “Algorithms in C”, Pearson Education.
6. M. J. Folk, B. Zoellick, G Riccardi, “File Structures”, Pearson Education.





L T P C
4 1 0 5

MS-123 Visual Basic


Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.

SECTION A

Introduction to Visual Basic: - Creating User Interfaces with Windows Common Controls, Creating Menus for Programs, Advance Design Features, Working with Collections, Creating Classes in a Program, Working with Active Data Objects.

SECTION B

Working with forms, drawing with VB, Multiple document interface, basic Active X controls, advanced active X controls.
Extending the Capabilities of Visual Basic: - Declaring and using External Functions,
Creating ActiveX Control with Visual Basic
Communicating with Other Programs: - Using ActiveX Server, Creating ActiveX Client Applications.

SECTION C

Integrating Visual Basic with the Internet: - Writing Internet Application with Visual Basic, Web Browsing objects, using document object, Active Server Pages, using web browser controls, using history objects.

SECTION D

Creating Database Applications: - Accessing Data with Data Control
Using visual data manager, validating data, selected data with SQL, advanced data bound controls, active data objects, ADO data objects.
References:
1. Visual Basic 6.0 No Experienced Required by BPB Publication
2. Mastering Visual basic 6.0 by BPB Publications
3. Mastering Visual Basic 6.0 by Petroutsos.
4. Visual Basic 6 Complete by Sybex.
5. Mastering Database Programming with Visual Basic 6 by Petroutsos


L T P C
4 1 0 5
MS-124 : RDBMS & Oracle

Maximum Marks: 75 Maximum Time: 3 Hrs.
Minimum Pass Marks: 35% Lectures to be delivered: 40-45

A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have 5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks in all.

B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the question paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.

SECTION A

Introduction: Database Approach, Characteristics of a Database Approach, Database System Environment.
Roles in Database Environment: Database Administrators, Database Designers, End Users, Application Developers.
Database Management Systems: Definition, Characteristics, Advantages of Using DBMS Approach, Classification of DBMSs.
Architecture: Data Models, Database Schema and Instance, Three Schema Architecture, Data Independence – Physical and Logical data Independence.
Database Conceptual Modelling by E-R model: Concepts, Entities and Entity Sets, Attributes, Mapping Constraints, E-R Diagram, Weak Entity Sets, Strong Entity Sets.

SECTION B

Relational Data Model: Concepts and Terminology
Constraints: Integrity Constraints- Entity and Referential Integrity constraints, Keys- Super Keys, Candidate Keys, Primary Keys, Secondary Keys and Foreign Keys.
Relational Algebra: Basic Operations, Additional Operations, Example Queries.
Relational Calculus: Tuple and Domain Relational Calculus, Example Queries.
Database Design: Problems of Bad Database Design,
Normalization: Functional Dependency, Full Functional Dependency, Partial Dependency, Transitive Dependency, Normal Forms– 1NF, 2NF, 3NF, BCNF, Multi-valued Dependency, Join Dependency and Higher Normal Forms- 4NF, 5NF.

SECTION C

Transaction Processing Systems: Batch, On-line, Real time, Transaction ACID Properties
Database Protection: Security Issues, Discretionary Access Control-Granting and Revoking Privileges
Database Concurrency: Problems of Concurrent Databases, Serializability and Recoverability, Concurrency Control Methods-Two Phase Locking, Time Stamping,
Database Recovery: Recovery Concepts, Recovery Techniques-Deferred Update, Immediate Update, Shadow Paging.
Overview of the following:
Data Mining, Data Warehousing and OLAP, Mobile Databases, Multimedia Databases, Temporal Database, Spatial Database

SECTION D
Technical Introduction to Oracle: Structure of Oracle, Background Processes.
Data Objects: Tables, Views, Synonyms, Indexes, Snapshots, Sequences, Creation and Manipulation of Data Objects. SQL Queries. Applying Integrity Constraints. Functions, Procedures and Packages. Using Cursors and Triggers.

References:

1. Elmasry, Navathe, “Fundamentals of Database System”, Pearson Education.
2. “Oracle SQL Complete Reference”, Tata McGrawHill.
3. T. Connolly, C Begg, “Database Systems”, Pearson Education.
4. R. Ramakrishanan, J. Gehrke, “Database Management Systems”, McGraw Hill.
5. Henry F. Korth, A Silberschhatz, “Database Concepts," Tata McGraw Hill.
6. C.J. Date ," An Introduction to Database Systems”, Pearson Education.
7. M. T. Ozsu, P Valduriez, “Principles of Distributed Database Systems”, Pearson Education.
8. Naveen Parkash, “Introduction to Database Management”, Tata McGraw Hill.
9. Bobrowski, “Client Server Architecture and Introduction to Oracle 7”.
10. Jeffrey D. Ullman," Principles of Database Systems," 2nd Edition, Galgotia Pub. Pvt. Ltd.






























































L T P C
0 0 8 8


MS-125 : Programming Lab-II

Maximum Marks: 100 * Max. Time: 3 Hrs.
Minimum Pass Marks:35% Practical sessions to be conducted: 60-65

This laboratory course will mainly comprise of exercise based on subject MS-121 (Object Oriented Programming Using C++) and MS-122(Data and File Structures).
.
*Maximum Marks for Continuous Assessment: 25

Maximum Marks for University Examination : 75

L T P C
0 0 8 8


MS-126 Programming Lab-III

Maximum Marks: 100 * Max. Time: 3 Hrs.
Minimum Pass Marks: 35% Practical sessions to be conducted: 60-65

This laboratory course will mainly comprise of exercise based on subjects MS-123 (Visual Basic) and MS-124 (RDBMS & Oracle).


.
*Maximum Marks for Continuous Assessment: 25

Maximum Marks for University Examination : 75

Contact-

Punjabi University
NH 64, Urban Estate Phase II
Patiala, Punjab 147002