Other side=1522-922ft  =2254-814ft  =1444= 6ft

Area of closet =(6 x 4.5)sq.ft = 27 sq.ft 

100 cm is read as 102 cm.

 A1 = (100 x 100)  and A2 =(102 x 102)   

(A2 - A1) = [(102 x 102)-(100 x 100) ]= 404    

Percentage error =[404/(100 x 100 )] x 100%= 4.04%

Face value of the bill = Rs. 6000.

Date on which the bill was drawn = July 14 at 5 months. Nominally due date =                  December 14.

Legally due date = December 17.

Date on which the bill was discounted = October 5.

Unexpired time  : Oct.               Nov.                Dec.

                                 26  +               30  +              17     = 73 days  =1/ 5Years

 B.D. = S.I. on Rs. 6000 for 1/5 year

= Rs.   (6000 x 10 x1/5 x1/100)= Rs. 120.

T.D. = Rs.[(6000 x 10 x1/5)/(100+(10*1/5))]

            =Rs.(12000/102)=Rs. 117.64.

B.G. = (B.D.) - (T.D.) = Rs. (120 - 117.64) = Rs. 2.36.

Money received by the holder of the bill = Rs. (6000 - 120) = Rs. 5880.

s[i], *(i+s), *(s+i), i[s] are all different ways of expressing the same idea.Generally array name is the base address for that array. Here s is the base address. i is the index number/displacement from the base address. So, indirecting it with * is same as s[i]. i[s] may be surprising. But in the case of C it is same as s[i].

Stack. Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

The interviewer is listening for an answer that indicates you've given this some thought and are not sending out resumes just because there is an opening. For example, "I've selected key companies whose mission statements are in line with my values, where I know I could be excited about what the company does, and this company is very high on my list of desirable choices."

The garbage collector assumes that all objects in the managed heap are garbage. It starts walking the roots and builds a graph of all objects reachable from the roots recursively. It stops when it attempts to add an object to the graph that it previously added. The graph contains the set of all objects that are reachable from the application's roots. Any object/s that is not in the graph is not accessible by the application, and is considered garbage. Collection only occurs when the heap is full. In such a case, each and every garbage object calls the Finalize method and reclaims the unused memory

A web application resides in the server and serves the client’s requests over internet. The client access the web page using browser from his machine. When a client makes a request, it receives the result in the form of HTML which are interpreted and displayed by the browser.

A web application on the server side runs under the management of Microsoft Internet Information Services (IIS). IIS passes the request received from client to the application. The application returns the requested result in the form of HTML to IIS, which in turn, sends the result to the client.