Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


What is dangling pointer and how to avoid it?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

Write any two principles of gradation of structures.

0 Answers   Mahatma Gandhi University,


What is data structure? Explain.

0 Answers  


Does hashset maintain order?

0 Answers  


Can we give size to arraylist?

0 Answers  


Mention some drawbacks of the linked list.

0 Answers  


Differentiate among cycle, path, and circuit?

0 Answers  


What is a data structure node class?

0 Answers  


I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.

3 Answers  


What is the need of sorting?

0 Answers  


Define separate chaining?

0 Answers  


How will you reverse Linked List.

0 Answers  


Explain the term run-time stack?

0 Answers  


Categories