Register

UGC NET CSE | June 2016 | Part 3 | Question: 31

• retagged by
7,149 views

1 Answer

Best answer
6 votes
6 votes
(2n)!/(n+1)!n!  different binary trees are possible with n nodes.

Given n=6

Number of trees = 12!/(7!x 6!) =132
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
4 answers
2
soujanyareddy13 asked May 10, 2021
1,354 views
UGC NET CSE | June 2016 | Part 3 | Question: 66
A perceptron has input weights $W_1=-3.9$ and $W_2=1.1$ with threshold value $T=0.3.$ What output does it give for the input $x_1=1.3$ and $x_2=2.2?$ $-2.65$ $-2.30$ $0$ $1$
A perceptron has input weights $W_1=-3.9$ and $W_2=1.1$ with threshold value $T=0.3.$ What output does it give for the input $x_1=1.3$ and $x_2=2.2?$$-2.65$$-2.30$$0$$1$
User Avatar
0 votes
0 votes
1 answer
3
soujanyareddy13 asked May 10, 2021
865 views
UGC NET CSE | June 2016 | Part 3 | Question: 75
A software program that infers and manipulates existing knowledge in order to generate new knowledge is known as: Data dictionary Reference mechanism Inference engine Control strategy
A software program that infers and manipulates existing knowledge in order to generate new knowledge is known as:Data dictionaryReference mechanismInference engineControl...
User Avatar
3 votes
3 votes
2 answers
4
go_editor asked Aug 21, 2016
3,319 views
UGC NET CSE | June 2016 | Part 3 | Question: 74
Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state 1 2 3 which of the following state cannot be reached? A 3 1 2 B 3 2 1 C 1 3 2 D 2 1 3
Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state 12 3which of the following state cann...
User Avatar
Link Copied!