UGC NET SOLVED - COMPUTER SCIENCE

Monday, 21 May 2012

http://ugcnetsolved-computerscience.blogspot.in/#dec2008

DECEMBER 2010 PAPER SOLVED QUESTIONS 1 - 10

1. The number of integers between 1 and 250 that are divisible by 2,5 and 7 is A) 2 (B) 3 C) 5 (D) 8 Ans:- B. There are 3 integers between 1 and 250 that are divisible by 2,5 and 7. They are 70,140 and 210. 2. An undirected graph possess an Eulerian circuit if and only if it is connected and its vertices are A) All of even degree (B)All of odd degree C) Of any degree (D)even in number Ans:- A. According to Euler's theorem 1, if a graph is undirected then it has an eulerian circuit if and only if it is connected and each vertex has an even degree. ***It would be useful to know about the Hamiltonian circuit as well. 3. A partially ordered set is said to be a lattice if every two elements in the set have A)a unique least upper bound (B)a unique greatest lower bound C)both (A) and (B) (D)none of the above. Ans:- C. 4. The minimum number of edges in a connected graph with 'n' vertices is equal to A)n(n-1) (B)n(n-1)/2 C)n2 (D)n-1 Ans:- D. The formula for counting the minimum number of edges in a connected graph is (n-1). 5. Would be done later..... 6. The decimal number equivalent of (4057.06)8 is : A) 2095.75 (B)2095.075

C) 2095.937 (D)2095.09375 Ans:- D. 7. Would be done later... 8. An astable multivibrator has A)one stable state (B)two stable states C)no stable states (D)none of these Ans:- C. An astable multivibrator has two states but neither of them are stable. 9.12-bit 2's complement of -73.75 is A) 01001001.1100 (B)11001001.1100 C) 10110110.0100 (D)10110110.1100 Ans:- B 10. Encoding of data bits 0011 into 7-bit even parity Hamming code is A)0011110 (B)0101110 C)0010110 (D)0011100 Ans:- A. The explanation is quite lengthy. If you google the question, you would get a link to the book "Fundamentals of digital circuit" by A.Anand Kumar. The explanation is great there. 11. How many of the following declarations are correct? int z=7.0; double void=0.000; short array[2]={0,1,2}; char c="\n"; (A) None (B)One is correct (C) Two are correct (D)All four are correct Ans:-The second declaration is for sure wrong because we cannot have a keyword as a variable name. The last declaration is also wrong because we cannot assign anything within double quotes to a character variable. So we are left with only the first and the array declaration.I think those two would still not give errors in c. So 'C' could be the answer for this question.

To be continued later...
Posted by Vani Chakraborty at 10:17 5 comments Email ThisBlogThis!Share to TwitterShare to Facebook

DECEMBER 2009 PAPER II SOLVED

1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ________________. (i) Commutative (ii) transitive (iii) implicative (iv) equivalence (A) (i) and (ii) (B) (iii) (C) (i),(ii),(iii) and (iv) (D) None of these Ans:- D 2. Circle has ________ (A) No vertices (B) only 1 vertex (C) vertices (D) None of these Ans :- A 8. The highest noise margin is offered by (A) BICMOS (B) TTL (C) ECL (D) CMOS Ans:- B 9. The answer of the operation (10111)2 * (1110)2 in hex equivalence is (A) 150 (B) 241 (C) 142 (D) 101011110 Ans:- C 10. How many 1 are present in the binary representation of 3 X 512 + 7 X 64 + 5 X 8 + 3 (A) 8 (B) 9 (C) 10 (D) 11 Ans:- B 11. Recursive functions are executed in a (A) First in first out order (B) Last in first out order (C ) Parallel fashion (D) Load Balancing Ans: B 12. What would be the output of the following program, if run from the commandline as myprog 1 2 3? main(int argc,char *argv[]) { int i; i=argv[1]+argv[2]+argv[3]; printf(%d,i); } (A) 123 (B) 6 (C) Error (D) 123 Ans:- C 13. A ________________ is a special method used to initialize the instance variable of a class. (A) Member function (B) Destructor (C) Constructor (D) structure

Ans:- C 14. Encapsulation is (A) Dynamic binding (B) A mechanism to associate the code and data (C ) Data abstraction (D ) Creating new class Ans:- B 15. Which of the statements are true? I. Function overloading is done at compile time. II. Protected members are accessible to the member of a derived class. III. A derived class inherits constructors and destructors IV. A friend function can be called like a normal function. V. Nested class is a derived class. (A) I,II,III (B) II,III,V (C) III,IV,V (D) I,II,IV Ans:- D 16. The E-R model is expressed in terms of I. Entities II. The relationship among entitites III. The attributes of the entities. IV. Functional relationship. (A) I,II (B) I,II, IV (C) II,II,IV (D) I,II,IV Ans:- D 17. Specialization is ________________process. (A) top-down (B) bottom up (C ) both (A) and (B) (D) none of these Ans:- A 18. Match the following: (1) Determinants (a) No attributes (2) Candidate key (b) Uniquely identified a row (3) Non-redundancy (c ) A constraint between two attributes (4) Functional dependency (d) Group of attributes on the left hand side of arrow of function dependency (A) 1 d, 2 b, 3 a, 4 c (B) 2 d, 3 a, 1- b, 4 c (C) 4 a, 3 b, 2 c, 1 d (D) 3 a, 4 b, 1 c, 2 d Ans:- A. 19. A function that has no partial functional dependencies is in _____________ form. (A) 3 NF (B) 2 NF (C) 4 NF (D) BCNF Ans:- B

20. Which of the following statement is wrong? I. 2-phase locking protocol suffer from dead lock. II. Time stamp protocol suffer from more aborts. III. A block hole in a DFD is a data store with only inbound flows. IV. Multivalued dependency among attribute is checked at 3 NF level. V. An entity-relationship diagram is a tool to represent event model. (A) I ,II,III (B) II,III,IV (C) III,IV,V (D) II,IV,V Ans:- A 21. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in a tree? (A) It is an odd number. (B) It is an even number. (C ) It cannot be equal to the number of leaves. (D ) It is always greater than twice the number of leaves. Ans:- A. Strictly binary tree with N leaves contains 2N-1 nodes. So when the number of leaves is odd number then the total number of nodes in the tree also will be odd if we apply the above formula. 22. The number of edges in a complete graph of n vertices is (A) n (B) n(n-1)/2 (C ) n(n+1)/2 (D) n2/2 Ans:- B. The complete graph on n vertices has n(n-1)/2 edges. 23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car cant leave until all the cars in front of it have left. Is the parking lot more like (A) An array (B) A stack (C) A queue (D) A linked list Ans:- C. 24. With regard to linked list, which of the following statement is false ? (A) An algorithm to search for an element in a singly linked list requires O(n) operations in the worst case. (B) An algorithm for deleting the first element in a singly linked list requires o(n) operations in the worst case. (C ). An algorithm for finding the maximum value in a circular linked list requires o(n) operations. (D ). An algorithm for deleting the middle node of a circular linked list requires o(n) operations. Ans:- B 25. A hash function f defined as f(key)=key mod 7, with linear probing used to resolve collisions. Insert the keys 37,38,72,48,98 and 11 into the table indexed from 0 to 6. What will be the location of 11? (A) 3 (B) 4 (C ) 5 (D) 6 Ans:- C

