Category Archives: Computer Science & Engineering

MCQs in Introduction to programming and computer science.

MCQs on Operating System

MCQs on Operating System

Operating System is System Software which enables users to interrelate with the Hardware.

1. Moving Process from main memory to disk is called 

  1. Scheduling
  2. Caching
  3. Swapping
  4. Spooling 

Ans: C 

2. A loader is 

  1. A program that places programs into memory and prepares them for execution 
  2. A program that automate the translation of assembly language into machine language 
  3. A program that accepts a program written in a high level language and produces an object program 
  4. Is a program that appears to execute a source program if it were machine language 

Ans: A 

3. Assembler is 

  1. A program that places programs into memory and prepares them for execution 
  2. A program that automate the translation of assembly language into machine language 
  3. A program that accepts a program written in a high level language and produces an object program 
  4. Is a program that appears to execute a source program if it were machine language 

Ans: B 

4. Real time systems are 

  1. Primarily used on mainframe computers 
  2. Used for monitoring events as they occur 
  3. Used for program analysis 
  4. Used for real-time interactive 

Ans: B

5. When a computer is first turned on or restarted, a special type of absolute loader is executed, called a 

  1. Compile and Go loader  
  2. Boot loader  
  3. Bootstrap loader  
  4. Relating loader 

Ans: C 

6. In an absolute loading scheme, which loader function(s) is (are) accomplished by programmer 

  1. Allocation  
  2. Linking  
  3. Both a and b  
  4. Reallocation 

Ans: C 

7. The primary job of the operating system of a computer is to 

  1. Command resources  
  2. Manage resources
  3. Provide utilities  
  4. Be user friendly 

Ans: B 

8. The operating system of a computer serves as a software interface between the user and 

  1. Hardware  
  2. Peripheral  
  3. Memory  
  4. Screen 

Ans: A 

9. 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 into machine code 
  4. The way a floppy disk drives operates 

Ans: A 

10. Multiprogramming was made possible by 

  1. input/output units that operate independently of the CPU  
  2. Operating system  
  3. Both a and b  
  4. None of the above 

Ans: C 

11. Which of the following is not a part of operating system? 

  1. supervisor  
  2. Performance monitor  
  3. job-control program  
  4. Input/output control program 

Ans: B

12. A processor 

  1. Is a device that performs a sequence of operations specified by instructions in memory 
  2. Is the device where information is stored 
  3. Is a sequence of instructions 
  4. Is typically characterized by interactive processing and time of the CPU’s time to allow quick response to each other 

Ans: A 

13. Producer consumer problem can be solved using 

  1. Semaphores
  2. Event counters
  3. Monitors
  4. All of the above 

Ans: D 

14. Special software to create a job queue is called a 

  1. Drive
  2. Spooler
  3. Interpreter
  4. Linkage editor 

Ans: B 

15. Thrashing 

  1. Is a natural consequence of virtual memory system 
  2. Can always be avoided by swapping 
  3. Always occurs on large computers 
  4. Can be caused by poor paging algorithms 

Ans: D 

16. Memory management is 

  1. Not used in modern operating system 
  2. Replaced with virtual memory on current system 
  3. Not used on multiprogramming systems 
  4. Critical for even the simplest operating system 

Ans: B 

17. Which is not true about the memory management? 

  1. Virtual memory is used in multi-user system 
  2. Segmentation suffers from external fragmentation 
  3. Paging suffers from internal fragmentation 
  4. Segmented memory can be paged 

Ans: A 

18. In the multiprogramming system, a set of processes is deadlock if each process in the set is waiting for an event to occur that can be initialized only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur? 

  1. Nonpreemption  
  2. Process suspension  
  3. Partial assigment of resources  
  4. Circular wait 

Ans: B 

19. Block or Buffer caches are used 

  1. To improve disk performance  
  2. To handle interrupts  
  3. To increase the capacity of main memory  
  4. To speed up main memory read operation 

Ans: A 

20. In virtual memory systems, Dynamic address translation 

  1. Is the hardware necessary to implemented paging 
  2. Stores pages at a specifies location on disk 
  3. Is useless when swapping is used. 
  4. Is part of the operating system paging algorithm 

Ans: A 

Computer Science Sample Paper 2

Computer Science Sample Paper 2

 

Computer Science questions and answers with explanation for interview, competitive examination and entrance test. It's contains are more AGRE test in computer science as well as GATE, PSC, NET and other similar exams.

 

1.    . The line graph L(G) of a simple graph G is defined as follows:

• There is exactly one vertex v(e) in L(G) for each edge e in G.

• For any two edges e and e' in GL(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G.

