Abhi PYQ

Credits Table

Course Title L T P Credits
Database Management System [156501] 3 0 0 3
Computer Network [156502] 3 0 0 3
Automata Theory & Compiler Design [156503] 3 0 0 3
Cryptography and Network Security [156504] 3 0 0 3
Seminar [156505] 0 1 0 1
Program Electives Courses-I [156506-156510] 3 0 0 3
Professional Practice, Law & Ethics 0 3 0 0
Summer Entrepreneurship-II [156511P] 6 Weeks 6
NPTEL Course [156512P] 0 0 4 2
Database Management System Lab [156501P] 0 0 4 2
Computer Network Lab [156502P] 0 0 2 1
TOTAL 27

Theory Subjects

Lab Subjects

Database Management System [156501]

  • Unit 1.0: Database system architecture
    • Data Abstraction
    • Data Independence
    • Data Definition Language (DDL)
    • Data Manipulation Language (DML)
    • Data models: Entity-relationship model
    • Network model
    • Relational and object oriented data models
    • Integrity constraints
    • Data manipulation operations
  • Unit 2.0: Relational query languages
    • Relational algebra
    • Tuple and domain relational calculus
    • SQL3
    • DDL and DML constructs
    • Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server
    • Relational database design: Domain and data dependency
    • Armstrong's axioms
    • Normal forms
    • Dependency preservation
    • Lossless design
    • Query processing and optimization: Evaluation of relational algebra expressions
    • Query equivalence
    • Join strategies
    • Query optimization algorithms
  • Unit 3.0: Storage strategies
    • Indices
    • B-trees
    • Hashing
  • Unit 4.0: Transaction processing
    • Concurrency control
    • ACID property
    • Serializability of scheduling
    • Locking and timestamp based schedulers
    • Multi-version and optimistic Concurrency Control schemes
    • Database recovery
  • Unit 5.0: Database Security
    • Authentication
    • Authorization and access control
    • DAC
    • MAC and RBAC models
    • Intrusion detection
    • SQL injection
  • Unit 6.0: Advanced topics
    • Object oriented and object relational databases
    • Logical databases
    • Web databases
    • Distributed databases
    • Data warehousing and data mining

Text/Reference Books:

  1. "Database System Concepts", 6th Edition by Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw-Hill.
  2. "Principles of Database and Knowledge - Base Systems", Vol 1 by J. D. Ullman, Computer Science Press.
  3. "Fundamentals of Database Systems", 5th Edition by R. Elmasri and S. Navathe, Pearson Education.
  4. "Foundations of Databases", Reprint by Serge Abiteboul, Richard Hull, Victor Vianu, Addison - Wesley.

Computer Network [156502]

  • Unit 1.0
    • Overview of Data Communication and Networking: OSI Reference Model
    • TCP/IP Protocol Suite
    • Network Architecture and Physical Topology
  • Unit 2.0
    • Physical Layer: Analog and Digital Signals
    • Transmission Impairment
    • Data Rate Limits
    • Performance Analysis of a Network
    • Representation and Synchronization of Bits
    • Analog and Digital Transmission
    • Multiplexing and Spreading Techniques
    • Guided Transmission Media
    • Circuit
    • Packet and Virtual Circuit Switching
  • Unit 3.0
    • Data Link Layer: Framing
    • Flow and Error Control (Noiseless and Noisy Channels Protocols)
    • PointToPoint Protocol
    • Random Access protocols (Pure/slotted ALOHA, CSMA/CD, CSMA/CA)
    • Controlled Access Protocol (Bit-Map, Polling and Token Passing)
    • Channelization (TDMA, FDMA, CDMA)
    • Physical Addressing and Ethernet
    • Connecting LANs and Virtual LANs
  • Unit 4.0
    • Network Layer: Internet Protocol version 4 and 6
    • Address Mapping (ARP, RARP, BOOTP and DHCP)
    • ICMP and IGMP
    • Routing Algorithms
  • Unit 5.0
    • Transport Layer: UDP
    • TCP
    • Congestion Control and QoS
    • Client-Server Model and Socket Interface
  • Unit 6.0
    • Application Layer: DNS
    • Remote Logging
    • Electronic Mail (SMTP, POP)
    • FTP
    • Introduction to WWW and HTTP

