1)What is GUI?
GUI is short for Graphical User Interface. It provides users with an interface wherein actions can be performed by interacting with icons and graphical symbols. People find it easier to interact with the computer when in a GUI especially when using the mouse. Instead of having to remember and type commands, users click on buttons to perform a process.
2) What are the various operations that can be performed on different Data Structures?
Insertion ? Add a new data item in the given collection of data items.
Deletion ? Delete an existing data item from the given collection of data items.
Traversal ? Access each data item exactly once so that it can be processed.
Searching ? Find out the location of the data item if it exists in the given collection of data items.
Sorting ? Arranging the data items in some order i.e. in ascending or descending order in case of numerical data and in dictionary order in case of alphanumeric data.
3) What is data redundancy?
Data redundancy is the repetition or superfluity of data. Data redundancy data is an common issue in computer data storage and database systems. Data redundancy definition. Data redundancy in database means that some data fields are repeated in the database.
4) Who invented C Programming?
5) What are the advantages of a multiprocessor system?
With an increased number of processors, there is a considerable increase in throughput. It can also save more money because they can share resources. Finally, overall reliability is increased as well.
6) What are overlays?
Overlays are used to enable a process to be larger than the amount of memory allocated to it. The basic idea of this is that only instructions and data that are needed at any given time are kept in memory.
7) What is Stack?
Stack is an ordered list in which, insertion and deletion can be performed only at one end that is called the top. It is a recursive data structure having pointer to its top element. The stack is sometimes called as Last-In-First-Out (LIFO) list i.e. the element which is inserted first in the stack will be deleted last from the stack.
8) What is the minimum number of queues that can be used to implement a priority queue?
Two queues are needed. One queue is used to store the data elements, and another is used for storing priorities.
9) What are the advantages of Selecetion Sort?
It is simple and easy to implement.
It can be used for small data sets.
It is 60 per cent more efficient than bubble sort.
10) Differentiate among cycle, path, and circuit?
Path: A Path is the sequence of adjacent vertices connected by the edges with no restrictions.
Cycle: A Cycle can be defined as the closed path where the initial vertex is identical to the end vertex. Any vertex in the path can not be visited twice
Circuit: A Circuit can be defined as the closed path where the intial vertex is identical to the end vertex. Any vertex may be repeated.