Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Who's Online 0

Don't Hesitate for ask Question, post your assignment with hope you will find best solution.

CS604 GDB Solution

CS604 GDB
I think that the following strategy will be the solution for the above gdb.
No preemption
To ensure that this condition does not hold we may use the protocol: if a process is holding some resources and requests another that cannot be allocated immediately to it, then all resources currently being held by the process are preempted. These resources are implicitly released, and added to the list of resources for which the process is waiting. The process will be restarted when it gets all its old, as well as the newly requested resources.

Copied

Comments

  • ansaraliansarali Posts: 22,950
    current paper of cs604
    Cs604 finalterm paper 15/02/2020 session 5 pm.
    1.Source code tu executable code steps
    2. File Protection
    3.UNIX/Linux me virtual memory ka concept,esa kuch question tha
    4.page replacement(algorithms)
    5.Paged segmentation
    6. Logical to physical address translation(steps)
    7.Deadlock prevention me safe state essential ha ya nai
    8. Ek table me values thi us me sy average wait time or first come first serve algorithm sy calculation krni thi.
    9. Values di hoi thi uska gant chart bnana tha.
    10. Segmentation k 2 registers k name.

    Cs604.... 15feb...8:00am
    MCQS mstly frm last 10 lectures
    Primary page protection scheme.. 3 mrks
    Accessing modes nd user clases.. 3 mrks
    Aftr detecting deadlock how to recovr it give one methd.. 3 mrks
    Wrng use if semaphore will lead to no bad effect on process.. Do u agree?? Give 2 reasons... 3 mrks
    For critical section problem, maximum proces involves init nd which algorithm is used to solv it.. 3 mrks
    U hv dfrnt deadlock detection algorithm in ur system when should u use them.. Give 2 conditions.. 5 mrks
    Differentiate bw starvation nd deadlock with the help of code... 5 mrks
    Statements are given identify them as signal, interrupt, trap... 5 mrks
    Situations given... Identify which system call will be used... 5 mrks
    Steps of page replacement.. 5 mrks

    Cs604 11am paper
    20+ mcqs waqar sidhu r moaaz files sy thy

    Semaphore ka question
    Semaphore ka algo shortcomings batani thi
    Resource Alllocation Graph dya howa tha wait for graph bana kar bata na tha k deadlock ha k ni
    File structure name batany thy
    I/O disk operations fast hoty han ya file system
    Numerical tha p, f aur d find karna tha
    Fork() k failure k reasons likhny thy
    Virtual memory per comment likhna tha
Sign In or Register to comment.

ACC311 ACC501 ACC311  ACC501 ACF619  ACFI619 BIF401 BIF402 BIF501 BIF601 BIF602

BIF604 BIF619 BIF720 BIF731 BIF732 BIF733 BIT701 BIT703 BIT710 BIT715 BIO101 BIO102 

BIO201 BIO202 BIO203 BIO204 BIO301 BIO302 BIO303 BIO401 BIO502 BIO503 BIO601 BIO731 

BIO732 BIO733 BIO734 BNK601 BNK603 BNK604 BNK610 BNK612 BNK619 BNK620

BNK701 BNK703 BNK704 BNK725 BNKI619 BNKI620 BT101 BT102 BT201 BT301 BT302 BT401

BT402 BT403 BT404 BT405 BT406 BT503 BT504 BT505 BT601 BT603 BT605 BT619 BT720 BT731

BT732 BT733 BT734 BT735 BTI619

CS001 CS101 CS201 CS202 CS204 CS205 CS206 CS301 CS302 CS304 CS310 CS311 CS312 CS314 CS315 CS401

CS402 CS403 CS405 CS406 CS407 CS408 CS409 CS410 CS411 CS420 CS431 CS432 CS435 CS441 CS501 CS502 

CS504 CS506 CS507 CS508 CS510 CS519 CS601 CS602 CS603 CS604 CS605 CS606 CS607 CS608 CS609 CS610

CS611 CS614 CS615 CS619 CS620 CS625 CS701 CS702 CS703 CS704 CS706 CS707 CS708 CS709 CS710 

CS711 CS712 CS713 CS716 CS718CS720 CS721 CS723 CS724 CS726 CS799 COM619 COMI619