Suggested books:

  1. B. Forouzan, "Data Communication and Network", McGraw-Hill Publications. 4th ed.
  2. A. S. Tanenbaum., "Computer Networks", Pearson Education Asia. 5th ed.

Suggested reference books:

  1. W. Stalling, "Data and Computer Communication", PHI (EEE). 8th ed.
  2. A. L. Garcia and I. Widjaja, "Communication Networks: Fundamental Concepts and Key Architectures", Tata McGraw-Hill. 2nd ed.
  3. S. Sharma, "A course in Computer Networks", Kataria. 3rd ed.

Automata Theory & Compiler Design [156503]

  • Unit 1.0
    • Formal Language and Regular Expressions: Languages
    • Definition Languages regular expressions
    • Finite Automata - DFA
    • NFA
    • Conversion of regular expression to NFA
    • NFA to DFA
  • Unit 2.0
    • Applications of Finite Automata to lexical analysis
    • Lex tools
    • Context Free grammars and parsing: Context free grammars
    • Derivation
    • Parse trees
    • Ambiguity LL(K) grammars and LL(1) parsing
  • Unit 3.0
    • Bottom up parsing handle pruning LR Grammar Parsing
    • LALR parsing
    • Parsing ambiguous grammars
    • YACC programming specification
    • Semantics: Syntax directed translation
    • S-attributed and L-attributed grammars
    • Intermediate code - abstract syntax tree
    • Translation of simple statements and control flow statements
  • Unit 4.0
    • Context Sensitive features Chomsky hierarchy of languages and recognizers
    • Type checking
    • Type conversions
    • Equivalence of type expressions
    • Overloading of functions and operations
  • Unit 5.0
    • Run time storage: Storage organization
    • Storage allocation strategies scope access to now local names
    • Parameters
    • Language facilities for dynamics storage allocation
    • Code optimization: Principal sources of optimization
    • Optimization of basic blocks
    • Peephole optimization
    • Flow graphs
    • Data flow analysis of flow graphs
  • Unit 6.0
    • Code generation: Machine dependent code generation
    • Object code forms
    • Generic code generation algorithm
    • Register allocation and assignment
    • Using DAG representation of Blocks

Suggested books:

  1. Introduction to Theory of computation.Sipser, 2nd Edition, Thomson.
  2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson Education.

Suggested reference books:

  1. Modern Compiler Construction in C, Andrew W.Appel Cambridge University Press.
  2. Compiler Construction, LOUDEN, Thomson.
  3. Elements of Compiler Design, A. Meduna, Auerbach Publications, Taylor and Francis Group.
  4. Principles of Compiler Design, V. Raghavan, TMH.
  5. Engineering a Compiler, K. D. Cooper, L. Torczon, ELSEVIER.

