MASTER OF SCIENCE IN INFORMATION TECHNOLOGY
2002-2004

1. Duration of the Course: The Master of Science (Information Technology) course    will be of four semester  duration to be conducted in two years. Each semester will be of approximately 5 months (minimum 100 working days in a semester) duration.

2. Eligibility: Candidates seeking admission to the first semester of Master of Science Information Technology must have a bachelor’s degree with 50% marks in any discipline. Candidates seeking admission must also be conversant with Computer Fundamentals & Programming. Good aptitude in Mathematical logic is required to pursue the course and the same will be tested in the entrance examination.

  Note:  Candidates who have passed graduation (except engineering Graduates) with  10+2+3 scheme only will be considered for admission.

3.   Admission procedure

Admission will be made purely on the basis of the marks obtained in the entrance examination conducted by the University. The entrance examination shall consist of a test on mathematical ability (25%), mental ability (25%) and information technology (50%). The entrance test will be of 2 hrs duration and will carry 100 marks. There will be total 100 questions of objective type. (Each correct answer carrying 1 marks and -1/3 for an incorrect answer). Candidates who fail to score at least 40% in the entrance examination will not be eligible for admission in MSIT.  Outline for the admission test is given in Appendix –A. The standard of the syllabus of the entrance test is that required by the candidate to pursue the MSc (IT) course.

The course is designed basically for Graduates of Physical Sciences and Engineering Graduates. However, candidates from other streams who have good knowledge in Information technology  topics of DOEACC O level and  10+2 level Mathematics are made eligible for this course. Since the course requires high logical thinking, hard work and mental make up to work about 12 hrs daily in the department without routine breaks  & holidays,  candidates   are advised to make a self assessment of their  capabilities   before applying for the course.

Seats The total number of seats in Master of IT will be 20, out of which 3 seats will be reserved for SC and 2 seats for ST candidates. Out of the total candidates admitted, at least 50% of the candidates admitted will be from students who have graduated from the constituent colleges/colleges affiliated to Mohanlal Sukhadia University, Udaipur including candidates admitted against reserved seats. No other reservation will be allowed in the MSc. course.

 

Courses of Study and Examination

Semester-I                                                                                                                                                       Maximum Marks

Paper/Code     Paper Name                   Duration       Ext.     Int.      Max

                                           Lecture   Exam

Hrs     hrs

Paper-I
(MIT-101)

Computer  Architecture

50

  3

75

25

100

Paper-II
(MIT 102)

Programming Languages

50

 3

75

25

100

Paper-III
(MIT-103)

Data  structure and Algorithm

50

 3

75

25

100

Paper-IV
(MIT-104)

Digital Communication Technologies

50

 3

75

25

100

Paper-V
(MIT-105)

Computer Networks

50

 3

75

25

100

Paper-VI
(MIT-106)

Mathematical Foundations

50

 3

75

25

100

Paper-VII
(MIT-107)

Marketing & Business Strategy for IT Professionals

50

 3

75

25

100

Paper-VIII
(MIT-108)

Practical-1:  Programming Lab & IT workshop

300

 6

75

25

100

Semester-II

Paper-I
(MIT-201)

Database & Distributed Computing

 50

3

75

25

100

Paper-II
(MIT-202)

Computer Graphics

 50

3

75

25

100

Paper-III
(MIT-203)

Object Oriented Programming

 50

3

75

25

100

Paper-IV
(MIT-204)

Operating System

 50

3

75

25

100

Paper-V
(MIT-205)

Internet & Web programming

 50

3

75

25

100

Paper-VI
(MIT-206)

Information Security

 50

3

75

25

100

Paper-VII
(MIT-207)

Information systems and Technology Strategy Planning 

 50

3

75

25

100

Paper-VIII
(MIT-208)

Practical-2 : Programming Lab &  IT Workshop

 300

6

75

25

100

Semester-III

Paper-I
(MIT-301)

Embedded Systems

 50

3

75

25

100

Paper-II
(MIT-302)

Application Development for Windows

 50

3

75

25

100

Paper-III
(MIT-303)

Design, Installation and Management of Networks 

 50

3

75

25

100

Paper-IV
(MIT-304)

Unix System Administration and Programming 

 50

3

75

25

100

Paper-V
(MIT-305)

Software Engineering

 50

3

75

25

100 

Paper-VI
(MIT-306)

Electronic Commerce

 50

3

75

25

100

Paper-VII
(MIT-307)

Data Mining 

 50

3

75

25

100

Paper-VIII
(MIT-308)

Practical-3 : Programming Lab & IT Workshop

 300

3

75

25

100

Semester-IV

Paper-I
(MIT-401)

IT Infrastructure Management

50

3

75

25

100

Paper-II
(MIT-402A-402E)

Specialization (any one of the following):
(A)Wireless Communication and Mobile Computing
(B)Bioinformatics
(C)Computer Vision and Image Analysis
(D)Parallel Processing
(E) Integrated
Enterprise Wide Systems/SAP

100

3

75

25

100

Paper-III
(MIT-403A-403D)

Practical -4 : Programming Lab

200

6

75

25

100

 Project
(MIT-404)

Project Work:  300 hrs

300

 

 250

50

300

Candidates are required to stay in the department from 8.00AM to 8.00 PM attending lectures and Lab work.

Note:   Specialization offered will depend on the infrastructural facilities and
 availability of visiting faculties. Specialization 402E will be offered only on the basis of additional cost sharing by the candidates.

Scheme of Instruction: 

Each semester will be of five months (100 working days) duration. Details of lecture hours per week are as follows:

Theory:  3 hrs/week for each paper

Practical: Students are required to work in   the laboratory for 24 hrs/week carrying out practical assignments & projects as per instruction of the teachers.  The practical work will be carried out under the supervision of lab tutors. Faculty guidance for three hrs/week for each of the theory papers on which practical are based will be available for carrying out programming lab work.

Professional/Industrial Training:  100 hrs/semester professional training to the students by software professionals from   industry.

Visit to Software Industry/Institutions: Students are required to visit software industrial houses /institutions, make reports and present the same at the end of the third semester to the project examiner. 

 Examination Scheme:

1 University shall conduct examinations only after completion of at least 80 working days of instruction in each semester. External examination will be conducted on consecutive working days without any gap.

