m.sc. (information technology) · mit 226 dbms lab 60 04 04 mit 227 object oriented programming lab...

INTERNATIONAL COLLEGE FOR GIRLS (AUTONOMOUS), JAIPUR

M.Sc. (INFORMATION TECHNOLOGY)

The Course of study for the M. Sc.(Information Technology) shall comprise of four semesters. First

semester will consist of five theory papers, 3 Practical papers and a seminar. Second semester will have

four theory papers & four Practical papers. Third semesters will consist of five theory papers, two

Practical papers and a minor elective based project. Fourth semester will be composed of reading elective

& a major project. The reading elective has to be chosen by the student out of the given list & the student

has to prepare the same on her own. The major project has to be taken as industrial training of six months.

Each theory subject shall be evaluated for one hundred marks out of which semester-end examination

shall be for seventy marks. The concerned teacher shall award the remaining thirty marks internally. The

semester-end examination shall be of three hours duration. Each practical subject shall be evaluated for

one hundred marks out of which, semester end examinations shall be for seventy and internal assessment

for thirty marks.

GENERAL ELIGIBILITY CRITERIA FOR M. SC. (INFORMATION TECHNOLOGY)

Candidates seeking admission into the programme of the M. Sc.(Information Technology) shall be

required to fulfill the following eligibility criteria:

� Candidate must have at least 55% marks in their bachelor’s degree.

AND

� Candidates must possess any of the following :

� B.Sc.

� Bachelor of Computer Applications (BCA)

� Any bachelor degree With Computer Science /Information Technology/ Computer

Applications as one of the electives at graduation

� ‘O’ Level/’A’ Level from DOEACC.

� Post Graduate Diploma in Computer Applications (PGDCA)

CREDIT TEMPLATE AND OUTLINE OF THE SYLLABI

Name of the Department: Centre for Information Technology

Name of the Programme: M. Sc. (INFORMATION TECHNOOGY)

Semester –I

Contact Hrs Paper Code Title

Per

Semester

Per

Week

Credit

MIT 121 PROBLEM SOLVING TECHNIQUES 60 04 04

MIT 122 COMPUTER ARCHITECTURE 60 04 04

MIT 123 DATA COMMUNICATIONS &

NETWORKING

60 04 04

MIT 124 PROGRAMMING THROUGH ‘C’

60 04 04

MIT 125 WEB AUTHORING TOOLS

60 04 04

MIT 126 PROBLEM SOLVING TECHNIQUES LAB 60 04 04

MIT 127 C PROGRAMMING LAB 60 04 04

MIT 128 WEB AUTHORING LAB 60 04 04

MIT 129 SEMINAR 30 02 02

Total credits for Semester I 34

Semester-II


Per

Semester

Per

Week

Credit

MIT 221 ALGORITHMS & DATA STRUCTURES 60 04 04

MIT 222 DATABASE MANAGEMENT SYSTEMS 60 04 04

MIT 223 OBJECT ORIENTED PROGRAMMING 60 04 04

MIT 224 LINUX 60 04 04

MIT 225 ALGORITHMS & DATA STRUCTURES

LAB 60 04 04

MIT 226 DBMS LAB 60 04 04

MIT 227 OBJECT ORIENTED PROGRAMMING

LAB 60 04 04

MIT 228 LINUX LAB 60 04 04

Total credits for Semester II 32

Semester –III


Per

Semester

Per

Week

Credit

MIT 321 SOFTWARE ENGINEERING 60 04 04

MIT 322 NETWORK PROTOCOLS 60 04 04

MIT 323 GUI PROGRAMMING 60 04 04

MIT 324 WEB TECHNOLOGIES 60 04 04

MIT 325 ELECTIVE I 60 04 04

MIT 326 GUI PROGRAMMING LAB 60 04 04

MIT 327 WEB TECHNOLOGIES LAB 60 04 04

MIT 328 MINOR PROJECT 60 06 06

Total credits for Semester III 34

Semester-IV


Per

Semester

Per

Week

Credit

MIT 421 READING ELECTIVE 06

MIT 422 MAJOR PROJECT

24

Total credits for Semester IV 30

Total credits For M.Sc. (IT) 130

ELECTIVES:

A. Advanced Java Programming

B. BioInformatics

C. Geographical Information Systems

D. SQA & Testing

E. E-Commerce Application Development

READING ELECTIVES:

A. Information Systems

B. Data Mining & Warehousing

C. Distributed Databases

D. IT Enabled Services

EVALUATION SCHEME FOR M.SC.(INFORMATION TECHNOLOGY) (2008-2010)

Scheme of

Examination

Semester

Paper code

Paper Name Contact

hrs per

week

Credits Maximum

Marks

Minimum

Marks Continuous

Assessment

(30%)

Semester

End Exam (70 %)

I

MIT 121

MIT 122

MIT 123

MIT 124

MIT 125

MIT 126

MIT 127

MIT 128

MIT 129

PROBLEM SOLVING TECHNIQUES

COMPUTER ARCHITECTURE

DATA COMMUNICATIONS & NETWORKING

PROGRAMMING THROUGH ‘C’

WEB AUTHORING TOOLS

PROBLEM SOLVING TECHNIQUES LAB

C PROGRAMMING LAB

WEB AUTHORING LAB

SEMINAR

4

4

4

4

4

4

4

4

2

4

4

4

4

4

4

4

4

2

100

100

100

100

100

100

100

100

100

40

40

40

40

40

40

40

40

40

30

30

30

30

30

30

30

30

30

70

70

70

70

70

70

70

70

70

II

MIT 221

MIT 222

MIT 223

MIT 224

MIT 225

MIT 226

MIT 227

MIT 228

ALGORITHMS & DATA STRUCTURES

DATABASE MANAGEMENT SYSTEMS

OBJECT ORIENTED PROGRAMMING

LINUX

ALGORITHMS & DATA STRUCTURES LAB

DBMS LAB

OBJECT ORIENTED PROGRAMMING LAB

LINUX LAB

4

4

4

4

4

4

4

4

4

4

4

4

4

4

4

4

100

100

100

100

100

100

100

100

40

40

40

40

40

40

40

40

30

30

30

30

30

30

30

30

70

70

70

70

70

70

70

70

III

MIT 321

MIT 322

MIT 323

MIT 324

MIT 325

MIT 326

MIT 327

MIT 328

SOFTWARE ENGINEERING

NETWORK PROTOCOLS

GUI PROGRMMING

WEB TECHNOLOGIES

ELECTIVE I

GUI PROGRMMING LAB

WEB TECHNOLOGIES LAB

MINOR PROJECT

4

4

4

4

4

4

4

6

4

4

4

4

4

4

4

6

100

100

100

100

100

100

100

100

40

40

40

40

40

40

40

30

30

30

30

30

30

30

30

70

70

70

70

70

70

70

70

IV

MIT 421

MIT 422

READING ELECTIVE

MAJOR PROJECT

6

24

100

100

40

40

30

30

70

70

Note:

� Following is the list of Electives for Sem III (MIT 325) out of which the student has to opt one:

A. Advanced Java Programming

B. BioInformatics

C. Geographical Information Systems

D. SQA & Testing

E. E-Commerce Application Development

� Following is the list of Reading Electives for Sem IV (MIT 421) out of which the student has to opt one:

A. Information Systems

B. Data Mining & Warehousing

C. Distributed Databases

D. IT Enabled Services

� Continuous Assessment for Theory will be divided as per follows:

• Test I (40 marks)

• Quiz (20 marks)

• Teacher Interaction(20 marks)

• Attendance (10 marks)

� Marking Distribution for the Theory Paper will be divided as follows:

The question paper will consist of three sections.

• Section A consisting of 16 Objective type questions, carrying 1 mark each.

• Section B consisting of 10 short answer type questions (75 words), carrying 3 marks each.

• Section C consisting of 5 essay type questions (400-500 words), carrying 8 marks each.

The students are required to attempt all the question in section A and B. In section C, students will be required to

attempt any 3 questions out of 5 questions.

� Continuous Assessment for Practical will be divided as per follows:

• Practical Test I (15 marks)

• Viva (5 marks)

• III component (10 marks):-

o Assignment (5 marks)

o Attendance (5 marks)

� Marking Distribution for the Practical Paper will be divided as follows:

• Practical Questions (2 questions of 20 marks each)

• Algorithm Design (10 marks)

• Viva-voce (10 marks)

• File Submission (10 marks)

� Continuous Assessment for Seminar:

a. Subject Matter (10 Marks)

b. Report (10 Marks)

c. Regularity( 10 Marks)

� Marking Distribution for Seminar (Semester End Exam):

a. Presentation (35 Marks)

b. Viva-voce (35 Marks)

� Continuous Assessment for Major Project will be divided as per follows:

(Students will be undergoing training under a Project Guide, who can be either external or internal, and a Project

Coordinator assigned from the college)

• Synopsis (5 marks)

• Software Requirement & Design Specification (10 marks)

• Mid term Assessment Report (to be filled in by the Project Guide)(15 marks)

� Marking Distribution for the Major Project will be divided as follows:

• Project Demo (30 marks each)

• Project Report (20 marks)

• Viva-voce (20 marks)

� Time duration of internal tests will be one and half-hour.

� Home assignments shall be given on exercise-based problems.

� Time duration of SEE will be three hours.

� Passing percentage in continuous assessment and semester end exam is 40% individually.


PROBLEM SOLVING TECHNIQUES

Paper Code: MIT 121

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This course is aimed towards inculcating programming logic development skills in a student.

UNIT I [No. Of Hrs: 12]

Introduction to computer problem solving: Introduction – The Problem solving Aspect, Topdown

Design, implementation of Algorithms, Program Verification , The Efficiency of Algorithms.

Fundamental algorithms: Exchanging the values of Two Variables – Counting, Summation of a set of

Numbers, Factorial Computation, Generation of the Fibonacci sequence, Reversing the Digits of an

Integer, Base Conversion, Character to Number Conversion.

UNIT II [No. Of Hrs: 12]

Factoring methods: Finding the square Root of a number , The Smallest Divisor of an Integer , The

Greatest Common Divisor of Two Integers , Generating Prime Numbers , Computing the Prime Factors of

an Integer , Raising a Number to a Large Power , Computing the nth Fibonacci Number.

UNIT III [No. Of Hrs: 12]

Array techniques: Array Order Reversal, Array Counting or Histogramming , Finding the Maximum

Number in a Set , Removal of Duplicates from an Ordered Array , Partitioning an Array , Finding the kth

Smallest Element , Longest Monotone Subsequence.

