GeeksforGeeks

How would you implement the Unix fork() system call. What are the data structures involved in this process?

Hi,

Came across ur forum and liked the explanations for various topics.

I have never understood the O notation and the way its calculated.

Even in the DS linked list and other searching/sorting i understand the logic but not how the time and space complexity is calculated.(and that tends to answer just half of the question in interviews.. :( )

Please give me ptrs for detailed explanation or link if this forum has already discussed the same.

TIA,
Karthe...

Implement your own hash map from scratch. Make it thread safe.

Code your own implementation of Doubly linkedlists, Binary Tree

Implement an ADT for a buffer in a text editor. It should support the following operations:
* insert(c): insert character c at cursor
* delete(): delete and return the character at the cursor
* left(): move the cursor one position to the left
* right(): move the cursor one position to the right
* get(i): return the ith character in the buffer

You have an array of 1 million integers, there is at most one 5 in the array. Write code to find the index of 5, or return -1 if there is no 5. The array can be put into main memory.

There is a large text file, and every line of which is a single word. How to write a C++ function that takes this file as input and returns the words which only occurs once.