26. Device on one network can communicate with devices on another network via a (A) Hub/switch (B) Utility server ( C) File server (D) Gateway Ans:- D 27. What is the maximum window size in sliding window protocol used in a computer network? (A) 4 (B) 8 (C ) 15 (D) 16 Ans:- A 28. Which of the following are Data Link Layer standard? 1. Ethernet 2. HSSI 3. Frame Relay 4. 10-Base T 5. Token Ring (A) 1,2,3 (B) 1,3,5 (C) 1,3,4,5 (D) 1,2,3,4,5 Ans:- C 29. In case of Bus/Tree topology signal balancing issue is overcome by (A) Modulation (B) Polling (C ) Segmentation (D) Strong transmitter Ans:- C 30. Match the following: (i) Ethernet (a) Deterministic (ii) Token Ring (b) Utilize the full wire speed (iii) Cut-through switch (c ) Prevent Looping (iv) Spanning tree (d) Checking valid address Codes: (A) i-d,ii-a,iii-b,iv-c (B) i-a,ii-d,iii-b,iv-c (C ) i-d,ii-d,iii-c,iv-b (D) i-d,ii-c,iii-b,iv-a Ans:- A 31. In an absolute loading scheme which loader function is accomplished by assembler? (A) re-allocation (B) allocation (C ) linking (D) loading Ans:- A. Implementation of Absolute loader: The four loader functions are performed as following: 1.Allocation- By programmer 2.Linking- By programmer 3.Relocation- By assembler 4.Loading- By loader 32. Which of the following grammar is LR(1)? (A) A->aAb, A->bAb,A->a,A->b (B) A->aAa,A->aAb,A->c (C ) A->A+A,A->a (D)Both (A) and (B) 33. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar. S->xxW[ print 1 ] S->y [ print 2 ]

W->S2 [ print 3 }, what is the translation of x x x x y z z? (A) 1 1 2 3 1 (B) 1 1 2 3 3 (C) 2 3 1 3 1 (D) 2 3 3 2 1 Ans:- C 34. Context-free Grammar(CFG) can be recognized by (A) Finite state automata (B) 2-way linear bounded automata (C ) push down automata (D ) Both (B) and (C) Ans:- D 35. Synthesized attribute can be easily simulated by a (A) LL grammar (B) Ambiguous grammar (C ) LR grammar (D) None of the above Ans:- C 36. In the process management Round-robin method is essentially the pre-emptive version of _______________. (A) FILO (B) FIFO (C ) SSF (D) Longest time first Ans:- B 37. A page fault (A) is an error specific page (B) is an access to the page not currently in memory (C ) occur when a page program occur in a page memory. (D ) page used in the previous page reference. Ans:- B 38. A semaphore count of negative n means (s=-n) that the queue contains ___n__________ waiting processes. (A) n + 1 (B) n (C) n 1 (D) 0 Ans:- B 39. A program is located in the smallest available hole in the memory is ______________ (A) best-fit (B) first-bit (C ) worst-fit (D ) buddy Ans:- A 40. The unix command used to find out the number of characters in a file is (A) nc (B) wc (C ) chcnt (D) lc Ans:- B 41. Software Engineering is a discipline that integrates __________ for the development of computer software. (A) Process (B) Methods (C ) Tools (D) All Ans:- D

42. Any error whose cause cannot be identified anywhere within the software system is called _________________. (A) Internal error (B) External error (C ) Inherent error (D) Logic error Ans:- B 43. Recorded software attributes can be used in the following endeavours: (i) Cost and schedule estimates. (ii) Software product reliability predictions (iii )Managing development process (iv). No where Codes: (A) (i) (ii) (iv) (B) (ii) (iii) (iv) (C) (i) (ii) (iii) (D) (i) (ii) (iii) (iv) Ans :- C 44. Black box testing is done (A) To show that s/w is operational at its interfaces i.e. input and output. (B) To examine internal details of code (C) At client side (D) None of the above Ans:- A 45. The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called (A) Batch.exe (B) Trans.exe (C ) Opt.exe (D) Edit.exe Ans:- C 46. The single stage network is also called (A) One sided network (B) two sided network (C ) recirculating network (E) pipeline network Ans:- C. The single stage network is also called a recirculating network. 47. Analysis of large database to retrieve information is called (A) OLTP (B) OLAP (C ) OLDP (D) OLPP Ans:- B 48. Which technology is sometime referred to as wireless cable? (A) MMDS (B) ATM (C ) LMDS (D) CDMA Ans:- A. MMDS stands for multipoint multichannel distribution system. MMDS is a broadband wireless technology. 49. Another name of IEEE 802.11 a is ______________ (A) Wi-Max (B) Fast Ethernet (C) Wi-fi (D) 802.11 g

Ans:- C. IEEE 802.11 standards provide the basis for Wi-fi networks. 50. The unlicensed National Information Infrastructure band operates at the ____________frequency (A) 2.4 GHz (B) 5 GHz (C ) 33 MHz (D) 5 MHz Ans:- B

1. The number of integers between 1and 250 that are divisible by 2, 5 and7 is (B) 3 2.An undirected graph possesses an eulerian circuit if and only if it isconnected and its vertices are (A) all of even degree 3. A partially ordered set is said to be a lattice if every two elements in the set have (C) Both A and B 4. The minimum number of edges in a connected graph with n vertices is equal to (D) n-1 5. Consider the problem of connecting 19 lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required is (C) 6 Here m-ary tree equation is coonsidered i.e. (m-1)i = t - 1 therefore, (4-1) i = 19 - 1 = 6 6. The decimal number equivalent of (4057.06)8 is (D) 2095.0937 8. An astable multivibrator has (C) No stable states 9. 12-bit 2s complement of 73.75 is (C) 10. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is (A) 11. How many of the following declarations are correct ? int z = 7.0; double void = 0.000; short array [2] = {0, 1, 2}; char c = \n; Answer .. (C) cant assign char in double quotes and keword cant be a variable name.

