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

What are the tasks performed by a Team Lead

0 Answers   Emphasis,

---

how to invoke the macro in another macro?

1 Answers   Accenture,

---

In Java what is the difference between following two statements ? int a[],b; int []a,b;

1 Answers  

---

How to link calculator in oops concept? how is it working in oops concept? why dont u using in beginning of program 'z' in abap(sap)?

2 Answers  

---

Write a program to calculate the following i want a Java program for this condition 1+4+9+16+….+100 Like this (1^2+2^2) Hint use function pow(a,b)

4 Answers   HTC,

---

1.Mutating table

0 Answers  

---

I would like to know what is Intellimatch and some interview questions which could be asked related to Intellimatch.

3 Answers  

---

how many languages .net is supporting now?

4 Answers  

---

Why COBOL/400 is giving 95 session error when opening a file even though the file is having key and the screen or display file is having IND ARA defined?

1 Answers   Freelance,

---

converting 41.685 to binary

1 Answers   Hughes,

---

preorder of A*(B+C)/D-G

6 Answers   BFL,

---

What is meant byStatic Variable ?

7 Answers   Mascot,

---