Answer Posted / manish soni bca 3rd year jaipu

#include<stdio.h>
#include<conio.h>
void main()
{
int cnt,term;
cnt=0;
while(cnt<6)
{
cnt+=1;
term=(cnt*2-1)^1;
printf("%d\n",term);
}
getch();
}

manish soni tagore biotech collage jaipur

Is return a keyword in c?

1050

---

What is the method to save data in stack data structure type?

1056

---

How do I swap bytes?

1044

---

If null and 0 are equivalent as null pointer constants, which should I use?

1158

---

What is methods in c?

1046

---

How many identifiers are there in c?

985

---

What is double pointer?

970

---

Is c dynamically typed?

1118

---

What is an example of structure?

998

---

Write a program with dynamically allocation of variable.

1090

---

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 }

3150

---

hi... can anyone help me to make a two-dimensinal arrays in finding the sum of two elements plzzz. thnx a lot...

1884

---

Find duplicates in a file containing 6 digit number (like uid) in O (n) time.

3215

---

How can I copy just a portion of a string?

1289

---

how we can make 3d venturing graphics on outer interface

4768

---