13. Posted by Gurveen at 10:23 0 comments Email ThisBlogThis!Share to TwitterShare to Facebook Friday, 30 March 2012 DBMS

In DBMS, there could be a question on different steps in normalization and what is achieved at the end of every step in it.You need to be knowing the following things very clearly and without any ambiguity.The question would be based on these terms. A table is in 1NF if there and no duplicate rows in the table. Each cell is single-valued. A table is in 2NF if it is in 1NF and if all non-key attributes are dependent on all of the key. A table is in 2NF if it is in 1NF and if it has no partial dependencies A table is in 3NF if it is in 2NF and if it has no transitive dependencies A table is in BCNF if it is in 3NF and if every determinant is a candiate key. A table is in 4NF if it is in BCNF and it it has no multi-valued dependencies. A table is in 5NF if it is in 4NF and it has no join dependency. Superkey,Candidate key,Primary key A superkey is any set of attributes such that the values of the attributes(taken together)uniquely identify one entity in the entity set. A candidate key is a minimal superkey. A primary key is one of the candidate keys, designated by the Database designer.

UGC NET SOLVED COMPUTER SCIENCE - PAPER II This section is for all those NET exam aspirants who are looking out for a solution for UGC NET computer science papers. As a person who had taken the examination i have searched the internet incessantly for the solution of paper-II and paper-III of computer science. Since i could not find any solid help(or rather no help at all) in this regard, i had decided to write my own blog posting the solution for each and every paper as and when i complete it. I have posted the solution for paper-II of December 2008(and it was quite a task). Wherever i could, i have given explanation for the answers. If it is too lengthy or too simple, i have left it out. Enjoy your preparation for the NET exam. I just have one word of advice for all NET aspirants... "Focus on the journey, not the destination. Joy is found not in finishing an activity but in doing it.

1. The channel capacity of a band-limited Gaussian channel is given by (A). B log2 (2+S/N) (B) B log2 (1+S/N) (C ).B log10(1+S/N) (D). B loge(1+S/N) Ans : B. Explanation :- C=B log2 (1 + S/N) where C is the capacity in bits per second. B is the bandwidth of the channel in Hertz and S/N is the signal to noise ratio.

2. The graph K 3,4 has _______ edges. (A). 3 edges (B) 4 edges (C ). 7 edges (D) 12 edges Ans : D. A bipartite graph is a complete bipartite graph if every vertex in U is connected to every vertex in V. If U has n elements and V has m, then the resulting complete bipartite graph can be denoted by K n,m and the number of edges is given by n*m. The number of edges = K 3,4 = 3 * 4 = 12

3. The total number of spanning trees that can be drawn using five labeled vertices is: (A). 125 (B).64 (C ). 36 (D). 16 Ans : A. According to cayleys formula for counting spanning trees, for a complete graph Kn, T(Kn)= n n-2 where n is the number of vertices. T(k5)=5 5-2=5 3= 5 * 5 * 5=125

4. Extremely low power dissipation and low cost per gate can be achieved in (A) MOS ICS (B) C MOS ICS (C ) TTL ICS (D) ECL ICS Ans : B. CMOS ICS

5. An example of a universal building block is : (A). EX-OR Gate (B). AND Gate (C ). OR gate (D). NOR Gate Ans:- D. Universal gates are the ones which can be used for implementing any gate like AND,OR and NOT or any combination of these basic gates. Apart from the NOR gate, NAND gate is also considered as universal gate.

6. An example of a layer that is absent in broadcast networks is : (A). Physical layer (B). Presentation layer (C ). Network layer (D). application layer Ans : C. 7. The ATM cell is : (A). 48 bytes long (B). 53 bytes long

(C ). 64 bytes long (D). 69 bytes long Ans: B. An ATM cell always consists of a 5-byte header followed by a 48-byte payload. So the size is 53 bytes long. 8. Four jobs J1,J2,J3, and J4 are waiting to be run. Their expected run times are 9,6,3 and 5 respectively. In order to minimize average response time, the jobs should be run in the order: (A). J1 J2 J3 J4 (B). J4 J3 J2 J1 (C ) J3 J4 J1 J2 (D) J3 J4 J2 J1 Ans : D 9. Suppose it takes 100ns to access page table and 20 ns to access associative memory. If the average access time is 28ns, the corresponding hit rate is: (A). 100 percent (B). 90 percent (C ). 80 percent (D). 70 percent Ans : B 10. Transmission of N signals , each band limited to Fm Hz by TDM, requires a minimum bandwidth of (A).fm (B) 2 fm (C ) N fm (D) 2N fm Ans : C. Minimum transmission band-width of TDM channel is given by the following equation. Bt=NW Where N is the total number of channels, which are bandlimited to W Hz. In the above problem, the number of signals are N, each band limited to Fm Hz and so the minimum bandwidth is N fm. 11. If a code is t error detecting, the minimum hamming distance should be equal to : (A). t-1 (B). t (C ). t+1 (D). 2t+1 Ans: C. To guarantee the detection of upto s errors in all cases, the minimum hamming distance in a block code must be dmin=s+1 So, the minimum hamming distance for a t error detecting must be t+1

12. A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. The relation is : (A) Reflexive (B). symmetric (C ). Transitive (D). not reflexive, not symmetric and not transitive Ans:- D.

13. The dual of the switching function x+yz is: (A). x+yz (B). x+yz (C ). x(y+z) (D). x(y+z) Ans:- D

14. The characteristic equation of D-flip flop is : (A). Q=1 (B). Q=0 (C ). Q=D (D). Q=D Ans: D.

15. If four 4 input mulitplexers drive a 4 input multiplexer we get a : (A). 16 input MUX (B). 8 input MUX (C ). 4 input MUX (D). 2 input MUX Ans:- A

16. The throughput of slotted ALOHA is given by: (A). S=G (B). S=GeG (C ). S=Ge-G (D). S=eG Ans: C

17. Congestion control is done by (A). Network layer (B). Physical layer (C ). Presentation layer (D). Application layer Ans:- A. Addressing, internetworking, error handling, packet sequencing are its other jobs.

18. Assertion(A): Twisted pairs are widely used as transmission medium. Reasoning(R ): Twisted pairs have adequate performance and low cost. (A). Both (A) and (R ) are true and (R ) is the correct explanation for (A). (B). Both (A) and (R ) are true but (R ) is not the correct explanation (C ). (A) is true but (R ) is false (D). (A) is false but (R ) is true Ans:- A. Page No .91 of Tanenbaum book, you will find the following statement. Due to their adequate performance and low cost, twister pairs are widely used and are likely to remain so for years to come.

19. An example of a non-adaptive routing algorithm is: (A). Shortest path routing (B). Centralised routing (C ). Barans hot potato algorithm (D). Barans backward learning algorithm Ans:- A. Shortest path routing.