UNIT IV [No. Of Hrs: 12]

Sorting and searching: The Two-way Merge, Sorting by Selection, Sorting by Exchange, Sorting by

Insertion, Sorting by Diminishing Increment, Sorting by Partitioning, Binary Search, Hash Searching.

UNIT V [No. Of Hrs: 12]

Text processing and pattern searching : Text Line Length Adjustment , Left and Right Justification of

Text, Keyword Searching in Text , Text Line editing , Linear Pattern Search , Sub linear Pattern Search.

BOOKS RECOMMENDED:

ESSENTIAL READINGS:

1. R.G.Dromey “ How to Solve it by Computer ”, Pearson Education,India,2007.

REFERENCES:

2. Seymour Lipschutz, “Essentials computer Mathematics”, Schaums’ outlines series, Tata

PROPOSED COVERAGE (MIT 121):

UNIT- I [Chapter 1, 2: Essential Reading(1)]

UNIT- II [Chapter 3 : Essential Reading(1) ]

UNIT- III [Chapter 4: Essential Reading(1) ]

UNIT- IV [Chapter 6:Essential Reading(1) ]

UNIT- V [Chapter 7: Essential Reading(1) ]


COMPUTER ARCHITECTURE

Paper code: MIT 122

Credits: 04

Periods/Week: 04

Max. Marks: 100

Objective: This module is focused on the study of essential areas of computer architecture.

UNIT I [No. Of Hrs : 12] Digital Logic Circuits: Digital Computer, Logic Gates, Boolean algebra, Map Simplification,

Combinational Circuits, Flip Flops, Sequential Circuits.

Digital Components: Integrated Circuits, Decoders, Multiplexers, Registers, Shift Registers, Binary

Counters, Memory Unit.

UNIT II [No. Of Hrs : 12] Register Transfer and Micro-operation: Register Transfer Language, Register Transfer, Bus and Memory

Transfer: Three state bus buffers, Memory Transfer; Arithmetic Micro-operations: Binary Adder, Binary

Adder-Subtrator, Binary Incrementor; Logic Micro-operations: List of Logic micro operations; Shift

Micro-operations( excluding H/W implementation), Arithmetic Logic Shift Unit.

Central Processing Unit: Introduction, General Register Organization, Stack Organization, Instruction

Formats, Addressing Modes.

UNIT III [No. Of Hrs : 12]

Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, RISC Pipeline,

Vector Processing, Array Processors.

Computer Arithmetic: Introduction, Addition and Subtraction, Multiplication Algorithm, Division

Algorithm.

UNIT IV [No. Of Hrs : 12] Input-Output Organization: Peripheral Devices, Input-Output Interface, Modes of Transfer, Priority

interrupts, DMA.

Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory.

UNIT V [No. Of Hrs : 12] Memory Organization: Associative Memory, Cache Memory, Virtual Memory.

Multiprocessors: Characteristics of Multiprocessors, Interconnection Structures, Interprocessor

Arbitration, Interprocessor Communication and Synchronization, Cache Coherence

BOOKS RECOMMENDED

ESSENTIAL READINGS:

1. M. Morris Mano, “Computer System Architecture”, 3nd

Ed., TMH, 200

REFERENCES:

1. C.P. Malvino, D.P. Leach, “Digital Principles and Applications”, TMH, 1985.

2. P. John Hayes, “Computer Architecture and Organization”, TMH, 1988.

3. S. Stone, “Introduction to Computer Architecture”, Galgotia Publications 1996.


UNIT – I [Chapter 1: 1.1-1.7, Chapter 2: 2.1-2.7, Essential Reading 1]

UNIT – II [Chapter 4: Essential Reading (1), Chapter 8: 8.1-8.5, Essential Reading 1]

UNIT – III [Chapter 9: 9.1-9.7, Chapter 10: 10.1-10.4, Essential Reading 1]

UNIT – IV [Chapter 11: 11.1, 11.2, 11.4, 11.6, Chapter 12: 12.1-12.3]

UNIT – V [Chapter 12: 12.4-12.6, Chapter 13: 13.1-13.5]


DATA COMMUNICATIONS AND NETWORKING

Paper code: MIT 123

Credits: 04

Periods/Week: 04

Max. Marks: 100

Objective: This module will help the students to learn various data communication and networking

concepts.

UNIT I [No. Of Hrs: 12] Introduction: Data Communication, Networks, Protocols and Standards.

Basic Concepts: Line configuration, Topology, Transmission mode, Category of networks, Internetworks.

OSI Model: Model, Functions of layers, TCP/IP Protocol suites

Encoding and Modulating: Digital to digital, Analog to digital, Digital to analog, Analog to analog

conversion.

UNIT II [No. Of Hrs: 12]

Transmission of digital data: Digital data transmission, DTE-DCE interface, interface standards, modems.

Transmission Media: Guided Media, Unguided Media, Transmission Impairment, Performance,

Wavelength, Shannon Capacity.

Multiplexing: FDM, WDM, TDM, DSL.

Error Detection and correction: Types of Error, Detection, VRC, LRC, CRC, Checksum, Error Correction

(Hamming Code). Data Link control: Line discipline, Flow control, Error control.

UNIT III [No. Of Hrs: 12]

Local Area Network: Ethernet, Token bus, Token ring, FDDI. Switching: Circuit switching, Packet

switching, Message switching.

