Give me information about required eligiblity for Master of Science in Information Technology offer by Punjabi university ?

Master of Science in Information Technology is a postgraduate Science course. Here I am giving you information about required eligiblity for Master of Science in Information Technology offer by Punjabi university .

M.Sc. Information Technology Eligibility
You have to passed a B.Sc. degree with Biology and Chemistry and Physics as main subjects with 50% or above marks from a well recognized university.
For admission you have to pass an entrance examination orgnized by collge administration.

MSC IT 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

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.


References:

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


MS-112 Computer Programming using C

Maximum Marks: 80 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.

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.

Maximum Marks: 80 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 Algebra, K-maps.

SECTION B

Basic Gates, Combinational logic design: half-adder, full adder, parallel adder.
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: memory hierarchy. Memory types: cache, associative and other types.
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.

Mathematical Foundation of Computer Science


Maximum Marks: 80 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

Fundamentals of Set Theory : Sets and subsets, Operations on sets, Cartesian product of sets, Partitions, Inclusion-Exclusion principle.
Logic : Propositions and Logical Operations, Conditional statements, Mathematical Induction.
Counting : The Basic of counting, The Pigeonhole Principle,
Matrices and Determinants: Definition, Types, Addition, subtraction, Multiplication, Adjoint, Inverse, properties of determinants.

SECTION B

Relation: Relations and diagraph, n-ary relations and their properties, Equivalence relations.
Functions : One-to-one Functions, Onto Functions, Inverse and Composition of Functions
Growth of functions: Big-O Notation, Big-Omega and Big-Theta Notation.
SECTION C

Graphs: Introduction to Graph, Graph terminology, Representing graphs and Graph Isomorphism, Connectivity, Euler Paths and Circuits, Hamillonian paths and circuits, Shortest Path Problems, Planar Graphs.

SECTION D

Recurrence Relations: Introduction, Order and Degree of Recurrence relation, Solution of linear recurrence relations, Homogeneous solution, particular solution, total solution, Generating functions.
Trees : Trees, Labelled Trees, Tree Searching, Undirected Trees, Minimum Spanning Trees.


Reference :-

1. Discrete Mathematics and its Applications, Rosen, K. H , TMH Publication.
2. Discrete Mathematical Structures. B. K. Kolman, R.C. Busby and Sharon Ross, PHI.
3. Discrete Mathematics, Richard Johnsonbaugh, Pearson Education.

MS-115 Operating System

Maximum Marks: 80 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

Computers and Software: General Systems software, Resource Abstraction and sharing; Multiprogramming Systems, Batch , Timesharing systems and Real time systems. Using operating system : Resources, Processes, Threads and objects ; Factors in operating system design, Basic functions, Implementation considerations.

Section-B

Device Management : I/O system organization, Direct I/O with polling, interrupt driven I/O, Memory mapped I/O, DMA; Buffering ; Device Drivers. Processor Management : System view of processes and Resources, Initializing Operating system, Process address spaces, Abstraction, Hierarchy, Scheduling Mechanisms, Strategies, Strategy selection, Non preemptive and preemptive strategies.

Section-C

Basic Synchronization Principles : Interacting processes, Co-coordinating processes, Semaphores, Shared memory processors. Deadlock : Problem, Model, Prevention Avoidance, Detection and Recovery; Memory management : Basics, Allocation, Relocation, Manager Strategies, Virtual Memory : Address translation.

Section-D

File Management : Files, implementations, Directories Directory implementation.
Protection and Security : Basics, Authentication, Authorization, Authorization implementation, Cryptology.

References:
1 Nutt. Gary : "Operating Systems" Addison Wesely Publication, 2000.
2. Silberschatz and Galvin, "Operating System Concepts", Sixth edition, Addison-Wesley publishing, Co., 1999.
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.

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: 20

Maximum Marks for University Examination : 80

Attached Files

Punjabi university MSC IT syllabus.doc (90.0 KB, 80 views)