20. IP address in B class is given by: (A). 125.123.123.2 (B). 191.023.21.54 (C ). 192.128.32.56 (D). 10.14.12.34 Ans:- B

21. N processes are waiting for I/O. A process spends a fraction of its time in I/O wait state. The CPU utilization is given by: (A). 1-P N (B). 1 P N (C ). P N (D). P -N Ans:B. According to the probabilistic model, if a process spends a fraction p of its time in I/O wait state, and if there are N processes in memory, then the CPU utilization is given by 1-PN

22. If holes are half as large as processes, the fraction of memory wasted in holes is: (A) 2 / 3 (B). 1 / 2 (C ). 1 / 3 (D). 1 / 5 Ans : D

23. An example of a non-premptive scheduling algorithm is: (A). Round robin (B). Priority scheduling (C ). Shortest job first (D). 2 level scheduling Ans: C 24. An example of a distributed OS is: (A). Amoeba (B). UNIX (C ). MS DOS (D). MULTICS Ans: A 25. Which one of the following correctly describes a static variable: (A). It cannot be initialized. (B). It is initialized once at the commencement of execution and cannot be changed during run time. (C ). It retains its value during the life of the program. (D). None of the above Ans: C 26. The output of the program code main() { int x = 0; while ( x < = 10) for(;;) if (++x%10==0) break; printf(x=%d,x); } is: (A). x = 1 (B). compilation error

(C ). x = 20 (D) none of the above Ans:- C. For the while statement there is a for loop inside. For the for loop, there is one if condition, based on which there is a break statement. Since the value of x initially is 0, the while condition would be true and the for loop would start executing. The if statement condition would be checked, since ++x would become 1 and 1%10 is not equal to 0, break will not be executed. Since for is infinite x value will go on increasing. Once the value of x reaches 9, ++x would become 10 and 10%10==0 and so break would be executed. So control will come out of the innermost loop and would go to the outer loop. Sinc the value of x is 10, and since it is equal to 10, once again the for loop would start its execution. Once the value of x reaches 20, 20%10 will be equal to 0 and again break will be executed and control would go to the outer for loop. When the condition is checked for x<=10,it is false as the value of x is 20 and so it comes out of the while loop and the printf statement gets executed, printing the value of 20. Whew!!!!! 27. A copy constructor is invoked when : (A). a function returns by value (B). an argument is passed by value (C ). A function returns by reference (D). none of the above Ans:- B 28. When a language has the capability to produce new data types, it is said to be : (A). extensible (B). encapsulated (C ). Overloaded (D). none of the above Ans:-A 29. How many constructors can a class have? (A) Zero (B) 1 (C ) 2 (D) any number Ans:- D 30. An entity has: (i) a set of properties (ii) a set of properties and values for all the properties (iii) a set of properties and the values for some set of properties may non-uniquely identify an entity (iv) a set of properties and the values for some set of properties may uniquely identify an entity Which of the above are valid? (A) (i) only (B) (ii) only (C ) (iii) only (D) (iv) only Ans:- D 31. Aggregation is: (A) An abstraction through which relationships are treated as lower level entities (B) An abstraction through which relationships are treated as higher level entities (C) An abstraction through which relationships are not treated at all as entities (D) None of the above Ans:- B 32. Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 forma a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that : (A) R1R2 ->R1 is in F+ (B) R1 R2->R2 is in F+ (C) Both R1 R2->R1 and R1 R2->R3 functional dependencies are in F+ (D)At least one from R1R2->R1 and R1 R2->R2 is in F+ Ans:- D.

33. In a heap, every element is ________________ of all the elements in the subtree. (A) Maximum (B) minimum (C ) sum (D) product Ans:- A 34. If (rear == maxsize 1) rear=0; else rear=rear+1; is required in : (A) circular queue (B) linear queue (C) stack (D) deque

Ans:- D 35. A high performance switching and multiplexing technology that utilizes fixed length packets to carry different types of traffic is : (A) ATM (B) ADSL (C) SONET (D) None of the above Ans:- A

36. A conventional LAN bridge specifies only the functions of OSI: (A) Layers 1 and 2 (B) layers 1 through 3 (C) all layers (D) none of the above Ans:- A.

37. An assembly program contains: (A) Imperative and declarative statements (B) Imperative statements and assembler directives (C) Imperative and declarative statements as well as assembler directives (D) Declarative statements and assembler directives Ans:- C. Assembly program consists of three types of statements. 1. Imperative 2. Declarative 3. Assembler directives 38. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of a register? (A) Absolute mode (B) immediate mode (C) indirect mode (D) index mode Ans:- D

39. Which of the following are Assembler directives? (i) EQU (ii) ORIGIN (iii) START (iv) END (A) (ii),(iii) and (iv) (B) (i),(iii) and (iv) (B) (iii) and (iv) (D) (i),(ii),(iii) and (iv) Ans:- D

40. Which of the following OS treats hardware as a file system? (A) UNIX (B) DOS (C) Windows NT (D) none of the above Ans:- A. 41. In which of the following, ready to execute processes must be present in RAM? (A) Multiprocessing (B) multiprogramming (C) multitasking (D) all of the above

42. If the executing program size is greater than the existing RAM of a computer, it is still possible to execute the program if the OS supports:

(A) Multitasking (B) virtual memory (C) paging system (D) none of the above Ans: B

43. Software Quality Assurance (SQA) encompasses: (A) Verification (B) validation (C) both verification and validation (D) none of the above 44. Which level is called as defined in capability maturity model? (A) Level 0 (B) level 3 (C) level 4 (D) level 1 Ans:- B

45. COCOMO model is used for: (A) Product quality estimation (B). product complexity estimation (C) product cost estimation (D) all of the above Ans: C

