Category Archives: Uncategorized

This following video discusses 7 questions on following topics Q. Determining the class of an IP address Q. Properties of block Addresses Q. Finding valid subnet mask?   Q. Statements on IP address? Q. Subnetworks in classfull addressing Q. classless addressing and prefix value Q. Number of subnets and hosts in block To practice theseContinue reading “Video – Practice Questions (IPv4 Addressing)”

Question Comment on the TCP segment in which the value of the control field is a. 000000 b. 000001 c. 010001 Solution: a. 000000 -This segment is part of a data transmission without piggybacked acknowledgment b. 000001 – This is a FIN segment request to terminate the connection. c. 010001 – This is a FIN+ACKContinue reading “Numerical Practice (TCP Protocol)”

Question A client has a packet of 69,900 bytes. Show how this packet can be transferred by using only one UDP user datagram. Solution: As the maximum size of IP packet is 65535 bytes. This cannot be transferred using a single user datagram. Question Does every UDP packet have a destination port? Solution The UDPContinue reading “Numerical Practice (UDP Protocol)”

Important points about Fragments To identify that datagram is fragmented or not look at( M bit, offset), M bit 1 and offset other than 0 means data gram is fragmented To identify that all fragments belongs to the same datagram look to Identification (ID field of all fragments are same To Identify the first fragment,Continue reading “Numerical Practice (IP Datagram & Fragmentation)”

Some important formula used for network configuration ( CLASSLESS) Question In a block of addresses, we know the IP address of one host is 182.44.82.16/26. What is the first address (network address) and the last address (limited broadcast address) in this block? Solution. Given IP Address => 182.44.82.16/26 Since the prefix is 26(8+8+8+2),therefore subnet maskContinue reading “Numerical Practise – (IPv4 Addressing)”

P-Type The P-type consists of those problems that are solvable in polynomial time, i.e. these problems can be solved in time O(nk) in worst-case, where k is constant. These problems are called tractable, while others are called intractable. NP-Type The NP-type consists of those problems that are verifiable in polynomial time. NP is the class of decision problems for which itContinue reading “P-NP type Problems”

String matching is a fundamental operation in computer science and information retrieval that involves identifying the presence of a particular sequence of characters within a larger body of text. This process is crucial in various applications, ranging from simple search operations to complex data analysis and pattern recognition. String matching plays a pivotal role inContinue reading “String Matching Algorithms”

Dynamic Programming  is  a general algorithm design technique for solving problems defined by or formulated as recurrences with overlapping sub instances. Invented by American mathematician Richard Bellman in the  1950s to solve optimization problems.  “Programming” here means “planning” Main idea: 1. set up a recurrence relating a solution to a larger instance  to solutions ofContinue reading “Dynamic Programming”

The shortest path problem is a classic problem in graph theory and network optimization. The goal is to find the shortest path between two specified nodes in a graph, where each edge has an associated numerical value called a weight or cost. There are different variations of the shortest path problem, but the most commonContinue reading “Shortest Path”

Lets develop good understanding of the basic of M-way /B-TREE. [Click the following links to watch the video] You are invited to raise queries by writing your question in the  box given below