RTOS (43)
Bulnex (4)
Operating Systems General Concepts (1242)
Data Structures (2039)
IBM AIX (132)
MS-DOS (66)
Operating Systems AllOther (199) Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
1008an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
1042
Should I delete delivery optimization files?
Can I install 64 bit windows on my pc?
When is a system in a safe state?
What are sockets in linux?
What is bash command?
Is vmware an operating system?
Can kernel panic be fixed?
Tell me when should we use thread-safe "_r" library calls?
what do know about commands?
Define circular list?
What is a application error?
Can I use command prompt to repair windows 10?
What is a data structure node class?
How do I register a 32 bit dll file on windows 64 bit?
Who is trustedinstaller in windows 10?