Q1: A set of LANS are linked using bridges to create the bridged network depicted by the figure bellow. The bridges communicate configuration BPDUS to build a spanning tree to prevent loops within the network. If all bridges start the spanning tree algorithm (all bridges are initialized), answer the following questions (assume that the circles in the figure are the bridges and the ID for each bridge is the number inside these circles. Also assume that the state of each bridge is changing in sequence according to the information in each question) вз B5 B1 B2 E B7 B6 B4 a) What is the initial configuration BPDU for B6? b) What is the configuration BPDU of B2 after receiving the initial configuration BPDU of B7? c) If B3 accepted B2 as the root, what is the configuration BPDU of B3? d) If B3 accepted B1 as the root through B5, what is the configuration BPDU of B3? e) Which bridge is the designated bridge of LAN C at this time? f) Now, if B7 accepted B1 as the root, what is the configuration BPDU of B2 after receiving the new configuration BPDU of B7? g) Which bridge is the designated bridge of LAN C at this time?

Q1: A set of LANS are linked using bridges to create the bridged network depicted by the figure bellow. The bridges communicate configuration BPDUS to build a spanning tree to prevent loops within the network. If all bridges start the spanning tree algorithm (all bridges are initialized), answer the following questions (assume that the circles in the figure are the bridges and the ID for each bridge is the number inside these circles. Also assume that the state of each bridge is changing in sequence according to the information in each question) вз B5 B1 B2 E B7 B6 B4 a) What is the initial configuration BPDU for B6? b) What is the configuration BPDU of B2 after receiving the initial configuration BPDU of B7? c) If B3 accepted B2 as the root, what is the configuration BPDU of B3? d) If B3 accepted B1 as the root through B5, what is the configuration BPDU of B3? e) Which bridge is the designated bridge of LAN C at this time? f) Now, if B7 accepted B1 as the root, what is the configuration BPDU of B2 after receiving the new configuration BPDU of B7? g) Which bridge is the designated bridge of LAN C at this time?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

THIS IS MY CODE HELP ME ACHIEVE POINTS OUTLINED BELOW : #include <stdio.h>#include <stdlib.h>#include <string.h>#include <float.h>#include "graph.h"#include "dijkstra.h" #define INFINITY DBL_MAX /* find shortest paths between source node id and all other nodes in graph. *//* upon success, returns an array containing a table of shortest paths. *//* return NULL if *graph is uninitialised or an error occurs. *//* each entry of the table array should be a Path *//* structure containing the path information for the shortest path between *//* the source node and every node in the graph. If no path exists to a *//* particular desination node, then next should be set to -1 and weight *//* to DBL_MAX in the Path structure for this node */Path *dijkstra(Graph *graph, int id, int *pnEntries){ int n; int i, j; int* nv = get_vertices(graph, &n); int *S = malloc(n * sizeof(int)); double *D = malloc(n * sizeof(double)); int *R = malloc(n…
JavaScript The jQuery "post" method that we used in this course to enable "round-trip" dialog with the node.js server has the form: $.post("/", x, y); Describe the type and purpose of the x and y parameters.
Provide full C++ code for main.cpp, playlist.h and playlist.cpp Building a playlist (of songs) using a linked list and making some operations such as adding songs, removing songs, shuffling them, etc. (Some parts of this lab will closely follow lab 08 - it is imperative that you complete that lab before working on this project). A Node representing a song has the following data members (similar to struct Node of lab 08, except it doesn't have one member for storing data): string uniqueID string songName string artistName int songLength Node* nextNodePtr Your code must have the following three files: Playlist.h - Class declaration for a linked list of Nodes (very similar to lab 08 but with some changes to methods, as described below) with following private data members: private:Node* first;Node* last;int size; Playlist.cpp - Class definition main.cpp - main() function Checkpoint A For checkpoint A, you need to build a playlist (of songs) by readings data members of several songs…
Exercise 2 Given the following function to update a node in a standard linked list:public boolean update(Node head, int oldValue, int newValue){if (head == null)return false;while (head != null)if (head.data == oldValue){head.data = newValue;return true;}elsehead = head.next;return false;}There may be an error with the code. Answer the following:1) Design your own linked list of 4 nodes with different values2) If the code has an error, describe the issue and provide an example of calling theupdate function with values of your choice and show what the linked list looks likea. Also, show the code changes you would make to fix the error3) If the code does not have an error, provide an example of calling the update functionwith values of your choice and show what the linked list looks likeFor example, if your linked list was 1 -> 2 -> 3 -> 4, and you think there is an error withthis code, you could say something like “the problem with the code is xxx and after callingupdate(3, 5),…
8.3.2: HashMap with enhanced for loop. Declare variable scoreToGrade as a HashMap with Character key type and Double value type, representing a grade and the minimum score of the grade. Read integer numToRead from input. Then read numToRead key-value pairs from input and insert each into scoreToGrade. If the key already exists, replace the key's existing value with the new value. Ex: If the input is: 3 D 60.0 A 89.0 A 90.5 then one possible output is: Key: D, Value: 60.0 Key: A, Value: 90.5 Note: The order of the keys is not guaranteed in a HashMap. import java.util.Scanner;import java.util.HashMap; public class GradeScale {public static void main(String[] args) {Scanner scnr = new Scanner(System.in);char assignedGrade;double minScore;int numToRead;int i;/* Any variable declarations go here */ /* Your code goes here */ // For each key in the HashMap, retrieve the value associated with the keyfor (Character key : scoreToGrade.keySet()) {System.out.println("Key: " + key + ",…
1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
Java Simulate the behavior of a hash map. Assume the following: the hash table array has an initial capacity of 10 the hash table uses separate chaining to resolve collisions and adds new values at the beginning of the linked list. the hash function returns the absolute value of the integer key, mod the capacity of the hash table rehashing occurs at the end of an add where the load factor is ≥ 0.5 and doubles the capacity of the hash table Fill in the diagram to show the final state of the hash table after the following operations are performed. Write each bucket as key:value pairs with arrows between them, such as key1:value1 -> key2:value2 -> key3:value3 . Put a \ in the box if an array element is unused. Also write the size, capacity, and load factor of the final hash table. Write the load factor in 0.x format, such as 0.5 or 0.75. hashTable[ 0 ] : _____ hashTable[ 1 ] hashTable[ 2 ] hashTable[ 3 ] hashTable[ 4 ] hashTable[ 5 ] hashTable[ 6 ] hashTable[ 7 ] hashTable[ 8 ]…
09.Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link list looks like 1 -> 3 -> 4 ^ | |____|
Assume you implemented ADT LinkedStack where the top of the stack is the last node in the chain of nodes. Explain how to define the following methods without traversing. (a) pop (b) peek
90. A bridge can use the _________ algorithm to create a loopless topology. a. binary tree b. spanning tree c. multiway tree d. none of the above
E) Create a symbolical link /home/ec2-user/H/H1/C/c2 to the file /home/ec2-user/G/G1/c2 F) Use the tree -pf utility to show the contents and permissions of F, G and H. If you don’t have the utility loaded, load the tree package using yum install tree.
int F(node<int>&p){int c=0; while(p!=0){p=p->next; c++; } return c;} This function is a. return the number of items in the linked list b. return the number of items in a linked list and destroy the linked list c. None of these d. destroy the list and free all allocated nodes