Top Banner

Click here to load reader

M.Sc. (INFORMATION TECHNOLOGY) COURSE PATTERN FROM · PDF fileM.Sc. (INFORMATION TECHNOLOGY) COURSE PATTERN FROM ... Deleting in a Binary Search Tree ... and Deletion in an m-way Search

Jul 27, 2018

ReportDownload

Documents

buinhi

  • M.Sc. (INFORMATION TECHNOLOGY) COURSE PATTERN FROM 2014 2015 ONWARDS

    SEM SUBJECT

    CODE COURSE SUBJECT TITLE

    HRS / WEEK

    CREDIT CIA

    MARK SE

    MARK TOTAL MARK

    I

    14PIT1C1 Core I Structured and Object Oriented Programming 6 5 40 60 100

    14PIT1C2 Core II Data Structures and Algorithms 6 5 40 60 100

    14PIT1C3 Core III Data Communication and Networking 6 5 40 60 100

    14PIT1C4P1 Core IV Data Structures Lab using C 3 3 20 30 50

    14PIT1C4P 2 Core IV Object Oriented Programming Lab 3 2 20 30 50

    14PIT1CE1 Core Based Elective I # 6 5 40 60 100

    TOTAL 30 25 200 300 500

    II

    14PIT2C5 Core V Advanced Java Programming 6 5 40 60 100

    14PIT2C6 Core VI Management Information Systems 6 5 40 60 100

    14PIT2C7 Core VII Mobile Communications 6 5 40 60 100

    14PIT2C8P1 Core VIII Advanced Java Programming Lab 3 3 20 30 50

    14PIT2C8P2 Core VIII RDBMS Lab 3 2 20 30 50

    14PIT2CE2 Core Based Elective II # 6 5 40 60 100

    TOTAL 30 25 200 300 500

    III

    14PIT3C9 Core IX Advanced Operating Systems 6 5 40 60 100

    14PIT3C10 Core X Open Source Technology 6 5 40 60 100

    14PIT3C11 Core XI Web Technology 6 5 40 60 100

    14PIT3C12P1 Core XII Open Source Lab 3 3 20 30 50

    14PIT3C12P2 Core XII Web Technology Lab 3 2 20 30 50

    14PIT3CE3 Core Based Elective -III # 6 5 40 60 100

    14PIT3EC1 Extra Credit - I # Business Intelligence 5* 100* 100*

    TOTAL 30 25 200 300 500

    IV

    14PIT4CE4 Core XIII .Net Technology 6 5 40 60 100

    14PIT4CE5 Core XIV .Net Technology Lab 6 5 40 60 100

    14PIT4EC2 Extra Credit II # Information Security 5* 100* 100*

    14PITPW Project Work Project Work 18 15 120 180 300

    TOTAL 30 25 200 300 500

    GRAND TOTAL 120 100 800 1200 2000

  • *Not Considered for Grand Total and CGPA # Core Based Electives

    One subject to be opted for each Core Based Electives

    Semester Course Title I Software Project Management I Multimedia Systems & Design I Pattern Recognition II Database Systems II Human Computer Interaction II Genetic Algorithm III IT Infrastructure and Management III E Commerce III Ontology and Semantic Web

  • Core I : Structured and Object Oriented Programming

    Semester : I Subject Code : 14PIT1C1 Max. Marks : 100 Hours : 6 Internal Marks : 40 Credits : 5 External Marks: 60

    Objectives: To give the syntax and semantics of all the constructs in C and to impart the Object Oriented Programming skills in C++

    UNIT I 18 Hrs Introduction to C - Basic Structure of C Programs Tokens keywords & Identifiers - Constants -Variables Data Types Operators Expressions Input and Output Functions - Decision Making and Branching Statements: Simple if(), if..else Nesting of if() else if Ladder switch Statement Looping Statements.

    UNIT II 18 Hrs User Defined Functions: Elements of Functions Definition of Functions Function Declarations Function Calls Return Values and Types - Arrays: Single and Two Dimensional Arrays Structures and Unions: Introduction Defining, Declaring and Accessing Structure Members Unions Pointers: Understanding Pointers Declaring and Accessing Pointers.

    UNIT III 18 Hrs Principles of Object Oriented Programming(OOP): Basic Concepts Structure of C++ Programs Differences between C and C++ - Function Call by Reference and Return by Reference - In-line functions Default Arguments- Function Overloading. Classes and Objects: Defining Member Functions Private Member Functions Static Member Functions Array of Objects Friend functions Constructors - Parameterized Constructors Copy constructor Dynamic Constructors Destructors.

    UNIT IV 18 Hrs Operator Overloading: Defining Operator Overloading Overloading Unary and Binary operators Overloading Binary Operators using Friend Functions Rules for overloading operators. Inheritance: Introducing Inheritance Defining Derived Classes, Single, Multilevel, Multiple, Hierarchical and Hybrid Inheritances Virtual Base class - Pointers to Objects this Pointer.

    UNIT V 18 Hrs Virtual functions: Pointers to Derived Classes Virtual Functions Pure Virtual Functions Console I/O and Files: C++ Stream Classes Formatted Console I/O Operations Managing output Manipulators Opening and Closing Files Random access file Error handling during File Operations Command-line Arguments - Class and Function Templates Exception Handling.

    Text Books 1. E. Balagurusamy, Programming in ANSI C, Tata McGraw-Hill Publishing Company Limited, Fifth Edition, 2011. UNIT I & II 2. E. Balagurusamy, Object Oriented Programming with C++, Tata McGraw-Hill Publishing Company Limited, Fourth Edition, 2008. UNIT III, IV & V Reference Book

  • Herbert Schildt, Teach yourself C++, Tata McGraw-Hill Publishing Company, Third Edition, 2008.

  • Core II : Data Structures and Algorithms

    Semester : I Subject Code : 14PIT1C2 Max. Marks : 100 Hours : 6 Internal Marks : 40 Credits : 5 External Marks: 60

    Objectives: To study the various concepts of data structures and algorithms using trees, graphs, sorting, searching, and algorithm design techniques. UNIT I 18 Hrs Lists, Stacks and Queues: Abstract Data Types (ADTs) - The Stack ADT - The Queue ADT UNIT II 18 Hrs Trees: Introduction - Binary Trees - Representing Binary Trees in Memory - Traversing Binary Trees - Traversal Algorithms using Stacks - Header Nodes: Threads. Binary Search Trees - Searching and Inserting in Binary Search Trees - Deleting in a Binary Search Tree - AVL Search Trees - Insertion in an AVL Search Tree - Deletion in an Search Tree - m-way Search Trees - Searching Insertion and Deletion in an m-way Search Tree - B Trees - Searching Insertion and Deletion in B Trees - Heap: Heapsort. Path Lengths: Huffmans Algorithm - General Trees. UNIT III 18 Hrs Graphs and Their Applications: Introduction - Graph Theory Terminology - Sequential Representation of Graphs - Warshalls Algorithm - Linked Representation of a Graph - Operations on Graphs - Traversing a Graph - Topological Sorting. UNIT IV 18 Hrs Sorting and Searching: Introduction-Sorting - Insertion Sort - Selection Sort Merging - Merge Sort - Radix Sort -Searching and Data Modification - Hashing. UNIT V 18 Hrs Algorithm Design Techniques: Greedy Algorithms - Divide and Conquer - Dynamic Programming - Randomized Algorithms - Backtracking Algorithms. Text Books 1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Pearson publishing Company Limited, Second Edition, Reprint, Eleventh Impression. UNIT I Chapter 3 UNIT V Chapter 10 2. Seymour Lipschutz Data Structures (Schaums Outlines), Tata McGraw-Hill Publishing Company Limited, Fourth Reprint, 2006. UNIT II Chapter 7 UNIT III Chapter 8 UNIT IV Chapter 9

  • Core III : Data Communication and Networking

    Semester : I Subject Code : 14PIT1C3 Max. Marks : 100 Hours : 6 Internal Marks : 40 Credits : 5 External Marks: 60

    Objectives: To study the various layers of networking to understand the concepts of data communication and networking. UNIT I 18 Hrs Introduction: Data Communications Networks The Internet - Protocol and Standards Network Models: Internet Model. The OSI model Layers in the OSI model. Physical Layer: Multiplexing: FDM WDM TDM Guided Media Circuit Switched Networks Telephone Network UNIT II 18 Hrs Data Link Layer: Error Detection and Correction Types of Errors Error Detection and Correction Data Link Control and Protocols: Flow and Error Control Stop and Wait ARQ Go-Back-N ARQ Selective Repeat ARQ HDLC Connecting Devices Point-To-Point Protocol. UNIT III 18 Hrs Network Layer: Internetworks Addressing: Internet Address Classful addressing Subnetting Supernetting Routing: Routing Techniques Static versus dynamic routing IP: Datagram Fragmentation Unicast Routing Unicast Routing Protocols: Distance Vector Routing Link State Routing. UNIT IV 18 Hrs Transport Layer: Process to Process Delivery User Datagram Protocol Transmission Control Protocol Congestion Control and Quality of Service: Data traffic Congestion Congestion control Congestion control in TCP Quality of Services Techniques to Improve QOS UNIT V 18 Hrs Application Layer: Name space Domain Name Space DNS in the Internet Electronic Mail File Transfer Protocol. Cryptography: Symmetric Key Cryptography Public-Key Cryptography Digital Signature User Authentication Key management. Firewall Virtual Private network. Text Book: 1. BEHROUZ A FOROUZAN, Data Communications and Networking, 3rd Edition, Tata McGraw-Hill, 2004

  • Core IV(a) : Data Structures Lab using C

    Semester : I Subject Code : 14PIT1C4P1 Max. Marks : 50 Hours : 3 Internal Marks : 20 Credits : 3 External Marks: 30

    1 To push and pop an element from STACK.

    2 To insert and delete an element from QUEUE.

    3 Binary Search Tree (BST):

    (i) Creating a BST

    (ii) Searching an element in a BST

    (iii) Inserting an element in a BST

    4 Heap sort

    (i) Building a heap

    (ii) Heap sort

    5 To find the shortest paths between every pair of vertices.

    6 Graph Traversal (Breadth First Search (BFS) and Depth First Search (DFS))

    7 Finding the Kth smallest element from a given list of elements.