This document contains the details of a technical quiz competition including 5 rounds of questions. Each team will get one question per round and can earn 10 points for a correct answer. The rounds include guessing logos and taglines of companies, general technical questions, algorithms, and code output questions. The document provides the questions for each round along with the potential answers. It concludes by thanking the teams for participating.

1. NAEVUS'22
FINAL ROUND
QUIZ
TECHNICAL

2. QUIZ RULES
Each Team will be get 5 questions to Answer.
There are 5 round, where each team will get 1 question on each
round.
10 points for correct Answer.
No Negative Marks
No Passing

3. GUESS THE LOGO
ROUND 1

4. Question 1
Question 1
GUESS THE LOGO OF THIS FAMOUS American multinational retail corporation

5. WALLMART
ANSWER

6. Question 1
Question 2
GUESS THIS LOGO

7. MASTERCARD
ANSWER

8. Question 1
Question 3
GUESS THE LOGO

9. CISCO
ANSWER

10. Question 1
Question 4
GUESS THE LOGO

11. TARGET
ANSWER

12. Question 1
Question 5
GUESS THIS LOGO

13. SKYPE
ANSWER

14. GUESS THE TAGLINE OF A COMPANY
ROUND 2

15. Question 1
Question 1
GUESS THE TAGLINE OF THE COMPANY

16. APPLYING THOUGHTS (WIPRO)
ANSWER

17. Question 1
Question 2
GUESS THIS TAGLINE

18. POWERED BY INTELLECT
DRIVEN BY VALUES (INFOSYS)
ANSWER

19. Question 1
Question 3
GUESS THIS COMPANY/THEIR TAGLINE

20. THINK DIFFERENT (APPLE)
ANSWER

21. Question 1
Question 4
GUESS THE TAGLINE OF THE COMPANY

22. BUILDING ON THE BELIEF (TCS)
ANSWER

23. Question 1
Question 5
GUESS THE TAGLINE OF THIS COMPANY

24. CONNECTION IS EVOLVING
AND SO ARE WE(META)
ANSWER

25. GENERAL QUESTIONS
ROUND 3

26. GENERAL QUESTIONS
Question 1
Name of the virus that hit 1.5 crore android devices
across the country recently.

27. AGENT SMITH
ANSWER

28. GENERAL QUESTIONS
Question 2
UIDAI has launched a new mobile app named which
to perform face authentication?

29. AADHARFACERD
ANSWER

30. GENERAL QUESTIONS
Question 3
Identify the computer language used for artificial
intelligence

31. PROLOG
ANSWER

32. GENERAL QUESTIONS
Question 4
Name the other word for CPU?

33. MICROPROCESSOR
ANSWER

34. GENERAL QUESTIONS
Question 5
A person who sends irrelevant or unsolicited
messages by using Internet, usually to large numbers
of users, for the purposes of advertising, spreading
malware, phishing, etc. is known as …

35. SPAMMER
ANSWER

36. FAMOUS ALGORITHMS
ROUND 4

37. Question 1
Question 1
First person Discovered this
Algorithm first. Second
person independently
discovers it 27 years later.
Third person discovered it 2
years later. that finds a
minimum spanning tree for
a weighted undirected
graph. Which Algorithm is it?

38. PRIM ALGORITHM
ANSWER
ABOUT:
It is a greedy algorithm that finds a minimum
spanning tree for a weighted undirected graph.

39. Question 1
Question 2
A famous algorithm named
after this person. It works by
counting the number and
quality of links to a page to
determine a rough estimate
of how important the
website is.

40. PAGERANK
ANSWER
ABOUT:
PageRank (PR) is an algorithm used by Google Search
to rank web pages in their search engine results. It is
named after both the term "web page" and co-founder
Larry Page.

41. Question 1
Question 3
An Algorithm which is used
in Google Maps to calculate
the shortest distance from
point A ( Source) to point B (
destination). It is named
after its creator.

42. DIJKSTRA ALGORITHM
ANSWER
ABOUT:
Google Maps uses Graph algorithms namely Dijkstra’s
algorithm and A* algorithm. Dijkstra’s algorithm is one
of the greedy algorithms used to optimize and find the
shortest path between nodes in a graph. Dijkstra’s
algorithm is an effective algorithm proposed by
Edsger.W. Dijkstra in the year 1956 and published three
years later.

43. Question 1
Question 4
It is an Algorithm used by
Facebook till 2011 to
determine what articles
should be displayed in a
user's News Feed. It was
developed and implemented
by Serkan Piantino. Its name
is similar to Google page
ranking Algorithm
“PAGERANK”

44. EDGERANK
ANSWER
ABOUT:
EdgeRank and its successors have a broad impact on
what users actually see out of what they ostensibly
follow: for instance, the selection can produce a filter
bubble (if users are exposed to updates which confirm
their opinions etc.) or alter people's mood (if users are
shown a disproportionate amount of positive or
negative updates).

45. Question 1
Question 5
Which Algorithm is used in
the one of the most played
Game Minecraft to generate
a new world.

46. PERLIN NOSE
ANSWER
ABOUT:
This algorithm outputs a pseudo-random value that is
then used to determine the characteristics and
features of the world. However, the algorithm always
outputs the same value each time for a constant
starting point (seed). Thus, the same seed generates
the same terrain every time.

47. FIND THE OUTPUT
ROUND 5

48. Question 1
Question 1
FIND THE OUTPUT OF THE FOLLOWING CODE

49. NO
ANSWER
REASON:
a-- first makes a =1, then --a makes a= 0. Since ‘,’
operator is gonna return right most operand a which is
0, so else block is executed.

50. Question 1
Question 2
FIND THE OUTPUT OF THE FOLLOWING CODE

51. 101 200
ANSWER
REASON:
In the if block if || operator is used if the first statement
is true, the second won’t need to be check. Non zero
numbers are taken as true. So the second statement
isn’t checked.

52. Question 1
Question 3
FIND THE OUTPUT OF THE FOLLOWING CODE

53. COMPILATION ERROR
ANSWER
REASON:
‘A’ - Ascii value = 65, so both 65 and ‘A’ are same and it
displays error: duplicate case value

54. Question 1
Question 4
FIND THE OUTPUT OF THE FOLLOWING CODE

55. 2 4 6
ANSWER
ABOUT:
Initially i = 0, first time ++i in the initial expression and
condition expression is used to get 2, then the initial
expression is not touched. The condition and iteration
expression is used to get 4 and it repeats to get 6

56. Question 1
Question 5
FIND THE OUTPUT OF THE FOLLOWING CODE

57. 1
HELLO
ANSWER
REASON:
The printf prints 1 since 100>=100 is true. The printf
returns 3 (returns the length of the string it prints), 3 - 2
is 1 if(1) So it prints Hello.

58. FINAL SCORES!

59. FOR PARTICIPATING IN OUR TECHNICAL QUIZ
Thank You!