Cryptography and Network Security [156504]

  • Unit 1.0: Classical Encryption Techniques and Security Concepts
    • Security Concepts: Introduction
    • The need for security
    • Security approaches
    • Principles of security
    • Types of Security attacks
    • Security services
    • Security Mechanisms
    • A model for Network Security
    • Cryptography Concepts and Techniques: Introduction
    • Plain text and cipher text
    • Substitution techniques
    • Transposition techniques
    • Encryption and decryption
    • Symmetric and asymmetric key cryptography
    • Stenography
    • Key range and key size
    • Possible types of attacks
  • Unit 2.0: Block Ciphers and Symmetric Key Cryptography
    • Symmetric key Ciphers: Block Cipher principles- DES
    • AES
    • Blowfish
    • RC5
    • International Data Encryption Algorithm (IDEA)
    • Block Cipher Operation Modes
    • Stream ciphers - RC4
  • Unit 3.0: Number Theory and Asymmetric Key Cryptography
    • Number Theory: Prime and Relatively Prime Numbers
    • Modular Arithmetic
    • Fermat's and Euler's Theorems
    • Testing for Primality
    • The Chinese Remainder Theorem
    • Discrete Logarithms
    • Asymmetric key Ciphers: Principles of Public Key Cryptosystems
    • The RSA Algorithm
    • Diffie Hellman Key Exchange
    • Elgamal encryption & decryption
    • Knapsack Algorithm
  • Unit 4.0: Cryptographic Hash Functions, Authentication, and Digital Signatures
    • Cryptographic Hash Functions: Message Authentication
    • Secure Hash Algorithm (SHA-512)
    • Message authentication codes: Authentication requirements
    • HMAC
    • CMAC
    • Digital signatures
    • Elgamal Digital Signature Scheme
    • Key Management and Distribution: Symmetric Key Distribution Using Symmetric & Asymmetric Encryption
    • Distribution of Public Keys
    • Kerberos
    • X.509 Authentication Service
    • Public Key Infrastructure
  • Unit 5.0: Transport Layer Security and Wireless Network Security
    • Transport-level Security: Web security considerations
    • Secure Socket Layer and Transport Layer Security
    • HTTPS
    • Secure Shell (SSH)
    • Wireless Network Security: Wireless Security
    • Mobile Device Security
    • IEEE 802.11 Wireless LAN
    • IEEE 802.11i Wireless LAN Security
  • Unit 6.0: E-Mail and IP Security: Concepts and Applications
    • E-Mail Security: Pretty Good Privacy
    • S/MIME
    • IP Security: IP Security overview
    • IP Security architecture
    • Authentication Header
    • Encapsulating security payload
    • Combining security associations
    • Internet Key Exchange
    • Case Studies on Cryptography and security: Secure Multiparty Calculation
    • Virtual Elections
    • Single sign On
    • Secure Inter-branch Payment Transactions
    • Cross site Scripting Vulnerability

Text/Reference Books:

  1. Cryptography and Network Security: Principles and Practice William, Stallings, Pearson Education, 8th Edition (2022), ISBN-13: 978-1292437480.
  2. Cryptography and Network Security, Atul Kahate, McGraw Hill Education India Pvt Ltd, 3rd Edition (2017), ISBN-13: 978-1259029882.
  3. Cryptography and Network Security, Behrouz A. Forouzan, McGraw Hill Education, 3rd Edition (2015), ISBN-13: 978-0070702080.
  4. Cryptography and Network Security, C.K. Shyamala, N. Harini, Dr. T.R. Padmanabhan, Wiley India, 1st Edition (2011), ISBN-13: 978-8126521793.
  5. Information Security: Principles and Practice Mark Stamp, Wiley, 2nd Edition (2011), ISBN-13: 978-0470626399.
  6. Principles of Computer Security: CompTIA Security+ and Beyond Wm. Arthur Conklin, Greg White, McGraw Hill Education, 5th Edition (2018), ISBN-13: 978-1260026375.

