| Row- Column Transformation |
1 |
250 |
Numbers | Puzzles |
|
| Eating Cakes |
2 |
209 |
Game Theory |
|
| Knock Out Tournament |
1 |
192 |
Mathematical | Puzzles |
|
| Crazy Malvika discovers Crazy Fibonacci function |
0 |
127 |
Fibonacci |
|
| Why there is no recursion in Fortran? |
1 |
670 |
Recursion |
Cisco |
| Maximum Length of necklace |
0 |
238 |
Combinatorial | Recursion |
|
| Upper Lower Combination of String |
2 |
195 |
Recursion | Strings |
|
| Arrange the disks |
4 |
386 |
Algorithms | Data Structures | Greedy |
|
| Write a function, given the number of stories in the building and calculates the number of different apartment combinations |
0 |
135 |
Algorithms |
|
| Compiler Design |
3 |
166 |
compiler |
|
| How many Lockers will be Open at the End? |
9 |
318 |
Arrays | Mathematical |
|
| How could you arrange 'N' coin in 'X' bags? |
0 |
161 |
Algorithms | Divide and Conquer | Greedy |
|
| Flash Storage Media |
1 |
781 |
DBMS |
|
| Differentiate between quick sort and merge sort? |
2 |
423 |
Sorting |
Oracle |
| Object relational Mapping |
1 |
258 |
DBMS |
|
| Explain briefly difference between different address binding methods? |
3 |
337 |
Operating Systems |
Philips |
| SIGFPE Error |
1 |
233 |
Computer Science | programming-language |
|
| Implementation of Set |
4 |
765 |
Tree |
Amazon |
| Designing an NFA |
1 |
343 |
theory of computation |
|
| Address Generation |
1 |
215 |
Operating Systems |
Accenture |
| Expected Number of Trials |
0 |
211 |
Algorithms |
|
| Write applications of binary search tree. |
1 |
252 |
Data Structures |
MAQ Software |
| Difference between an Interface and an Abstract class in Java. |
1 |
419 |
Java |
Goldman Sachs |
| conversion of epsilon nfa to dfa |
0 |
278 |
theory of computation |
|
| Time digit counting |
0 |
255 |
C | Dynamic Programming |
|