Draw a binary Tree for the expression :
A * B - (C + D) * (P / Q)
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
Is heap sort stable?
Why do we need sorting?
What is basic data structure?
What is stack in data structure with the example?
What are different techniques for making hash function?
What is the space complexity of bubble sort?
What are the types of collection?
Differentiate among cycle, path, and circuit?
What is a b+ tree? Explain its uses.
What are basic algorithms?
How does arraylist size work?