Given an array of size n. It contains numbers in the range 1 to n. Each number is present at least once except for 2 numbers. Find the missing numbers.

1237

---

Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same.

1280

---

How do you convert a decimal number to its hexa-decimal equivalent.Give a C code to do the same

1105

---

What is the time and space complexities of merge sort and when is it preferred over quick sort?

1081

---

Write a function which takes as parameters one regular expression(only ? and * are the special characters) and a string and returns whether the string matched the regular expression.

1097

---

Given an array of size n+1 which contains all the numbers from 1 to n.Find the number which is repeated in O(n) time.How do you proceed with the same with floating numbers from 0 to 1 instead of 1 to n?

1051

---

Explain what is OOPS and its concepts?

1121

---

Where do we need Operator overloading?

1119

---

Write a program to reverse a number?

1186

---

Write a program to find duplicate number from array in minimum time complexity.

1064

---

Write a program to show polymorphism.

1125

---

Explain encapsulation in C++.

1010

---

What is the merger sort principle and its time complexity.

1141

---

Explain with examples any 2 features of OOPS.

1127

---

Differentiate between a structure and a union.

1291

---