46. Font sizes are usually expressed in points. One point is: (A) 0.0069 inch (B) 0.0138 inch (C) 0.0207 inch (D0 0.0276 inch Ans:- B. One point is 1/72 of an inch and so we will get the answer 0.0138 inch.

47. Assertion (A): Cellular telephone systems can handle a multitude of users. Reasoning(R ): Cellular telephone systems permit extensive frequency reuse in a small local area. (A) Both (A) and (R ) are true and (R ) is the correct explanation for (A) (B) Both (A) and (R ) are true but (R ) is not the correct explanation (C) (A) is true but (R ) is false (D) (A) is false but (R ) is true Ans:- A.

48. E-Commerce involves: (A)Electronic Data Interchange (B) Electronic mail (C) Electronic Bulletin boards (D) All of the above Ans:- D. E-commerce involves paperless transactions and usage of EDI(Electronic Data Interchange), electronic mail, bulletin boards, fax transmission and electronic fund transfers.

49. An example of a data mining algorithm which uses squared error score function is: (A) CART algorithm (B) back propagation algorithm (C) a priori algorithm (D) vector space algorithm

Ans:- B. Back propagation algorithm uses squared error score function. CART algorithm uses cross-validated loss function.

50. (I) Each object in the active directory of windows 2000 has an access control list. (II) The scheme is a blueprint of all objects in the domain of windows 2000. Which of the following is true? (A) Only (I) (B) only (II) (C) both (I) and (II) (d) none of the above Ans:- C DECEMBER 2009 PAPER II SOLVED

1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ________________. (i) Commutative (ii) transitive (iii) implicative (iv) equivalence (A) (i) and (ii) (B) (iii) (C) (i),(ii),(iii) and (iv) (D) None of these Ans:- D 2. Circle has ________ (A) No vertices (B) only 1 vertex (C) vertices (D) None of these Ans :- A 8. The highest noise margin is offered by (A) BICMOS (B) TTL (C) ECL (D) CMOS Ans:- B 9. The answer of the operation (10111)2 * (1110)2 in hex equivalence is (A) 150 (B) 241 (C) 142 (D) 101011110 Ans:- C 10. How many 1 are present in the binary representation of 3 X 512 + 7 X 64 + 5 X 8 + 3 (A) 8 (B) 9 (C) 10 (D) 11 Ans:- B 11. Recursive functions are executed in a (A) First in first out order (B) Last in first out order (C ) Parallel fashion (D) Load Balancing Ans: B 12. What would be the output of the following program, if run from the commandline as myprog 1 2 3? main(int argc,char *argv[]) { int i;

i=argv[1]+argv[2]+argv[3]; printf(%d,i); } (A) 123 (B) 6 (C) Error (D) 123 Ans:- C 13. A ________________ is a special method used to initialize the instance variable of a class. (A) Member function (B) Destructor (C) Constructor (D) structure Ans:- C 14. Encapsulation is (A) Dynamic binding (B) A mechanism to associate the code and data (C ) Data abstraction (D ) Creating new class Ans:- B 15. Which of the statements are true? I. Function overloading is done at compile time. II. Protected members are accessible to the member of a derived class. III. A derived class inherits constructors and destructors IV. A friend function can be called like a normal function. V. Nested class is a derived class. (A) I,II,III (B) II,III,V (C) III,IV,V (D) I,II,IV Ans:- D 16. The E-R model is expressed in terms of I. Entities II. The relationship among entitites III. The attributes of the entities. IV. Functional relationship. (A) I,II (B) I,II, IV (C) II,II,IV (D) I,II,IV Ans:- D 17. Specialization is ________________process. (A) top-down (B) bottom up (C ) both (A) and (B) (D) none of these Ans:- A 18. Match the following: (1) Determinants (a) No attributes (2) Candidate key (b) Uniquely identified a row (3) Non-redundancy (c ) A constraint between two attributes (4) Functional dependency (d) Group of attributes on the left hand side of arrow of function dependency (A) 1 d, 2 b, 3 a, 4 c

(B) 2 d, 3 a, 1- b, 4 c (C) 4 a, 3 b, 2 c, 1 d (D) 3 a, 4 b, 1 c, 2 d Ans:- A. 19. A function that has no partial functional dependencies is in _____________ form. (A) 3 NF (B) 2 NF (C) 4 NF (D) BCNF Ans:- B 20. Which of the following statement is wrong? I. 2-phase locking protocol suffer from dead lock. II. Time stamp protocol suffer from more aborts. III. A block hole in a DFD is a data store with only inbound flows. IV. Multivalued dependency among attribute is checked at 3 NF level. V. An entity-relationship diagram is a tool to represent event model. (A) I ,II,III (B) II,III,IV (C) III,IV,V (D) II,IV,V Ans:- A 21. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in a tree? (A) It is an odd number. (B) It is an even number. (C ) It cannot be equal to the number of leaves. (D ) It is always greater than twice the number of leaves. Ans:- A. Strictly binary tree with N leaves contains 2N-1 nodes. So when the number of leaves is odd number then the total number of nodes in the tree also will be odd if we apply the above formula. 22. The number of edges in a complete graph of n vertices is (A) n (B) n(n-1)/2 (C ) n(n+1)/2 (D) n2/2 Ans:- B. The complete graph on n vertices has n(n-1)/2 edges. 23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car cant leave until all the cars in front of it have left. Is the parking lot more like (A) An array (B) A stack (C) A queue (D) A linked list Ans:- C. 24. With regard to linked list, which of the following statement is false ? (A) An algorithm to search for an element in a singly linked list requires O(n) operations in the worst case. (B) An algorithm for deleting the first element in a singly linked list requires o(n) operations in the worst case. (C ). An algorithm for finding the maximum value in a circular linked list requires o(n) operations. (D ). An algorithm for deleting the middle node of a circular linked list requires o(n) operations.

Ans:- B 25. A hash function f defined as f(key)=key mod 7, with linear probing used to resolve collisions. Insert the keys 37,38,72,48,98 and 11 into the table indexed from 0 to 6. What will be the location of 11? (A) 3 (B) 4 (C ) 5 (D) 6 Ans:- C 26. Device on one network can communicate with devices on another network via a (A) Hub/switch (B) Utility server ( C) File server (D) Gateway Ans:- D 27. What is the maximum window size in sliding window protocol used in a computer network? (A) 4 (B) 8 (C ) 15 (D) 16 Ans:- A 28. Which of the following are Data Link Layer standard? 1. Ethernet 2. HSSI 3. Frame Relay 4. 10-Base T 5. Token Ring (A) 1,2,3 (B) 1,3,5 (C) 1,3,4,5 (D) 1,2,3,4,5 Ans:- C 29. In case of Bus/Tree topology signal balancing issue is overcome by (A) Modulation (B) Polling (C ) Segmentation (D) Strong transmitter Ans:- C 30. Match the following: (i) Ethernet (a) Deterministic (ii) Token Ring (b) Utilize the full wire speed (iii) Cut-through switch (c ) Prevent Looping (iv) Spanning tree (d) Checking valid address Codes: (A) i-d,ii-a,iii-b,iv-c (B) i-a,ii-d,iii-b,iv-c (C ) i-d,ii-d,iii-c,iv-b (D) i-d,ii-c,iii-b,iv-a Ans:- A 31. In an absolute loading scheme which loader function is accomplished by assembler? (A) re-allocation (B) allocation (C ) linking (D) loading Ans:- A. Implementation of Absolute loader: The four loader functions are performed as following: 1.Allocation- By programmer 2.Linking- By programmer 3.Relocation- By assembler 4.Loading- By loader 32. Which of the following grammar is LR(1)? (A) A->aAb, A->bAb,A->a,A->b

(B) A->aAa,A->aAb,A->c (C ) A->A+A,A->a (D)Both (A) and (B) 33. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar. S->xxW[ print 1 ] S->y [ print 2 ] W->S2 [ print 3 }, what is the translation of x x x x y z z? (A) 1 1 2 3 1 (B) 1 1 2 3 3 (C) 2 3 1 3 1 (D) 2 3 3 2 1 Ans:- C 34. Context-free Grammar(CFG) can be recognized by (A) Finite state automata (B) 2-way linear bounded automata (C ) push down automata (D ) Both (B) and (C) Ans:- D 35. Synthesized attribute can be easily simulated by a (A) LL grammar (B) Ambiguous grammar (C ) LR grammar (D) None of the above Ans:- C 36. In the process management Round-robin method is essentially the pre-emptive version of _______________. (A) FILO (B) FIFO (C ) SSF (D) Longest time first Ans:- B 37. A page fault (A) is an error specific page (B) is an access to the page not currently in memory (C ) occur when a page program occur in a page memory. (D ) page used in the previous page reference. Ans:- B 38. A semaphore count of negative n means (s=-n) that the queue contains ___n__________ waiting processes. (A) n + 1 (B) n (C) n 1 (D) 0 Ans:- B 39. A program is located in the smallest available hole in the memory is ______________ (A) best-fit (B) first-bit (C ) worst-fit (D ) buddy Ans:- A

40. The unix command used to find out the number of characters in a file is (A) nc (B) wc (C ) chcnt (D) lc Ans:- B 41. Software Engineering is a discipline that integrates __________ for the development of computer software. (A) Process (B) Methods (C ) Tools (D) All Ans:- D 42. Any error whose cause cannot be identified anywhere within the software system is called _________________. (A) Internal error (B) External error (C ) Inherent error (D) Logic error Ans:- B 43. Recorded software attributes can be used in the following endeavours: (i) Cost and schedule estimates. (ii) Software product reliability predictions (iii )Managing development process (iv). No where Codes: (A) (i) (ii) (iv) (B) (ii) (iii) (iv) (C) (i) (ii) (iii) (D) (i) (ii) (iii) (iv) Ans :- C 44. Black box testing is done (A) To show that s/w is operational at its interfaces i.e. input and output. (B) To examine internal details of code (C) At client side (D) None of the above Ans:- A 45. The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called (A) Batch.exe (B) Trans.exe (C ) Opt.exe (D) Edit.exe Ans:- C 46. The single stage network is also called (A) One sided network (B) two sided network (C ) recirculating network (E) pipeline network Ans:- C. The single stage network is also called a recirculating network. 47. Analysis of large database to retrieve information is called (A) OLTP (B) OLAP (C ) OLDP (D) OLPP

Ans:- B 48. Which technology is sometime referred to as wireless cable? (A) MMDS (B) ATM (C ) LMDS (D) CDMA Ans:- A. MMDS stands for multipoint multichannel distribution system. MMDS is a broadband wireless technology. 49. Another name of IEEE 802.11 a is ______________ (A) Wi-Max (B) Fast Ethernet (C) Wi-fi (D) 802.11 g Ans:- C. IEEE 802.11 standards provide the basis for Wi-fi networks. 50. The unlicensed National Information Infrastructure band operates at the ____________frequency (A) 2.4 GHz (B) 5 GHz (C ) 33 MHz (D) 5 MHz Ans:- B Posted by Vani Chakraborty at 23:20 17 comments Email ThisBlogThis!Share to TwitterShare to Facebook UGC SOLVED PAPERS Monday, 4 June 2012 Dec-2010

Wednesday, 30 May 2012 June 2010 7. Advantage of synchronous sequential circuits over asynchronous ones is: (A) Faster Operation 9. What is decimal equivalent of BCD 11011.1100 ? (B) 22.2 13. Member of a class specified as _______ are accessible only to method of the class. (A) Private 15. The data type created by the data abstraction process is called (C) Abstract data type 16. An entity instance is a single occurrence of an --------(A) Entity 17. Generalization is _______ process. (B) Bottom up 18. Match the following : I. 2 NF II. 3 NF (a) transitive dependencies eliminated (b) multivalued attribute removed

III. 4 NF IV. 5 NF (B) I-d, II-a , III-b, IV- c

(c) contain no partial functional dependencies (d) contains no join dependency

19. Which data management language component enabled the DBA to define the schema components ? (C) Schema DLL 21. If we have six stack operationspushing and popping each of A, B and C-such that push (A) must occur before push (B) which must occur before push (C), then A, C, B is a possible order for the pop operations, since this could be our sequence : push (A), pop (A), push (B), push (C), pop (C), pop (B). Which one of the following orders could not be the order the pop operations are run, if we are to satisfy the requirements described above ? (D) CAB 22. What is the most appropriate data structure to implement a priority queue ? (A) Heap 23. In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as ! (B) About 2 log n 26. The ______ field is the SNMP PDV reports an error in a response message. (A) Error Index 27. What does the URL need to access documents ? (B) pathname, DNS, Server port number 28. End-to-End connectivity is provided from Last-to-Last in (C) Trasnsport Layer 30. What is the maximum operating rate of a wireless LAN using infrared communication ? (A) 1mbps 31. In an absolute loading scheme, which loader function is accomplished by a loader ? (D) Loading 32. Which of the following expression is represented by the parse tree ? (A) 33. Consider the following left associative operators in decreasing order of precedence : subtraction (highest precedence)

*multiplication $ exponentiation (lowest precedence) What is the result of the following expression ? 3 2 *4 $ | * 2**3 (D) 4096 34. Which of the following is the most general phase structured grammar ? (B) Context - Sensitive 37. ________ synchronizes critical resources to prevent dead lock. (C) Semaphore 38. _______ is one of pre-emptive scheduling algorithm (A) RR 39. In order to allow only one process to enter its critical section, binary semaphore are initialized to (B) 1 40. Remote Computing Service involves the use of time sharing and _______. (C) Batch Processing 41. Software engineering primarily aims on (C) reliable and cost effective software 42. Top-down design does not require (B) Loop invariants 43. Which model is simplest model in Software Development ? (A) Waterfall Model 44. Design phase will usually be (A) Top down 45. Applications-software (C) performs a specific task for computer users. 46. The cost of the network is usually determined by (B) Switching Complexity 47. A leased special high-speed connection from the local telephone carrier for business users that transmits at 1.544 mb is known as (A) T1 carrier 48. CDMA Cell uses ________ carriers of 1.25 MHz.

(A) 9 49. At any given time Parallel Virtual Machine (PVM) has ________ send buffer and ________ receive buffer (B) one - two 50. Posted by Gurveen at 11:16 0 comments Email ThisBlogThis!Share to TwitterShare to Facebook Sunday, 27 May 2012 Dec-2009 1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is : (D) None 2. Circle has -----(A) No vertices 6. The simplified form of Boolean Expression (X+y+Xy) (X+Z) (C) X+yZ) 8.The highest noise margin is offered by : (B) TTL 10.How many 1's are present in binary representation of 3*512+7*64+5*8+3 (B) 9 11.Recursive functions are executed in: (B) LIFO 12. What would be the output of the following program, if run from the command line as "myprog 1 2 3"? main(int argc,char *argv[]) int i; i=argv[1]+argv[2]+argv[3]; printf("%d",i); } (C) Error 13. A ------ is a special method used to initialize the instance variable of a class: (C) Constructor 15. Which of the statements are true? (D)

