Sie sind auf Seite 1von 6

previous paper ka.. 20.

When inorder traversing a tree resulted E A C K F H D B G; the preorder trav ersal would return a. b. c. d. FAEKCDBHG FAEKCDHGB EAFKHDCBG FEAKDCHBG

******************************************************************************** ********************************* ** Answers according to me and preffered from net. correct if something is wrong and incomplete. **25 questions Max. Marks 50.0 --> 40 min **2 mark for correct and -1 for wrong **25 Multiple-Choice Questions 1. Which of the following data structures are indexed structures? a. linear arrays b. linked lists c. both of above d. none of above Ans: a) 2. In MS-DOS 5.0, which is the number that acts as a code to uniquely identify the software product? A. B. C. D. E. Ans: d) MS DOS MS DOS 5.0 None of the above

3. In virtual memory systems, Dynamic address translation A. B. C. D. E. Ans: a) is the hardware necessary to implement paging stores pages at a specific location on disk is useless when swapping is used is part of the operating system paging algorithm None of the above

4. What will be the output of the program? class PassS { public static void main(String []args) { PassS p= new PassS(); p.start(); } void start()

{ String s1="slide"; String s2= fax(s1); System.out.println(s1+" "+s2); } String fax(String s) { String p= s +"stream"; System.out.println(p+" "); return s; } } a) slidestream b)slide stream c)slidestream slide stream d)slidestream slide Ans: c) 5. The Memory Buffer Register (MBR) A. is a hardware memory device which denotes the location of the current instruc tion being executed. B. is a group of electrical circuits (hardware), that performs the intent of ins tructions fetched from memory. C. contains the address of the memory location that is to be read from or stored into. D. contains a copy of the designated memory location specified by the MAR after a "read" or the new contents of the memory prior to a "write". E. None of the above Ans: d) 6. Which of the following is not the required condition for binary search algorithm ? a. The list must be sorted b. there should be the direct access to the middle element in any sublist c. There must be mechanism to delete and/or insert elements in list d. none of above Ans: c) 7. A fork system call will fail, if a) yaad nahi.. b) system exceed no. of process c) ststem exceed no. of process in something something... d) a and c e) b and c f) a and b Ans: e) 8. Interprocess communication a) synchronization something... b) c) d) yaad nahi...

9. To connect a computer with a device in the same room, you might be likely to use A. B. C. D. E. Ans: a) a coaxial cable a dedicated line a ground station All of the above None of the above

10. A hunter leaves his cabin early in the morning and walks one mile due south.Here he sees a Beer and starts chasing it for one mile due east before he is able to shoot the Beer.After shooting the Beer, he drags it one mile due north back to his cabin where he started that morning.What color is the beer. a.Black b.Brown c.White. d.Gray Ans: c) 11. In a _____ a parent record type can be linked to one or more "child" record type s, but a child record type can have only one parent. A. B. C. D. E. Ans: d) Network database Relational database Distributed database Hierarchical database None of the above

12. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowel can be formed a) 210 b) 1050 c) 25200 d) 21400 e) none Ans: c) 13. Unix Operating System is an ____. a) time sharing b) muti-tasking c) muti-user d) all above Ans: d) 14. In OSI network architecture, the dialogue control and token management are respo nsibility of a. session layer b. network layer c. transport layer d. data link layer e. none of above Ans: a)

15. Which of the following methods of collision processing has some of their address never be used. a) random collision b) sequential collision c) index collision d) yaad nahi.. Ans: a) 16. Suppose cursor points to a node in a linked list (using the node definition with member functions called data and link). What statement changes cursor so that i t points to the next node? A. cursor++; B. cursor = link( ); C. cursor += link( ); D. cursor = cursor->link( ); Ans: d) 17. he memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above Ans: a) 18. Which of the following refers to the associative memory? a) the address of the data is generated by the CPU b) the address of the data is supplied by the users c) there is no need for an address i.e. the data is used as an address d) the data are accessed sequentially e) None of the above Ans: c) 19. Which of the following TCP/IP protocol allows an application program on one mach ine to send a datagram to an application program on another machine? A. B. C. D. E. Ans: a) 20. Which of the following hardware components is the most important to the operatio n of a database management system? A. B. C. high-resolution video display printer high speed, large-capacity disk UDP VMTP X.25 SMTP None of the above

D. plotter E. mouse. Ans: c) 21. In OSI network architecture, the routing is performed by a. network layer b. data link layer c. transport layer d. session layer e. none of above Ans: a) 22. Look at this series: 2, 1, (1/2), (1/4), ... What number should come next? A. (1/3) C. (2/8) Ans: b) B. D. (1/8) (1/16)

23. A file containing multiple indices to the data is called a/an a) index file b) sequential file c) index sequential file d) none Ans: c) 24. Carrier is yaad nhi... 25. Fork is A. the dispatching of a task B. the creation of a new job C. the creation of a new process D. increasing the priority of a task E. None of the above Ans: c) ******************************************************************************** ********************************* c: http://answers.yahoo.com/question/index?qid=20080328111325AANVZtM operating system: http://www.crazyengineers.com/threads/operating-system-quiz-answer-these-questio ns.45712/ http://www.indiabix.com/computer-science/operating-systems-concepts/013010 DS: http://www.psexam.com/MCQs-from-Data-Structures-and-Algorithms/data-structures-a -algorithms-multiple-choice-questions-mcqs-objective-set-2.html networking: https://docs.google.com/document/d/1ijAGZ3WMaQbgiKmU6VWwwEBFNQEYA_Ltx85f-EvfDZs/ edit?hl=en_US

http://www.indiabix.com/computer-science/networking/001008 http://www.indiabix.com/computer-science/networking/001005 dbms: http://www.indiabix.com/computer-science/database-systems/030005 general: http://www.indiabix.com/logical-reasoning/number-series/

Das könnte Ihnen auch gefallen