In Data Structure, write output of given program.
- 0 Answers
- 493 Views
- HPCL, Hughes Systique Corporation, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Define indegree of a graph?
Why would we use dynamically allocated arrays vs vectors?
create an singly linked lists and reverse the lists by interchanging the links and not the data?
What is sequential search?
What is the difference between arraylist and array?
How do treesets work internally?
What is faster array or arraylist?
Explain the Linked List
Which interfaces are implemented by abstractqueue?
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.
Define non-linear data structures?
What is the time complexity of arraylist and linked list?
Windows 
