Q2➡| Let us assume that you construct ordered tree to represent the compound proposition (~ (p ∧ q)) ↔ (~ p ∨ ~ q) Then, the prefix expression and post-fix expression determined using this ordered tree are given as ____ and __ respectively.
Q3➡| Let A and B be sets in a finite universal set U. Given the following: |A – B|, |A ⊕ B|, |A| + |B| and |A ∪ B| Which of the following is in order of increasing size ?
i ➥ |A–B| ≤ |A⊕B| ≤ |A|+|B| ≤ |A∪B|
ii ➥ |A⊕B| ≤ |A–B| ≤ |A∪B| ≤ |A|+|B|
iii ➥ |A⊕B| ≤ |A|+|B| ≤ |A–B| ≤ |A∪B|
iv ➥ |A–B| ≤ |A⊕B| ≤ |A∪B| ≤ |A|+|B|
Q18➡| Consider the following statements regarding relational database model: (a) NULL values can be used to opt a tuple out of enforcement of a foreign key. (b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is also in BCNF. (c) The difference between the project operator (Î ) in relational algebra and the SELECT keyword in SQL is that if the resulting table/set has more than one occurrences of the same tuple, then Î will return only one of them, while SQL SELECT will return all. One can determine that:
Q19➡| Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ) , then which of the above could not be the relationship set for the E-R diagram ?
Q21➡| Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation can not be implemented in O(1) time ?
i ➥Insertion at the front of the linked list.
ii ➥ Insertion at the end of the linked list.
iii ➥Deletion of the front node of the linked list.
iv ➥Deletion of the last node of the linked list.
Q22➡| Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a,b) and (c, d) if |a – c| ≤ 1 or | b–d| ≤ 1. The number of edges in this graph is:
Q24➡| Consider the following statements: S1: A queue can be implemented using two stacks. S2: A stack can be implemented using two queues. Which of the following is correct?
Q28➡| A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ?
Q31➡| The number of strings of length 4 that are generated by the regular expression (0 + 1 + | 2 + 3 + )*, where | is an alternation character and {+, *} are quantification characters, is:
Q33➡| In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction ?
i ➥Replace P + P by 2 * P or Replace 3 + 4 by 7.
Q34➡| Which of the following are the principles tasks of the linker? I. Resolve external references among separately compiled program units. II. Translate assembly language to machine code. III. Relocate code and data relative to the beginning of the program. IV. Enforce access-control restrictions on system libraries
Q36➡| Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows : process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, __ processes are deadlocked.
Q37➡| Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, _____ number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1
i ➥11
ii ➥ 12
iii ➥10
iv ➥9
Show Answer With Best Explanation
Answer: None of the above Explanation: Upload Soon
Q38➡| Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P 1 , P 2 and P 3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur ?
i ➥70
ii ➥ 14
iii ➥13
iv ➥7
Show Answer With Best Explanation
Answer: None of the above Explanation: Upload Soon
Q39➡| Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3,5 and x respectively. All jobs entered in Ready queue at time zero. They must run in _____order to minimize average response time if 3 < x < 5.
Q40➡| Consider three CPU intensive processes P1 , P2 , P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then _ context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).
Q41➡| Which of the following is used to determine the specificity of requirements? [ Where n 1 is the number of requirements for which all reviewers have identical interpretations, n 2 is number of requirements in a specification.]
Q46➡| An attacker sits between the sender and receiver and captures the information and retransmits to the receiver after some time without altering the information. This attack is called as _______.
