Tip 1 : Do at least some project work.
Tip 2 : Practice at least 250 questions.
Tip 1 : Put some projects on resume.
Tip 2 : Do not put false things on resume.
1. Explain your final year project
2. What is grey hole attack?
3. What is semaphore?
4. What is mutex?
5. Difference between mutex and semaphore.
6. What is virtual memory?
7. Difference between thread and process.
8. Write a program to implement semaphore
What is SSH, SSL, SDN ?
Difference between TCP and UDP ?
What is virtual, physical memory?
What is critical section?
1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
You need to modify the given tree only. You are not allowed to create a new tree.
For the given binary search tree
11 will be replaced by {15 + 29 + 35 + 40}, i.e. 119.
2 will be replaced by {7 + 11 + 15 + 29 + 35 + 40}, i.e. 137.
29 will be replaced by {35 + 40}, i.e. 75.
1 will be replaced by {2 + 7 + 11 + 15 + 29 + 35 + 40}, i.e. 139.
7 will be replaced by {11 + 15 + 29 + 35 + 40}, i.e. 130.
15 will be replaced by {15 + 29 + 35 + 40}, i.e. 104.
40 will be replaced by 0 {as there is no node with a value greater than 40}.
35 will be replaced by {40}, i.e. 40.
What is deadlock?
What is segmentation fault?
What is page fault?
What is exception?
What will be stored in data section, heap, stack in memory?
What are application of stacks?
What is TTL in ipv4 and its uses?
What is priority inversion?
What is priority inheritance?
What is normalisation and denormalisation
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?