RTOS (43)
Bulnex (4)
Operating Systems General Concepts (1242)
Data Structures (2039)
IBM AIX (132)
MS-DOS (66)
Operating Systems AllOther (199) Sorting is not possible by using which of the following methods? (a) Insertion (b) Selection (c) Exchange (d) Deletion
1 1445In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
1 2063Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
1020There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
1 1985In the given binary tree, using array you can store the node 4 at which location? 1 2 3 - - 4 - - 5
1 1276What are the types of Collision Resolution Techniques and the methods used in each of the type?
1 1664
How do I know if my cpu is overheating?
Is it possible to create new a file system in UNIX?
Explain latency, transfer and seek time with respect to disk i/o.?
How to make a new directory in unix?
What is glibc linux?
How do I know chkdsk is finished?
Explain multiply linked list in short.
What is the meaning of Thread Priority?
What is lilo how is it useful in linux?
Which is better hashmap or treemap?
Why is my windows 10 computer so slow?
How do I find cpu in linux?
What is a .lib file?
What is unix and its features?
How to use appendNode() in linkedlist()?