Program Elective-I: Software Engineering [156506]

  • Unit 1.0: Introduction
    • What is Software Engineering and its history
    • Software crisis
    • Evolution of a Programming System Product
    • Characteristics of Software
    • Brooks' No Silver Bullet
    • Software Myths
    • Software Development Life Cycles: Software Development Process
    • The Code-and-Fix model
    • The Waterfall model
    • The Evolutionary Model
    • The Incremental Implementation
    • Prototyping
    • The Spiral Model
    • Software Reuse
    • Critical Comparisons of SDLC models
    • An Introduction to Non-Traditional Software Development Process: Rational Unified Process
    • Rapid Application Development
    • Agile Development Process
  • Unit 2.0: Requirements
    • Importance of Requirement Analysis
    • User Needs
    • Software Features and Software Requirements
    • Classes of User Requirements: Enduring and Volatile
    • Sub phases of Requirement Analysis
    • Functional and Nonfunctional requirements
    • Barriers to Eliciting User requirements
    • The software requirements document and SRS standards
    • Requirements engineering
    • Case Study of SRS for a Real Time System
    • Tools for Requirements Gathering: Document Flow Chart
    • Decision Table
    • Decision Tree
    • Introduction to nontraditional Requirements
  • Unit 3.0: Software Design
    • Goals of good software design
    • Design strategies and methodologies
    • Data oriented software design
    • Coupling
    • Cohesion
    • Modular structure
    • Packaging
    • Structured Analysis: DFD
    • Data Dictionary
    • Structured Design: Structure chart
    • Object oriented design
    • Top-down and bottom-up approach
    • UML
    • UML Diagrams
    • Design patterns
  • Unit 4.0: Software Project Management
    • Overview of Project Manager Responsibilities & project planning
    • Software Measurement and Metrics: Line of Code (LOC)
    • Function Point (FP) based measures
    • Various Size Oriented Measures: Halstead's software science
    • Project Size estimation Metrics Project Estimation
    • Techniques
    • COCOMO
    • Staffing Level Estimation
    • Scheduling
    • Organization & Team Structures Staffing
    • Risk Management
  • Unit 5.0: Software Coding & Testing
    • Development: Selecting a language
    • Coding guidelines
    • Writing code
    • Code documentation
    • Testing process
    • Design of test cases
    • Functional Testing: Boundary value analysis
    • Equivalence class testing
    • Decision table testing
    • Cause effect graphing
    • Structural testing
    • Cyclomatic Complexity Measures: Control flow graphs
    • Path testing
    • Data flow and mutation testing
    • Unit testing
    • Integration and system testing
    • Debugging
    • Alpha & beta testing
    • Testing tools & standards
  • Unit 6.0: Software Maintenance
    • Management of maintenance
    • Maintenance process
    • Maintenance models
    • Regression testing
    • Reverse engineering
    • Software reengineering
    • Configuration management
    • Documentation
    • Software Reliability & Quality Management: Introduction to reliability and metrics to reliability measure
    • Overview of S/W Quality management System ISO 9000
    • SEI CMM

Text/Reference Books:

  1. Software Engineering: A Practitioner's Approach, R. S. Pressman, McGraw Hill
  2. Fundamental of Software Engg. By Rajib Mall 4th edition PHI
  3. A Concise Introduction to Software Engineering By Pankaj Jalote.
  4. Zero Defect Software, G. G. Schulmeyer, McGraw-Hill
  5. Object Oriented Modeling and Design, J. Rumbaugh, Prentice Hall
  6. Software Engineering, K.K. Aggarwal, Yogesh Singh, New Age International Publishers

Program Elective-I: Pattern Recognition [156507]

  • Unit 1.0: Introduction to Pattern Recognition
    • Definition
    • Applications of Pattern Recognition
    • Supervised vs. Unsupervised Learning
    • Statistical vs. Structural Pattern Recognition
    • Pattern Recognition System Design
    • Overview of Feature Extraction and Selection
  • Unit 2.0: Statistical Pattern Recognition
    • Bayes Decision Theory
    • Maximum Likelihood Estimation
    • Bayesian Classifier
    • Naïve Bayes Classifier
    • Parametric and Non-Parametric Approaches
    • K-Nearest Neighbors (KNN)
    • Probabilistic Graphical Models
  • Unit 3.0: Feature Extraction and Dimensionality Reduction
    • Feature Selection Techniques
    • Principal Component Analysis (PCA)
    • Linear Discriminant Analysis (LDA)
    • Independent Component Analysis (ICA)
    • Singular Value Decomposition (SVD)
    • Feature Engineering for Pattern Recognition
  • Unit 4.0: Machine Learning for Pattern Recognition
    • Support Vector Machines (SVM)
    • Decision Trees
    • Random Forest
    • Neural Networks (MLP, CNNs)
    • Deep Learning Approaches
    • Autoencoders
    • Performance Evaluation Metrics (Precision, Recall, F1-score, ROC Curve)
  • Unit 5.0: Clustering and Unsupervised Learning
    • K-Means Clustering
    • Hierarchical Clustering
    • DBSCAN
    • Gaussian Mixture Models (GMM)
    • Self-Organizing Maps (SOM)
    • Hidden Markov Models (HMM)
    • Applications of Clustering in Pattern Recognition
  • Unit 6.0: Applications and Emerging Trends
    • Pattern Recognition in Image Processing
    • Speech Recognition
    • Biometrics
    • Natural Language Processing (NLP)
    • Object Detection and Recognition
    • Al-driven Pattern Recognition
    • Ethical Considerations in Pattern Recognition