16. The ER model is expressed in terms of : (B) 17. Specialization is ----------- process. (A) top down 19. A function that has no partial functional dependencies is in ------- form : (B) 2NF 21. If no. of leaves in a strictly binary tree is an odd no., then what can you say with full conviction about total no.of nodes in the tree. (A) Its an odd number (there are 2n-1 nodes) 22. The number of edges in a complete graph is: (B) n(n-1)/2 23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car cant leave until all the cars in front of it have left. Is the parking lot more like (C) queue 26. Device on one network can communicate with devices on another network via a (D) Gateway 27. What is the maximum window size in sliding window protocol used in a computer network ? (A) 4 28. Which of the following are Data Link Layer standard ? 1. Ethernet 2. HSSI 3. Frame Relay 4. 10 Base T 5. Token Ring (C) 1,3,4,5 29. In case of Bus/Tree topology signal balancing issue is overcome by (C) Segmentation 30. Match the following : (i) Ethernet (ii) Token Ring (iii) Cut-through switch (iv) Spanning tree (A) 1-d,2-a,3-b,4-c 31. In an absolute loading scheme which loader function is accomplished by assembler ? (A) Reallocation (Allocation and linking are done by a programmer)

(a) Deterministic (b) Utilize the full wire speed (c) Prevent looping (d) Checking valid address

