Time Left - 08:00 mins

# ECIL GET 2018 Recruitment: Subject Test-3 (DS)

Attempt now to get your rank among 632 students!

Question 1

What is the value of F(4) using the following procedure:

Question 2

How many edges are there in a forest with v vertices and k components?

Question 3

The best data structure to check whether an arithmetic expression has balanced parentheses is a

Question 4

The maximum number of binary trees that can be formed with three unlabeled nodes is:

Question 5

Which one of the following is not correct about recursion?

Question 6

What is the minimum number of stacks of size n required to implement a queue of size n?

Question 7

Which of the following are equivalent to the statement?

Question 8

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

Question 9

How many minimum spanning trees does the following graph have?

Question 10

Which of the following programming language(s) provides garbage collection automatically

- 632 attempts
- 5 upvotes
- 19 comments

Dec 21GATE & PSU CS

Posted by: