Course: Core course for MTech 1st year, 2nd semester
Grading: Internal Assessment (Attendance, Assignment, Quiz, Mid-Sem): 50%; End-semester exam: 50%
Books referred:
Behrouz A. Forouzan. “Data Communications and Networking”, 5th Edition, McGraw Hill Publishing Co.
William Stallings. “Data and Computer Communications”, 10th edition, Pearson Publication.
Andrew S. Tanenbaum. “Computer Networks”, 4th Edition, Pearson Publication.
James Kurose and Keith Ross, "Computer Networking: A Top-Down Approach" ,6th edition, Pearson Larry Publication.
Larry L. Peterson and Bruce S. Davie, "Computer Networks: A Systems Approach", 5th edition, Morgan Kaufman Publication
Topics:
Module 1: Introduction
Data communication Components: Representation of data and its flow Networks; Various Connection Topologies; Protocols and Standards; TCP/IP protocol suite; OSI model.
Module 2: Wireless Networks
Introduction; Wireless Links and Network Characteristics; WiFi:802.11 Wireless LANs - architecture, MAC protocol, IEEE 802.11 frame; Mobility in the same IP Subnet; WiMAX/IEEE 802.16; Personal Area Network - IEEE 802.15.2 Bluetooth.
Module 3: Multimedia Networks
Multimedia Networking Applications - properties of video, audio, types of multimedia applications; Streaming Stored Video - UDP Streaming, HTTP Streaming, Adaptive Streaming, Content Distribution Network (CDN), Case Studies; Voice-over-IP (VoIP); Protocols for Real-Time Conversational Applications - RTP, SIP.
Module 4: Mobile Networks
Cellular Internet Access: Overview; 3G Cellular Data Networks; 4G LTE; 5G Wireless Networks; Mobility Management - Principles, Mobile IP; Managing Mobility in Cellular Networks - Routing, Handoffs in GSM.
Module 5: Internet Security & Firewalls
Security in the Internet: IPSec, SSL/TLS, PGP, and VPN; Traditional Packet Filter Firewalls; Stateful Packet Filter Firewalls; Application Gateways.
Course: Core course for BTech 3rd year, 1st semester
Grading: Internal Assessment (Attendance, Assignment, Quiz, Mid-Sem): 50%; End-semester exam: 50%
Books referred:
Kenneth Rosen. “Discrete Mathematics and Its Applications”, 7th Edition, McGraw Hill Publishing Co., 2012.
Thomas H. Coremen, et al. “Introduction to Algorithms,” 4th Edition, MIT Press.
Ellis Horowitz, et al. “Computer Algorithms”, Computer Science Press.
Topics:
Module 1: Introduction to Graphs
Definition and basic properties of graphs; Types of graphs; Graph representations (adjacency matrix, adjacency list); Graph Isomorphism; Breadth First Search (BFS); Depth First Search (DFS); Graph Coloring;
Module 2: Connectivity and Paths
Paths and circuits, Euler paths & circuits, Hamilton paths & circuits; Connectedness in undirected graphs; Connected components; Vertex connectivity, Edge connectivity; Connectedness in directed graphs; Planar graphs;
Module 3: Shortest Paths
Shortest path problem - Dijkstra's algorithm; Single-source shortest path problem - Bellman-Ford algorithm; All pair shortest path problem – Floyd-Warshall algorithm
Module 4: Trees
Definition and basic properties of trees; Traversal of trees - preorder, inorder, postorder; Spanning trees - definitions, building spanning trees from graphs using DFS and BFS; Minimum spanning tree (MST) problem - Kruskal's algorithm, Prim's algorithm;
Module 4: Maximum Flow
Flow networks; The Ford-Fulkerson method;
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Course: Core course for BTech 2nd year, 1st semester
Grading: Internal Assessment (Attendance, Assignment, Quiz, Mid-Sem): 50%; End-semester exam: 50%
Books referred:
Kenneth Rosen. “Discrete Mathematics and Its Applications”, 7th Edition, McGraw Hill Publishing Co., 2012.
Susanna S. Epp. “Discrete Mathematics with Applications”, 4th edition, Wadsworth Publishing Co. Inc
C. L. Liu and D. P. Mohapatra. “Elements of Discrete Mathematics: A Computer Oriented Approach”, 3rd Edition, Tata McGraw – Hill.
Topics:
Module 1:
Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic Connectives and Truth Tables, Logical Equivalence: The Laws of Logic, Logical Implication, Rules of Inference, The use of Quantifiers.
Proof Techniques: Some Terminology, Proof Methods and Strategies, Forward Proof, Proof by Contradiction, Proof by Contraposition, Proof of Necessity and Sufficiency.
Module 2:
Basic Discrete Structures (Sets, Relations, Functions): Operations and Laws of Sets, Cartesian Products, Binary Relation, Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum and Product of Functions, Bijective functions, Inverse and Composite Function, Size of a Set, Finite and infinite Sets, Countable and uncountable Sets, Cantor's diagonal argument and The Power Set theorem, Schroeder-Bernstein theorem.
Module 3:
Counting: Basic counting techniques-inclusion and exclusion, pigeon-hole principle, permutation and combination.
Generating Function and Recurrence Relations: Numeric functions and their asymptotic behavior, Generating functions and their use for solving combinatorial problems, Recurrence relations and their application in analyzing algorithms.
Principles of Mathematical Induction: The Well-Ordering Principle, Proof by induction, Strong induction.
Integers and Division: The Division algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean Algorithm, The Fundamental Theorem of Arithmetic.
Module 4:
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph, Isomorphism, Eulerian and Hamiltonian Walks, Graph Colouring, Colouring maps and Planar Graphs, Colouring Vertices, Colouring Edges, List Colouring, Perfect Graph, definition properties and Example, rooted trees, trees and sorting, weighted trees and prefix codes, Bi-connected component and Articulation Points, Shortest distances
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Course: Core course for BTech 3rd year, 2nd semester
Grading: Internal Assessment (Attendance, Assignment, Quiz, Mid-Sem): 50%; End-semester exam: 50%
Books referred:
Behrouz A. Forouzan. “Data Communications and Networking”, 5th Edition, McGraw Hill Publishing Co.
William Stallings. “Data and Computer Communications”, 10th edition, Pearson Publication.
Andrew S. Tanenbaum. “Computer Networks”, 4th Edition, Pearson Publication.
James Kurose and Keith Ross, "Computer Networking: A Top-Down Approach" ,6th edition, Pearson Larry Publication.
Larry L. Peterson and Bruce S. Davie, "Computer Networks: A Systems Approach", 5th edition, Morgan Kaufman Publication
Topics:
Module 1:
Data communication Components: Representation of data and its flow Networks, Various Connection Topology, Protocols and Standards, OSI model; Physical layer: Data & Signals, Periodic Analog Signals, Digital Signals, Transmission Impairments, Data Rate Limits, Performance; Techniques for Bandwidth utilization: Multiplexing - Frequency Division, Time Division and Wave Division, Concepts on Spread Spectrum; Switching – Circuit Switching, Packet Switching.
Module 2:
Data Link Layer and Medium Access Sub Layer: Error Detection and Error Correction -Fundamentals, Block coding, Hamming Distance, CRC; Flow Control and Error control protocols - Stop and Wait, Go back – N ARQ, Selective Repeat ARQ, Sliding Window, Piggybacking, Random Access, Multiple access protocols -Pure ALOHA, Slotted ALOHA, CSMA/CD, CDMA/CA, Wired LAN, Wireless LAN, Connecting LAN, Virtual LAN.
Module 3:
Network Layer: The Internet Protocol (IP) - Forwarding and Addressing in the Internet; Routing algorithms - Link-state routing, Distance vector routing, Hierarchical routing; Routing in the Internet - RIP, OSPF, BGP; Broadcast & multicast routing; Next Generation IP - IPv6, ICMPv6.
Module 4:
Transport Layer: Process to Process Communication; User Datagram Protocol (UDP); Transmission Control Protocol (TCP); Flow Control; Congestion Control.
Module 5:
Application Layer: Protocols - DNS, SMTP, POP, FTP, WWW, HTTP; Network security - authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------