Which of the following statements is/are TRUE?

(P) The line graph of a cycle is a cycle.

(Q) The line graph of a clique is a clique.

(R) The line graph of a planar graph is planar.

(S) The line graph of a tree is a tree.

  • (A) P only                      (B) P and R only
  • (C) R only                     (D) P, Q and S only

Answer: A

 

2.       What is the logical translation of the following statement ?

"None of my friends are perfect."

  • (A) x(F(x)˄¬P(x))        (B) x(¬F(x)˄P(x))
  • (C) x(¬F(x)˄¬P(x))     (D) ¬x(F(x)˄P(x))

Answer: D

 

3.       Consider the following sequence of micro–operations.

MBR←PC

MAR←X

PC←Y

Memory←MBR

Which one of the following is a possible operation performed by this sequence ?

  • (A) Instruction fetch   
  • (B) Operand fetch
  • (C) Conditional branch         
  • (D) Initiation of interrupt service

Answer: D

 

4.       Consider a hard disk with 16 recording surfaces (0−15) having 16384 cylinders (0−16383) and each cylinder contains 64 sectors (0−63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder–wise and the addressing format is <cylinder no., surface no., sector no.>. A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?

  • (A) 1281           
  • (B) 1282        
  • (C) 1283        
  • (D) 1284

Answer: D

 

5.    The number of elements that can be sorted in Θ(logn) time using heap sort is

  • (A) Θ(1)                                 (B) Θ(√logn) 
  • (C) Θ(logn/loglogn)                 (D) Θ(logn)

Answer: C

 

6.       Consider the following function:

int unknown int n {

int i, j, k=0;

for(i=n/2; i≤n; i++)

for(j=2; j≤n; j=j*2)

k=k+n/2;

return (k);

}

The return value of the function is

  • (A) Θ(n2)           
  • (B) Θ(n2logn)          
  • (C) Θ(n3)           
  • (D) Θ(n3logn)

Answer: B

 

7.       Consider the following languages.

L1={0p1q0r|p,q,r≥0}

L2={0p1q0r|p,q,r≥0,pr}

Which one of the following statements is FALSE?

  • (A) L2 is context–free
  • (B) L1∩L2 is context–free
  • (C) Complement of L2 is recursive
  • (D) Complement of L1 is context–free but not regular

Answer: D

 

8.       Consider the DFA A given below.

Which of the following are FALSE?

1. Complement of L(A) is context–free

2. L(A)=L((11*0+0)(0+1)*0*1*)

3. For the language accepted by AA is the minimal DFA.

4. A accepts all strings over {0, 1} of length at least 2.

  • (A) 1 and 3 only           (B) 2 and 4 only
  • (C) 2 and 3 only           (D) 3 and 4 only

Answer: D

 

9.       A shared variable x, initialized to zero, is operated on by four concurrent processes WXYZ as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the Poperation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?

  • (A) –2    
  • (B) –1            
  • (C) 1  
  • (D) 2

Answer: D

 

10.       Consider the following relational schema.

Students(rollno: integer, sname: string)

Courses(courseno: integer, cname: string)

Registration(rollno: integer, courseno: integer, percent: real)

Which of the following queries are equivalent to this query in English?

"Find the distinct names of all students who score more than 90% in the course numbered 107"

(I) SELECT DISTINCT S.sname

FROM Students as S, Registration as R

WHERE R.rollno=S.rollno AND R.Courseno=107 AND R.percent>90

(II) ∏snamecourseno=107percent>90(RegistrationStudents))

(III) {T|S ϵ Students, R ϵ Registration(S.rollno=R.rollno

R.courseno=107R.percent>90T.sname=S.name)}

(IV) {<SN>|SRRP(<SR,SN>ϵStudents<SR,107,RP>ϵRegistrationRP>90)}

  • (A) I, II, III and IV          
  • (B) I, II and III only
  • (C) I, II and IV only      
  • (D) II, III and IV only

Answer: A

 

11.       Determine the maximum length of cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s

  • (A) 1      
  • (B) 2   
  • (C) 2.5          
  • (D) 5

Answer: B

 

12.       In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are

  • (A) Last fragment, 2400 and 2789
  • (B) First fragment, 2400 and 2759
  • (C) Last fragment, 2400 and 2759
  • (D) Middle fragment, 300 and 689

Answer: C

 

13.       The following figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles represent attributes. If method m is moved to module M2 keeping the attributes where they are, what can we say about the average cohesion and coupling between modules in the system of two modules?

  • (A) There is no change.
  • (B) Average cohesion goes up but coupling is reduced
  • (C) Average cohesion goes down and coupling also reduces
  • (D) Average cohesion and coupling increase

Answer: A

 

14.       A certain computation generates two arrays a and b such that a[i]=f(i) for 0≤i

 

Process X;                                Process Y;

private i;                                     private i;

for (i=0; i<n; i++) {                    for (i=0; i<n; i++) {

a[i]=f(i);                                               EntryY(R, S);

ExitX(R, S);                                       b[i]=g(a[i]);

}                                                  }

 

Which one of the following represents the CORRECT implementations of ExitX and EntryY ?

(A) ExitX R, S {

P(R);

V(S);

}

EntryY R, S {

P(S);

V(R);

}

(B) ExitX R, S {

V(R);

V(S);

}

EntryY R, S {

P(R);

P(S);

}

(C) ExitX R, S {

P(S);

V(R);

}

EntryY R, S {

V(S);

P(R);

}

(D) ExitX R, S {

V(R);

P(S);

}

EntryY R, S {

V(S);

P(R);

}

Answer: C

 

15.    Consider the following two sets of LR(1) items of an LR(1) grammar

X→c.X, c/d    X→c.X, $

X→.cX, c/d    X→.cX, $

X→.d, c/d       X→.d, $

Which of the following statements related to merging of the two sets in the corresponding LALRparser is/are FALSE?

1. Cannot be merged since look aheads are different

2. Can be merged but will result in S–R conflict

3. Can be merged but will result in R–R conflict

4. Cannot be merged since goto on c will lead to two different sets

  • (A) 1 only                      (B) 2 only
  • (C) 1 and 4 only           (D) 1, 2, 3 and 4

Answer: D

 

16.       Which of the following is/are undecidable?

1. G is a CFG. Is L(G)=Φ?

2. G is a CFG. IS L(G)=∑* ?

3. M is a Turning machine. Is L(M) regular?

4. A is a DFA and N is a NFA. Is L(A)=L(N) ?

  • (A) 3 only                                 
  • (B) 3 and 4 only
  • (C) 1, 2 and 3 only      
  • (D) 2 and 3 only

Answer: D

17.       What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value.

int f (int &x, int c) {

c=c-1;

if (c==0) return 1;

x=x+1;

return f(x,c)*x;

}

(A) 3024            (B) 6561        

(C) 55440          (D) 161051

Answer: Marks to All

 

18.       The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

  • (A) 10,20,15,23,25,35,42,39,30
  • (B) 15,10,25,23,20,42,35,39,30
  • (C) 15,20,10,23,25,42,35,39,30
  • (D) 15,10,23,25,20,35,42,39,30

Answer: D

 

19.       Consider the following operation along with Enqueue and Dequeue operations on queues, where kis a global parameter.

MultiDequeue(Q) {

m=k

while(Q is not empty) and (m>0) {

Dequeue(Q)

m=m-1

}

}

What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?

  • (A) Θ(n)            (B) Θ(n+k)     
  • (C) Θ(nk)           (D) Θ(n2)

Answer: A

 

20.       Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO,EI and WO are 5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. There are intermediate storage buffers after each stage and the delay of each buffer is 1 ns. A program consisting of 12 instructions I1, I2, I3,….I12 is executed in this pipelined processor. Instruction I4 is the only branch instruction and its branch target is I9. If the branch is taken during the execution of this program, the time (in ns)needed to complete the program is

  • (A) 132              
  • (B) 165          
  • (C) 176            
  • (D) 328

Answer: B
 

 

21.       A RAM chip has a capacity of 1024 words of 8 bits each (1K×8). The number of 2×4 decoders with enable line needed to construct a 16K×16 RAM from 1K×8 RAM is

  • (A) 4      
  • (B) 5  
  • (C) 6 
  • (D) 7

Answer: B

 

22.       Which one of the following is NOT logically equivalent to ¬x(y()˄z())?

  • (A) x(z)y()) 
  • (B) x(z()y))
  • (C) x(y()z)) 
  • (D) x(y)z))

Answer: Marks to All

 

Computer Science Sample Paper 1

Computer Science Sample Paper 1

Computer Science questions and answers with explanation for interview, competitive examination and entrance test. It's contains are more AGRE test in computer science as well as GATE, PSC, NET and other similar exams.

 
1.       A binary operation  on a set of integers is defined as xy=x2+y2. Which one of the following statements is TRUE about ?

  • (A) Commutative but not associative
  • (B) Both commutative and associative
  • (C) Associative but not commutative
  • (D) Neither commutative nor associative

Answer: A

 

2.       Suppose p is number of cars per minute passing through a certain road junction between 5 PM and 6PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?

  • (A) 8/(2e3)          (B) 9/(2e3)
  • (C) 17/(2e3)       (D) 26/(2e3)

