Answer Posted / sakthi sudhan

declaration : int a;
declaration means here a is declared as integer variable
initialization : int a = 5;
initialization is whatever you have declared give that
variable some value
definition : int a;
definition is whatever variable you have declared give it's
datatype as here a is declared as integer variable

find the value of y y = 1.5x+3 for x<=2 y = 2x+5 for x>2

1730

---

To print the pattern 1 2 3 4 5 10 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9

2427

---

What are the advantages and disadvantages of c language?

761

---

Explain what standard functions are available to manipulate strings?

805

---

What are the uses of a pointer?

866

---

Write a client and server program in C language using UDP, where client program interact with the Server as given below: i) The client begins by sending a request to send a string of 8 characters or series of 7 numbers, the server sends back a characters or numbers as per the request of the client. ii) In case of series of 7 numbers: The client sends a multiplication of numbers, to the server. iii) In case of a string of 8 characters: The client sends a reverse order of string to the server.. iv) Server will send an acknowledgment to the client after receiving the correct answer

4088

---

What is the difference between procedural and declarative language?

881

---

C program execution always begins with a) #include b) comment (/*-------*/) c) main() d) declaration instructions

801

---

Explain what are the advantages and disadvantages of a heap?

839

---

Function which gives a pointer to a binary trees const an integer value at each code, return function of all the nodes in binary tree.?

813

---

What is string length in c?

817

---

What are file streams?

768

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2936

---

What is data structure in c language?

831

---

What is action and transformation in spark?

823

---