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.
937an 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 ].
980
Is 1tb a lot of storage?
What is meant by sticky bit?
Is collection a class or interface?
How can I check the exit status of my previous command in Linux operating system?
How do I turn off programs running in the background?
List out the applications of a linked list?
What is stable sort example?
How do I restore my desktop icons from itunes?
Why is arraylist not thread safe?
Is it ok to delete downloaded program files?
Is hashmap a collection?
How do I restore windows 7 without a disk?
What is medium term scheduling in operating system (os)?
Which is the parent class of linkedhashset class?
How do I install windows live mail on windows 10?