Integrated Services Digital Network(ISDN): Services, Subscriber Access to ISDN, ISDN layer,

Broadband ISDN.

X.25: X.25 Layers, Other protocols related to X.25

UNIT IV [No. Of Hrs: 12] Frame Relay: Frame relay layer, congestion control, leaky bucket algorithm.

ATM: ATM Architecture, layers, applications.

SONET/SDH: Synchronous transport signals, Physical configurations, Sonnet layers, Sonnet Frame.

Networking and internetworking Devices: Repeaters, Bridges, Routers, Gateways.

UNIT V [No. Of Hrs: 12] Networking and internetworking Devices: Routing Algorithms, Distance Vector Routing, Link state

Routing.

Transport Layer: Duties, Connections, OSI Transport model.

Upper OSI Layers: Session Layer, Presentation Layer, Application Layer.

Network Security: Four aspect of security, Privacy, Digital signature, Access Authorization.

BOOKS RECOMMENDED

ESSENTIAL READINGS:

1. Behrouz A. Forouzan, “Data Communications and Networking”, 2nd

Ed., TMH, 2003

REFERENCES:

1. A.S.Tanenbaum, “Computer Networks”, Pearson Education Asia, 4th

Ed.,2003.

2. William Stallings, “ Data and Computer Communications”, Pearson Education Asia, 7th

Ed.,

2002.


UNIT – I [Chapter1: 1.1, 1.2, 1.3, 1.4, Chapter 2: 2.1-2.5, Chapter 3: 3.1-3.3 Essential Reading 1]

UNIT – II [Chapter 6: 6.1-6.4, Chapter 7: 7.1-7.6, Chapter 8: 8.2-8.4, 8.6, Chapter 9: 9.1-9.7, Chapter

10: 10.1-10.3 Essential Reading 1]

UNIT – III [Chapter 12: 12.2,12.4-12.6, Chapter 14: 14.1-14.3, Chapter 16: 16.1,16.3-16.5, Chapter

17: 17.1, 17.2, Essential Reading 1]

UNIT – IV [Chapter 18: 18.3-18.5 Chapter 19: 19.2, 19.5, 19.7, Chapter 20: 20.1-20.4, Essential

Reading 1]

UNIT – V [Chapter 21: 21.1-21.4, 21.6-21.8, Chapter 22: 22.1-22.3, Chapter 23: 23.1-23.3 Chapter

27: 27.1, 27.2, 27.3, 27.5 Essential Reading 1]


PROGRAMMING IN ‘C’

Paper Code: MIT 124

Credits: 04

Periods /Week: 04

Max. Marks: 100

Objective: This module is designed to acquaint the students with the basics of ‘C’ programming

language.

UNIT I [No. of Hrs: 12]

Introduction to C: History of C, C standard library, Structured Programming, the basics of a typical C

program Development Environment.

Introduction to ‘C’ programming: Introduction, A Simple C program, Memory Concepts, Arithmetic in C,

Decision making.

Structured Program Development in C: Introduction, Algorithm, Pseudo code, Control structures, if

selection structure, if/else selection structure, while repetition structure, Structured Program Development

in C: Counter Controlled Repetition, Sentinel Controlled Repetition, Nested control structures,

Assignment operators, Increment and Decrement operators.

UNIT II [No. of Hrs: 12]

C Program control: Introduction, Essentials of repetition, Counter controlled repetition, The for repetition

structure, for structure: notes and observations, The switch Multiple selection structure, The do/while

repetition structure, the break and continue statements, Logical operators, Equality and Assignment

operators.

C Functions: Introduction, Program Modules in C, Math Library Functions, Functions, Functions

Definitions, Function Prototypes, Header Files, Calling Functions: Call by Value and Call by reference,

Storage Classes, Scope rules, Recursion, Recursion vs. Iteration.

UNIT III [No. of Hrs: 12]

C Arrays: Declaring Arrays, Passing Arrays to Functions, Sorting arrays (Bubble Sort), Searching

(Linear, Binary Search), Multiple-Subscripted Arrays.

C Pointers: Introduction, Pointer variable declaration and initialization, Pointer operators, Calling

functions by reference, Const qualifier, Pointer Expressions and pointer arithmetic, Relationship between

pointers and Arrays, Arrays of Pointers.

C characters and Strings: Introduction, Fundamentals of Strings and characters, Character and String

Handling Library, String conversions and comparison functions.

UNIT IV [No. of Hrs: 12]

C Formatted Input/Output: Streams, Formatting output with printf, Printing: Integers, Floating point

numbers, Strings, Characters. Field Widths and Precisions, Flags in print format control string, Escape

sequences, formatted input with scanf.

C structures, Unions, Bit Manipulations and Enumerations: Introduction, Structure Definition, Initializing

structures, Accessing Members of structures, typedef, Union, Bitwise operators, Bit Fields, Enumerated

Constants.

UNIT V [No. of Hrs: 12]

C File Processing: Files and streams, Sequential & random access files.

C Preprocessor: #include, #define preprocessor directives, macros, conditional compilation.

BOOKS RECOMMENDED

ESSENTIAL READINGS:

1. H.M.Deitel & P.J.Deitel, “How to program in ‘C’”, 3rd

Edition, Pearson Education, 2001.

REFERENCES: 1. B.Kernighan & D.Ritchie “C Programming Language”, 2

nd Edition, Prentice-Hall, 1988.

2. E. Balagurusami, “Programming in ‘ANSI C’”, TMH Publications.

3. Yashwant Kanetkar, “Working with C”, BPB Publications.

4. S. Lipschutz, “C Programming”, Schaum’s outline series, Tata McGraw Hill Edition.


UNIT – I [Chapter 1: 1.7 - 1.13 & 1.14 to Chapter 3 Essential Reading (1)]

UNIT – II [Chapter 4 & 5 Essential Reading (1)]

UNIT – III [Chapter 6, 7 & 8 Essential Reading (1)]

UNIT – IV [Chapter 9, 10 Essential Reading (1)]

UNIT – V [Chapter 11 & 13 Essential Reading (1)]


WEB AUTHORING TOOLS

Paper Code: MIT 125

Credits: 04

Periods /Week: 04

Max. Marks: 100

Objective: This module is designed to help students for creating web sites.

UNIT I [No. of Hrs: 12]

Basic concepts of Internet: Introduction to Web server and Web Client, IP Addressing, HTTP.

HTML Basics: Introduction to HTML, Commonly used HTML tags, Text Formatting

(Paragraph and Line Breaks), Text Styles (Bold, Italics and Underline), Heading Styles and Other Text

Effects (Centering and Spacing), Lists (Ordered, Unordered, Definition), Adding Graphics to HTML

document (Image, Border attribute, Align and ALT attribute), Links: External Document reference,

Internal Document Reference and Images as Hyperlinks.

UNIT II [No. of Hrs: 12]

Tables: Creating tables, Width and Border attributes, Cell padding & Cell spacing, BGcolor, Colspan and

Rowspan attribute, Adding Images and Links to Table Cells.

Frames: Introduction to Frames, <Frameset> Tag, <Frame> Tag, and Targeting named frames.

Forms: Understanding HTML forms Processing, Tags and Attributes used to create forms ( Text box,

Radio button, TextArea, Checkbox ,Drop Down List, Reset button and Submit Button), Controlling the

layout of Form Elements and text with HTML Tables.

UNIT III [No. of Hrs: 12]

Cascading Style Sheets: Understanding Style Sheets, Applying Style Sheets to HTML document,

Developing a Style Sheet: Setting Font attributes, Text Attributes, Border Attributes, Setting Background

properties and List Attributes and External Style Sheets (LINK Tag).

UNIT IV [No. of Hrs: 12] Concept of Class, Table properties, <SPAN> Tag, Using the DIV tag and Layers, Introduction to

Advanced CSS: CSS Dimension, Classification, Positioning and Pseudo-class Properties.

UNIT V [No. of Hrs: 12]

XHTML Concepts: Introduction, Comparison with HTML, XHTML Syntax, XHTML DTD, Validation

and Adding colors and Fonts in XHTML tables with CSS.

BOOKS RECOMMENDED

ESSENTIAL READINGS:

1. Kris Jamsa, King & Anderson,” HTML & Web Design Tips & Techniques”, TMH

2. Ivan Bayross, ” HTML, DHTML, Javascript, PERL CGI”,BPB

REFERENCES:

1. Website: http://www.w3schools.com


UNIT – I [Chapter 1, Essential Reading (1), Chapter 1& 6: Essential Reading (2)]

UNIT – II [Chapter 2 & 3 Essential Reading (1), Chapter 7: Essential Reading (2)]

UNIT – III [Chapter 4: Essential Reading (1), Chapter 12: Essential Reading (2)]

UNIT – IV [Chapter 12: Essential Reading (2)]

UNIT – V [Chapter 5: Essential Reading (1), References (2)]


PROBLEM SOLVING TECHNIQUES LAB

Paper Code: MIT 126

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This course is aimed towards inculcating programming logic development skills in a student.

This lab course covers the implementation of concepts covered in MIT 121 (Problem Solving

Techniques) through C.


‘C’ PROGRAMMING LAB

Paper Code: MIT 127

Credits: 04

Periods /Week: 04

Max. Marks: 100

Objective: This lab course is designed to help the students to have practical exposure of C programming

language. This module covers the concepts taught in MIT 124 (Programming through ‘C’).


WEB AUTHORING LAB

Paper Code: MIT 128

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This module is designed to help students for creating web sites.

A topic-based homepage has to be to be developed by each student using various commands covered in

HTML, CSS and XHTML.

Web pages should be designed with following features:

• HTML Basic Tags (html/head/title/body/B/I/U/BR/HR)

• Anchor/Image insertion/Linking

• Tables/Frames/Forms

• CSS

• XHTML


SEMINAR

Paper Code: MIT-129

Credits: 02

Periods/week: 02

Max. Marks: 100

Objective: To create awareness regarding current trends, issues and researches related to various aspects

of Information Technology.

Each student will be assigned a topic in the beginning of semester. The students will present a seminar on

latest trends in the field of Information Technology. This will help the student in enhancing their

communication as well as presentation skills and expand their area of knowledge. It will make them

aware of ongoing developments in the related domain. This will make them more analytical &

judgmental. They will be required to prepare and submit a short report on the same.


ALGORITHMS & DATA STRUCTURES

Paper Code: MIT 221

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This course describes various structuring methods of data and their practical use.

UNIT-I [No. of Hrs: 12]

Introduction to Data Structures: Information and meaning, Data type in C, pointers in C, Data structure and C,

Arrays (one, two and multi dimensional), Row major and column major form, representation of strings,

structure and unions in C along with their implementation, allocation of storage and scope of variable,

Algorithm definition and its characteristics, Abstract data types, ADT for rational number, Sequence as

value definition, ADT for varying length strings, Array as an ADT.

C File Processing: Files and streams, Sequential access file(Creation, Reading and Writing).

UNIT-II [No. of Hrs: 12] Stack: Definition, Primitive operations, Stack as an ADT, representing stack in C, implementing the push and

pop operation, testing exceptional conditions, infix, postfix and prefix expression (definition and examples),

evaluation of postfix expression and converting an expression from infix to postfix only (Algorithm and C

implementation).

Recursion definition and processes, algorithms, recursion in C, Writing recursive programs ( Factorial,

multiplication, Fibonacci sequence, Binary search, Towers of Hanoi Problem), Properties of recursive

definition or Algorithms, Efficiency of recursion.

UNIT-III [No. of Hrs: 12] Queues: Introduction, Definition of Queue and its sequential representation, Queue as an ADT, C

implementation of queues, insert and remove operation, Applications and Priority queues. Linked list: Introduction to linked list, creation, insertion and deletion of nodes from a list, linked

implementation of stacks, get node and free node operations, linked implementation of queues, linked list as a

data structure, linked implementation of priority queue, concept of header nodes, array implementation of lists

and its limitation, Allocating and freeing dynamic memory, comparing dynamic and array implementation of

lists.

Definition and C implementation: Singly linked lists, Doubly Linked lists, Circular linked lists, Circular

Double linked lists, Stack as Circular List, Queue as circular list.

UNIT-IV [No. of Hrs: 12] Trees: Binary tree, Introduction and terminology, Operations on binary trees, applications of binary tree,

Binary tree representations (node and implicit array representation), Recursive and Non - Recursive Tree

Traversal Techniques ( Inorder, PostOrder and Preorder), Threaded binary trees.

Sorting: Exchange Sorts (Bubble sort, Quick sort), Straight Selection sort, Insertion sorts, Merge sort.

Searching: Linear and Binary Search.

UNIT-V [No. of Hrs: 12]

Hashing: Concept, Resolve hash clashes by open addressing, coalesced Hashing and separate chaining.

Graphs and their Applications: Graphs, C representation of graphs, Transitive Closure, Warshall’s

Algorithm, Shortest path algorithm, Graph Traversal (Depth First Traversal & Breadth First Traversal:

Algorithm and application only).

BOOKS RECOMMENDED

ESSENTIAL READINGS: 1. Y. Langsam, M. J. Augenstein, A.M. Tanenbaum, “Data Structure using C, C++”, second edition,

Prentice Hall of India, 1999.

REFERENCES : 1. E. Horowitz and S. Sahani, “Fundamentals of Data Structures”, Galgotia Book source Pvt. Ltd, 2000

2. S. Lipschutz, “Data Structures”, Schaum’s outline series, Tata McGraw Hill Edition, 2002

3. Robert L.Kruse “Data Structures and Program Design”, Third edition, PHI

4. Weiss, “Data Structures and Algorithmic analysis in C", 2e, 2003, PEA.

5. Trembley, Sorenson,” An introduction to Data Structure with Applications", 2e, TMH.

6. Aho, Hopcroft, Ullman,” Data Structure and Algorithms", PEA.

7. Nicholas Wirth, “Algorithms + Data Structure = Programs", PHI.

8. Samanta, “Classic Data Structures", 1e, 2001, PHI.

9. R.B.Patel, “Expert data structures with C”, Khanna Book Publishing Co(p). Ltd. Delhi

PROPOSED COVERAGE:

UNIT-I [ Chapter 1: 1.1-1.3 Essential Reading(1) ]

UNIT-II [ Chapter 2 & 3: 2.1-2.3 & 3.1-.3.3 Essential Reading(1) ]

UNIT-III [ Chapter 4 : 4.1-4.3 & 4.5 Essential Reading(1) ]

UNIT-IV [ Chapter 5,6 & 7 : coverage as written above in units from Essential Reading(1) ]

UNIT-V [ Chapter 7 & 8: coverage as written above in units from Essential Reading(1) ]


DATABASE MANAGEMENT SYSTEMS

Paper Code: MIT 222

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This module is designed to help students to know about the fundamental concepts of database

management.

UNIT I [No. of Hours: 12]

Databases and Database Users: Introduction, Characteristics of the Database Approach, Database

administrators, Database designers, End users, System analysts and application programmers, Advantages

of DBMS , History of Database Applications.

Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-schema

Architecture and Data Independence, Database Languages and Interfaces, Database System Environment,

Centralized and Client-Server Architectures, Classification of DBMS.

Data Modeling Using the Entity-Relationship Model: High-Level Conceptual Data Models for Database

Design, Entity Types, Entity Sets, Attributes, and Keys, Relationship Types, Relationship Sets, Roles, and

Structural Constraints, Weak Entity Types, Refining the ER Design for a Database, ER Diagrams,

Naming Conventions, and Design Issues.

UNIT II [No. of Hours: 12]

The Relational Data Model and Relational Database Constraint: Relational Model Concepts, Relational

Model Constraints and Relational Database Schemas, Update Operations and Dealing with Constraint

Violations.

Relational Algebra and Relational Calculus: Unary Relational Operations-SELECT and PROJECT,

