Answer / nashiinformaticssolutions

o Big-O notation describes the performance or complexity of an algorithm in terms of the size of the input. Common examples:
 O(1)O(1): Constant time
 O(n)O(n): Linear time
 O(log⁡n)O(log n): Logarithmic time
 O(n2)O(n^2): Quadratic time

Java is called as pure objerct oriented programming language, where as c++ is not completely object oriented.can any explain the detailed differenec between these two

4 Answers  

---

How do you pass variables forwrd to future CECI sessions

0 Answers   Mind Tree,

---

what is difference between input parameter and output parameter.

0 Answers   NIIT,

---

Given a arbitrary pointer to an element in a singly linked list?what is the time complexity for its deletion .

1 Answers   Hughes,

---

Hi I am Rathnam, How To Remove the duplicates with out using remove duplicate stage in the datastage

0 Answers   TCS,

---

Write a shell program to test whether a given year is leap year or not ?

0 Answers   Patni,

---

Hello all, My name is Nrupali, am a fresher, i know C language beginner. dont have any experience. planning to learn Php. let me know which language should i choose to learn or for salary purpose and growth??? kindly help me to take decision. thanks

1 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 do u mean by tagging

0 Answers  

---

any drawback are there in mantis?

0 Answers  

---

what is the diff bw sql direct and jdbc update can't we do select and updating operation in sql direct

0 Answers   HP,

---

what is delegats ?

4 Answers  

---