| How could you arrange 'N' coin in 'X' bags? |
0 |
1198 |
Algorithms | Divide and Conquer | Greedy |
|
| Flash Storage Media |
4 |
2238 |
DBMS |
|
| Differentiate between quick sort and merge sort? |
2 |
1670 |
Sorting |
Oracle |
| Object relational Mapping |
1 |
1613 |
DBMS |
|
| Explain briefly difference between different address binding methods? |
3 |
2793 |
Operating Systems |
Philips |
| SIGFPE Error |
1 |
4348 |
Computer Science | programming-language |
|
| Implementation of Set |
5 |
2282 |
Tree |
Amazon |
| Designing an NFA |
2 |
1916 |
theory of computation |
|
| Address Generation |
1 |
1151 |
Operating Systems |
Accenture |
| Expected Number of Trials |
0 |
984 |
Algorithms |
|
| Write applications of binary search tree. |
1 |
1165 |
Data Structures |
MAQ Software |
| Difference between an Interface and an Abstract class in Java. |
2 |
1573 |
Java |
Goldman Sachs |
| conversion of epsilon nfa to dfa |
0 |
1980 |
theory of computation |
|
| Time digit counting |
1 |
999 |
C | Dynamic Programming |
|
| Search in Linked List |
10 |
3281 |
Linked List |
UnitedHealth Group |
| Different bindings in WCF |
1 |
2019 |
CSharp |
UnitedHealth Group |
| Largest palindrome |
2 |
2486 |
palindrome | Strings |
UnitedHealth Group |
| Middle element of the linked list |
10 |
2383 |
Linked List |
UnitedHealth Group |
| What are different contracts in WCF ? |
1 |
1626 |
CSharp |
UnitedHealth Group |
| TreeMap or HashMap who is fast for fetching data ? |
11 |
1456 |
Java |
|
| Mutex vs Binary Semaphore |
0 |
1480 |
Operating Systems |
|
| what are the drawbacks of simple queues in data structures? |
1 |
3237 |
Data Structures |
|
| Which address user deals or accesses directly virtual(logical) or physical address? |
1 |
1120 |
Operating Systems |
|
| Calculate physical address if logical address is 346 and relocation register is 14000? |
2 |
2029 |
Operating Systems |
|
| 1/1! +2/2! +3/3! ...+n/n! |
1 |
913 |
C |
|
Problem of the Day
Problem of the Day