What is linear searching?
Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location.
Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.
Define the ADT for stack. Show the implementation of the stack data structure using linked list.
What is a priority queue ?
Briefly differentiate between CDMA and GSM technologies.
What operations can be performed on Queues?
Why Required of ISO 9001:2000 standard?
