# Graph Theory-Connectivity (GATE Computer Science): Questions 1 - 7 of 7

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

## Question number: 1

» Graph Theory » Connectivity

MCQ▾

### Question

The graph K 3, 4 has ________ edges

### Choices

Choice (4) Response

a.

4 edges

b.

3 edges

c.

12 edges

d.

7 edges

## Question number: 2

» Graph Theory » Connectivity

MCQ▾

### Question

What will be output if you will compile and execute the following c code?

1. `void main()`
2. `{`
3. `    printf("%s","c" "question" "bank");`
4. `}`

### Choices

Choice (4) Response

a.

bank

b.

c

c.

c question bank

d.

All of the above

## Question number: 3

» Graph Theory » Connectivity

MCQ▾

### Question

< question-text > Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

1) 2 phase locking.

2). Time- stamp ordering

### Choices

Choice (4) Response

a.

1 only

b.

2 only

c.

None of the above

d.

All of the above

## Question number: 4

» Graph Theory » Connectivity

MCQ▾

### Question

An example of a universal building block is

### Choices

Choice (4) Response

a.

OR Gate

b.

NOR Gate

c.

EX-OR Gate

d.

AND Gate

## Question number: 5

» Graph Theory » Connectivity

MCQ▾

### Question

Data security threats include

### Choices

Choice (4) Response

a.

privacy invasion

b.

hardware failure

c.

fraudulent manipulation of data

d.

encryption and decryption

## Question number: 6

» Graph Theory » Connectivity

MCQ▾

The ATM cell is

### Choices

Choice (4) Response

a.

48 bytes long

b.

69 bytes long

c.

64 bytes long

d.

53 bytes long

## Question number: 7

» Graph Theory » Connectivity

MCQ▾

### Question

The number of edges in a complete graph of n vertices is

### Choices

Choice (4) Response

a.

n2/n

b.

n

c.

b > n (n-1) /2

d.

All of the above

f Page