When you?re running a component within ASP.NET, what process
is it running within on Windows XP? Windows 2000? Windows 2003?
- 2 Answers
- 6188 Views
- BirlaSoft, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / atul atey
On Windows 2003 (IIS 6.0) running in native mode, the
component is running within the w3wp.exe process associated
with the application pool which has been configured for the
web application containing the component.
On Windows 2003 in IIS 5.0 emulation mode, 2000, or XP, it’s
running within the IIS helper process aspnet_wp.exe.
| Is This Answer Correct ? | 4 Yes | 1 No |
Answer / harshvardhan
On Windows 2003 (IIS 6.0) running in native mode, the component is running within the w3wp.exe process associated with the application pool which has been configured for the web application containing the component.
On Windows 2003 in IIS 5.0 emulation mode, 2000, or XP, it's running within the IIS helper process whose name I do not remember, it being quite a while since I last used IIS 5.0.
| Is This Answer Correct ? | 0 Yes | 0 No |
What are two of your strengths that you will bring to our QA/testing team?
how to run servlets in eclipse 3.3.2....if we choose file->new->servlet then after that it is showing javax.servlet.* ...cannot be resolved.......to avoid this error any external jar file is to be added? please help me regarding this issue........thank u
Write a shell program. Enter number of days from keyboard. Find out the number of years, month and days it contains
what is the difference between conversion and interface in bdc?
which of the following is efficient in terms of space a. insertion sort b. quick sort c. selection d. both a and c
cobol is execution r not without jcl
V2 SOLUTIONS APTI paper is very easy there are 3 sections 1'st is quant problem on age train traveling speed is given length of train is given we have to find out length of bridge then prob on calender one date is given on Friday hv to find out day of othe date ans is Friday then there was 1 prob on percentage which was very easy ans was 21340 then 2’nd section was english grammer had has been being like that hv to fill in the blanks was very wasy then last section was find relative words there was five Q 1 pant ANS:-breath 2inquire ans :- ask And 3 more out of that 1 ‘s ans was:- body 4 And others ans was :-through THEN THEY HAVE GD There was three topics 1 should we allow india’s talent to go to abrod 2 protest against seperate state is justify 3 inturuption of politics in cricket Thats all guys i cleared both the rounds now preparing 4 interview best of luck
In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?
What is the maximum amount of memory any single process on Windows can address? Is this different than the maximum virtual memory for the system? How would this affect a system design?
In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 ≤ i0 <i1….< ik-1 ≤ n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.
sample code for data transfer between two r/2 systems and r/3 systems?
whats the Need for Concurrency control
C 
