# Basic CS [3i Infotech Placement]: Sample Questions 205 - 207 of 243

Glide to success with Doorsteptutor material for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

## Question 205

Basic CS

### Explanation

- The function of packet assembler and disassembler (PAD) is described in a document known as X. 3.
- The standard protocol defined between the terminal and PAD is called X. 28;
- Another protocol exists between PAD and the network called X. 29.
- These three recommendations are often called “triple X” .
- Used to connect a dumb terminal to X. 25 network.

## Question 206

Basic CS

Edit

### Write in Short

Short Answer▾What is Minimum number of queues needed to implement the priority queue?

### Explanation

- 2 queues would be needed.
- One queue stores the data and creates one more queue.
- The second queue stores the priority in place of data- priority the program would check and process.

## Question 207

Basic CS

Edit

### Describe in Detail

Essay▾Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

### Explanation

- No, the minimum spanning tree is not guaranteed to give the shortest distance between any 2 specified nodes.
- By definition the min spanning tree doesn՚t have redundant connections and hence no shortcuts which the full graph might have.

**Minimum spanning Tree**:

- A subset of the edges of a connected graph.
- A graph can have many spanning trees.
- Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees- with cost defined as weight of vertices
- Graph can have many minimum spanning trees.
- Direct application in the design of networks.
- Used in algorithms-
- Approximating the travelling salesman problem
- Multi-terminal minimum cut problem
- Minimum-cost weighted perfect matching