Showing posts with label m703. Show all posts
Showing posts with label m703. Show all posts

21 Dec 2016

20-12-16 Cs703 Paper at 12.00 pm - Current Mid


Total 3questions each q contain equal marks

Q1. Compare user thread and kernel thread ?
Q2. Disadvatage of thread paradigms ?
Q3. What are the desirable properties of a good cpu scheduling algorithm ? Evalute the FCFS scheduling algorithm on the basis of the established desirable properties ?

19 Dec 2016

18 Dec Current Midterm

Q1 there was a program and u had to tell how many times it will print hello.. fork()
part 2 . write a program that print "i am ith process"
Q2 was write program to create a thread in main process print something and wait for second thread to fnish
Q3 was from free list queue
One queue given and you had to tell contents after each operation.

20 Oct 2016

CS 703 31-05-2016 TIME : 9:00 am


Q#1. Suppose that a system is in an unsafe state. Show that that is possible for the process to completed their execution without entering a deadlock state.
Q#2.Major uses of threads.
Q#3.Possibility thread created or not.Write the possibility of failure thread creation.
Q#4.diagram ti us mai Quantum 8 or aik quantum 16 diya huwa ta next FCFS likha ta
a.which process will complete execution 2nd queue.
b.How move different queue how enter into different queues...

CS 703 30-05-2016 TIME : 7:30 am

Q#1. Suppose that a system is in an unsafe state. Show that that is possible for the process to completed their execution without entering a deadlock state.
Q#.2. Threads open resource sharing, are threads harmful for the system give solid reason?
Q#3. Do you think there are some events in computer systems that causes CPU scheduling?
Q#4. An operating system is running three concurrent P1,P2,P3 for three different users. each process require six units of computing time . P1 consist of a single thread, P2 consists of two threads , each requiring three of P2,S SIX TOTAL UNIT COMPUTING TIME....................
a) Suppose that the threads are kernel-supported and the kernel implements peemptive, round-robin scheduling of threads with a quantum on one time unit. of the first six units of time how many will devoted to each of the three process?
b) suppose threads are implemented entirely at the user level, and that .............

McQs Midterm

1.Asynchronous exception are caused by events external to the __________.
Processor
Memory
Vector Table
Data range
2.In _______memory allocator application allocates and frees space.
Dynamic
Explicit 
Implicit 
Static
3. To show free block in implicit list method we use _____ digit.
0
00
11
1
4. In reference counting, each ______has “ref count” of pointers to it.
Object
Block
Heap Address
Stack
5. A task in Linux that is present in the run queue (ready queue) at any given time has its state set to_______. 
TASK_INTERRUPTIBLE 
TASK_STOPPED
TASK_RUNNING
TASK_ZOMBIE
6. A process _______ defines the readiness of the process to be scheduled for execution.
Scheduler
Counter
State
Executer
7. Functions that are called from a thread must be thread ______.
Safe
Oriented
Dependent
Independent

For More: http://vuinnovators.com/cs703-current-paper-mcqs-solved/

Midterm Question

Diffeeence between Long term scheduler, medium term and short term scheduler. How long term scheduler helps.. (10)
Uses of threads (5)
One code was given, I have to tell the logic of that code. (5)
And last question was about high-level synchronization advantages over semaphore. (5)