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 ].
1039
Explain the ways to infect the system by virus?
Local zone in shutting down state.how to bring state of zone to installed?
How do I install windows defender on windows 10?
How do I start linux?
Can you explain a little bit about command substitution?
What is hardware management console?
What is sorting with example?
Where is the start button on a keyboard?
Can you sort a hashmap?
Do you need antivirus software with windows 10?
What does stack top do?
How do I run a file in linux?
Which type of application can be run on linux?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
How to uninstall programs in windows xp?