Latest DATA STRUCTURE Aptitude Question SOLUTION: Can someone please tell some real time examples of insertion,heap,quick,merge,selection sort?

Follow Quotesrain

DATA STRUCTURE Question Papers:

DATA STRUCTURE Select Another Category Technical Select Another Topic

Programming and Technical

DATA STRUCTURE Question Topics

Logical Reasoning (3)

Programming (63)

Advertisements

Previous Question: Q.Two dimensional array elements are stored a. System dependent b. In Row major dependent c. Compiler dependent d. In column major dependent Next Question: Imagine that two divisions of the Pandava army are camped outside an enemy camp of Kauravas commanded by Bhishma. Each division is commanded by its own general; Saatyaki and Yudhishtra. The two generals can communicate with one another only by messengers, who might get caught by the Kauravas. After observing the Kaurava camp, Saatyaki and Yudhistra must each decide independently whether to attack the Kauravas or not. Then they must each communicate their plan to the other through messengers. Upon receiving a message from the other, both Saatyaki and Yudhistra must decide a common plan of action. The Pandavas can succeed only when both Saatyaki and Yudhishtra attack the Kaurava camp at the same time.

(#M40153331) DATA STRUCTURE Programming question sorting real time examples Keep an EYE

Can someone please tell some real time examples of insertion,heap,quick,merge,selection sort?: Asked In DATA STRUCTURE sanj (8 years ago); Unsolved Read Solution (1); Is this Puzzle helpful? (0) (3) Submit Your Solution Technical

Advertisements

Read Solution (1) :

Please Login to Read Solution.

Previous Question: Q.Two dimensional array elements are stored a. System dependent b. In Row major dependent c. Compiler dependent d. In column major dependent Next Question: Imagine that two divisions of the Pandava army are camped outside an enemy camp of Kauravas commanded by Bhishma. Each division is commanded by its own general; Saatyaki and Yudhishtra. The two generals can communicate with one another only by messengers, who might get caught by the Kauravas. After observing the Kaurava camp, Saatyaki and Yudhistra must each decide independently whether to attack the Kauravas or not. Then they must each communicate their plan to the other through messengers. Upon receiving a message from the other, both Saatyaki and Yudhistra must decide a common plan of action. The Pandavas can succeed only when both Saatyaki and Yudhishtra attack the Kaurava camp at the same time.

Login
Register

Sponsored Links

Advertisements

Challenger of the Day

no image

Dimple

India

Punjab

Time: 00:01:33

Points

19

Maths Quotes

If a problem arise in your mind take help your best friend "mathematics.

yash singh

If human invention is the tree bearing juicy fruits, Maths is the root of this tree!

srishti dhameja

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

2511K+Registerd user
1758K+Engineers
753K+MBA Asprirant
3K+Enginnering College
250+Company Exam
150K+Interview Questions

All rights are reserved to @m4maths.com