Relational Algebra Operations From Set Theory, Binary Relational Operations-JOIN and DIVISION,

Additional Relational Operations, Examples of Queries in Relational Algebra, The Tuple Relational

Calculus, The Domain Relational Calculus.

UNIT III [No. of Hours: 12]

Relational Database Design by ER- and EER-to-Relational Mapping: Relational Database Design Using

ER-to-relational Mapping, Mapping EER Model Concepts to Relations.

SQL99-Schema Definition, Constraints, and Queries: SQL Data Definition and Data Types, Specifying

Basic Constraints in SQL, Schema Change Statements in SQL, Basic Queries in SQL, More Complex

SQL Queries, Insert, Delete, and Update Statements in SQL, Additional Features of SQL, Specifying

General Constraints as Assertions, Views (Virtual Tables) in SQL.

UNIT IV [No. of Hours: 12]

Database Design Theory and Methodology- Relational database design: Informal Design Guidelines for

Relation Schemas, Functional Dependencies, Normal Forms Based on Primary Keys, General Definitions

of Second and Third Normal Forms, Boyce-Codd Normal Form, Properties of Relational Decompositions,

Algorithms for Relational Database Schema Design, Multivalued Dependencies and Fourth Normal Form,

Join Dependencies and Fifth Normal Form.

UNIT V [No. of Hours: 12]

Transaction Processing Concepts- Introduction to Transaction Processing, Transaction and System

Concepts, Characterizing Schedules Based on Recoverability, Characterizing Schedules Based on

Serializability.

Concurrency Control Techniques: Two-Phase Locking, Timestamp Ordering, Multiversion Control

Techniques, Validation (Optimistic) Concurrency Control Techniques, Granularity of Data Items and

Multiple Granularity Locking, Using Locks for Concurrency Control in Indexes, Concurrency Control

Issues.

Database recovery concepts: Recovery outline, Caching of Disk blocks, Write ahead logging, Steal/No

Steal and Force/NoForce, Checkpoints in the System Log and Fuzzy Checkpointing, Transaction

Rollback. Recovery Techniques Based on Deferred Update and on Immediate Update.

BOOKS RECOMMENDED

ESSENTIAL READING:

1. R. Elmasri and SB Navathe, “Fundamentals of Database Systems”, Addison Wesley, 4

th Ed., 2004

REFERENCES:

1. Abraham Silberschatz, Henry Korth, S. Sudarshan, “Database Systems Concepts”, 4th Edition, McGraw

Hill, 1997.

2. Jim Melton, Alan Simon, “Understanding the new SQL: A complete Guide”, Morgan Kaufmann

Publishers, 1993.

3. A. K. Majumdar, P. Battacharya, “Data Base Management Systems’, TMH, 1996.

4. Bipin Desai, “An Introduction to database Systems”, Galgotia Publications, 1991.

PROPOSED COVERAGE:

UNIT-I [Chapter 1, 2 & 3: Essential Reading (1)]

UNIT-II [Chapter 4 & 5: Essential Reading (1) ]

UNIT-III [Chapter 6 & 7: 7.1-7.9 Essential Reading (1)]

UNIT-IV [Chapter 8: Essential Reading (1)]

UNIT-V [Chapter 11: Essential Reading (1)]


OBJECT ORIENTED PROGRAMMING

Paper code: MIT 223

Credits: 04

Periods/Week: 04

Max. Marks: 100

Objective: This module is designed to help students in learning the concept of Object Oriented

Programming using Java.


Object oriented Paradigm; An overview of Java : Data types ,variables, keywords in java, Operators,

control statement in java, Arrays in java, introduction to java classes, Objects & methods, constructors,

overloading methods, inner classes.


Inheritance in java, super ,creating a multilevel hierarchy ,abstract classes, using final with inheritance,

interfaces in java, Defining, implementing interfaces, introduction to Packages, defining and importing

packages.

Exception handling in java, Exception types, try, catch block, nested try statements, throw, throws,

finally, create your own exception

UNIT III [No. of Hours: 12] Multithreading in java, thread life cycle, thread class and runnable interface, creating a thread, creating

multiple threads, thread priority, synchronization, isalive, join, suspending, resuming and stopping

threads, Autoboxing, annotations(Metadata).

INPUT/OUTPUT Basics, streams (Byte stream and character stream), Reading console input, writing

console output, reading and writing files.


Basics of Applet, life cycle of Applet, Applet initialization and termination, overriding update ( ), paint

methods of Applet, Passing parameters to Applet, simple examples of applet.

Event Handling in java, Delegation Event models, Event sources, Event Listeners, Event classes, Event

Listener Interfaces, Adapter classes, Anonymous Inner Classes.


Introducing Awt, Awt Classes, window fundamentals, component, container, panel, window, frame,

canvas, control fundamentals, adding, removing controls, label, buttons, checkboxes, checkbox group,

choice lists, list, text field, text area, menu bar, menus, dialog boxes, Handling Events by Extending AWT

components, image fundamentals.

BOOKS RECOMMENDED

ESSENTIAL READINGS:

1. Herbert Schildt, “Java:The Complete Reference’, Seventh Edition, Tata McGraw Hill

REFERENCES:

1. C. S. Horstmann, Gray Cornell, “Core Java2 :Advanced features (Vol I)- Java Series”, Pearson

Education.