32. Which of the following grammar is LR (1) ? (D) Both A and B 33. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar. S x x W [ print 1] S y [print 2] W S2[print 3], what is the translation of x x x x y z z ? (C) 2 3 1 3 1 34. Contex-free Grammar (CFG) can be recognized by (D) Both B and C 35. Synthesized attribute can be easily simulated by a (C) LR Grammer 36. In the process management Round-robin method is essentially the pre-emptive version of _________ (B) FIFO 37. A page fault (B) is an access to page not currently in memory 38. A semaphore count of negative n means (s = n) that the queue contains ________ waiting processes. (B) n 39. A program is located in the smallest available hole in the memory is _________ (A) Best fit 40. The Unix command used to find out the number of characters in a file is (B) wc 41. Software Engineering is a discipline that integrates _________ for the development of computer software. (D) ALL 44. Black Box testing is done (A) 45. The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called (C) opt.exe 46. The single stage network is also called

(C) Recirculating Network 47. Analysis of large database to retrieve information is called (B) Olap 48. Which technology is sometime referred to as wireless cable ? (A) MMDS 49. Another name of IEEE 802.11 a is ____________ (C) Wi-fi 50. The unlicensed National Information Infrastructure band operates at the _________ frequency (B) 5 Ghz Posted by Gurveen at 10:57 0 comments Email ThisBlogThis!Share to TwitterShare to Facebook Thursday, 24 May 2012 June 2009 2. In order that a code is 't' error correcting, the minimum hamming distance should be : (D) 2t+1 4. Characteristic equation of JK Flip-flop is : (B) Q(n+1)=JQ'+K'Q 5. In order to implement a n variable switching function, a MUX must have : (A) 2 power n 6. The throughput of pure ALOHA is given by : (D) Ge power -2g 7. The fiber distributed Data interface uses: (B) Multimode fibres and LED's 8. To employ multi-access in GSM, users are given different : (D) frequency bands 9. With a four programs in memory, and with 80% average I/O wait, the CPU utilization is : (A) 60% CPU utilization is given by 1-p to power n. Here n=4 and p=80%=0.8. 10. Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is : (A) NP/2 bytes 12. The complete graph with four vertices has k edges , where k is : (D) 6

k=n(n-1)/2 13. The octal equivalent of hexadecimal (A.B) is: (B)12.54 In hexa decimal A=10 and B=11, now A.B means1010.1011 => 001 010.101 100 = > 1 2. 5 4 = > 12.54 15. What is the value of 'b' after execution of following code statements: c = 10; b = ++c + ++c; (D) None (bcoz, if a variable comes twice or more in one statement the answer is compiler dependent) 16 Which of the following does not represent a valid storage class in 'C'? (C) Union 18. DML includes a query language based on both relational algebra and tuple calculus. True 19. Suppose it takes 100ns to access a page table, and 20 ns to access associative memory, with a 90% hit rate, the average access time equals (B) 28 ns access time = associative memory * hit ratio + time for main memory (1-hit ratio) 20. There exist a construct which returns a value 'true'if the argument subquery is : (B) Non - Empty 21. Which construct in SQL is used to test whether a subquery has tuples in its result? (A) Unique 23. Which two of the following are equivalent for undirected graph G? (D) 24. In a B tree of order m with p nodes the average number of splits is atmost : (B) m/2 - 1 26. Queue is a ------- list. (A) LIFO 28. A binary tree is said to have heap property if the elements along any path : (D) from root to leaf are non increasing 31. Usually information in a network is achieved by : (B) Cryptography 33. In which addressing mode the operand is given explicitly in the instruction itself : (B) Immediate mode

34. A compiler that runs on one machine and produces code for a different machine is called: (A) Cross compilation 37. Which of the following changes permissions to deny write permission to group and others? (A) chmod go -w filex 39. Capability maturity model is meant for : (B) Process 40. In the light of software engineering software consists of : (D) All (Programs , data and documentation) 41. Which one of the following ISO Stamdard is used for software process? (C) ISO 9003 42. Which of the following is used for test data generation? (C) Boundary value Analysis 43.Reverse Engineering is the process which deals with : (C) Design Recovery 44. The spacing between character pairs is called : (A) Kerning 46. E-commerce includes : (D) All (b2b, b2c, c2c) 47. A clustering technique that permits a convenient graphical display is : (C) Hierarchical Clustering 48. After sending a message,the sender should not be able to , at a later date , deny having sent the message is referred to as: (B) Non-Repudiability 50.We cannot delete the ------ icon but make it invisible : (A) Recycle

