Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider an array A [1......n].It consists of...

Join the Discussion on the App

Consider an array A [1......n]. It consists of a permutation of numbers 1....n. Now compute another array B [1.....n] as follows:

a)
B will be a sorted array.
b)
B is a permutation of array A.
c)
Doing the same transformation twice will not give the same array.
d)
B is not a permutation of array A.
e)
None of the above.

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Test: Array & Linked List

Attempt Test

Attempt this Test

Verified Answer

Consider an array A [1......n].It consists of a permutation of numbers...

B is a permutation of array A

Infact, B gives the reverse index of all the elements of array A. Since the array A contains numbers [1..n] mapped to the locations [1...n] and A is a permutation of the numbers [1...n], the array B will also be a permutation of the numbers [1...n]. For example:

To see that option c is incorrect, let array C be the array attained from doing the same transformation twice, that is,

We can see that C = A, which makes option c incorrect.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

In a permutation a1.....an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of 1.....n with at most n inversions?

View answer

In a permutation a1.....an of n distinct integers, an inversion is a pair (ai, aj) such that i j and ai aj. What would be the worst case time complexity of theInsertion Sortalgorithm, if the inputs are restricted to permutations of 1.....n with at most n inversions?

View answer

In a permutation a1.....an of n distinct integers, an inversion is a pair (ai, aj) such that i j and ai aj. What would be the worst case time complexity of theInsertion Sortalgorithm, if the inputs are restricted to permutations of 1.....n with at most n inversions?

View answer

Consider the ordering relation a|bSNxNover natural numbers N such that a | b if there exists c belong to N such that a^ * c = b Then Oa, is an equivalence relation Ob. It is a total order Oc. (N.) is a lattice but not a complete lattice d. Every subset of N has an upper bound under |?

View answer

Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1, 2, ..., 100. There is an edge between vertices u and v if and only if the label of u can be obtained by swapping two adjacent numbers in the label of v. Let y denote the degree of a vertex in G, and z denote the number of connected components in G. Then y + 10z = _______ .Note -This was Numerical Type question.

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer?.

Solutions for Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider an array A [1......n].It consists of a permutation of numbers 1....n.Now compute another array B [1.....n]as follows:a)B will be a sorted array.b)B is a permutation of array A.c)Doing the same transformation twice will not give the same array.d)B is not a permutation of array A.e)None of the above.Correct answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam