Scribd
Upload
60 views1 page

Telephonic Interview Questions

The document discusses several data structures and object-oriented programming concepts including polymorphism, encapsulation, abstraction, inheritance, interfaces, HashMaps, priority queues, linked lists, binary trees, binary search trees, tree traversals, and implementing queues and stacks using each other's underlying structures. It asks questions about the differences between various concepts, how certain data structures work internally, and time complexities of common operations.

Uploaded by

Rahul Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views1 page

Telephonic Interview Questions

The document discusses several data structures and object-oriented programming concepts including polymorphism, encapsulation, abstraction, inheritance, interfaces, HashMaps, priority queues, linked lists, binary trees, binary search trees, tree traversals, and implementing queues and stacks using each other's underlying structures. It asks questions about the differences between various concepts, how certain data structures work internally, and time complexities of common operations.

Uploaded by

Rahul Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1. What is polymorphism OOPS?

Dynamic /static good

Encapsulation good and abstraction

2. what is the difference between abstraction class and interfaces?

3. Multi-level inheritance and multiple inheritance?

4. Can you tell me about how HashMap works internally? Can we store a duplicate key in HashMap?

Default method with same signature can be accessed by I2.super.MethodName();

I2 – interface

5. Upcasting of reference variable in java (instanceOf Operator) / DownCasting

what is a priority queue?

7. Given a sorted integer array and a value K. find two elements from given array

whose sum will be equal to K

8. Given pointer to the head node of a linked list, the task is to reverse the
linked list. We need to reverse the list by changing the links between nodes.
9. What are Binary trees? what is a binary search tree? Difference between
tree and binary search tree? Time complexity of BST Operations = O(logn)
9. BFS traversal of tree
10. Depth First Traversals
Inorder Traversal (Left-Root-Right)
Preorder Traversal (Root-Left-Right)
Postorder Traversal (Left-Right-Root)

11. How to implement a queue using stack?


How do you implement stack using queues?

You might also like