Textbooks:

  1. Richard O. Duda, Peter E. Hart, David G. Stork - Pattern Classification, Wiley.
  2. Sergios Theodoridis, Konstantinos Koutroumbas - Pattern Recognition, Academic Press.
  3. C. M. Bishop - Pattern Recognition and Machine Learning, Springer.

Reference Books:

  1. S. Haykin - Neural Networks and Learning Machines, Pearson.
  2. Christopher Bishop - Neural Networks for Pattern Recognition, Oxford University Press.
  3. S. V. N. Vishwanathan - Introduction to Statistical Learning Theory, Springer.
  4. Anil K. Jain, Robert P. Duin, Jianchang Mao - Statistical Pattern Recognition: A Review, Elsevier.
  5. Trevor Hastie, Robert Tibshirani, Jerome Friedman - The Elements of Statistical Learning, Springer

Program Elective-I: Digital Signal Processing [156508]

  • Unit 1.0: Discrete Fourier Transform (DFT)
    • Z-transform and DTFT
    • Frequency domain sampling (Sampling of DTFT)
    • DFT and its inverse
    • Zero padding
    • DFT as a linear transformation (matrix method)
    • Properties
    • Spectrum analysis using DFT
    • Filtering of long data sequences using DFT: overlap save method
    • Overlap add method
  • Unit 2.0: Fast Fourier Transform (FFT)- Radix-2 FFT algorithms
    • Decimation-in-time (DIT-FFT) algorithm
    • Decimation-in-frequency (DIF-FFT) algorithm
    • Inverse DFT using FFT algorithms
    • Goertzel algorithm
    • Chirp-z transform algorithm
  • Unit 3.0: Filter Concepts
    • Frequency response and filter characteristics
    • Phase delay and group delay
    • Zero-phase filter
    • Linear-phase filter
    • Simple FIR filters
    • Simple IIR filters
    • All pass filter
    • Minimum-phase system
    • Averaging filter
    • Comb filter
    • Digital resonator
    • Notch filter
    • Digital sinusoidal oscillator
  • Unit 4.0: FIR and IIR Digital Filter
    • Desirability of linear-phase filters
    • Frequency response of linear phase FIR filters
    • Filter specifications: absolute specifications
    • Relative specifications
    • Analog filter specifications
    • Design techniques: windowing
    • Frequency sampling method
    • Digital Hilbert transformer
    • Analog filters
    • Butterworth and Chebyshev approximation
    • Bilinear transformation method
    • Warping effect
    • Spectral transformation
    • Design of low pass
    • High pass
    • Band pass and band elimination filter
  • Unit 5.0: Realizations of Digital Filters
    • FIR filter structures: direct form
    • Cascade form
    • Linear-phase form
    • FIR Lattice structure
    • IIR filter structures: direct form-I
    • Direct form-II
    • Cascade form
    • Parallel form
    • All pole lattice structure
    • Lattice-ladder (pole-zero) lattice structure
  • Unit 6.0: Multirate Signal Processing
    • Decimation
    • Interpolation
    • The polyphase decomposition
    • Digital filter banks
    • Nyquist filters
    • Two-channel QMF

Text Book:

  1. Digital Signal Processing by Alan V. Oppenheim, Ronald W. Schafer, PHI

Reference Books:

  1. S K Mitra, Digital Signal Processing-A Computer Based Approach, Tata McGraw Hill.
  2. Digital Signal Processing by John G. Proakis, Dimitris K Manolakis, Pearson.

