If virtualization is concerned, then answer would be choice d. Since its
not necessary to load complete process in memory.
On Sat, Dec 8, 2012 at 12:45 AM, sahil gupta wrote:
> It's b.
> Windows follow this Operation.
>
>
> On Fri, Dec 7, 2012 at 4:21 AM, manish wrote:
>
>> Four processes of 1
It's b.
Windows follow this Operation.
On Fri, Dec 7, 2012 at 4:21 AM, manish wrote:
> Four processes of 1gb,1.2gb,2gb,2gb are there and RAM available is 2gb.
> We have a
> time shared system. Which of the following is the most appropriate
> scheduling algorithm?
> a. all processes are loaded s
Four processes of 1gb,1.2gb,2gb,2gb are there and RAM available is 2gb. We
have a
time shared system. Which of the following is the most appropriate
scheduling algorithm?
a. all processes are loaded sequentially 1 by 1
b. load one process at a time and execute processes in RR fashion
c. load 1gb
Hi All,
Please suggest any one, group or forums related to Operating System
and Network like algogeeks.
Thanks
Vivek P
--
@manish
Q1. Paging has various advantages.
1. Increase the process address space to 4 GB (assuming 32 bit address
and data bus) even if physical memory is less than 4 GB.
2. Provides Security through Virtual Memory. Each process has its own
physical address space and cannot interfere wit
I think the answer to Q1 may "Yes".
Cause the virtual memory of program is limited, they need logically
contiguous memory, and have limit from OS and processor(32-bit, or
64-bit) yet.
I have no idea about Q2.
On Mon, Nov 5, 2012 at 4:30 AM, manish wrote:
> Q1. If we have infinite memory, then d
Q1. If we have infinite memory, then do we still be needing paging?
Q2. Given only 8bits registers, you have to find average of 4 bit registers
values without using any operation involving 16 bit calculations.
--
You received this message because you are subscribed to the Google Groups
"Algori
can't get :(
On Wed, Jan 25, 2012 at 5:19 PM, Rahul wrote:
> Google search this
> 6.033
> You will get the basics of processor mode of execution
> and rings of execution
> Hope I got the question !
> On Wed, Jan 25, 2012 at 4:21 PM, UTKARSH SRIVASTAV <
> usrivastav...@gmail.com> wrote:
>
>> I ha
Google search this
6.033
You will get the basics of processor mode of execution
and rings of execution
Hope I got the question !
On Wed, Jan 25, 2012 at 4:21 PM, UTKARSH SRIVASTAV
wrote:
> I have a doubt when each process has it's own separate page table then why
> is there s system wide page tabl
I have a doubt when each process has it's own separate page table then why
is there s system wide page table required ? Also if Page table is such
that it maps virtual address to a physical address then I think two process
may map to same physical address because all process have same virtual
addre
m sry i dint read the question properly
page no = vitual page % 3 ie 0 % 3 = 3
thrfre 3*1024 is starting addr of physical page
but the byte address will be 3*1024 + 512 = 3584
On Sun, Sep 25, 2011 at 10:12 AM, Vishnu Ganth wrote:
> 3584
>
>
> On Sun, Sep 25, 2011 at 9:53 AM, sivaviknesh s wrote:
c) 512
On Sun, Sep 25, 2011 at 9:53 AM, sivaviknesh s wrote:
>
>
>
> Consider a virtual memory system in which the virtual page addresses are
> mapped onto physical page addresses as follow
> Virtual page address.. Physical page address
> 0.
3584
On Sun, Sep 25, 2011 at 9:53 AM, sivaviknesh s wrote:
>
>
>
> Consider a virtual memory system in which the virtual page addresses are
> mapped onto physical page addresses as follow
> Virtual page address.. Physical page address
> 0...
Consider a virtual memory system in which the virtual page addresses are
mapped onto physical page addresses as follow
Virtual page address.. Physical page address
03
1...
http://www.tenouk.com/WinVirtualAddressSpace.html
go to this link.
think it will help you...
i
On Wed, Sep 14, 2011 at 7:48 PM, teja bala wrote:
> can any one tell the difference between ADDRESS SPACE and VIRTUAL
> ADDRESS SPACE?
>
> thx in advance.
>
> --
> You received this message be
Address Space:
The total addresses taken up by a process is known as a process's address
space
On Wed, Sep 14, 2011 at 7:48 PM, teja bala wrote:
> can any one tell the difference between ADDRESS SPACE and VIRTUAL
> ADDRESS SPACE?
>
> thx in advance.
>
> --
> You received this message because
can any one tell the difference between ADDRESS SPACE and VIRTUAL
ADDRESS SPACE?
thx in advance.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this g
4
On Wed, Sep 7, 2011 at 9:09 PM, Mohit Goel wrote:
> How many processes are created in this snippet?
> Main()
> {
> Fork();
> Fork() && fork () || fork ();
> Fork ();
> }
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to th
thnks everyone...
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
its 19...as 19 prcses are created
On Wed, Sep 7, 2011 at 11:21 PM, Mohit Goel wrote:
> 20 is not in option ..so whats the answer??
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@go
@mohit:answer is 19.one is the parent process originally.and 19 more
processes have been created.
On Wed, Sep 7, 2011 at 11:21 PM, Mohit Goel wrote:
> 20 is not in option ..so whats the answer??
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm G
20 is not in option ..so whats the answer??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups
int main()
{
fork();
fork() && fork() || fork();
fork();
return 0;
}
ln 1 : will create 2 prs
ln 2 : will create 10 process for each existing pr
ln 3 : will do fork for all 10 process, nd so now u ve 20 prs
the main issue is @ln-2 in main( )
Ln 2 :
here for 1st fork, if its parent
ups...19 i guess
On Wed, Sep 7, 2011 at 9:52 PM, Dheeraj Sharma
wrote:
> wats the ans... 21??
>
>
> On Wed, Sep 7, 2011 at 9:42 PM, vivek goel wrote:
>
>> can anyone explain me how?? plsss
>>
>>
>> On Wed, Sep 7, 2011 at 9:40 PM, rahul vatsa wrote:
>>
>>> 19 prs will be cr
wats the ans... 21??
On Wed, Sep 7, 2011 at 9:42 PM, vivek goel wrote:
> can anyone explain me how?? plsss
>
>
> On Wed, Sep 7, 2011 at 9:40 PM, rahul vatsa wrote:
>
>> 19 prs will be created, total 20 prs.
>> we have discussed this a few days back. plz check the old thr
can anyone explain me how?? plsss
On Wed, Sep 7, 2011 at 9:40 PM, rahul vatsa wrote:
> 19 prs will be created, total 20 prs.
> we have discussed this a few days back. plz check the old thread for any
> explanation.
>
>
> On Wed, Sep 7, 2011 at 12:01 PM, Mohit Goel wrote:
19 prs will be created, total 20 prs.
we have discussed this a few days back. plz check the old thread for any
explanation.
On Wed, Sep 7, 2011 at 12:01 PM, Mohit Goel wrote:
> a. 15
> b. 19
> c. 21
> d. 27
> e. 31
> these are the only options.
>
> --
> You received this message because
a. 15
b. 19
c. 21
d. 27
e. 31
these are the only options.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubs
hey is it 4 child processes along wid one parent
process.??
m i rite??
On Wed, Sep 7, 2011 at 9:09 PM, Mohit Goel wrote:
> How many processes are created in this snippet?
> Main()
> {
> Fork();
> Fork() && fork () || fork ();
> Fork ();
> }
>
> --
> You received this
How many processes are created in this snippet?
Main()
{
Fork();
Fork() && fork () || fork ();
Fork ();
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from thi
@roy : yes , kind of , i didnt know the exact technical term for it. Not
exactly PCB but process can maintain a lookup table for all the shared
variable and there corresposing threads . or for every thread the shared
variable. or ,may be in the thread itself, you can have a linked list
pointer whic
@ankur i think you are talking about cleanup handlers. these are the
functions which are executed when a thread terminates. but can you give any
hint how it can be accomplished using process control block.
On Sun, Aug 14, 2011 at 2:15 PM, Kamakshii Aggarwal
wrote:
> @ankur::nahi samajh aaya..:(
>
@ankur::nahi samajh aaya..:(
On Sun, Aug 14, 2011 at 9:46 AM, Ankur Khurana wrote:
> My 2 cents,
> When the termination signal is sent to the thread either synchronously or
> asynchronously , you just have a mechanism in place that if that thread is
> in critical section , it exits from there and
My 2 cents,
When the termination signal is sent to the thread either synchronously or
asynchronously , you just have a mechanism in place that if that thread is
in critical section , it exits from there and and unlocks the mutex at point
of exit. This can be done by associating a tokken with the
You can make a routine check for mutex
On Sat, Aug 13, 2011 at 7:56 PM, Kamakshii Aggarwal
wrote:
>
> How do you make sure to unlock a mutex which was locked in a thread that
> dies/terminates?
> --
> Regards,
> Kamakshi
> kamakshi...@gmail.com
>
> --
> You received this message because you are s
How do you make sure to unlock a mutex which was locked in a thread that
dies/terminates?
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.
Round Robin ..
On Thu, Aug 11, 2011 at 11:01 AM, siddharam suresh
wrote:
> shortest preemptive job first
> Thank you,
> Siddharam
>
>
>
> On Thu, Aug 11, 2011 at 10:49 AM, krishna meena <
> krishna.meena...@gmail.com> wrote:
>
>> Consider a set of n teaks with known runtimes r1,r2,r3rn to b
shortest preemptive job first
Thank you,
Siddharam
On Thu, Aug 11, 2011 at 10:49 AM, krishna meena
wrote:
> Consider a set of n teaks with known runtimes r1,r2,r3rn to be
> run on a uni-processor machine. which processor scheduling algorithm
> will result in the maximum throughput?
>
> --
Consider a set of n teaks with known runtimes r1,r2,r3rn to be
run on a uni-processor machine. which processor scheduling algorithm
will result in the maximum throughput?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this gr
Hi,
I know that the compiled code of a C file(after assembler converts assembly
code to opcode) cannot be run on a different OS or it cannot be run on a
different processor architecture.
So, I need to know what are the machine dependencies which are added in
object file.
One thing is the opcode
shared memory is fastest IPC mechanism , because , it is a simple memory
allocation on physical memory ,
in case of other options like pipes etc , they requires kernel entries ..
Thx,
--Gopi
On Tue, Aug 9, 2011 at 11:00 PM, Varun Jakhoria wrote:
> @Raghvendhra +1 ... because it doesn't require e
@Raghvendhra +1 ... because it doesn't require entry at kernel
On Tue, Aug 9, 2011 at 10:55 PM, raghavendhra rahul
wrote:
> Shared memory is fastest IPC mechanism, since it doesn’t involve any system
> call as it is done in user space.
> --
>
> Regards
> Raghavendhra
>
>
>
> "changing the face" c
Shared memory is fastest IPC mechanism, since it doesn’t involve any system
call as it is done in user space.
--
Regards
Raghavendhra
"changing the face" can change nothing .. but "facing the change" can change
everything
--
You received this message because you are subscribed to the Google
Named pipes are just like pipes which is global for every process and each
one can access them
so u can say that named pipes are shared global pipes
and i think they are fastest.
pipes works in queue fashion
On Mon, Aug 8, 2011 at 6:13 PM, Gaurav Menghani
wrote:
> I would rather not discuss n
I would rather not discuss non-algorithm questions on this group :)
On Mon, Aug 8, 2011 at 6:02 PM, dilip makwana wrote:
> Thanx for correction ... :D
>
> On 8 August 2011 17:50, dilip makwana wrote:
>>
>> Yes NAMED PIPES ... is correct
>>
>> On 8 August 2011 17:43, Himanshu Srivastava
>> wrote
Thanx for correction ... :D
On 8 August 2011 17:50, dilip makwana wrote:
> Yes NAMED PIPES ... is correct
>
>
> On 8 August 2011 17:43, Himanshu Srivastava wrote:
>
>> named pipes!!!
>>
>> On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal > > wrote:
>>
>>>
>>> Fastest IPC mechanism is
>>>
>>>
According to me,it should be shared memory..but i have taken this from an
online test which say that the answer is named pipeswhat are named
pipes?
On Mon, Aug 8, 2011 at 5:50 PM, dilip makwana wrote:
> Yes NAMED PIPES ... is correct
>
>
> On 8 August 2011 17:43, Himanshu Srivastava wrote:
>
>
Yes NAMED PIPES ... is correct
On 8 August 2011 17:43, Himanshu Srivastava wrote:
> named pipes!!!
>
> On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal
> wrote:
>
>>
>> Fastest IPC mechanism is
>>
>>1. ?shared memory
>>2. ?pipes
>>3. ?named pipes
>>4. ?S
*shared memory is the fastest IPC mechanism
Because we need not copy some data from one place to another.*
On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal wrote:
>
> Fastest IPC mechanism is
>
>1. ?shared memory
>2. ?pipes
>3. ?named pipes
>4. ?Semaphore
shared memory
On Mon, Aug 8, 2011 at 5:43 PM, Himanshu Srivastava <
himanshusri...@gmail.com> wrote:
> named pipes!!!
>
> On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal
> wrote:
>
>>
>> Fastest IPC mechanism is
>>
>>1. ?shared memory
>>2. ?pipes
>>3. ?named pipe
http://en.wikipedia.org/wiki/Shared_memory
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
named pipes!!!
On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal wrote:
>
> Fastest IPC mechanism is
>
>1. ?shared memory
>2. ?pipes
>3. ?named pipes
>4. ?Semaphores
>
> --
> Regards,
> Kamakshi
> kamakshi...@gmail.com
>
> --
> You received this message be
Shared Memory...
On Mon, Aug 8, 2011 at 5:36 PM, Kamakshii Aggarwal wrote:
>
> Fastest IPC mechanism is
>
>1. ?shared memory
>2. ?pipes
>3. ?named pipes
>4. ?Semaphores
>
> --
> Regards,
> Kamakshi
> kamakshi...@gmail.com
>
> --
> You received this message
Fastest IPC mechanism is
1. ?shared memory
2. ?pipes
3. ?named pipes
4. ?Semaphores
--
Regards,
Kamakshi
kamakshi...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send
Thnks Azhar :)
got the point
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more opti
The *exec* family of functions shall replace the current process image with
a new process image. It does not matter how many threads you have whole
process gets replaced with new one.
-
Azhar.
On Thu, Aug 4, 2011 at 8:27 PM, ankit sambyal wrote:
> What happens when a thread calls exec ?? What h
To elaborate more. New process image will not have the existing threads and
user defined data declared in current process will be wiped out. Parent can
do is to wait for the child status by calling wait().
for example
main()
{
pid = fork();
if (child) {
exec("ls"); /// he
Good point.
Let me search a bit on Threads. Will get back asap.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/7pWIqcdwugcJ.
To post to this group, send em
@Dipankar: But all the threads of a process share code and data section. So,
how is it possible that they are not affected ???
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To
I think the answer would be the thread calling execute will have to wait for
the executed command to exit and then it will proceed.
As for other threads, they shouldn't be affected.
Please do correct me if it is wrong.
On 4 August 2011 20:27, ankit sambyal wrote:
> What happens when a thread ca
What happens when a thread calls exec ?? What happens to the other threads
of the same process ??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group,
Hey coders if anybody has Operating Systems, by William
Stallings please mail me as early as you can.
my e-mail:brajkishoresa...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge
One such resource
http://placementsindia.blogspot.com/search/label/Operating%20Systems
On Mon, Jun 27, 2011 at 2:01 PM, Nishant Mittal
wrote:
> plz recommend me some good sites for OS interview questions...
> Thanx in advance
>
> --
> You received this message because you are subscribed to th
plz recommend me some good sites for OS interview questions...
Thanx in advance
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
@rahul: buddy, u can ignore the mail if u don't want to answer (no offense).
Lets not discourage someone from asking questions...
On Tue, Jun 21, 2011 at 11:23 PM, rahul wrote:
> If u want us to solve the GATE paper, please attach the paper, we will post
> the solution.
>
> regards.
>
>
> On Tue
@Rahul
Threads within a process share the same virtual memory space but each has a
separate stack, and possibly "thread-local storage". this thread local
storage is register and other private data. They are *lightweight* because a
context switch is simply a case of switching the stack pointer and
last year's gate question?
On Tue, Jun 21, 2011 at 11:32 PM, Akshata Sharma
wrote:
> But, the OS maintains a separate PC (program counter ),stack and A CPU
> register state for a thread . So option A I am not sure is correct, it says
> ONLY..
> scheduling and accounting information is stored for
But, the OS maintains a separate PC (program counter ),stack and A CPU
register state for a thread . So option A I am not sure is correct, it says
ONLY..
scheduling and accounting information is stored for a process right? Can you
please explain why C is not correct and D is correct?
On Tue, Jun 2
If u want us to solve the GATE paper, please attach the paper, we will post
the solution.
regards.
On Tue, Jun 21, 2011 at 11:21 PM, Akshata Sharma
wrote:
> The atomic fetch-and-set x, y instruction unconditionally sets the memory
> location x to 1 and fetches the old value of x n y without allo
The atomic fetch-and-set x, y instruction unconditionally sets the memory
location x to 1 and fetches the old value of x n y without allowing any
intervening access to the memory location x. consider the following
implementation of P and V functions on a binary semaphore S.
void P (binary_semaphor
A, D
On Tue, Jun 21, 2011 at 11:16 PM, Akshata Sharma
wrote:
> A thread is usually defined as a ‘light weight process’ because an
> operating system (OS) maintains smaller data structures for a thread than
> for a process. In relation to this, which of the followings is TRUE?
> (A) On per-thread
A thread is usually defined as a ‘light weight process’ because an
operating system (OS) maintains smaller data structures for a thread than
for a process. In relation to this, which of the followings is TRUE?
(A) On per-thread basis, the OS maintains only CPU register state
(B) The OS does not ma
If the operation (want = false) is not atomic, we can not mutual
exclusion.Certo?
Wladimir Araujo Tavares
*Federal University of Ceará
*
On Sun, Jun 19, 2011 at 11:01 AM, Wladimir Tavares wrote:
> One of two process can be in starvation!
>
> Wladimir Araujo Tavares
> *Federal University of C
One of two process can be in starvation!
Wladimir Araujo Tavares
*Federal University of Ceará
*
On Sun, Jun 19, 2011 at 10:49 AM, sanjay ahuja
wrote:
> where does it ensure that if P1 has first executed critical section
> then it will get chance to execute critical section only after P2 has
where does it ensure that if P1 has first executed critical section
then it will get chance to execute critical section only after P2 has
executed critical section once.
If it is strict alternation then it is ensuring bounded waiting!
On Sun, Jun 19, 2011 at 7:01 PM, Akshata Sharma
wrote:
> Why
Why is C not true?
On Sun, Jun 19, 2011 at 6:31 PM, sanjay ahuja wrote:
> B and D are true
>
>
> On Sun, Jun 19, 2011 at 5:43 PM, Nishant Mittal
> wrote:
> > It does not prevent deadlock so i think (D) is definitely true.
> >
> > On Sun, Jun 19, 2011 at 5:15 PM, Akshata Sharma <
> akshatasharm..
B and D are true
On Sun, Jun 19, 2011 at 5:43 PM, Nishant Mittal
wrote:
> It does not prevent deadlock so i think (D) is definitely true.
>
> On Sun, Jun 19, 2011 at 5:15 PM, Akshata Sharma
> wrote:
>>
>> Two processes, P1 and P2, need to access a critical section of code.
>> Consider the follo
It does *not* prevent deadlock so i think (D) is definitely true.
On Sun, Jun 19, 2011 at 5:15 PM, Akshata Sharma
wrote:
> Two processes, P1 and P2, need to access a critical section of code.
> Consider the following synchronization construct used by the processes:
>
> /* P1 */
> while (true) {
>
Two processes, P1 and P2, need to access a critical section of code.
Consider the following synchronization construct used by the processes:
/* P1 */
while (true) {
wants1 = true;
while (wants2==true);
/* Critical Section */
wants1=false;
}
/* Remainder section */
/* P2 */
while (true)
i don have...
On Fri, Jan 21, 2011 at 10:25 PM, rahul rai wrote:
> can u give me sipser solution mannual?
>
>
> On 1/21/11, Sreeprasad Govindankutty wrote:
> > Thanks so much
> >
> > On Wed, Jan 19, 2011 at 4:20 AM, jayapriya surendran
> > wrote:
> >
> >> wow..thank you so much
> >>
> >>
>
can u give me sipser solution mannual?
On 1/21/11, Sreeprasad Govindankutty wrote:
> Thanks so much
>
> On Wed, Jan 19, 2011 at 4:20 AM, jayapriya surendran
> wrote:
>
>> wow..thank you so much
>>
>>
>> On Wed, Jan 19, 2011 at 2:08 PM, LALIT SHARMA wrote:
>>
>>>
>>>
>>> --
>>> Lalit Kishore Sha
My Pleasure !!
On Fri, Jan 21, 2011 at 11:22 PM, Anand wrote:
> It's really good. Thanks a lot
>
>
> On Fri, Jan 21, 2011 at 8:24 AM, Sreeprasad Govindankutty <
> sreeprasad...@gmail.com> wrote:
>
>> Thanks so much
>>
>>
>> On Wed, Jan 19, 2011 at 4:20 AM, jayapriya surendran > > wrote:
>>
>>> wo
It's really good. Thanks a lot
On Fri, Jan 21, 2011 at 8:24 AM, Sreeprasad Govindankutty <
sreeprasad...@gmail.com> wrote:
> Thanks so much
>
>
> On Wed, Jan 19, 2011 at 4:20 AM, jayapriya surendran
> wrote:
>
>> wow..thank you so much
>>
>>
>> On Wed, Jan 19, 2011 at 2:08 PM, LALIT SHARMA wrote
Thanks so much
On Wed, Jan 19, 2011 at 4:20 AM, jayapriya surendran wrote:
> wow..thank you so much
>
>
> On Wed, Jan 19, 2011 at 2:08 PM, LALIT SHARMA wrote:
>
>>
>>
>> --
>> Lalit Kishore Sharma,
>>
>> IIIT Allahabad (Amethi Capmus),
>> 6th Sem.
>>
>> --
>> You received this message because yo
wow..thank you so much
On Wed, Jan 19, 2011 at 2:08 PM, LALIT SHARMA wrote:
>
>
> --
> Lalit Kishore Sharma,
>
> IIIT Allahabad (Amethi Capmus),
> 6th Sem.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send
But you dont need a swap filesystem right?
On Thu, Jul 22, 2010 at 8:41 AM, Anand wrote:
> Yes you do need virtual memory even if you have 4GB of RAM. Because if you
> do not have virtual memory, you could not have uniform addressing. and that
> prevents you creating the final elf file for each
Yes you do need virtual memory even if you have 4GB of RAM. Because if you
do not have virtual memory, you could not have uniform addressing. and that
prevents you creating the final elf file for each process. B'cos while
compiling the program you don;t know the actual physical address your
program
You have 4GB ram, and at any time you have only 2 processes of 10mb
each. so do you need any virtual memory for it?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscrib
if there are 32 such frames of 8 X 1024 then the logical address will be
(10+5)15 as pointed out by Harit.
On Thu, Jul 1, 2010 at 8:57 AM, sharad kumar wrote:
> i think harit's answer is correct regarding ques 2 plzz someone comment on
> this
>
> --
> You received this message because you are sub
i think harit's answer is correct regarding ques 2 plzz someone comment on
this
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
al
1. Virtual memory depends upon the data lines of the processor if it 32 bit
than virtual memory would 2^32.
2. Number of logical address bits would be (2^10= 1024)10. and 8 data bits.
On Thu, Jun 24, 2010 at 9:20 PM, harit agarwal wrote:
> 1. the virtual memory size depends on the page size t
1. the virtual memory size depends on the page size that the system is
using...
2. logical address=5+10=15 bits + (some modifying bits if they are present
like modified,copied etc..)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
1.
If size of the physical memory is 2^32-1, then the size of virtual
memory ??
2.
If the logical memory of 8 X 1024 is mapped into 32 frames, then the number
of bits for the logical address ?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group
@amit
i think your query is answered by varun..as each process do system call to
allocate memory so it is exhausting the memory for all the processesas
all processes are having the same interface...
@sharad
1.i don't think priviliges affect the user address spaceit tells that in
which w
I think your size of your RAM + Virtual memory(allocated swap space) limits
the amount of heap memory available. If while allocating 1 gb, your program
fails when it has allocated 800 mb, it means that its simply has exhausted
its memory space available. As ram cannot be increased without changing
In SMP operating sytem provides spinlock to execute critical section of code
that is shared among various processors. Spinlocks keeps every other
processors just to spin around and there by prevents them from generating
interrupts which could interrupt the processor which is executing the
critical
@ above
The heap getting exhausted is with respect to 1 Process only naa. i.e What I
am trying to ask is Heap Section of Memory is seperate for all processes or
Same?
So when u say that heap gets exhausted no more dynamic memory can be
allocated by that process or any other process in the system a
yes you can allocate 1gb using malloc but it also depends on how much heap
size is available to you..
if you try 2gb then more chances are it won't allocate because of heap is
exhausted..
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To pos
for 1
other reasons apart 4m d 1 told by harit are
1)in every os,a user has maximum space allocated to him according to his
previlege so ... may be it is exceeding that maximum capacity
2)it may be possible that it has exceeded total space available to whole os
i.e it may be smaller system having m
@ above
I think it is because of the heap size . The Heap corresponding to dynamic
memory allocation grows and merges with the stack section of the process.
Correct me if I am wrong.
And if was only because of calloc() , then will malloc work?
Can we allocate 1gb dynamically using malloc()??
O
1 - 100 of 109 matches
Mail list logo