2. E. Balagurusamy, “Programming with Java”, McGraw Hill Education Series.


UNIT – I [Chapter1,2,3,4,5 Essential Reading 1]

UNIT – II [Chapter 8,9,10 Essential Reading 1]

UNIT – III [Chapter 11,12,13,19 Essential Reading 1]

UNIT – IV [Chapter 13,21,22 Essential Reading 1]

UNIT – V [Chapter 23,24,25 Essential Reading 1]


LINUX

Paper Code: MIT 224

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This course is focused on the study of basic concepts of Operating systems followed by study

of Linux, its user interface & system administration concepts.


Introduction to Operating Systems: Introduction, history, functions and types of operating system,

Operating System concepts: Processes, Files, System Calls, Shell, Operating System structure. Basic

terminology of Process model, Memory Management, File Systems.

Overview of Linux: What is Linux, Linux’s Root in Unix, common Linux Features, advantages of Linux,

Overview of UNIX and LINUX Architectures, Hardware requirements for Linux. Various Linux

Distributions, Contributions of Open Source Foundation.


LINUX Internals: Introduction, process management, systems calls.

Linux File system: Logging in, getting familiar with Linux desktop, shell interface, understanding Linux

shell, using shell, types of Text editors, using vi editor, prompt character, correcting typing errors, simple

shell commands-date, cal, who, tty, uname, passwd, bc, script, echo, logging out, Environment variables,

wild card characters *, ?

LINUX File System: boot block, super block, inode table, file types, absolute and relative path, listing

files and directories commands, Navigating file system- pwd, cd, mkdir, rmdir,ls, pr

Handling ordinary files-cat, cp, mv, wc, rm, comm., amp, diff, Basic file attributes- file permissions,

changing permissions

UNIT III [No. of Hours: 12]

Processes and filters: Simple filters- head, tail, cut, paste, sort, uniq, tr, Regular expression-Grep utility,

Shell command line, redirection, pipeline, split output, tee, Process- system processes, internal and

external commands, background process, premature termination of process, process priorities, process

scheduling-(at, batch), nohup command


The File System: What Is The File System, File Search Utilities, Navigating The File System, Managing

Drives And Partitions. Mounting and Unmounting devices and drives, File System Maintenance, Managing User Accounts: Purpose Of Different User Accounts, User Manager, How Linux Stores User

Account Information, Advanced User Account Management, Advanced Group Management, Users, Groups,

And File System Permissions.


Building Networks: Networking, Setting Up a Web Server, Setting Up a Ftp Server, Setting Up a Print

Server, Setting Up NFS Server, Setting Up a Mail Server, Setting Up a Dhcp Server.

Advanced System Administration: System Configuration, Logging, Backing Up And Archiving.

BOOKS RECOMMENDED

ESSENTIAL READINGS:

1. Neil Mathew, Richard Stones, “Beginning Linux Programming”, Wrox Press.

2. Sandip Bhattacharya, Mark Mamone, Kapil Sharma, Deepak Thomas , Simon Whiting, Shishir

Gundavaram, “Beginning Red Hat Linux 9”, Wrox Press.

3. Website: www.linux.org

REFERENCES:

1. Beginning Red Hat Linux 5.0, Wrox Publications.

2. Christopher Negus, ”Fedora 6 and red hat enterprise Linux Bible” Wiley-India.

3. B. W. Kernighan & R. Pike, “The UNIX Programming Environment”, PHI.

4. Cox K., “Red Hat Linux Administrator’s Guide”, PHI, 2001.

5. M. Beck, “LINUX Kernel Internals”, Addison Wesley, 1997.

6. Yashwant Kanetkar, “Unix shell programming”, BPB Publications.


ALGORITHMS & DATA STRUCTURES LAB

Paper Code: MIT 225

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This lab course is based on the practical implementation of algorithms and data structures

taught in theory paper Algorithms & Data Structures (MIT 221) using C.

Practical based on implementation of following different data structures & related operations on them:

• One-dimensional & Two-dimensional Arrays

• Structures, Unions & Pointers

• Linked Lists

• Queues

• Stacks

• Graphs

• Sorting & searching Techniques


DBMS LAB

Paper Code: MIT 226

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This lab course is based on the Practical implementation of concepts of database taught in

Database Management Systems (MIT 222).

Exercises given will be covering entire syllabi as follows:

1. Introduction to DBMS.

2. To implement different types of DDL, DML and DCL statements in SQL.

3. To use constraints on the created database.

4. To explore ‘select’ clause using where, order by, between, like, group by, having etc.

5. To implement different in-built functions on the created database.

6. To implement nested and correlated queries.


OBJECT ORIENTED PROGRAMMING LAB

Paper Code: MIT 227

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This lab course is based on the Practical implementation of concepts taught in Object Oriented

Programming (MIT 223) through Java.

Practical based on implementation of different object oriented concepts & related operations with the help

of Java.


LINUX LAB

Paper Code: MIT 228

Credits: 04

Periods/week: 04

Max. Marks: 100

Objective: This lab course is based on the Practical implementation of concepts taught in Linux (MIT

224).

This paper will cover various Commands, Shell Programming & Administrative Concepts of Linux like

Linux File system, directory structure, Linux commands, shell scripts, Server Settings.

m.sc. (information technology) · mit 226 dbms lab 60 04 04 mit 227 object oriented programming lab...

Documents