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
More >>
Saturday, July 30, 2011
Friday, July 29, 2011
UGC NET Questions For Computer Science - Paper II
Q. Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to
(A) the maximum weight of a non zero code word
(B) the minimum weight of a non zero code word
(C) m
(D) n
Q. A context free grammar is :
(A) type 0.
(B) type 2.
(C) type 1.
(D) type 3.
Q. In order to build a MOD - 18 counter, the minimum number of flip flops needed is equal to :
(A)18
(B) 5
(C) 9
(D) 4
(A) CMOS
(B) DTL
(C) TTL
(D) ECL
Q. Which of the following is not true in C++ ?
(A) “Private” elements of a base class are not accessible by members of its derived class.
(B)“Protected” elements of base class are not accessible by members of its derived class.
(C) When base class access specified is “Public”, public elements of the base class become public members of its derived class.
(D) When base class access specified is “Public”, protected elements of a base class become protected members of its derived class.
Q. A primary key for an entity is :
(A) a candidate key
(B) any attribute
(C) a unique attribute
(D) a superkey
Q. Which of the following is true of constructor function in C++ ?
(A) A class must have at least one constructor.
(B) A constructor is a unique function which cannot be overloaded.
(C) A constructor function must be invoked with the object name.
(D) A constructor function is automatically invoked when an object is created.
Q. Aggregate functions in SQL are :
(A) GREATEST, LEAST and ABS
(B) SUM, COUNT and AVG
(C) UPPER, LOWER and LENGTH
(D) SQRT, POWER and MOD
Q.If a relation is in 2NF and 3NF forms then :
(A) no non-prime attribute is functionally dependent on other non-prime attributes
(B) no non-prime attribute is functionally dependent on prime attributes
(C) all attributes are functionally independent
(D) prime attribute is functionally independent of all non-prime attributes
Q.The end of an SQL command is denoted by :
(A) an end-of-line character
(B) an ‘enter-key’ marker
(C) entering F4 key
(D) a semicolon (;)
Q. The aging algorithm with a = 0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20, and 15 msec. The prediction for the next time will be :
(A)15 msec.
(B)25 msec.
(C)39 msec.
(D)40 msec.
Q. A major defect in water fall model in software development is that :
(A)the documentation is difficult
(B)a blunder at any stage can be disastrous
(C)a trial version is available only at the end of the project
(D)the maintenance of the software is difficult
Q.Function point metric of a software also depends on the :
(A)number of function needed
(B)number of final users of the software
(C)number of external inputs and outputs
(D)time required for one set of output from a set of input data
Q.An error message produced by an interactive system should have :
(A)always the error code
(B)the list of mistakes done by the user displayed
(C)a non-judgmental approach
(D)the past records of the occurrence of the same mistake
Q.System development cost estimation with use-cases is problematic because :
(A)of paucity of examples
(B)the data can be totally incorrect
(C)the expertise and resource available are not used
(D)the problem is being over simplified
Q.The approach to software testing is to design test cases to :
(A)break the software
(B)understand the software
(C)analyse the design of sub processes in the software
(D)analyze the output of the software
Q.Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by :
(A)t/p
(B)mt/p
(C)t1(m2t)/p
(D)(m2t)/p
Q.With reference to implementation of different association mining algorithms, identify the correct statement :
(A)The FP growth method was usually better than the best implementation of the a priori algorithm
(B)Apriori algorithm is usually better than CHARM
(C)Apriori algorithm is good when the support required is low
(D)At very low support the number of frequent items becomes less
Q.Consider a typical mobile communication system. If 840 frequencies are available, how many can be used in a given cell ?
(A)140
(B)120
(C)84
(D)60
Q.Identify the incorrect statement :
(A)The internet has evolved into phenomenally successful e-commerce engine
(B)e-business is synonymous with e-commerce
(C)The e-commerce model B2C did not begin with billboardware
(D)The e-commerce model G2C began with billboardware
Q. Identify the incorrect statement :
(A)ATM provides both real time and non-real time service
(B)ATM provides faster packet switching than X.25
(C)ATM was developed as part of the work on broadband ISDN
(D)ATM does not have application in Non-ISDN environments where very high data rates are required
Thursday, July 28, 2011
HSST Computer Science Data Structure Questions Published
1. Two main measures for the efficiency of an algorithm are
2. The time factor when determining the efficiency of algorithm is measured by
4. Which of the following case does not exist in complexity theory
5. The Worst case occur in linear search algorithm when
6. The Average case occur in linear search algorithm
7. The complexity of the average case of an algorithm is
8. The complexity of linear search algorithm is
9. The complexity of Binary search algorithm is
10. The complexity of Bubble sort algorithm is
11. The complexity of merge sort algorithm is
12. The indirect change of the values of a variable in one module by another module is called
13. Which of the following data structure is not linear data structure?
14. Which of the following data structure is linear data structure?
15. The operation of processing each element in the list is known as
16. Finding the location of the element with a given value is:
17. Arrays are best data structures
18. Linked lists are best suited
19. Each array declaration need not give, implicitly or explicitly, the information about
20. The elements of an array are stored successively in memory cells because
a. Processor and memory
b. Complexity and capacity
c. Time and space
d. Data and space
b. Complexity and capacity
c. Time and space
d. Data and space
2. The time factor when determining the efficiency of algorithm is measured by
a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm
3. The space factor when determining the efficiency of algorithm is measured byb. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm
a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm
4. Which of the following case does not exist in complexity theory
a. Best case
b. Worst case
c. Average case
d. Null case
b. Worst case
c. Average case
d. Null case
5. The Worst case occur in linear search algorithm when
a. Item is somewhere in the middle of the array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all
6. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
7. The complexity of the average case of an algorithm is
a. Much more complicated to analyze than that of worst case
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None or above
b. Much more simpler to analyze than that of worst case
c. Sometimes more complicated and some other times simpler than that of worst case
d. None or above
8. The complexity of linear search algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
b. O(log n)
c. O(n2)
d. O(n log n)
9. The complexity of Binary search algorithm is
a. O(n)
b. O(log )
c. O(n2)
d. O(n log n)
b. O(log )
c. O(n2)
d. O(n log n)
10. The complexity of Bubble sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
b. O(log n)
c. O(n2)
d. O(n log n)
11. The complexity of merge sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
b. O(log n)
c. O(n2)
d. O(n log n)
12. The indirect change of the values of a variable in one module by another module is called
a. internal change
b. inter-module change
c. side effect
d. side-module update
b. inter-module change
c. side effect
d. side-module update
13. Which of the following data structure is not linear data structure?
a. Arrays
b. Linked lists
c. Both of above
d. None of above
b. Linked lists
c. Both of above
d. None of above
14. Which of the following data structure is linear data structure?
a. Trees
b. Graphs
c. Arrays
d. None of above
b. Graphs
c. Arrays
d. None of above
15. The operation of processing each element in the list is known as
a. Sorting
b. Merging
c. Inserting
d. Traversal
b. Merging
c. Inserting
d. Traversal
16. Finding the location of the element with a given value is:
a. Traversal
b. Search
c. Sort
d. None of above
b. Search
c. Sort
d. None of above
17. Arrays are best data structures
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
18. Linked lists are best suited
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
19. Each array declaration need not give, implicitly or explicitly, the information about
a. the name of array
b. the data type of array
c. the first data from the set to be stored
d. the index set of the array
b. the data type of array
c. the first data from the set to be stored
d. the index set of the array
20. The elements of an array are stored successively in memory cells because
a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
b. the architecture of computer memory does not allow arrays to store other than serially
c. both of above
d. none of above
Solved Questions >>
b. the architecture of computer memory does not allow arrays to store other than serially
c. both of above
d. none of above
Solved Questions >>
Computer Science Questions Previously asked by PSC
Q. The statements char c[ ] = " there!"; putchar(c); will result in printing:
(A) There
(B) there.
(C) there!
(D) "there!"
Q. Total number of nodes in a 3-stage ternary tree will be :
(A) 12
(B) 5
(C) 13
(D) 15
Q. The power ratio of 1 in dBs will be :
(A) 10
(C) 1
(B) 0
(D) 100
Q. The units for telephone traffic is :
(A) Erlangs
(B) Poissons
(C) Bells
(D) N one of the above
Q. The number of full adders needed to implement one bit serial adder is :
(A) 2
(B) 4
(C) 8
(D) 1
Q. The supply voltage of ECL gates is :
(A) -5.2V (B) +5.2V
(C) -3.3V (D) +1.5V
Q. Which of the following is not a standard size of floppy diskettes?
(A) 5.25 in
(B) 10 in
(C) 3.5 in
(D) 8 in
Q. The Moore's law is applicable to :
(A) Automobile industry
(B) Computer industry
(C) Cement industry
(D) Semiconductor industry
Q. DVD stands for:
(A) Digi tal Video Disc
(B) Digital Vital Disc
(C) Digital Versatile Disc
(D) N one of the above
C and C++ Questions >>
(A) There
(B) there.
(C) there!
(D) "there!"
Q. Total number of nodes in a 3-stage ternary tree will be :
(A) 12
(B) 5
(C) 13
(D) 15
Q. The power ratio of 1 in dBs will be :
(A) 10
(C) 1
(B) 0
(D) 100
Q. The units for telephone traffic is :
(A) Erlangs
(B) Poissons
(C) Bells
(D) N one of the above
Q. The number of full adders needed to implement one bit serial adder is :
(A) 2
(B) 4
(C) 8
(D) 1
Q. The supply voltage of ECL gates is :
(A) -5.2V (B) +5.2V
(C) -3.3V (D) +1.5V
Q. Which of the following is not a standard size of floppy diskettes?
(A) 5.25 in
(B) 10 in
(C) 3.5 in
(D) 8 in
Q. The Moore's law is applicable to :
(A) Automobile industry
(B) Computer industry
(C) Cement industry
(D) Semiconductor industry
Q. DVD stands for:
(A) Digi tal Video Disc
(B) Digital Vital Disc
(C) Digital Versatile Disc
(D) N one of the above
C and C++ Questions >>
Wednesday, July 27, 2011
Possible Questions from Computer Concepts
Q. "STORED PROGRAM CONCEPT " Postulated By
a. Richard Stalman
b. Henry Dunant
c. Pascal
d. John von neumann
Q? : Founder of the social networking website 'Facebook'
a. Mark Elliot Zuckerberg
b. Henry Dunant
c. Pascal
d. John von neumann
9. Special programs which wrote for understanding the operation of the device it interfaces to, such as a printer, video card, sound card or CD ROM drive.
(a) Operating System
(b) Software
(c) Firmware
(d) Driver
Q? Name associated with Open Source Program
a. Pascal
b. Henry Dunant
c. Richard Stalman
d. John von neumann
Q? An internet protocol that allows quick file tarns-mission to remote computers is know as:
(a) HTTP
(b) FI'P
(c) TCP/IP
(d) ISP
Q. Protocol used to temporarily store new messages in your mailbox on an e-mail server is known as:
(a) POP
(b) SMTP
(c) TCP/IP
(d) FTP
Q. Company which maintains internet computers and telecommunications equipment in order to provide internet access to businesses, organisaations and individuals is called:
(a) Internet Service Agency
(b) ICAAN
(c) Internet Service Provider
(d) Web Hosting
Q.The device that protects all computers in the net-work from many attacks is called:
(a) Router
(b) Access Point
(c) Anti Virus Software
(d) Firewall
Q. Free telephone-style conversations to travel over the internet to virtually anywhere in the world is known as:
(a) Teleconference
(b) Videoconference
(c) Internet Telephony
(d) Internet broadcasting
Q. The main routes that data travels over the interrnet is called:
(a) Internet backbone
(b) Firewall
(c) Internet Router
(d) Silicon Valley
Q.An IT term refers to allowing someone to open web pages and see web sites on the internet.
(a) Hacking
(b) Cracking
(c) Web Caching
(d) Web Surfing
Q. 1,024 gigabytes is equal to:
(a) 1 kilobytes
(b) 1 megabyte
(c) 1 yottabyte
(d) 1 terabyte
Q. This type of memory would not lose its data when the computer lost power thus ensuring BIOS programs would always be available. What type of memory is referring here?
(a) ROM
(b) RAM
(c) Primary Memory
(d) Secondary Memory
Subscribe to:
Posts (Atom)