Program Elective-I: Randomized Algorithms [156509]

  • Unit 1.0: Basic Probability Theory
    • Basic probability theory
    • Random variables
    • Expectation of a Random variable
    • Linearity of Expectation
    • Randomized complexity classes
    • Independent events
    • Limited independence
  • Unit 2.0: Simple Randomized Algorithms
    • A simple Randomized algorithm for Min-cut problem and analysis
    • Randomized quicksort and analysis
  • Unit 3.0: Randomized Complexity Classes And Some More Randomized Algorithms
    • Randomized Complexity Classes BPP and RP
    • Adleman's theorem
    • Randomization applied in Game theory
    • Minimax Principle
    • Lower bounds
    • Coupon collecting problem
    • Stable marriage problem
    • Proposal algorithm
    • Analysis
  • Unit 4.0: Analyzing Deviation From Expectation
    • Calculating deviation from expectation: Tail bounds
    • Markov and Chebyshev inequalities
    • Chernoff's bounds
    • Algorithm for kth smallest element
    • Analysis
  • Unit 5.0: Derandomization Techniques
    • Randomized algorithm for MAX-SAT and Max-cut problems
    • Derandomization using method of conditional probabilities and expectations
  • Unit 6.0: Probabilistic Method
    • Hypercube routing algorithm
    • Probabilistic Method
    • The basic counting argument
    • The Expectation argument
    • Lovasz Local Lemma Proof
    • Explicit Constructions using the Local Lemma
    • Illustration and Applications

Text Books:

  1. Motwani, Raghavan, Randomized Algorithms, Ist Edition, Cambridge University Press, 2004, 978-0521613903
  2. Alon, Spencer, Probabilistic Method, 4th Edition, Wiley, 2015, 978-1119061953

Program Elective-I: Internet of Things [156510]

  • Unit 1.0
    • Introduction to IoT: Architectural Overview
    • Design principles and needed capabilities
    • IoT Applications
    • Sensing
    • Actuation
    • Basics of Networking
    • M2M and IoT Technology Fundamentals- Devices and gateways
  • Unit 2.0
    • Data management
    • Business processes in IoT
    • Everything as a Service (XaaS)
    • Role of Cloud in IoT
    • Security aspects in IoT
  • Unit 3.0
    • Elements of IoT: Hardware Components Computing (Arduino, Raspberry Pi)
    • Communication
    • Sensing
    • Actuation
    • I/O interfaces
  • Unit 4.0
    • Software Components- Programming API's (using Python/Node.js/Arduino) for Communication
    • Protocols-MQTT
    • ZigBee
    • Bluetooth
    • CoAP
    • UDP
    • TCP
  • Unit 5.0
    • IoT Application Development: Solution framework for IoT applications- Implementation of Device integration
    • Data acquisition and integration
    • Device data storage- Unstructured data storage on cloud/local server
    • Authentication
    • Authorization of devices
  • Unit 6.0
    • IoT Case Studies: IoT case studies and mini projects based on Industrial automation
    • Transportation
    • Agriculture
    • Healthcare
    • Home Automation

Suggested books:

  1. Vijay Madisetti, Arshdeep Bahga, Internet of Things, "A Hands on Approach", University Press
  2. Dr. SRN Reddy, Rachit Thukral and Manasi Mishra, "Introduction to Internet of Things: A practical Approach", ETI Labs
  3. Pethuru Raj and Anupama C. Raman, "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", CRC Press
  4. Jeeva Jose, "Internet of Things", Khanna Publishing House, Delhi
  5. Adrian McEwen, "Designing the Internet of Things", Wiley
  6. Raj Kamal, "Internet of Things: Architecture and Design", McGraw Hill
  7. Cuno Pfister, "Getting Started with the Internet of Things", O Reilly Media.

Database Management System Lab [156501P]

Preform all Experiments:

  • Student should decide on a case study and formulate the problem statement.
  • Conceptual Designing using ER Diagrams (Identifying entities, attributes, keys and relationships between entities, cardinalities, generalization, specialization etc.) Note: Student is required to submit a document by drawing ER Diagram to the Lab teacher.
  • Converting ER Model to Relational Model (Represent entities and relationships in Tabular form, Represent attributes as columns, identifying keys) Note: Student is required to submit a document showing the database tables created from ER Model.
  • Normalization -To remove the redundancies and anomalies in the above relational tables, Normalize up to Third Normal Form.
  • Creation of Tables using SQL- Overview of using SQL tool, Data types in SQL, Creating Tables (along with Primary and Foreign keys), Altering Tables and Dropping Tables.
  • Practicing DML commands- Insert, Select, Update, Delete.
  • Practicing Queries using ANY, ALL, IN, EXISTS, NOT EXISTS, UNION, INTERSECT, CONSTRAINTS etc.
  • Practicing Sub queries (Nested, Correlated) and Joins (Inner, Outer and Equi).
  • Practice Queries using COUNT, SUM, AVG, MAX, MIN, GROUP BY, HAVING, VIEWS Creation and Dropping.
  • Practicing on Triggers - creation of trigger, Insertion using trigger, Deletion using trigger, Updating using trigger.

