Skip to main content

Data Structure – Technical interview questions


Write programs for Bubble Sort, Quick sort
Explain about the types of linked lists
How would you sort a linked list?
Write the programs for Linked List (Insertion and Deletion) operations?
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
When will you  sort an array of pointers to list elements, rather than sorting the elements themselves?
The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
Which sort show the best average behavior?
What is the average number of comparisons in a sequential search?
Which data structure is needed to convert infix notations to post fix notations?
What is a data structure?
What does abstract data type means?
How is it possible to insert different type of elements in stack?
Stack can be described as a pointer. Explain.
Write a Binary Search program
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.
Explain binary searching, Fibinocci search.
What do you mean by: Syntax Error, Logical Error, Runtime Error?
How can you correct these errors?
In which data structure, elements can be added or removed at either end, but not in the middle?
How will in order, preorder and post order traversals print the elements of a tree?
Parenthesis are never needed in prefix or postfix expressions. Why?
Which one is faster? A binary search of an ordered set of elements in an array or a sequential search of the elements.

Knowing all basic questions you can prepare these questions and can attend technical interviews confidently.
Hope these questions will help you getting your dream job!

Labels:

Popular posts from this blog

CIVIL SERVICES' (I.A.S.) EXAMINATION

The Union Public Service Commission (U.P.S.C.)  conducts Civil Services' Examination once a year in two stages. The Preliminary Examination (Objective Type) for selection of candidates for the Main Examination is held in the month of May. The Civil Services Main Examination  is held in the months of October/November. Blank application forms and other particulars are published in the Employment News, generally in the month of December. The last date for the submission of applications to the Secretary, Union Public Service Commission, Dholpur House, Shahjahan Road, NewDelhi-11001 1 is usually the last week of January of the year of examination. The Combined Civil Services Examination is conducted for Recruitment to the following Services/Posts: 1. Indian Administrative Service. 2. Indian Foreign Service. 3. Indian Police Service. 4. Indian P & T Accounts & Finance Service, Group 'A'. 5. Indian Audit and Accounts Service, Group 'A'. 6. Indian Customs and Centr
1 comment
Read more

Predict the output or error(s) for the following:

1 . void main(){ int const * p=5; printf("%d",++(*p)); } Answer: Compiler error: Cannot modify a constant value. Explanation: p is a pointer to a "constant integer". But we tried tochange the value of the "constant integer". 2. main() {  char s[ ]="man"; int i;  for(i=0;s[ i ];i++) printf("\n%c%c%c%c",s[i],*(s+i),*(i+s),i[s]); } Answer: mmmm aaaa nnnn Explanation: s[i], *(i+s), *(s+i), i[s] are all different ways of expressing the same idea. Generally array name is the base address for that array. Here s is the base address. i is the index number/displacement from the base address. So, indirecting it with * is same as s[i]. i[s] may be surprising. But in the case of C it is same as s[i]. 3 . main(){  float me = 1.1;  double you = 1.1;  if(me==you) printf("I love U"); else printf("I hate U"); } Answer: I hate U Explanation : For floating point numbers (float, double, long double)
Post a Comment
Read more

AGRICULTURAL SCIENTIST RECRUITMENT BOARD

Agricultural Research Service National   Eligibility  Test/ Senior Research Fellowship Examination  The Agricultural Scientists Recruitment Board (ASRB)  holds a Competitive Examination for recruiting Scientists of the ARS in the pay scale of Rs. 8,000-13,500 in the ICAR Institutes, combined with National Eligibility Test (NET) for recruitment of Lecturers and Assistant Professors by the State Agricultural Universities (SAUS) and for award of ICAR Senior Research Fellowships. The selected candidates for Agricultural Research Service must serve in the institutes to which they are posted until they find appointment for higher positions through selection at other institutes. (i) Candidates successful in ARS are appointed as Scientists in the Indian Council of Agricultural Research in the pay scale of Rs. 8,000-13,500. (ii) Candidates clearing the National Eligibility Test are recommended to various State Agricultural Universities who will consider them for appointment as Lecturers or A
Post a Comment
Read more