GATE | CS | 2003 | Algorithms | Sorting | Question 4 (original) (raw)

• Courses

• Tutorials

• Interview Prep

• DSA

• Practice Problems

• C

• C++

• Java

• Python

• JavaScript

• Data Science

• Machine Learning

• Courses

• Linux

• DevOps

Last Updated :

Discuss

Comments

Let A be a sequence of 8 distinct integers sorted in ascending order. How many distinct pairs of sequences, B and C are there such that (i) each is sorted in ascending order, (ii) B has 5 and C has 3 elements, and (iii) the result of merging B and C gives A?

256

56

30

2

This question is part of this quiz :

Combinatorics,GATE-CS-2003,Algorithms GATE CS PYQ Quiz,

Searching & Sorting GATE CS PYQ Quiz

Tags:

Engineering Mathematics Questions

GATE

Algorithms

GATE CS

Share your thoughts in the comments

GeeksforGeeks