We are given a set of n distinct elements and an unlabeled binary tree with n nodes In how many

Gate Question Papers:

Gate Select Another Category Select Another Topic

Exam

Gate Question Topics

Verbal Ability (13)

Advertisements

Previous Question: Four matrices M1, M2, M3 and M4 are dimensions p Ã— q, q Ã— r, r Ã— s and s Ã— t respectively can be multiplied in several ways with different number of total scalar multiplications. For example When multiplied as (( ) ( )) 1 2 3 4 M Ã—M Ã— M Ã—M the total number of scalar multiplications is pqr+rst+prt. When multiplied as ((( ) ) ) 1 2 3 4 M Ã—M Ã—M Ã—M , the total number of scalar multiplications is pqr+prs+pst. If p=10, q=100, r=20, s=5 and t=80, then the minimum number of scalar multiplications needed is?? Next Question: A deck of 5 cards (each carrying a distinct number from 1 to 5) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected with the number on the first card being one higher than the number on the second card?

(#M40021715) GATE question MATHS Keep an EYE

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?: Asked In Gate MAN (11 years ago); Unsolved Read Solution (1); Is this Puzzle helpful? (6) (0) Submit Your Solution

Dimple

India

Punjab

Time: 00:01:33

Points

Six is a number perfect in itself, and not because God created the world in six days; rather the contrary is true. God created the world in six days because this number is perfect, and it would remain perfect, even if the work of the six days did not exis

Saint Augustine of Hippo

Mathematics is the handwriting on the human consciousness of the very Spirit of Life itself.

Claude Bragdon

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: We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search

Gate Question Papers:

Exam

Gate Question Topics

Category (172)

General Ability (20)

HR Interview (166)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

(#M40021715) GATE question MATHS Keep an EYE

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?

Sponsored Links

Challenger of the Day

Maths Quotes

Placed User Comments

Site Links

Useful Info

Placement papers