Question
Consider a weighted complete graph G on the vertex set {v1,v2 ,v} such that the weight of the edge (v,v) is 2|i-j|. The weight of a minimum spanning tree of G is:
More IT Networking Questions
- Which is correct with respect to the size of the data types in C?
- The time required to delete a node x from a doubly linked list having n nodes is
- Which of the following are TCL commands
- Which data visualization technique is best suited for displaying hierarchical data with a tree-like structure?
- What is the main purpose of a digital signature in public key cryptography?
- The gain of an amplifier is defined as:
- A /24 network must be divided into subnets supporting at least 30 usable host addresses each. What is the maximum number of equal-size subnets possible?
- Which of the following is not a valid rule of XOR?
- Which of the following is a primary limitation of the COCOMO model?
- In the context of ADTs, what does "encapsulation" refer to?
Relevant for Exams:
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)