Answer: C

 

3.       Which one of the following does NOT equal

 

 


Answer: A

 

4.       The smallest integer than can be represented by an 8-bit number in 2's complement form is

  • (A) -256             (B) -128
  • (C) -127             (D) 0

Answer: B

5.       In the following truth table, V=1 if and only if the input is valid.

ComputerSci6

What function does the truth table represent?

  • (A) Priority encoder     (B) Decoder
  • (C) Multiplexer             (D) Demultiplexer

Answer: A

 

6.       Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort ?

  • (A) O(log n)       (B) O(n)
  • (C) O(n log n)   (D) O(n2)

Answer: B

 

7.       Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes ?

  • (A) O(1)              (B) O(log n)
  • (C) O(n)             (D) O(n log n)

Answer: C

 

8.       Consider the languages L= Φ and L2 = {a}. Which one of the following represents L1L2*UL1* ?

  • (A) { є }               (B) Φ
  • (C) a*                  (D) { є, a}

Answer: A

 

9.       What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type A→є and A→a) to parse a string with n tokens?

  • (A) n/2                (B) n-1
  • (C) 2n-1             (D) 2n

Answer: B

10.    A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

  • (A) This algorithm is equivalent to the first-come-first-serve algorithm.
  • (B) This algorithm is equivalent to the round-robin algorithm.
  • (C) This algorithm is equivalent to the shortest-job-first algorithm.
  • (D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Answer: B

11.       Match the problem domains in Group I with the solution technologies in Group II.

Group I                                                  Group II

  • (P) Services oriented computing                                (1) Interoperability
  • (Q) Heterogeneous communicatingsystems               (2) BPMN
  • (R) Information representation                                   (3) Publish-find bind
  • (S) Process description                                            (4) XML

 

  • (A) P–1, Q–2, R–3, S–4         
  • (B) P–3, Q–4, R–2, S–1
  • (C) P–3, Q–1, R–4, S–2         
  • (D) P–4, Q–3, R–2, S–1

Answer: C

 

12.       The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are

  • (A) TCP, UDP, UDP and TCP          
  • (B) UDP, TCP, TCP and UDP
  • (C) UDP, TCP, UDP and TCP          
  • (D) TCP, UDP, TCP and UDP

Answer: C

 

13.       Using public key cryptography, X adds a digital signature σ to message M, encrypts <M,σ>, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations ?

  • (A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by Y’s public key
  • (B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by Y’s private key
  • (C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by X’s private key
  • (D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key

Answer: D

 

14.       Assume that source S and destination D are connected through two intermediate routers labelled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.

ComputerSci7

  • (A) Network layer–4 times and Data link layer-4 times
  • (B) Network layer–4 times and Data link layer-3 times
  • (C) Network layer–4 times and Data link layer-6 times
  • (D) Network layer–2 times and Data link layer-6 times

Answer: C

 

15.       An index is clustered, if

  • (A) it is on a set of fields that form a candidate key.
  • (B) it is on a set of fields that include the primary key.
  • (C) the data records of the file are organized in the same order as the data entries of the index.
  • (D) the data records of the file are organized not in the same order as the data entries of the index.

Answer: C

 

16.       Three concurrent processes XY, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a,b and c; process Y executes the P operation on semaphores bc and d; process Z executes the Poperation on semaphores cd, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

  • (A) X:P(a)P(b)P(c)       Y:P(b)P(c)P(d)          Z:P(c)P(d)P(a)
  • (B) X:P(b)P(a)P(c)       Y:P(b)P(c)P(d)          Z:P(a)P(c)P(d)
  • (C) X:P(b)P(a)P(c)       Y:P(c)P(b)P(d)          Z:P(a)P(c)P(d)
  • (D) X:P(a)P(b)P(c)       Y:P(c)P(b)P(d)          Z:P(c)P(d)P(a)

Answer: B

 

17.       Which of the following statements is/are FALSE?

  • (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
  • (2) Turing recognizable languages are closed under union and complementation.
  • (3) Turing decidable languages are closed under intersection and complementation
  • (4) Turing recognizable languages are closed under union and intersection.

 

  • (A) 1 and 4 only           (B) 1 and 3 only
  • (C) 2 only                      (D) 3 only

Answer: C

 

18.       Which of the following statements are TRUE?

(1) The problem of determining whether there exists a cycle in an undirected graph is in P.

(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.

(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

 

  • (A) 1, 2 and 3                (B) 1 and 2 only
  • (C) 2 and 3 only           (D) 1 and 3 only

Answer: A

 

19.       What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices ?

  • (A) Θ(n2)            (B) Θ(n2logn)           
  • (C) Θ(n3)            (D) Θ(n3logn)

Answer: C

 

20.    In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from

  • (A) (j mod v)*k to (j mod v)*k+(k−1)
  • (B) (j mod v) to (j mod v)+(k−1)
  • (C) (j mod k) to (j mod k)+(v−1)
  • (D) (j mod k)*v to (j mod k)*v+(v−1)

Answer: A

 

21.       Which one of the following expressions does NOT represent exclusive NOR of x and y?

  • (A) xy + x'y'        (B) x⊕y'
  • (C) x'⊕y             (D) x'⊕y'

Answer: D

 

22.       Which one of the following functions is continuous at x = 3 ?

ComputerSci8

 

Answer: A

 

23.       Function f is known at the following points:

The value of 03f(x)dx computed using the trapezoidal rule is

(A) 8.983           (B) 9.003        (C) 9.017        (D) 9.045

Answer: D

 

24.       Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three ?

  • (A) 1/8                (B) 1   
  • (C) 7                   (D) 8

Answer: C

 

25.       Which of the following statements is/are TRUE for undirected graphs?

P: Number of odd degree vertices is even.

Q: Sum of degrees of all vertices is even.

  • (A) P only                      (B) Q only
  • (C) Both P and Q         (D) Neither P nor Q

Answer: C
 

Basic Computer MCQs-7

Basic Computer MCQs-7

1.  Which computer memory is used for storing programs and data currently being processed by the CPU?

  • (A) Mass memory
  • (B) Internal memory
  • (C) Non-volatile memory
  • (D) PROM
  • (E) None of these

Answer: (B)
2. A circuit with about 100 transistors fabricated on a single chip is called

  • (A) MCR
  • (B) MSI
  • (C) MIS
  • (D) RJE
  • (E) None of these

Answer: (B)
3. ALU is called for _____ of a computer

  • (A) Heart
  • (B) Master dispatcher
  • (C) Primary memory
  • (D) All of the above
  • (E) None of these

Continue reading Basic Computer MCQs-7

Basic Computer MCQs-6

Basic Computer MCQs-6

1. Which of the following is not an advantage of magnetic disk storage?

  • (A)The access time of magnetic disk is much less than that of magnetic tape
  • (B)Disk storage is longer lasting than magnetic tape
  • (C)Disk storage is less expensive than tape storage
  • (D)None of the above

ANSWER: (D)

2. A prefix for billion which is equal to _____is called as billi.

  • (A) 100
  • (B) 10000
  • (C) 1000
  • (D) 10

ANSWER: (A)

3. One kilobyte -byte

  • (A) 1250
  • (B) 2088
  • (C) 1024
  • (D) 1000

Continue reading Basic Computer MCQs-6

Basic Computer MCQs-5

Basic Computer MCQs-5

1. Technology no longer protected by copyright, available to everyone, is considered to be

  • (A) Proprietary.
  • (B) Open
  • (C) Experimental
  • (D) In the public domain
  • (E) None of the above

ANSWER: (A)

2. Input, output and processing devices grouped together represent a/an……

  • (A) Mobile device
  • (B) Information processing cycle
  • (C) Circuit boards
  • (D) Computer system
  • (E) None of the above

ANSWER: (D)

3. The term gigabyte refers to

  • (A) 1024 bytes
  • (B) 1024 kilobytes
  • (C) 1024 megabytes
  • (D) 1024 gigabytes
  • (E) None of these

Continue reading Basic Computer MCQs-5

Basic Computer MCQs-3

Basic Computer MCQs-3

1. ……makes it possible for shoppers to make purchases using their computers.

  • (A) E-world
  • (B) E-commerce
  • (C) E-spend
  • (D) E-business
  • (E) None of these

Ans: (D)
2. Programs such as Internet Explorer that serve as navigable windows into the Web are called—

  • (A) Hypertext
  • (B) Networks
  • (C) Internet
  • (D) Web browsers
  • (E) None of these

Continue reading Basic Computer MCQs-3

Basic Computer MCQs-2

Basic Computer MCQs-2

1. When you save to this, your data will remain intact even when the computer is turned off–

  • (A) RAM
  • (B) Motherboard
  • (C) Secondary storage device
  • (D) Primary storage device
  • (E) None of these

Ans : (C)

2. A central computer that holds collections of data and programs for many PCs, workstations, and other computers is a (n) –

  • (A) Supercomputer
  • (B) Minicomputer
  • (C) Laptop
  • (D) Server
  • (E) None of these

Continue reading Basic Computer MCQs-2