Chemical Engineering > GATE 2010 > Permutations and Combinations
Given digits 2. 2, 3, 3, 3 4, 4. 4. 4 how many distinct 4 digit numbers greater than 3000 can be formed?
A
50
B
51
C
52
D
54

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science