Tip 1 : Practice maximum question
Tip 2 : dry run all code
Tip 1 : Do not put false things on resume
Tip 2 : make short resume
Conversion method in which users, being used to an old system, continue to use the old system, along with the new system, is
The records in a file on magnetic tape
If a process fails, most operating system write the error information to a ______
The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?
first read complete statement of problem, First i did in-order traversal, doing in-order traversal, while doing previously visited node in a variable, For every visited node, make it next to the previous and set previous of this node as previous.
I was given code on python threading concept.
I used threading.main_thread() function to get the main thread object. but i exactly didn't remember how to use correctly so this question didn't go well.
I did first Traverse the whole Linked List and keeping the node’s data into the stack and did pop to element to out of stack and update doubly linked list. but i faced time complexity error and i did much struggle to solve this
Tell me about yourself.
In five years, where do you see yourself?