2 Each theory paper shall be of 100 marks (75 marks for written examination of 3-hrs duration and 25 marks for internal assessment

3 Each practical/Project paper shall be of 100 marks (75 marks for semester practical examination of six hours duration and 25 marks for internal assessment.

4 Students are required to answer total five questions out of eight questions in each  theory paper in the external examination

5  A committee consisting of Programme co-coordinator, Teacher concerned and One advisory committee member will award the internal marks. The committee will ensure that norms given below are followed in the award of internal marks for each theory & Practical paper.

6. Detailed outline of the course and a list of textbooks and reference books followed to teach the course will be intimated to the examiner along with a model paper to provide necessary guide lines to set question paper for the external examination.

7. In case of questions in the external examination is found outside the prescribed syllabus or not within the scope of the syllabus, the matter will be referred to the advisory board. The advisory committee will examine the matter in detail and will make specific recommendation to the University Grievance committee.  If the students walk out or boycott the examination, they will be declared failed in that paper/examination and their grievance will not be examined by the board of examiners.

8. Internal Evaluation Scheme to award internal marks

Assignments: 40% of the internal assessment marks for each theory paper will be awarded on the basis of the performance in the assignments regularly given to the students.

Internal examination: 40% of the total internal assessment marks for each theory paper will be awarded on the basis of the performance in the written examination conducted by the faculty, one at the end of the two months and another at the end of the semester.

Seminar & Oral examination: 20% of the total internal assessment marks for each paper will be awarded on the basis of the performance in a seminar and Internal viva examination.  At least one Internal Viva Voice examination per paper will be conducted by a committee consisting local examiners preferably during internal examination

Over all performance: Performance report of the student will be prepared by each teacher based on the active role played by the candidate in understanding the subject in the form of asking questions, participating in the discussion, group work, sharing of resources and knowledge with fellow students etc. The performance sheet will be made available to the prospective employers for making analysis of the capabilities of the student.

Note: Candidate who attends less than seventy percent of the total classes conducted in a paper will be awarded zero marks in the internal marks of that paper. This rule will not be relaxed under any circumstances

Students are required to keep record of the assignments, Seminars and answer books of the internal examinations and present them at the end of the semester to the advisory board of the course. The attendance / Lab log book and performance sheet of each student will be examined by the board .The internal marks awarded by the teacher will be moderated by the advisory board if necessary.

If a student has undertaken project work but failed to submit Project report before the prescribed date for submission, he/she shall be declared failed in IV semester. However he/she will be allowed to submit the same whenever next Semester examination is conducted and internal marks will be carried over.

If the project work of a student is found unsatisfactory or he/she is not carried out the project work he or she will be declared Failed in the IV th Semester examination and shall not be eligible for award of M.Sc degree. Such students will be given one more chance within one year provided they undertake a fresh project work as per rules. Internal marks if any awarded shall be treated as cancelled and student is required to undergo fresh internal examination as per rules

Vacation/holidays:  Normal holidays except national holidays and vacations declared by the University for Traditional Courses will not be applicable to this course due to professional and semester nature of the course. If required, classes may be conducted even on Sundays. However, limited semester /summer breaks applicable to the course will be declared by the Programme  co-ordinator

 Minimum passing marks and classification of the successful candidates:

A: I st semester

1. (a) The minimum marks for passing Ist semester shall be 40% in each paper and 50% marks in the aggregate.

(b)   A candidate may be promoted to second semester if he or she has secured at least 40% marks in each papers but has failed to secure 50% marks in aggregate. He/she shall be required appear in some of the papers when these papers are offered again by the university so as to satisfy the passing criteria laid in 1 (a). However, candidate will not be allowed to reappear in the practical papers to improve the percentage.

(c)   A candidate may be promoted to the second semester if he/she has secured at least 40% marks in any six papers prescribed in the first semester, provided that aggregate of marks in all papers together is at least 50%. Such candidate shall be required to appear in papers in which he/she has secured less than 40% marks when these courses are offered again so as to satisfy the passing criteria laid in 1 (a)

(d)   A candidate fails to satisfy the criteria 1 (a), 1 (b), and 1 (c) for promotion to 2nd semester shall be required to rejoin the course in the first semester, if otherwise eligible in accordance with the university regulations laid in this regard.

(e)   In case result of the first semester is not declared by the university, before the starting of the second semester, all the students who have appeared in all the papers in the first semester will be allowed to attend the class of the second semester at their own risk. Candidates who are not eligible to be promoted to the second semester will have to leave the semester.

2: Second Semester

(a)    The minimum marks for passing 2nd semester shall be 40% in each paper and 50% marks in the aggregate.

(b)   A candidate may be promoted to third semester if he or she has secured at least 40% marks in each papers but has failed to secure 50% marks in aggregate. He/she shall be required appear in some of the papers when these papers are offered again by the university so as to satisfy the passing criteria laid in 2 (a). However, candidate will not be allowed to reappear in the practical papers to improve the percentage.

(c)   A candidate may be promoted to the third semester if he/she has secured at least 40% marks in any six papers prescribed in the second semester, provided that aggregate of marks in all papers together is at least 50%. Such candidate shall be required to appear in papers in which he/she has secured less than 40% marks when these courses are offered again so as to satisfy the passing criteria laid in 1 (a)

(d)   A candidate fails to satisfy the criteria 2 (a), 2 (b), and 2 (c) for promotion to 3rd semester shall be required to rejoin the course in the second semester, if otherwise eligible in accordance with the university regulations laid in this regard.

(e)   In case result of the second semester is not declared by the university, before the starting the third semester, all the students who have appeared in all the papers in the second semester will be allowed to attend the class of the third semester at their own risk. Candidates who are not eligible to be promoted to the third semester will have to leave the semester.

3: Third Semester:

(a)The minimum marks for passing 3rd semester shall be 40% in each paper and 50% marks in the aggregate.

(b) A candidate who has secured at least 40% marks in each papers but has failed to secure 50% marks in aggregate shall be required appear in some of the papers when these papers are offered again by the university so as to satisfy the passing criteria laid in 3 (a). However, candidate will not be allowed to reappear in the practical paper to improve the percentage.

(c ) A candidate may be promoted to the fourth semester if he/she has secured at least 40% marks in any six papers prescribed in the third semester, provided that aggregate of marks in all papers together is at least 50%. Such candidate shall be required to appear in papers in which he/she has secured less than 40% marks when these courses are offered again so as to satisfy the passing criteria laid in 3 (a)

(d) A candidate fails to satisfy the criteria 3(a),3(b) and  3(c) shall be required to rejoin the course in the third semester, if otherwise eligible in accordance with the university regulations laid in this regard.

(e)In case result of the third semester is not declared by the university, before the starting the fourth semester, all the students who have appeared in all the papers in the third semester will be allowed to attend the class of the fourth semester at their own risk. Candidates who are not eligible to be promoted to the fourth semester will have to leave the semester.

(4) Fourth Semester

(a)The minimum marks for passing 4th semester shall be 40% in each paper and 50% marks in the aggregate.

(b)A candidate who has secured at least 40% marks in each papers but has failed to secure 50% marks in aggregate shall be required appear in some of the papers when these papers are offered again by the university so as to satisfy the passing criteria laid in 4 (a). However, candidate will not be allowed to reappear in the practical paper to improve the percentage.

(c) No candidate shall be deemed to have satisfied examination requirement for award of  M.Sc degree unless he/she fulfills the criteria for passing first, second third and fourth  semester as laid in 1(a), 2(a) and 3 (a)  and 4(a).

No candidate will be allowed to reappear in the practical papers of first, second and third and fourth semester in which he/she obtained 50% marks to improve the percentage to satisfy the criteria for passing First, Second, third and fourth semester examination.

Note:   (1) In order to avoid loss of working days/classes due to delay in declaration of the results of the each semester examination, classes of next semester will be started after provisional admission immediately after previous semester examination. If any candidate is found not eligible for promotion to the next semester on the basis of results of their previous examinations or any other reason, their admission will be cancelled and fee deposited for that particular semester will be refunded.

                (2) If more than 50% students submit their project, University will conduct project evaluation and declare results. Candidates who fail to submit the project in time due to longer term project offered by Industry may be evaluated separately if allowed by advisory committee.

RESULT

At the end of final examination the candidate’s eligible for the award of M.Sc. Degree in Information Technology with specialization in the subject he/she had chosen in the IV the Semester. The Specialization subject will be mentioned in the mark sheets as well as on the degree. Degree shall be classified on the basis of the marks obtained in the first, second, third and fourth semester examination taken together, as follows:

(a)   First Division with distinction:

  75% or more marks in the aggregate and provided the candidate has passed all the papers and examination in the first attempt.

(b)  First Division

 60% or more marks but fails to satisfy criteria being classified as first division with distinction laid in (a)

(c)   Second Division

  All other than those included in (a) and (b) above  

The Specialization of the Course   will be marked in the Degree as well as in the mark sheet to emphasize the area of specialization.  A candidate must pass the M Sc examination within three years of the initial admission to the first semester of the course

Note: Since M.Sc (Information Technology) is a Professional course, all other examination rules will be that applicable to professional PG courses of the University

Syllabus :

MIT-101    :     Computer  Architecture

Note:   Students who have not been studied Basic electronics are required to undertake 20 hrs of basic electronics course in addition to 50 hrs of normal teaching in this paper

Introduction: Digital Logic: Introduction to combinational logic and sequential logic MSI & LSI chips, Brief history of computer architecture, and progresses, Von Neumann model of a digital computer, system bus model, and topical exploration of a typical computer.

Data Representation Basic data representation, computer arithmetic and advanced data representations, carry-look ahead addition, array multiplication, and division by functional iteration are covered. Residue arithmetic 

The Instruction Set Architecture: Basic architectural components involved in program execution. Machine language and the fetch-execute cycle: The organization of a central processing unit, Role of the system bus in interconnecting the arithmetic/logic unit, registers, memory, input and output units, and the control unit 

Assembly Language Programming  8085 and 8088 Microprocessors: Basic architecture, Registers, addressing modes, Instruction sets. Assembly language programming

Languages and the Machine Compilation process, code generation, The assembly process   for a two-pass assembler, generating symbol tables. Linking, loading, and macros  

Data path and Control: Microprogrammed control unit 

Memory: Organization of a basic random access memory, cache memory and virtual memory:  Direct, associative, and set associative cache mapping schemes, multilevel caches. Overlays, replacement policies, segmentation, fragmentation, and the translation look aside buffer 

Input and Output   Bus communication and bus access methods, Bus-to-bus bridging.  Various I/O devices commonly used such as disks, keyboards, printers, and displays. Computer buses & interfaces, PC hardware components,  I/O architecture,

Trends in Computer Architecture to cover advanced architectural features that have either emerged or taken new forms in recent years.  Reduced instruction set computer (RISC) processors and the architectural implications of RISC. Multiple instruction issue machines and very large instruction word (VLIV/) machines. Introduction to parallel and distributed architectures 

 MIT-102    : Programming Languages

Introduction to programming languages: Abstractions, language definitions, translation and design, development of programming languages Language Design Principles: Design criteria, efficiency, generality, Orthogonality, Uniformity

Syntax: Lexical Structure of Programming Languages, Context-Free Grammars and BNFs, Parse Trees and Abstract Syntax Trees, Ambiguity, Associativity, and Precedence, EBNFs and Syntax Diagrams, Parsing Techniques and Tools Lexics Versus Syntax Versus Semantics

Basic Semantics: Attributes, Binding, and Semantic Functions, Declarations, Blocks, and Scope The Symbol Table, Allocation, Extent, and the Environment, Constants and Variables, Aliases, Dangling References, and Garbage, Expression Evaluation.

Data Types: Data Types and Type Information, Simple Types, Type Constructors, Type Nomenclature in Pascal-like Languages, Type Equivalence, Type Checking

Type Conversion   
Control: Guarded Commands and Conditionals, Loops and Variations on WHILE The GOTO Controversy, Procedures and Parameters, Procedure Environments, Activations, and Allocation, Exception Handling

 Abstract Data Types: The Algebraic Specification of Abstract Data Types, Abstract Data Types in Modula-2, Abstract Data Types in Ada, Abstract Data Types in Other Languages, Overloading and Polymorphism, Modules and Separate Compilation Problems with Abstract Data-Type Mechanisms, The Mathematics of Abstract Data Types

Functional Programming: Programs as Functions, Functional Programming in a Procedural

Language Scheme: A Dialect of LISP, ML and Miranda: Functional Programming with Static
Typing, Delayed Evaluation, Lambda Calculus: A Mathematical View of Functional Programming, Dynamic Memory Management for Functional Languages.


Object Oriented Programming: Paradigms and Metaphors, ClassesLogic Programming
Logic and Logic Programs, Horn Clauses, Resolution and Unification The Language Prolog, Problems with Logic Programming, Extending Logic 

Formal Semantics of Programming Languages: A Sample Small Language, Operational Semantics, Denotational Semantics Axiomatic Semantics, Proofs of Program Correctness
Parallel Programming: Introduction to Parallel Processing, Parallel Processing and Programming Languages, Pseudoparallelism and Coroutines, Semaphores, Monitors
Message Passing, Parallelism in Nonprocedural Languages

 MIT-103    : Data Structures  and Algorithm

Programming in C   language:

Programing Strategies: Objects and ADTs, Constructors and destructors, Data Structure, Methods, Pre-and Post conditions, C conventions, Error Handling

Data Structures: Arrays, Lists, Stacks, Recursion

Searching: Sequential Searches, binary search, Trees, Red Black tress, AVL trees, Hash Tables Complexity Queues: Priority Queues and Heaps

Sorting: Bubbles, Heap, Quick, Bin, Radix

Dynamic Algorithms: : Fibonacii numbers, Binomial Coefficients, Optimal Binary Search trees, Matrix Chain Multiplication, Longest Common Subsequence, Optimal Traingularisation

Graphs:  Minimum Spanning, Dijkstra's Algorithm  Huffman encoding, FFT, Travelling Salesman's Problem

MIT-104    : Digital Communication Technologies

Note:   Students who have not been studied communication electronics in their degree are required to undertake 10 hrs of basic communication electronics course in addition to 50 hrs of normal teaching in this paper

Data communication: Theoretical model of communication; analog and digital signal, Fourier analysis; bandwidth, channel, baud rate of transmission; modulation and demodulation of digital signals; multiplexing-FDM, TDM

Transmission media: twisted pair, cable, OFC, wireless transmission: radio, microwave, infrared and light wave

Telephone system: Structure, RS232-c, CCITT V.24 and RS-449 SONETT/SDH

Switching circuit, packet,   crossbar and space division and time division switches

Narrow band ISDN: services, architecture, interface. Broad band ISDN, Virtual circuits, ATM switches

Cellular radio: paging systems, analog cellular and AMPS, digital cellular and personal communication services, communication satellites. Transmission error-error detection and correction

MIT-105    : Computer Networks

 OSI reference model: detailed discussion of services and protocols of the seven layers, TCP/IP model

LAN, MAN and WAN technologies: Ethernet, token ring, FDDI, DQDB, ISDN, B-ISDN and ATM;

Internetworking devices and issues: bridges, routers and gateway

Internet and its protocols: IP, TCP, UDP

Network application and its protocols: SNMP, telnet, FTP, HTTP, NFS

MIT-106    : Mathematical  Foundations

 Sets, relation and Functions: Definition of sets and subsets; intersection, union and complements; de Morgan’s law; cardinality; relations-equivalence relations etc.; Mappings one - one onto etc.

Calculus: Functions; limits and continuity; differentiation and integration; differential equations

Logic : Logic operator like AND, OR etc., truth tables; theory of inference and deductions; mathematical induction; Predicate calculus; Predicates and quantifiers.

Linear equations & Matrices: Row/Column operations; Gauss elimination; Decomposition; Inverse. Determinant: Properties of determinants; Cramer’s rule; Determinant to transpose and inverse.

Vector spaces: Linear independence; Bases, subspace and dimensionality.

Inner Products and Norms : Length, angle, direction cosines, orthogonalizations.

  MIT-107:  Marketing & Business Strategy for IT Professionals

 Note:   Students  who have not been studied business functions and accounting principles  are required to undertake  20 hrs of  basic   course in  above in addition to 50 hrs of normal teaching in this paper

Marketing concepts and thinking, Analysis of the business environment. Marketing segmentation and targeting product decisions. Pricing decisions. Distribution management. Advertisement and promotion, Industrial marketing, services marketing, Introduction to international marketing.

The concept of strategic environment and analysis, analysis of internal strengths and weaknesses, achieving and maintaining competitive advantage, strategy formulation, translating strategies in to policies and plans. Strategy implementation, Measurement, control and feedback, Case studies

MIT-108:  Programming Laboratory & IT workshop

(Practicals based on papers I,II,III,IV and V)

 Architecture Lab:  Assembling computer system to get  acquainted with specifications of a latest computer system , various components, I/O cards, peripherals etc. Installation of   OS (Windows 98) to get acquainted with different components  of Windows and proper configuration of OS

Digital Communication & Network Lab: Study of digital signal, modulation schemes, multiplexing. Study of  different network media, Study of  network cards, repeaters, hubs, switches, bridges and router. Implementing  10/100 mbps switched network, Remote connectivity using modem, Study of different  protocols.

Software Lab: Implementing simple algorithm to learn C   , Programming using C &    to  under stand different data structure and to implement different algorithm.

Use of Accounting & Financial Package  to prepare balance sheet/financial analysis

 Use of Foxpro to develop business applications

Minor Project: Students are required to Interact with Software professionals and IT Industry to  select and implement  a minor software project. 

IT Workshop:  Students are required to take detailed study in any one of the area and organise small workshops where they present their  work, participate in discussion

1.      Microprocessors & Interfacing
2.      Security  and ethical challenges in IT
3.      Information system analysis and design
4.      Dynamics of IT Industry
5.      Computing Models for Management Science

MIT-201:  Database & Distributed Computing

 Purpose of database systems, abstract view of data, , data models, database languages, transaction processing and transaction management, database administrator, database users, overall structure of database management system

Entity relationship model: Entity sets, attributes, relationship sets, design issues, mapping constraints, keys entity, relationship diagram,  weak entity sets, strong entity sets, design of E-R database schema, Reduction of an E-R schema to tables

Relational Model:  Structure of Relational  database, Relational algebra, modification of the relational database, creating views

SQL: Basic structure, set operations, aggregate functions, null values, nested sub queries, derived relations, views, modification of database using SQL, Joined Relations, Data Definition Language, Embedded SQL

Integrity constrains , domain constraints, referential integrity, assertions, triggers, functional dependencies

Relational database design: shortfalls, decomposition, normalization using functional dependencies, First, second and third normal forms, Boyce-cod  Normal form, normalization using multivalued dependencies

Object oriented databases: new database Applications, object oriented data model, object oriented languages

Storage and  File structures: An overview of Physical storage media, Magnetic disks, teritary storage, storage access, file organization, organization of Records in file, data dictionary storage

Indexing and hashing: Basic concepts, ordered indices, static hashing, Dynamic hashing, comparison of ordered indexing and hashing

Database system architecture: centralized system-client server systems, parallel systems, distributed systems

Distributed Databases: Distributed data storage, network transparency, distributed query processing, distributed transaction processing, distributed transaction model, concurrency control

Physical Architecture, Logical Architecture, Instance, Database.Tablespaces,Containers,Stored Procedures, User Defined Functions (UDF), User Defined Triggers(UDT)

Case studies of RDBMS Softwares:Oracle, DB2, MS SQL

MIT-202:  Computer Graphics

 Introduction to computer graphics, applications, hardware and software and fundamental ideas behind modern computer graphics, Two dimensional graphics: device independent programming, graphics primitives and attributes. Interactive graphics: Physical input devices; event driven input; user interface. Three dimensional graphics:3D curves and surfaces, projections, transformations; translation, rotation, scaling and shearing

Introduction to basic technologies, methodologies and algorithms for processing digital images by computer, colour spaces, pixel mapping, filtering, restoration, enhancement, edge detection, image segmentation and pattern classification, pattern recognition and image analysis techniques, image formation and transforms  

 MIT-203:  Object Oriented  programming    

 Introduction to  C++ Fundmentals, The Class construct and Object Oriented Design, Programmer defined data types, Example classes, constructors,Object oriented analysis and design

Implementing Abstract Data Types: Defining a sample ADT,class interface description,access restrictions, functions, data members,operator overloading,class implementation copy construction,member assignment and destruction, example classes

Lists: Arrays container classes, class vector ,string class,multidimensional arrays

Pointers and Dynamic memory, Lvalues and rvalues,pointers,arrays and pointers,strings and pointers,command line parameters, pointers to functions, dynamic objects

Inheritance: Using inheritance,reuse via inheritance, protected members and inheritance, controlling inheritance,multiple inheritance

Templates and Polymorphism: Function templates,class templates, polymorphism, abstract base classes,virtual multiple inheritance

Widows API : Simple Window class,bitmap class,events,alert message

Microsoft foundation classes

Introduction to distributed Object Technology and recent developments

MIT-204:  Operating System

 Operating systems-evolution  concepts and Overview, hardware concepts

Operating system functions and structure

Processes & Threads : Importance of process, process attributes, process vs threads, threads types, process creations and interactions

CPU scheduling: Basic concepts, scheduling criteria algorithms & evaluation

Concurrency & concurrent programming: Critical selection problem, synchronization hardware, semaphores, classical synchronization problems, monitors

Deadlocks: characterization, methods of handling-prevention, avoidance and detection

Memory Management: Constraints & Real Memory, binding, dynamic loading, linking, overlays, logical vs physical address space swapping, contiguous allocation, single partition, multipartition allocated, dynamic storage allocation, External and Internal fragmentation, paging, segmentation, segmentation with paging

Virtual memory: Demand  paging, page replacement algorithms, thrashing

File-systems: Concept, access methods, naming, directory structure, protection & Consistency semantics, File system structure, Allocation methods, Free space Management, Directory implementation performance, I/O systems & Application, I/O Interface

Secondary storage scheduling: Disk scheduling and Management

User Interface, Protection and Security

Introduction to distributed systems: Network structure, Distributed Network OS, Distributed file systems & Distributed co-ordination

Case study: Unix, Windows NT and Linux

MIT-205:  Internet & Web Programming

 Internet : Basic Concepts, architecture and Protocols:  Network Programming ,Measurement and packet analysis ,protocol stack implementation

Programming in Java: Java Programming env, Primitive Data types,Class,Objects,Methods ,Control structure, String and Arrays,File, I/O

Java Applets

Photoshop elements, XHTML and CSS, JavaScript Programming, Dynamic HTML and FLASH, DHTML.Servers(IIS,PWS,Apache). Database: SQL,MYSQL,DBI,ADO, Serverside Programming: VBScript, ASP, Perl and CGI, Phython, Web services, Servlets, VOXML, Desiging Data Interfaces with XML and XSL,WML

Websphere Studio Application Developer

MIT-206:  Information Security

Defining resources: Identifying resources,  Security classifications, Threat assessment: Human error,Natural disasters,system failures,Malicious acts and software. Loss analysis: Denial of service, Theft of resources, deletion of information,theft of information, disclosure of information, corruption of information, theft of software,theft of hardware Identifying vulnerabilities: Location of vulnerabilities, known vulnerabilities, security design flaw, incorrect implementation. Assigining Safeguards

Encryption and Decryption, secure encryption systems, protocols and Practices, Program security,  Protection  in OS, Designing Trusted  OS Database security, Security in networks and distributed systems, administering security

MIT-207:  Information Systems and Technology Strategy Planning

 Key concepts in information technology planning, Approaches taken to planning and the problems they have encountered. How theory and practice of IT planning has evolved, The philosophical basis of IT planning, Key influences in the development of planning theory, current methods and approaches to planning, critical evaluation of IT planning practices and scope for alternative radical perspectives on planning. Business process re-engineering

MIT-208:  Programming Lab & IT Workshop

  Practicals based on theory papers I,II, III,IV, V and VI

Database: Database programming using SQL/ Oracle and Oracle Developer 2000/DB2

Operating System: Unix, Linux & Windows NT ,  

Computer Graphics : Programming using C/C++

Programming in Java & Visual Basic, Visual C++,  WSAD programming

 IT Workshop:  Students are required to take detailed study in any one of the area and organise small workshops where they present their  work, participate in discussion

1.      Decision support systems
2.      Expert systems
3.      Information system Development
4.      Information Technology Management
5.      Information Services

MSCE-301     :Embedded Systems

Overview of embedded systems, Design challenge, Processor technology, IC technology, Design Technology

Custom-Single purpose processors: Custom single purpose processor design, optimizing custom single processors, Basic architecture, operation, programmers view, development environment, Application specific instruction set processors, selecting a microprocessor

Standard single-purpose processors: peripherals Timers, counters, watchdog timers, UART ,Pulse width modulator, LCD controller, Keypad controller, ADC,Real time clocks

Memory: Memory write ability and storage performance, Common memory types, composing memories, memory hierarchy and cache, advanced RAM : DRAM,FPM DRAM, EDO DRAM, SDRAM, RDRAM, Memory management Unit

Interfacing:   Arbitration, Muti-level bus architectures, Serial protocols: I2C bus, CAN bus, Fire Wire bus, USAB, Parallel protocols :PCI and ARM bus, Wireless Protocols: IrdA, Bluetooth,IEEE802.11

Digital Camera: Case study of embedded system

Brief study State Machine and Concurrent Process Models

Control systems:  Open loop and closed loop systems, General control systems and PID controllers, Fuzzy control, Practical issues related to computer based control, Benefits of computer based control implementations

MIT-302:  Application Development  for Windows

 Overview  of 32bit Windows Programming, Input: Keyboard  messages; timer messages,

child controls, control class Windows resources-Icons, cursors, bitmaps, fonts, menus, accelarators, string tables

Dialog  boxes: Modal and Modelss-Window procedures and Dialog procedures

Messages- Message flow: Message processing; program control: Hook function

Graphics Devices  Interfaces: Device context; GDI Objects; Drawing graphics, Bitmaps, Fonts

Clipboard, MDI, DDE

Dynamic Link Libraries-Static Linking and Dynamic Linking:How to create DLLs

Memory Management

Multitasking and Multithreading applications

Advanced Topics-OLE,COM,Active X

Microsoft .Net , .Net Fundamentals,Programming using C#, C# in the .NET framework, .NET framework classes, ADO.NET, ASP .NET

Visual Studio.NET

MIT-303:  Design, Installation and Management of Networks

 Internetwork Design: Internetwork design basics, Designing  large scale-IP internetworks, Designing Switched  LAN Internetworks, Designing ISDN Internetworks,  Designing  ATM networks and Internetworks for multimedia. Internetworking : Case studies