December 2004

December 2004

1 1 2 3 4 C B

2 B C B D

3 C B C

4 B A A A

6 C D

7 D A

8 D B

9 D

10 A

A D A C C

June 2005 1 B D D C B 2 C D B B D 3 C B D 4 5 C C 6 B A C 7 C 8 D 9 C C B 10 C

1 2 3 4 5

A B

Posted by Gurveen at 01:23 0 comments Email ThisBlogThis!Share to TwitterShare to Facebook Introduction Hello All, This blog is created for those who are preparing for UGC-NET in Computer Science.Its high time to prepare for UGC as from June-2012 UGC exam is going to be objective.Computer Science is known to be tough as compare to other subjects, this is due to a drastic changes in technologies. As we all know advancement in computers is taking place year by year. Whenever we start preparing for UGC, we first go thru' the previous year question papers that are normally available on ugc website, but when we try to find answers to them, we hardly get them or we keep on searching through various search engines that consumes time. Therefore there is a little effort put on to give you answers to the previous year question papers. I have found answers to most of them but not all. Thank you.!! Posted by Gurveen at 00:32 0 comments Email ThisBlogThis!Share to TwitterShare to Facebook Home Subscribe to: Posts (Atom)

Q.What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above

Q.What was originally called the "imitation game" ? A. LISP B. The Logic Theorist C. The Turing Test D. Cybernetics
Q.What stage of the manufacturing process has been described as "the mapping of function onto form"? A. Design B. Distribution C. project management D. field service E. None of the above

Q.Decision support programs are designed to help managers make:A. budget projections B. visual presentations C. business decisions D. vacation schedules

Q. PROLOG is an AI programming language . It was developed in 1972 at the University of Marseilles by a team of specialists. Can you name the person who headed this team? A. Alain Colmerauer B. Nicklaus Wirth C. Seymour Papert D. John McCarthy

Q.Programming a robot by physically moving it through the trajectory you want it to follow is called: A. contact sensing control B. continuous-path control

C. robot vision control D. pick-and-place control

Q.To invoke the LISP system, you must enter A. AI B. LISP C. CL (Common Lisp) D. both b and c

Q.In a rule-based system, procedural domain knowledge is in the form of: A. production rules B. rule interpreters C. meta-rules D. control rules

Operating Systems Questions

1) The high paging activity is called ________. 1 Inter process communication 2 Thrashing 3 Context Switch 4 None of the above 2) The Hardware mechanism that enables a device to notify the CPU is called __________. 1 Polling 2 Interrupt 3 System Call 4 None of the above 3) In the running state 1 only the process which has control of the processor is found 2 all the processes waiting for I/O to be completed are found 3 all the processes waiting for the processor are found 4 none of the above 4) Which of the following is crucial time while accessing data on the disk? 1 Seek time 2 Rotational time 3 Transmission time

4 Waiting time 5) Process State is a part of 1 Process Control block 2 Inode 3 File Allocation Table 4 None of the above 6) Who is called a supervisor of computer acitvity ? 1 CPU 2 Operating system 3 Control unit 4 Application Program 7) Virtual memory is __________. 1 An extremely large main memory 2 An extremely large secondary memory 3 An illusion of extremely large main memory 4 A type of memory used in super computers. 8) The kernel keeps track of the state of each task by using a data structure called __ 1 Process control block 2 User control block 3 Memory control block 4 None of the above 9) Which of the following disk scheduling techniques has a drawback of starvation ? 1 SCAN 2 SSTF 3 FCFS 4 LIFO 10) A binary semaphore 1 has the values one or zero 2 is essential to binary computers 3 is used only for synchronisation 4 is used only for mutual exclusion 11) _________ page replacement alogorithm suffers from Belady's anamoly. 1 LRU 2 MRU 3 FIFO 4 LIFO 12) _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory 1 Translation Lookaside buffer

2 Inverse page table 3 Segmented page table 4 All the above 13) _________ does the job of allocating a process to the processor. 1 Long term scheduler 2 Short term scheduler 3 Medium term scheduler 4 Dispatcher 14) In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________. 1 Shortest Remaining Time Next (SRTN) Scheduling 2 Priority Based Preemptive Scheduling 3 Round Robin Scheduling 4 None of the above 15) In the multi-programming environment, the main memory consisting of _________ number of process. 1 Greater than 100 2 Only one 3 Greater than 50 4 More than one 16) In a multithreaded environment _______. 1 Each thread is allocated with new memory from main memory. 2 Main thread terminates after the termination of child threads. 3 Every process can have only one thread. 4 None of the above 17) Which of the following statement is not true? 1 Multiprogramming implies multitasking 2 Multi-user does not imply multiprocessing 3 Multitasking does not imply multiprocessing 4 Multithreading implies multi-user 18) In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock 1 Mutual exclusion 2 Hold and Wait 3 Circular Wait 4 No Preemption 19) In the ___________ method of data transfer, the participation of the processor is eliminated during data transfer. 1 Buffering

2 Caching 3 Direct Memory Access 4 Indirect Memory Access 20) A thread is a __________ process . 1 Heavy Weight 2 Mutliprocess 3 Inter Thread 4 Light wieght 21) Data reside in file on disk under DOS environment, which of the following file name is invalid ? 1 OSCONCEPTS.doc 2 RAW.txt 3 COMPAQ.BOOK 4 JUMPSTART.BOS 22) In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low priority processes may never execute, is resolved by __________. 1 Terminating the process. 2 Aging 3 Mutual Exclusion 4 Semaphore 23) CPU Scheduling is the basis of _________ operating system 1 Batch 2 Real time 3 Multiprogramming 4 Monoprogramming 24) A major problem with priority scheduling is _________. 1 Definite blocking 2 Starvation 3 Low priority 4 None of the above 25) ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue. 1 Long term 2 Short term 3 Medium term 4 None of the above 26) Which directory implementation is used in most Operating System? 1 Single level directory structure 2 Two level directory structure 3 Tree directory structure 4 Acyclic directory structure

27) Saving the state of the old process and loading the saved state of the new process is called ________. 1 Context Switch 2 State 3 Multi programming 4 None of the above 28) The term " Operating System " means ________. 1 A set of programs which controls computer working 2 The way a computer operator works 3 Conversion of high-level language in to machine level language 4 The way a floppy disk drive operates 29) Resource locking ________. 1 Allows multiple tasks to simultaneously use resource 2 Forces only one task to use any resource at any time 3 Can easily cause a dead lock condition 4 Is not used for disk drives 30) A thread 1 is a lightweight process where the context switching is low 2 is a lightweight process where the context swithching is high 3 is used to speed up paging 4 none of the above