Let G be a complete undirected graph on 6 vertices If vertices of G are labeled then the number of

Gate Question Papers:

Gate Select Another Category Select Another Topic

Exam

Gate Question Topics

Category (172)

General Ability (20)

General Knowledge(5)

HR Interview (166)

Interview(7)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

Advertisements

Previous Question: Suppose a circular queue of capacity ( n-1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are option (A) full: (REAR+1) mod n == FRONT empty: REAR == FRONT (B) full: (REAR+1) mod n == FRONT empty: (FRONT+1) mod n == REAR (C) full: REAR == FRONT empty: (REAR+1) mod n == FRONT (D) full: (FRONT+1) mod n == REAR empty: REAR == FRONT Next Question: A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is (A) 3 KBytes (B) 35 KBytes (C) 280 KBytes (D) dependent on the size of the disk

(#M40029659) GATE question GATE-CS Keep an EYE

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to

option
(A) 15
(B) 30
(C) 90
(D) 360: Asked In Gate Rats (11 years ago); Unsolved; Is this Puzzle helpful? (6) (2) Submit Your Solution

Dimple

India

Punjab

Time: 00:01:33

Points

Maths Quotes

maths is very interesting subject if u like it math also like u if u dont like maths dont like u

Aman Tiwari

A MAN IS LIKE A FRACTION WHOSE NUMERATOR IS WHAT HE IS AND WHOSE DENOMINATOR IS WHAT HE THINK ABOUT HIMSELF LARGER THE DENOMINATOR SMALLER THE FRACTION

UNKNOWN

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 4 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 5 years ago

Latest Gate Aptitude Question SOLUTION: Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to option (A) 15 (B) 30 (C) 90 (