Answer Posted / ekansh

Please Send me Question paper of hewitt placement test on
my mail by 2morrow or 3jan-ekansh_dhawan@yahoo.com

Thanks......
Ekansh Dhawan

can i knw what are we supposed to read for the coming oces/dgfs 2009 exam?what kind of book are we supposed to study?

2096

---

Is Diesel staorage tank ( 800 litres) cleaning procedure is available with any body

2047

---

what is polymorphism.

1916

---

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursion (the algorithm given in class). What is the maximum number of comparisons that this algorithm must perform before finding a given item or concluding that it is not in the list?

3683

---

Explain i.d.e. for visual c++?

2222

---

1)How to calculate AC Capacity for the Room?

2304

---

Has anyone attended any interviews in IITs for the positions like Research Associates/Fellowships?

1963

---

what is major differnet between hub and switch and also defferent between router and switch

1945

---

What is the instruction to load the register B?

2410

---

how will u test the idoc

2021

---

Please derive the formula for the area of a circle.

1185

---

There are n points and each point enclose with x and y axis form a rectangle and find the point using a program which forms the smallest rectangle?

2038

---

Name a accredited or govt approved university which have 100% online engineering course

1822

---

what is the work of Loopback ?

2062

---

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

1934

---