IIMT University, Meerut · PDF file IIMT UNIVERSITY MEERUT Course Structure and Syllabus for...

Click here to load reader

  • date post

    01-Apr-2020
  • Category

    Documents

  • view

    8
  • download

    1

Embed Size (px)

Transcript of IIMT University, Meerut · PDF file IIMT UNIVERSITY MEERUT Course Structure and Syllabus for...

  • CURRICULUM

    For

    POSTGRADUATE DEGREE COURSE IN

    INFORMATION TECHNOLOGY (Engineering & Technology)

    [Effective from 2018-19]

    IIMT University, Meerut

  • IIMT UNIVERSITY MEERUT

    Course Structure and Syllabus for M.Tech(Information Technology)

    NOTE:A student 'll be eligible to get PG degree only if he/ she completes additional courses of

    MOOCs/ NPTEL/ SWAYAM, registration to MOOCs courses can be done through Site

    http://nptel.ac.in/

    After successful completion of the courses, the student shall provide their successful

    completion status/ certificate to the Dean of their college which in turn 'll be forwarded to

    COE office . Semester -I

    S. No. Course Code Course Name Periods Evaluation Scheme

    L T P External Internal Total

    1 MTIT-101 Data Structure & Algorithm 3 0 - 70 30 100

    2 MTIT-102 DBMS 3 0 - 70 30 100

    3 MTIT-103 Software Engineering 3 0 - 70 30 100

    4 MTIT-104 Discrete Structure 3 0 - 70 30 100

    5 MTIT-105 Object Oriented Programming

    3 0 - 70 30 100

    6 MTIT-191P Data Structure Laboratory 0 0 2 30 20 50

    7 MTIT-192P DBMS Laboratory 0 0 2 30 20 50

    8 MTIT-195P

    Object Oriented Programming Lab(C++)

    0 0 2 30 20 50

    9 ECC-111

    Industrial Visit/ Seminar/

    Presentation

    on the report of visits

    - - - - 25 25

    10 ECC-112 University Social

    Responsibility - - 25 25

    11 ECC-113 Spoken Tutorial Certification - - 2 25 25

    12 ECC-114 MOOC/ SWAYAM - - 2 25 25

    Total 15 0 10 440 310 750

  • Semester -II

    S. No. Course Code Course Name

    Periods Evaluation Scheme

    L T P External Internal Total

    1 MTIT-201 Operating Systems 3 0

    70 30 100

    2 MTIT-202

    Software Project Management & TQM 3 0

    70 30 100

    3 MTIT-203

    Object Oriented Software Engineering & UML 3 0 0

    70 30 100

    4 MTIT-204

    Data Communication & Networking 3 0 0

    70 30 100

    6 MTIT-291P Object Tech. Laboratory 0 0 2 30 20 50

    7 MTIT-292P SPM Laboratory 0 0 2

    30 20 50

    8 ECC-211

    Industrial Visit/ Seminar/

    Presentation

    on the report of visits

    - - - - 25 25

    9 ECC-212 University Social

    Responsibility - - 25 25

    10 ECC-213 Spoken Tutorial Certification - - 2 25 25

    11 ECC-214 MOOC/ SWAYAM - - 2 25 25

    Total 12 0 8 340 260 600

  • Semester -III

    Semester -IV

    S. No. Course Code Course Name Periods Evaluation Scheme

    L T P External Internal Total

    1 MTIT301 Web Technology 3 0 70 30 100

    2 MTIT302 Elective I* 3 0 70 30 100

    3 MTIT303 Elective II* 3 0 70 30 100

    4 MTIT391P Web Technology Lab 0 2 30 20 50

    5 MTIT395P Assigned Project (minor) 0 4

    - 100 100

    9 ECC-321

    Industrial Visit/ Seminar/

    Presentation

    on the report of visits

    - - - - 25 25

    10 ECC-322 University Social

    Responsibility - - 25 25

    11 ECC-323 Spoken Tutorial Certification - - 2 25 25

    12 ECC-324 MOOC/ SWAYAM - - 2 25 25

    Total 9 0 10 240 310 550

    S. No. Course Code Course Name Periods Evaluation Scheme

    L T P External Internal Total

    1 MTIT 491 Seminar 0 0 3 100 100 200

    2 MTIT 495 Assigned Project (major) 0 0 12 200 100 300

    9 ECC-421

    Industrial Visit/ Seminar/

    Presentation

    on the report of visits

    - - - - 25 25

    10 ECC-422 University Social

    Responsibility - - 25 25

    11 ECC-423 Spoken Tutorial Certification - - 2 25 25

    12 ECC-424 MOOC/ SWAYAM - - 2 25 25

    Total 0 0 19 300 300 600

  • IIMT UNIVERSITY MEERUT Course Structure and Syllabus for M.Tech(Information Technology)

    * Electives to be selected from the following list ** Assigned Project is to be done throughout the final two semesters of study; Entire Design with DFD/ Use Case/ Production System is to be submitted as Minor (MTIT395) and completed in all aspect including testing and implementation is to be submitted as Major (MTIT 495) *** Seminar should be presented on a very recent topic on any technological domain.

    Elective I Elective II

    MTIT -302 MTIT 303

    A. Formal Language & Automata Compiler Design

    Theory

    B. Artificial Intelligence Soft Computing

    C. Computer Graphics and Multimedia Image Processing and Pattern

    Recognition

    D. Real Time & Embedded Systems Mobile Communication

    E. BioInformatics Data Encryption and Compression

    F. Data Mining & Data Warehousing Remote Sensing and GIS

    G Mechatronics Design and Analysis of Algorithm

    2

  • IIMT UNIVERSITY MEERUT Course Structure and Syllabus for M.Tech(Information Technology)

    1 st

    Semester

    Data Structures and Algorithms

    Code: MTIT-101 Introduction [4L]

    Time and Space analysis of Algorithms - Order Notations.

    Linear Data Structure [14L] Linear Data Structures - Sequential representations - Arrays and Lists, Stacks, Queues and Dequeues, strings, Application. Linear Data Structures, Link Representation - Linear linked lists, circularly linked lists. Doubly linked lists, application.

    Recursion [2L] Recursion - Design of recursive algorithms, Tail Recursion, When not to use recursion, Removal of recursion

    Linear Data Structure [12L] Non-linear Data Structure: Trees - Binary Trees, Traversals and Threads, Binary Search Trees, Insertion and Deletion algorithms, Height-balanced and weight-balanced trees, B-trees, B+ -trees, Application of trees; Graphs - Representations, Breadth-first and Depth-first Search.

    Sorting & Searching [8L] Sorting and Searching Algorithms- Bubble sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap sort and Radix Sort; Linear Search and Binary Search. Hashing - Hashing Functions, collision Resolution Techniques.

    Files [4] File Structures - Sequential and Direct Access. Relative Files, Indexed Files - B+ tree as index. Multi- indexed Files, Inverted Files, Hashed Files. Text book :

    1. Tanenbaum, A. S., ―Data Structures using ‗C‘‖, PHI References :

    2. Weiss Mark Allen, ―Algorithms, Data Structures, and Problem Solving with C++‖, Addison Wesley, Pearson.

    3. Horowitz Ellis & Sartaj Sahni, ―Fundamentals of Data Structures‖, Galgotia Pub.

    4. Aho Alfred V., Hopperoft John E., UIlman Jeffrey D., ―Data Structures and Algorithms‖, Addison Wesley

    5. Drozdek- Data Structures and Algorithms, Vikas

    Database Management System Concept

    Code: MTIT-102 Weekly Contact Hour: 4L

    Introduction [4L] Concept & Overview of DBMS, Data Models, Database Languages, Database Administrator, Database Users, Three Schema architecture of DBMS.

    Entity-Relationship Model [6L]

    3

  • IIMT UNIVERSITY MEERUT Course Structure and Syllabus for M.Tech(Information Technology)

    Basic concepts, Design Issues, Mapping Constraints, Keys, Entity-Relationship Diagram, Weak Entity Sets, Extended E-R features. Relational Model [5L] Structure of relational Databases, Relational Algebra, Relational Calculus, Extended Relational Algebra Operations, Views, Modifications Of the Database. SQL and Integrity Constraints [8L] Concept of DDL, DML, DCL. Basic Structure, Set operations, Aggregate Functions, Null Values, Domain Constraints, Referential Integrity Constraints, assertions, views, Nested Subqueries, Database security application development using SQL, Stored procedures and triggers. Relational Database Design [9L] Functional Dependency, Different anamolies in designing a Database., Normalization using funtional dependencies, Decomposition, Boyce-Codd Normal Form, 3NF, Nomalization using multi-valued depedencies, 4NF, 5NF Internals of RDBMS [7L] Physical data structures, Query optimization: join algorithm, statistics and cost bas optimization. Transaction processing, Concurrency control and Recovery Management: transaction model properties, state serializability, lock base protocols, two phase locking. File Organization & Index Structures [6L] File & Record Concept, Placing file records on Disk, Fixed and Variable sized Records, Types of Single- Level Index (primary, secondary, clustering), Multilevel Indexes, Dynamic Multilevel Indexes using B tree and B+ tree . Text Book:

    1. Henry F. Korth and Silberschatz Abraham, ―Database System Concepts‖, Mc.Graw Hill. References:

    2. Elmasri Ramez a