GeekInterview.com
  I am new, Sign me up!
 

Data Structures Interview Questions


Data Structures Interview Questions

Questions: 209
Comments: 392
 Data Structures Tags
 Showing Questions 1-10 of 210 Questions
[1] 2 3 4 5 6 7 8 9 10 Next >>
 Sponsored Links

 
 Data Structures Interview Questions
Sorting Options :  

What is the time complexity of adding three matrices of size NXN cell-by-cell? 
Latest Answer: The number of elements to be added is calculated in this way;Total Number of Elements to be added  = No. of pairs of matrix * ( no. of elements in each matrix)for 3 matrix; it would come to ; total number of operations required = (n*n) * 2 ( as there ...

To represent hierarchical relationship between elements, which data structure is not suitable?a. Dequeb. Priorityc. Treed. All of above 
Latest Answer: Only tree has the notion of parent child relationship, other data structures listed here do not have that. ...

Which of the following data structure is linear type?a. Stringsb. Listsc. Queuesd. All of above 

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.a. Input-restricted dequeb. Output-restricted dequec. Priority queuesd. None of above 

Which data structure allows deleting data elements from front and inserting at rear?a. Stacksb. Queuesc. Dequesd. Binary search tree 

Write a program of Linked List using pointers. 
View Question | Asked by : karyampudi

What is forest data structure? How is it useful? 

Which data structure is used for inserting and deleting dynamically? 
Latest Answer: Dynamic insertion and deletion works well with Lists (like a doubly linked list)(also mentioned in the previous answer)The problem gets incremented this way;Insertion at a particular location; should be started first with a search for the the right ...

How a value can be accessed through an address?How pointers can be used a funtions? 
Latest Answer: A value can be accesed through its address by use of pointers..Assigning any element as int x=10;int *p=&x;assigns the address of 'x' to pointer 'p'A pointer can be used as a function by using it as int (*p) (int, int){/// Function ...

Make a middle node of doubly link list to the top of the list.  
Latest Answer: node *n1,*n2;n1 = n2 = head;while((n2->next) && (n2->next->next)){     n1 = n1->next;     n2 = n2->next->next;]// n1 points to the middle nown1->prev->next = n1->next;n1->next->prev ...
Read Answers (3) | Asked by : shivi10j

View page [1] 2 3 4 5 6 7 8 9 10 Next >>

Ask A Question
Go Top
 Sponsored Links

 
Sponsored Links

 
Ask Question
You must login to Ask Question or Register your free account

Category:

 
Question Title:


Question in Detail:

Add this to my Subscribed Questions (?)
Send me email when new answer is posted (?)

 
Expert Members
Subscribe
Get Latest Updates Via RSS Reader or by Email
 Forum Discussion Subscribe to Forum Discussions Via E-Mail Latest Forum Discussions Subscribers
 Knowledge Base Subscribe to Knowledge Base Series Via E-Mail Knowledge Base Subscribers
 Learning Series Subscribe to GeekInterview Learning Series Via EMail Learning Series Subscribers
 Freelance Jobs Subscribe to GeekInterview Freelance Jobs Via EMail Latest Freelance Jobs Subscribers
 GeekInterview Blog Subscribe to GeekInterview Blog Via EMail GeekInterview Blog Subscribers
 Testing Interview Questions Subscribe to Testing Interview Questions Via EMail Testing Interview Questions Subscribers
 Oracle Interview Questions Subscribe to Oracle Interview Questions Via EMail Oracle Interview Questions Subscribers
 Java Interview Questions Subscribe to Java Interview Questions Via EMail Java Interview Questions Subscribers
 Latest Placement Papers Subscribe to Latest Placement Papers Placement Papers Subscribers
 Free Training Subscribe to Free Training Via EMail Free Training Subscribers
 Learn AJAX Subscribe to AJAXwith.com Via EMail AJAXwith Subscribers
About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2010 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape