What is the difference between static and dynamic data?
No Answer is Posted For this Question
Be the First to Post Answer
Explain the internal working of a hash map?
How do you find a string is anagram or not?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What is the difference between the hash table and hash map?
What is array indexing?
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.
What is the time complexity of arraylist and linked list?
What is vector and types of vector?
What is difference between tree and forest?
Why is merge sort faster?
Differentiate between iterator and enumeration.
Define circular list?