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.

0 Answers   Amazon,

---

A, B and C are 8 bit nos. They are as follows: A 1 1 0 1 1 0 1 1 B 0 1 1 1 1 0 1 0 C 0 1 1 0 1 1 0 1 Find ( (A-B) u C )=? how to solve this need with steps

5 Answers   TCS,

---

how we can call xml file in java file using Android platform?

2 Answers   TCS,

---

Difference between debugging, running, executing of an application

0 Answers   HCL,

---

What does this useful command line do? tasklist /m "mscor*"

1 Answers  

---

Tag for turning an image into a hyperlink is

0 Answers  

---

Data Structure:  How many comparisons are necessary to find the largest and smallest of a set of n distinct elements?  

0 Answers   Student,

---

When we delete logfiles such as screenshots how does it affect the ldf file? Ive seen huge change while adding screenshots in the ldf file but a very minor one deleting them.Please Explain

0 Answers  

---

Data Structure: Show that if k is the smallest integer greater than or equal to n+ (log2n)-2, k comparisons are necessary and sufficient to find the largest and second largest elements of a set of n distinct elements. (k comparisons are required to find what you are looking for, but no more than that are needed)

0 Answers   Student,

---

what is difference between java and c#

2 Answers   Cyient,

---

EXPLAIN UNARY OPEARATORS

0 Answers  

---

What is a programming language?

1 Answers  

---