Skip to main content

CS604 Current Final Term Paper Spring 2014 Shared By Aami

My Today paper:
Most of the MCQs were from moaaz file....
Subjective Question we as under:
Q.1). To resolve thrashing duw to excessive paging what can a user do? (2 marks)
Q.2). Which term is best suited for edge P-->R indicating that process p may requesy resource p sometime in the future?(2 marks)
Q.3). Differentiate between page number (p) and offset (d) ?(2 marks)
Q.4). You are required to identify a major issue of segmentation as a result of larger logical address space?
Q.5). Name two registers used for segmentation and what they represent?(3 marks)
Q.6). With respect to file mount how can you differentiate between different types of mount?(3 marks)
Q.7). Consider a process in normal execution but as some time one of its needed resource is preempted you are required to suggest method to handle this issue?(3 marks)
Q.8). In deadlock prevention strategy do you think it is necessary to check that either safe stat exists or not give reason?(3 marks)
Q.9). With regard to main memory and a secondary storage, where to store C source program and where to load it while execution in main memory or secondary storage support your answer with reason?(3 marks)
Q.10). Difference between paging and segmentation... ( A table of statements was given with two space for paging and segmentation and we have to fill it with Yes or No depending on statement)? (5 marks)
Q.11). In Linux OS describe working of copy on write in virtual memory?(5 marks)
Q.12). In case of file protection , what should the file owner.creator to be able to control? And what operations need to be controlled?(5 marks)
Overall papers was easy... Best of luck

Comments

Popular posts from this blog

CS614 Quiz No.4 Shared by Princess (solved), Spring 2014

  “What means What”. The phrase refers to: Select correct option:  Meta data  External data Transformed data Internal representations Question # 2 of 10 Which of the following is NOT one of the activities of “Maintenance and Growth” phase in Kimball’s DWH development approach? Select correct option: Education Technical Education Program Support  Interface Deployment                 Question # 3 of 10 Horizontally wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records Dataset has attribute skews Dataset has partitioning skews                 Question # 4 of 10 Which of the following is NOT one of the top-10 mistakes that should be avoided during DWH development? Select correct option: Not interacting directly with end user Not being an accommodating person Isolating IT support people from business users Training the users with dummy data and considering it success             

CS502 Quiz No.4 File 3

There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges.   Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles .         (Correct) In strong components algorithm, the form of graph is used in which all the vertices of original graph G have been reversed in direction. Select correct option: True                 (Correct)   False In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a/an __________ . Select correct option: Vertex Edge   Cycle               (Correct)   Tree For undirected graph, there is no distinction between forward and back edges. Select correct option: True                 (Correct)   False You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: (V+E)             (Corre

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Select correct option: int &x ;        ok int *x ; int x ; None of the given options he depth of a complete bina