Author Archives: Expert_Talk

Cisco Packet Tracer is a powerful network simulator that allows students to design various network topology and can experiment with network behavior. Packet Tracer provides simulation, visualization, authoring, assessment, and collaboration capabilities and facilitates the teaching and learning of complex technology concepts. Working on Cisco Packet Tracer involves creating and configuring network simulations. Here’s aContinue reading “Simulate Networks using Cisco Packet Tracer”

Directed graph G, also known as a digraph, is a graph in which every edge has a direction assigned to it. An edge of a directed graph is given as an ordered pair (u, v) of nodes in G. Adjacent nodes or neighbors –  For every edge, e = (u, v) that connects nodes uContinue reading “Basic Terminology used in Graphs.”

•Delete a node similar to a binary search tree. Deletion may disturb the balance factor of an AVL tree and therefore the tree needs to be rebalanced in order to maintain the AVLness. For this purpose, we need to perform rotations. There are two types of rotations L rotation and R rotation, L and RContinue reading “Deleting a Node in AVL Tree”

Perform standard BST insert. Let the newly inserted node be w. After insertion find BF (balance factor for each node in new tree) Starting from w, travel up and find the first unbalanced node. Let z be the first unbalanced node, y be the child of z that comes on the path from w toContinue reading “Adding a Node in AVL Tree”

Encoding, in computers, can be defined as the process of transmitting or storing sequence of characters efficiently. There are two types of encoding schemes Fixed-Length encoding – Every character is assigned a binary code using same number of bits. Thus, a string like “aabacdad” can require 64 bits (8 bytes) for storage or transmission, assumingContinue reading “Huffman Encoding”

Perform BST deletion and perform the following to ensure all properties of RB tree are still satisfied Understanding Double Black node In Red-Black Tree (RB tree) deletion, “double black” is a situation that can occur during the process of rebalancing the tree after removing a node. A double black node is a special condition thatContinue reading “RB Tree Deletion”

Question A computer sends a timestamp request to another computer. It receives the corresponding timestamp reply at 3:46:07 A.M. The values of the original timestamp, receive timestamp, and transmit timestamp are 13,560,000, 13,562,000, and 13,564,300, respectively. What is the sending trip time? What is the receiving trip time?What is the round-trip time? What is theContinue reading “Numerical Practice (ICMP Protocol)”

This following video discusses 8 questions on following topics Q. Correct expression of calculating length of UDP Q. An ICMP message has arrived…..What is IP Address of target router? Q. An ICMP message has arrived….. What is the type of the message? Q. UDP header format is represented…. What is the length of the data?Continue reading “Video – Practice Questions (UDP -ICMP)”

This following video discusses 10 questions on following topics Q. Protocol is IP and hardware is Ethernet …Find ARP packet size. Q. Sequence number and acknowledgement number field in segment header Q. An acknowledgement field in a segment Q. In User Datagram Protocol (UDP).. checksum calculation strategy Q. In TCP connection, ….. What is theContinue reading “Video – Practice Questions (UDP/ICMP/TCP)”

This following video discusses 4 questions on following topics Q. Bytes are delivered…. Find the sequence number of last segment? Q. Port address is corrupted…. What is the response of the TCP? Q. A client uses UDP to send data… Calculate efficiency Q. For given UDP header Find  -source port number/ destination port number/total lengthContinue reading “Video – Practice Questions (UDP -TCP)”