an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).

873

Is python good for freshers?

939

What is variable size arrays?and why we use it?

981

In which matrix, we can use multilinked structures?

848

Do all declaration statements result in a fixed reservation in memory?

879

How is a hashset implemented?

887

What is difference between set and map?

928

Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?

870

You want to insert a new item in a binary search tree. How would you do it?

872

How do you find the depth of a binary tree?

930

Is array faster than arraylist?

914

What are different techniques for making hash function? Explain with example.

976

Can arraylist contain duplicates?

810

Can arraylist be empty?

836

What is peek in stack?

887