Facebook Twitter Linkedin Google Plus You-tube Blogspot

Program Modules

Back
Master in Science (Information Technology): MSc-IT

Eligibility
Three years graduation degree with Mathematics/ Statistics/ Business Mathematics/ Business Statistics/ Quantitative Techniques/ Computer Science/ IT as compulsory/ Optional/ additional paper as one of the subjects either at 10+2 or at graduation level.

OR

PGDCA/BCA/B.Sc.(IT)

Semester Fee : Rs. 13,950.00 ( This amount includes Semester end Examination Fees of Rs. 900.00 ) or as revised from time-to-time

Minimum Duration  : 2 Years

Maximum Duration : 4 Years

Program Structure  :

Semester 1
Course Code Course Title
MSIT 101Information Management
MSIT 102 Operating System
MSIT 103 Object Oriented Programming in C++
MSIT 104 Computer Organization and Assembly Language
MSIT 105 Technical Communication
MSIT 106 Software Lab – I (Information Management)
MSIT 107 Software Lab – II (Object Oriented Programming in C++)
Semester 2
Course Code Course Title
MSIT 201Data Communication and Networks
MSIT 202Relational Database Management System
MSIT 203Data Structures
MSIT 204Web Technologies
MSIT 205 Software Lab – III (Relational Database Management System)
MSIT 106 Software Lab – IV (Data Structures))
MSIT 207 Software Lab – V (Web Technologies)
Semester 3
Course CodeCourse Title
MSIT 301Computer Graphics
MSIT 302Software Engineering
MSIT 303Java Programming
MSIT 304 Accounting and Financial Management
MSIT 305 Software Lab – VI (Computer Graphics)
MSIT 306 Software Lab – VII (Java Programming)
MSIT 307 Minor Project
MSCIT 102 Operating System

CSS Responsive Animated Accordion

Section A
Basics of Operating Systems:

Basics of Operating Systems: Definition, Types of Operating Systems: Mainframe, Desktop, Multiprocessor, Distributed, Clustered, Real time, Embedded and Time sharing. Simple, Layered, Monolithic and Microkernel Operating Systems. Virtual systems.


Operating System Components:

Process Management, Memory Management component, I/O Management, File Management, Protection System and Network management.


Operating System Services:

Process Execution, I/O operations, File manipulations, Communications, Error detection and recovery, Resource allocation, Accounting, System, Protection, System Calls and System Call Execution; API.

Section B
Process

Definition, Process Relationships, Process states, Process State transitions, Process Control Block, Context switching. Threads - Concept, Types and advantages of Multithreads


Process Scheduling

Definition, Scheduling objectives, Types of Schedulers, Scheduling criteria, CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time, Scheduling algorithms - Pre-emptive and Non pre-emptive, FCFS, SJF and RR. Multiprocessor schedulers. Performance evaluation of schedulers.


Inter-process Communication and Synchronization

Definition, Shared Memory System, Message passing, Critical section, Mutual Exclusion, Semaphores.

Deadlocks: Definition, Deadlock characteristics, Deadlock Prevention, Deadlock Avoidance, Deadlock detection and Recovery.

Section C
Basic Memory Management

Definition, Logical and Physical address map, Memory allocation, Contiguous, Fixed and variable partition. Internal and External fragmentation and Compaction; Paging - Principle of operation, Page allocation, Hardware support, Protection and sharing; Segmentation, Segmentation with Paging.


Virtual Memory Management

Basics of Virtual Memory, Hardware and control structures, Locality of reference, Page fault, Working Set, Dirty page/Dirty bit; Demand paging, Page replacement policies - Optimal (OPT), First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least Recently used (LRU).

Section D
Device Management: Hardware I/O organization, I/O control, Port and memory mapped I/O, DMA. Buffering and Caching. Device Drivers.)

Disk Management

: Disk Structure, Disk Formatting, Disk Scheduling and its algorithms, RAID.


Security

Authentication; Types of Threats, Detection, Prevention and correction of Threats.


File Management

File concept, File attributes - Name, Identifier, Type, Location, Size, Time, Date, user identification, File Operations, Directory Structure - Single level, Two level, Tree Structure. Disk space allocation methods - Contiguous, Linked, Indexed. Access Methods - Sequential, Indexed, Random access, File system structure, Byte sequence, Record sequence and Tree-based. Disk formatting


Security and Protection

Security threats, Security Policies and Mechanisms, Authentications

MSIT 301 Computer Graphics
Section A

Introduction to Active and Passive Graphics, Applications of Computer Graphics. Input devices: light pens, Graphic tablets, Joysticks, Trackball, Data Glove, Digitizers, Image scanner, Graphs and Types of Graphs. Video Display Devices-- Refresh Cathode Ray Tube, Raster Scan displays, Random Scan displays, Architecture of Raster and Random Scan Monitors, Color CRT-monitors and Color generating techniques (Shadow Mask, Beam Penetration) , Direct View Storage Tube, Flat-Panel Displays; 3-D Viewing Devices, Raster Scan Systems, Random Scan Systems, Graphics monitors and workstations, Color Models (RGB and CMY), Lookup Table.


Section B

Process and need of Scan Conversion, Scan conversion algorithms for Line, Circle and Ellipse, effect of scan conversion, Bresenham's algorithms for line and circle along with their derivations, Midpoint Circle Algorithm, Area filling techniques, flood fill techniques, character generation.


Section C

2-Dimensional Graphics: Cartesian and need of Homogeneous co-ordinate system, Geometric transformations (Translation, Scaling, Rotation, Reflection, Shearing), Two-dimensional viewing transformation and clipping (line, polygon and text), Cohen Sutherland, Sutherland Hodgeman and Liang Barsky algorithm for clipping.

Introduction to 3-dimensional Graphics: Geometric Transformations (Translation, Scaling, Rotation, Reflection, Shearing), Mathematics of Projections (parallel & perspective). Introduction to 3-D viewing transformations and clipping.


Section D

Hidden line and surface elimination algorithms: Z-buffer, Painters algorithm, scan-line, subdivision, Shading and Reflection: Diffuse reflection, Specular reflection, refracted light, Halftoning, Dithering techniques. Surface Rendering Methods: Constant Intensity method, Gouraud Shading, Phong Shading (Mash Band effect). Morphing of objects.