Solve This (? + ? + ?=30)

If 1111=R, 2222=T, 3333=E, 4444=N Then 5555=?

Guess the Hindi Muhawara from the following whatsapp Emoticons?

Sweet, Medicine, Film, Girl, City, Car, Place, Doggy all are name same, guess which word it is?

A girl is blind, deaf, dumb and uneducated too. A boy loves her. How would he propose without touching her?

Four Question, One Answer: One River Name, One Flower Name, One Film Name, One Actress Name?

Guess me who am I, I am the first on earth, the second in heaven...

Which Indian cricketer is known as "Brown Bradman"?

Which English poet, dramatist, and art historian, a pioneer in the European study of Far Eastern painting wrote.........

What nationality is Ilie N?stase, World No. 1 tennis player in 1973/1974, who won more than 100 ATP professional........

Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix.

What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)?

Time complexity : O ((| E | + | V |) log | V |)

Say we only know the worst case and best case complexity of an algo (Algo is not known). Is it possible to get the average case complexity?

using adjacency matrix representation of graph?