Computer Network Lab [156502P]

Preform any ten Experiments:

  • Write a report that includes a diagram showing the topology, type of connection devices, and speed of the wired and wireless LAN in your organization. Also find out the MAC and IP addresses and the subnet mask of your computer.
  • Install and run a network diagnosis tool such as TCP dump or Wireshark. Start capturing packets on an active interface, open a browser and type the address of your favourite search engine. Wait till the page loads and stop capture. List out the type and number of each type of packets captured.
  • Write a program to create a server that listens to port 53 using stream sockets. Write a simple client program to connect to the server. Send a simple text message "Hello" from the client to the server and the server to the client and close the connection.
  • Write a program to create a chat server that listens to port 54 using stream sockets. Write a simple client program to connect to the server. Send multiple text messages from the client to the server and vice versa. When either party types "Bye", close the connection.
  • Write a program to create a server that listens to port 55 using stream sockets. Write a simple client program to connect to the server. The client should request for a text file and the server should return the file before terminating the connection.
  • Write a program to create a server that listens to port 56 using stream sockets. Write a simple client program to connect to the server. Run multiple clients that request the server for binary files. The server should service each client one after the other before terminating the connection.
  • Write a program to create a server that listens to port 57 using stream sockets. Write a simple client program to connect to the server. Run multiple clients that request the server for text files. The server should service all clients concurrently.
  • Write a program to create a server that listens to port 59 using datagram sockets. Write a simple client program that requests the server for a binary file. The server should service multiple clients concurrently and send the requested files in response.
  • Creation of sample network topologies using CISCO packet tracer.
  • Creation of a subnet, assignment of addresses and communication within and outside the subnet.
  • Error Detection using CRC (Python/Java): Implement the Cyclic Redundancy Check (CRC) algorithm for error detection in data transmission.
  • Hamming Code for Error Correction (Python/Java): Implement the Hamming Code algorithm to detect and correct single-bit errors in transmitted data.
  • Sliding Window Protocol (Python/Java): Simulate Stop-and-Wait and Go-Back-N ARQ protocols to demonstrate flow control in a network.
  • Selective Repeat ARQ (Python/Java): Implement the Selective Repeat ARQ protocol for reliable data transmission.
  • CSMA/CD and CSMA/CA Simulation (Python/Java): Simulate Carrier Sense Multiple Access with Collision Detection (CSMA/CD) and Collision Avoidance (CSMA/CA).
  • IPv4 and IPv6 Addressing (Python/Java): Implement a program to validate and classify IP addresses as IPv4 or IPv6.
  • ARP and RARP Implementation (Python/Java): Simulate Address Resolution Protocol (ARP) and Reverse Address Resolution Protocol (RARP).
  • BOOTP and DHCP Simulation (Python/Java): Implement the BOOTP and DHCP mechanisms for dynamic IP address allocation.
  • Routing Algorithms (Python/Java): Implement the Distance Vector Routing (DVR) and Link State Routing (LSR) algorithms.
  • TCP and UDP Simulation (Python/Java): Implement a client-server model to demonstrate TCP and UDP socket programming.
  • Congestion Control using Leaky Bucket Algorithm (Python/Java): Simulate the Leaky Bucket algorithm for congestion control.
  • Congestion Control using Token Bucket Algorithm (Python/Java): Implement the Token Bucket algorithm to regulate network traffic.
  • FTP and HTTP Simulation (Python/Java): Implement a program to simulate FTP file transfer and send HTTP GET/POST requests.
  • DNS Query Resolution (Python/Java): Write a program to perform DNS resolution and retrieve IP addresses for given domain names.
  • Email Client Simulation (Python/Java): Implement a basic email client that can send and receive messages using SMTP and POP3 protocols.
← BEU PYQ Home