Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

KPIT Data Structures Interview Questions
Questions Answers Views Company eMail

1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

5 17198

Post New KPIT Data Structures Interview Questions


KPIT Data Structures Interview Questions


Un-Answered Questions

Explain how to find occurrence of mu and pe fields in a file?

505


In how many ways we can retrieve the data in the result set of mysql using php?

499


What are the popular frameworks in php?

530


Difference between weblogic and websphere?

470


How to Access HKEY_LOCAL_MACHINE under NT without Admin?

1288






If you want to use the same piece of code in different jobs, how will you achieve it?

644


What are functions in the sql server?

609


What is meant by Laravel - Hashing ?

851


how report can be generated if we have the database designed in oracle 10g?

1458


explain the output of the lexical analyser is

2742


What is a trend line?

326


how to convert numeric values to character strings? : Sql dba

571


How do I restore my bottom toolbar?

492


How do I navigate in cmd?

543


Does .net support python?

446