Answer Posted / best in the world

#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,k;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
{
printf("%d ",(i+j+1)%2);
}
printf("\n");
}
getch();
}




THIS IS THE BEST SOLUTION IN THE WORLD

c ka base kya hota hai? what is communication?

5285

---

PREVIOUS AND NEW companies positive and negative points AFTER LIVING

2174

---

why every computer should have a boot strap routine?

1909

---

what are differences between composition and inheritance in c

1596

---

my first question in huawei was ....1)Tell me about your self 2) oops concept 3)logic gates 4)ram and rom ,what is cache memory nd where it is located 5)diffrence between file system and data base 6) procedure of operating system 7)what is c# 8)high level language and machine language 9) and from mobile networkin !!!! hope thz will help you

1958

---

How do aeroplanes fly? Why can some fly up-side down?

1060

---

WHAT ARE THE ADVANTAGE OF SYSTEM ENGINEER

1966

---

What is Symbian.?

2095

---

what is the concept of c++ class

1980

---

A code which had some declarations of some data items. There were a couple of normal data items(char,int..) and some pointers as well and a malloc call. You have to find the total memory taken up in the stack(Hint:Pointers and all are allocated in heap, not in stack, so dont count them).Also in most of these questions, they were specifying that the OS was 32 bit

2332

---

Write a function to print all the combinations of a string both uppercase and lowercase without altering the position of each letter.

2346

---

Modal vs Modaless in VB??

1999

---

sample sbi questions paper

1904

---

what is your experience in developing technical specifications?

2246

---

10. Write a program in ‘C’ language that will perform the following operation on double link list. Each node of this list contains the address of previous as well as next node. The previous pointer of first node & next pointer of last node should contain null. 1. Creation of list with as many records as user want 2. Search a node in the list 3. Deletion at last position 4. Display 5. Exit Create separate functions for each operation. The create () will be used to create the list. It should accept no argument & return the address of the starting node. Search() will search a node in the list. It receives rollno as argument & return that node if found otherwise return null. The delete () function will delete the last node. It does not receive any argument & return structure type value at last position. The starting node of the double list must be declared as external pointer variable. Each element of double link list will contain the following information Roll No, Std Name, Course. Use do-while loop & switch case for generating the above menu. The format of the output should is given below: S.No. Roll No. Student Name Course 1 cse01 Anil Singh B.Tech

1929

---