COMPUTER SCIENCE - PAGE 4
1. Assume a cache memory with associative mapping. If the main memory is of 8K bytes and the cache memory is of 2K words, then each word of cache memory is
(a). 21 bits
(b). 11 bits
(c). 16 bits
(d). 20 bits
Answer: Option-C
2. An assembler is
(a). data dependent
(b). programming language dependent
(c). machine dependent
(d). syntax dependent
Answer: Option-C
3. The expansion of nested macro calls follows _________ rule
(a). LILO
(b). LIFO
(c). FIFO
(d). priority
Answer: Option-B
4. What is the purpose of this bit of code
void init()
{
...
}
(a). A place to declare variables
(b). A required method in an applet
(c). A class that initializes the applet
(d). Interacting with the user
Answer: Option-B
5. In Relational Algebra the query that finds customers who have a balance of over 800 is
(a). ∏customer_name(σ balance >800(Deposit))
(b). σcustomer_name(∏balance>800(Deposit))
(c). ∏customer_name(σbalance>800(Borrow))
(d). σcustomer_name(∏balance>500(Borrow))
Answer: Option-A
6. DNS is a
(a). Distributed hierarchical naming system
(b). Vertical naming system
(c). Horizontal naming system
(d). Client Server system
Answer: Option-A
7. E-commerce is not suitable for
(a). Online job searching
(b). Sale/Purchase of expensive jewellery and antiques
(c). Sale/Purchase of branded clothes
(d). Sale/Purchase of mobile phones
Answer: Option-A
8. Secret-key encryption is also known as
(a). Secret-encryption
(b). Asymmetric encryption
(c). Symmetric encryption
(d). Private encryption
Answer: Option-C
9. Several factors exist that affect the efficiency of lookup operations in a hash table. Which among the following is NOT one of those factors?
(a). Size of elements stored in the hash table.
(b). Number of elements stored in the hash table.
(c). Quality of the hash function.
(d). Number of buckets in the hash table.
Answer: Option-A
10. A DBMS query language is designed to
(a). specify the structure of a database
(b). support end users with English-like commands
(c). support the development of complex applications software
(d). all of the above
Answer: Option-D
11. Which of the following is true?
(a). Stream cipher technique is an encryption technique
(b). Block cipher technique is an encryption technique
(c). Both (A) and (B)
(d). Neither of (A) and (B)
Answer: Option-C
12. Given a linked list with n elements. Then the time taken to insert an element after an element pointed to by some pointer is
(a). O(n log2 n)
(b). O(1)
(c). O(log2 n)
(d). O(n)
Answer: Option-B
13. If L is a lattice, then for every a and b in L which among the following is correct? (a). a ν (b Λ c) =a
(b). a ν (b ν c) = (a ν b) ν c
(c). a ν b = a Λ b
(d). a ν (b ν c) = b
Answer: Option-B
14. Let h be a hashing function and is used to hash n keys into a table of size m (given n<=m). Then the expected number of collisions involving a particular key x is (a). less than 1
(b). less than m
(c). less than n
(d). less than n/2
Answer: Option-A
15. The technique of improving the priority of process waiting in queue for CPU allocation is called ________
(a). Starvation
(b). Ageing
(c). Revocation
(d). Relocation
Answer: Option-B
16. PSW is saved in stack when there is a
(a). interrupt recognized
(b). execution of CALL instruction
(c). execution of RST instruction
(d). all of these
Answer: Option-A
17. The default subnet mask for a Class C network is
(a). 127.0.0.1
(b). 255.0.0.0
(c). 255.255.0.0
(d). 255.255.255.0
Answer: Option-D
18. Which one of the following is NOT an advantage of Distributed System?
(a). Reliability
(b). Incremental growth
(c). Resource sharing
(d). None of the above
Answer: Option-D
19. Cache memory is based
(a). on the property of locality of reference
(b). on the fact that references generally tend to cluster
(c). on the heuristic 90-10 rule
(d). all of the above
Answer: Option-A
20. The language component of DBMS which can be embedded in a program is
(a). the database administrator (DBA)
(b). the data manipulation language (DML)
(c). the data definition language (DDL)
(d). a query language
Answer: Option-B
21. A computer system that permits multiple users to run programs at same time is _______
(a). Real time system
(b). Time sharing system
(c). Multiprogramming system
(d). Multi tasking system
Answer: Option-D
22. What is the output of the following code segment?
void test()
{
char c;
cin.get(c);
if (c!='\n'){
test();
cout.put(c);
}}
(a). It will print an empty line
(b). The string entered is printed as it is
(c). It will go into an infinite loop
(d). The string entered is printed in reverse order
Answer: Option-D
23. Which of the following statement is the negation of the statement, "10 is even and -5 is negative" (a). 10 is even and -5 is not negative
(b). 10 is odd and -5 is not negative
(c). 10 is even or -5 is not negative
(d). 10 is odd or -5 is not negative
Answer: Option-D
24. The __________ sort relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element
(a). selection sort
(b). quick sort
(c). insertion sort
(d). heap sort
Answer: Option-B
25. Which among the following is the data structure that is used to check balanced parenthesis in an expression
(a). Stack
(b). Tree
(c). Queue
(d). Array
Answer: Option-A
26. Which shortcut is used to permanently delete a file or folder from computer?
A:-Delete key
B:-alt + delete key
C:-Shift + delete key
D:-Ctrl + delete
Ans: C
(a). 21 bits
(b). 11 bits
(c). 16 bits
(d). 20 bits
Answer: Option-C
2. An assembler is
(a). data dependent
(b). programming language dependent
(c). machine dependent
(d). syntax dependent
Answer: Option-C
3. The expansion of nested macro calls follows _________ rule
(a). LILO
(b). LIFO
(c). FIFO
(d). priority
Answer: Option-B
4. What is the purpose of this bit of code
void init()
{
...
}
(a). A place to declare variables
(b). A required method in an applet
(c). A class that initializes the applet
(d). Interacting with the user
Answer: Option-B
5. In Relational Algebra the query that finds customers who have a balance of over 800 is
(a). ∏customer_name(σ balance >800(Deposit))
(b). σcustomer_name(∏balance>800(Deposit))
(c). ∏customer_name(σbalance>800(Borrow))
(d). σcustomer_name(∏balance>500(Borrow))
Answer: Option-A
6. DNS is a
(a). Distributed hierarchical naming system
(b). Vertical naming system
(c). Horizontal naming system
(d). Client Server system
Answer: Option-A
7. E-commerce is not suitable for
(a). Online job searching
(b). Sale/Purchase of expensive jewellery and antiques
(c). Sale/Purchase of branded clothes
(d). Sale/Purchase of mobile phones
Answer: Option-A
8. Secret-key encryption is also known as
(a). Secret-encryption
(b). Asymmetric encryption
(c). Symmetric encryption
(d). Private encryption
Answer: Option-C
9. Several factors exist that affect the efficiency of lookup operations in a hash table. Which among the following is NOT one of those factors?
(a). Size of elements stored in the hash table.
(b). Number of elements stored in the hash table.
(c). Quality of the hash function.
(d). Number of buckets in the hash table.
Answer: Option-A
10. A DBMS query language is designed to
(a). specify the structure of a database
(b). support end users with English-like commands
(c). support the development of complex applications software
(d). all of the above
Answer: Option-D
11. Which of the following is true?
(a). Stream cipher technique is an encryption technique
(b). Block cipher technique is an encryption technique
(c). Both (A) and (B)
(d). Neither of (A) and (B)
Answer: Option-C
12. Given a linked list with n elements. Then the time taken to insert an element after an element pointed to by some pointer is
(a). O(n log2 n)
(b). O(1)
(c). O(log2 n)
(d). O(n)
Answer: Option-B
13. If L is a lattice, then for every a and b in L which among the following is correct? (a). a ν (b Λ c) =a
(b). a ν (b ν c) = (a ν b) ν c
(c). a ν b = a Λ b
(d). a ν (b ν c) = b
Answer: Option-B
14. Let h be a hashing function and is used to hash n keys into a table of size m (given n<=m). Then the expected number of collisions involving a particular key x is (a). less than 1
(b). less than m
(c). less than n
(d). less than n/2
Answer: Option-A
15. The technique of improving the priority of process waiting in queue for CPU allocation is called ________
(a). Starvation
(b). Ageing
(c). Revocation
(d). Relocation
Answer: Option-B
16. PSW is saved in stack when there is a
(a). interrupt recognized
(b). execution of CALL instruction
(c). execution of RST instruction
(d). all of these
Answer: Option-A
17. The default subnet mask for a Class C network is
(a). 127.0.0.1
(b). 255.0.0.0
(c). 255.255.0.0
(d). 255.255.255.0
Answer: Option-D
18. Which one of the following is NOT an advantage of Distributed System?
(a). Reliability
(b). Incremental growth
(c). Resource sharing
(d). None of the above
Answer: Option-D
19. Cache memory is based
(a). on the property of locality of reference
(b). on the fact that references generally tend to cluster
(c). on the heuristic 90-10 rule
(d). all of the above
Answer: Option-A
20. The language component of DBMS which can be embedded in a program is
(a). the database administrator (DBA)
(b). the data manipulation language (DML)
(c). the data definition language (DDL)
(d). a query language
Answer: Option-B
21. A computer system that permits multiple users to run programs at same time is _______
(a). Real time system
(b). Time sharing system
(c). Multiprogramming system
(d). Multi tasking system
Answer: Option-D
22. What is the output of the following code segment?
void test()
{
char c;
cin.get(c);
if (c!='\n'){
test();
cout.put(c);
}}
(a). It will print an empty line
(b). The string entered is printed as it is
(c). It will go into an infinite loop
(d). The string entered is printed in reverse order
Answer: Option-D
23. Which of the following statement is the negation of the statement, "10 is even and -5 is negative" (a). 10 is even and -5 is not negative
(b). 10 is odd and -5 is not negative
(c). 10 is even or -5 is not negative
(d). 10 is odd or -5 is not negative
Answer: Option-D
24. The __________ sort relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element
(a). selection sort
(b). quick sort
(c). insertion sort
(d). heap sort
Answer: Option-B
25. Which among the following is the data structure that is used to check balanced parenthesis in an expression
(a). Stack
(b). Tree
(c). Queue
(d). Array
Answer: Option-A
26. Which shortcut is used to permanently delete a file or folder from computer?
A:-Delete key
B:-alt + delete key
C:-Shift + delete key
D:-Ctrl + delete
Ans: C
27. In Cyber Law terminology, “DoS” means
A) Denial of Service B) Disc Operating System
C) Distant Operator Service D) None of these
Ans: A
28. The tracks on a disk which can be accessed without repositioning the R/W heads is
A) Surface B) Cylinder
C) Cluster D) All of the above
Ans: B
29. Which of the following is not a type of UNIX shell ?
A) KORN SHELL B) BOURNE SHELL
C) C SHELL D) JOIN SHELL
Ans: D
A) Denial of Service B) Disc Operating System
C) Distant Operator Service D) None of these
Ans: A
28. The tracks on a disk which can be accessed without repositioning the R/W heads is
A) Surface B) Cylinder
C) Cluster D) All of the above
Ans: B
29. Which of the following is not a type of UNIX shell ?
A) KORN SHELL B) BOURNE SHELL
C) C SHELL D) JOIN SHELL
Ans: D
30. The essential difference between an operating system like Linux and one like Windows
is that
A) Windows can run with an Intel whereas Linux cannot
B) Linux is proprietary whereas Windows is not
C) There are multiple versions of Linux, but only one version of Windows
D) Any programmer can modify Linux code which is not permitted with Windows
Ans: D
31. Use of electronic messaging systems to send unsolicited bulk messages are called
A) E-mail bombing B) Spamming
C) Cyber stalking D) Phishing
Ans: B
32. A hard disk is divided into tracks which are further subdivided into
A) Clusters B) Sectors
C) Vectors D) Heads
Ans: B
33. A character that is raised and smaller above the baseline is known as
A) Raised B) Outlined
C) Capscript D) Superscript
Ans: D
34. Commercial use domain names will normally use the following suffix in their website
address.
A) .net B) .gov
C) .com D) .org
Ans: C
35. Which is the core of the Linux operating system ?
A) Shell B) Kernel
C) Commands D) Script
Ans: B
36. In MS Word, the process of removing unwanted part of an image is called
A) Hiding B) Bordering
C) Cropping D) Cutting
Ans: C
is that
A) Windows can run with an Intel whereas Linux cannot
B) Linux is proprietary whereas Windows is not
C) There are multiple versions of Linux, but only one version of Windows
D) Any programmer can modify Linux code which is not permitted with Windows
Ans: D
31. Use of electronic messaging systems to send unsolicited bulk messages are called
A) E-mail bombing B) Spamming
C) Cyber stalking D) Phishing
Ans: B
32. A hard disk is divided into tracks which are further subdivided into
A) Clusters B) Sectors
C) Vectors D) Heads
Ans: B
33. A character that is raised and smaller above the baseline is known as
A) Raised B) Outlined
C) Capscript D) Superscript
Ans: D
34. Commercial use domain names will normally use the following suffix in their website
address.
A) .net B) .gov
C) .com D) .org
Ans: C
35. Which is the core of the Linux operating system ?
A) Shell B) Kernel
C) Commands D) Script
Ans: B
36. In MS Word, the process of removing unwanted part of an image is called
A) Hiding B) Bordering
C) Cropping D) Cutting
Ans: C
37. The possible operations in a dequeue are :
(A) Insertion and deletion at front (B) Insertion at rear and deletion at front
(C) Insertion and deletion at rear (D) Insertion and deletion at rear and front
Ans: D
38. Which sorting algorithm has an average time complexity of O(nlogn) ?
(A) Bubble sort (B) Insertion sort
(C) Heap sort (D) Selection sort
Ans: C
39. In a 5-way B-tree maximum and minimum number of key values in a node are
(A) 2 and 4 (B) 3 and 5
(C) 3 and 4 (D) 2 and 5
Ans: A
40. The average number of comparisons in selection sort and insertion sort are respectively
(A) n(n–l)/2 and n(n–l)/4 (B) n(n–l)/4 and n(n–l)/2
(C) n(n–l)/2 and n(n–l)/2 (D) n(n–l)/4 and n(n–l)/4
Ans: A
41. The time complexity of merging two sorted arrays of size m and n is :
(A) O(mn) (B) O(m+n)
(C) O(mn
) (D) None of the above
Ans: B
42. The use of threaded binary tree helps to :
(A) Reduce the space occupied by nodes
(B) Traversals can be done without stack space
(C) Less number of pointers are required
(D) None of the above
Ans: B
43. Of the following which is not an advantage in using a linked list data structure than a linear array ?
(A) No space wastage
(B) Insertion and deletion without shifting
(C) A particular element can be accessed directly
(D) Nodes can be allocated dynamically
Ans: C
44. Prefix form of the expression (a+b)/c*d*e is
(A) +/**edca (B) **/+abcde
(C) +/ed*c*ba (D) /+ab*c*de
Ans: B
45. Dijktra’s algorithm finds :
(A) Minimum cost spanning tree
(B) Shortest path from one node to all other nodes
(C) Shortest path between all pair of nodes
(D) None of the above
Ans: B
46. In a noiseless channel with a bandwidth of 4000 Hz transmitting signal with 2 signal levels, what
is the theoretical maximum bitrate achieved ?
(A) 10000 bps (B) 6000 bps
(C) 8000 bps (D) 4000 bps
Ans: C
47. In the fibre optic cables, what makes the ray to undergo reflection ?
(A) Angle of Incidence < Critical Angle
(B) Angle of Incidence = Critical Angle
(C) Angle of Incidence > Critical Angle
(D) Angle of Incidence <= Critical Angle
Ans: C
48. The layer in which datagram switching is normally done ?
(A) Network Layer (B) Transport Layer
(C) Ethernet Layer (D) Physical Layer
Ans: A
49. The Hamming Distance D between the two code words (10101011 and 11010101) is
(A) 4 (B) 5
(C) 6 (D) 8
Ans: C
50. Bridge is a connecting device which operates in the following layers :
(A) Physical layer and Data Link layer
(B) Data link layer and Network layer
(C) Network layer and Physical layer
(D) Data link layer and Transport layer
Ans: A
51. The multiplexing technique used for digital signals is
(A) Frequency Division Multiplexing
(B) Wave Division Multiplexing
(C) Carrier Division Multiple Access
(D) Time Division Multiplexing
Ans: D
52. Five channels each with 110 kHz bandwidth are to be multiplexed together. In order to prevent
interference there is a guard band of 20 kHz between the channels. The minimum bandwidth of
the link is atleast
(A) 640 kHz (B) 650 kHz
(C) 630 kHz (D) 550 kHz
Ans: C
53. The address space of Ipv4 is
(A) 2 power 128 (B) 2 power 16
(C) 2 power 48 (D) 2 power 32
Ans: D
54. MTU ( Maximum Transfer Unit) in bytes for Ethernet is
(A) 576 (B) 1500
(C) 296 (D) 4352
Ans: B
55. Which header field in Ipv6 addressing takeover the function of Ipv4 Service Type field ?
(A) Header checksum (B) Hop limit
(C) Priority and flow label (D) Encrypted Security Payload
Ans: C
56. ARP reply is
(A) Broadcast (B) Multicast
(C) Unicast (D) Anycast
Ans: C
57. Two node / Three node instability is a problem that happens in
(A) Distance Vector Routing (B) Link State Routing
(C) Path Vector Routing (D) Shortest Path Routing
Ans: A
58. Which among the following is false ?
(A) SCTP is a reliable protocol
(B) SCTP is a byte oriented protocol
(C) SCTP combines the best features of TCP and UDP
(D) SCTP is a message oriented protocol
Ans: B
59. A situation where two or more threads access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called :
(A) aging (B) race condition
(C) data consistency (D) starvation
Ans: B
60. Bit used for trapping Illegal addresses is :
(A) access (B) protection
(C) error (D) valid – invalid
Ans: D
61. The offset of the logical address must be :
(A) greater than the segment number (B) between 0 and segment limit
(C) between 1 and the segment number (D) greater than segment limit
Ans: B
62. If the resources are always preempted from the same process, ______ can occur.
(A) starvation (B) deadlock
(C) system crash (D) aging
Ans: A
63. External fragmentation will not occur when
(A) best fit is used (B) worst fit is used
(C) first fit is used (D) it will always occur
Ans: D
64. Object modules generated by assembler that contains unresolved external references are resolved by
(A) Operating System (B) Loader
(C) Linker (D) Compiler
Ans: C
65. Special software that is used to create a job queue is called
(A) Loader (B) Spooler
(C) Linker (D) Linkage editor
Ans: B
66. Which of the following permanent database that has an entry for each terminal symbol ?
(A) Literal table (B) Identifier table
(C) Terminal table (D) Stack
Ans: C
67. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as
(A) Semaphore (B) Mutual exclusion
(C) Message passing (D) Multiprocessing
Ans: B
68. How many state can a process be in ?
(A) 3 (B) 4
(C) 5 (D) 2
Ans: C
69. Which of the following is the simplest way of deadlock recovery ?
(A) Pre-empt resource (B) Lock one of the processes
(C) Roll back (D) Kill one of the processes
Ans: D
70. The directory structure used in Unix file system is called
(A) Directed acyclic graph (B) Hierarchical directory
(C) Tree structured directory (D) None of the above
Ans: A
71. The degree of multiprogramming is controlled by
(A) CPU scheduler (B) Job scheduler
(C) Medium term scheduler (D) Kernel
Ans: B
72. The protocol which writes the information directly into main memory is
(A) Write through (B) Write back
(C) Write first (D) None of the mentioned
Ans: A
73. In a circular linked list the external pointer to the last node helps to :
(A) Delete an item from the front
(B) Add an item to the last position
(C) Delete an item from the first position
(D) All of the above
Ans: D
74:-_________ keyword allows a child class to inherit properties from its parent class in Java.
A:-Inherit B:-Extends C:-(1) and (2) D:-None
Ans: B
75:-Which memory allocation strategy places a program in the largest available partition in the main memory?
A:-Worst fit B:-Last fit C:-First fit D:-Best fit
Ans: A
76:-Which of the following has the lowest access time?
A:-Cache B:-RAM C:-Magnetic disc D:-Registers
Ans: D
77:-________ operator in C can only be used with integers.
A:-Addition B:-Modulus C:-Sizeof D:-Conditional
Ans: B
78:-URL stands for ________.
A:-Uniform Registry Locator B:-Universal Resource List
C:-Uniform Resource Locator D:-Universal Registry List
Ans: C
79:-____________ is the diagnostic testing sequence that BIOS runs to determine if the hardware components are working properly when the computer is turned on.
A:-DOT B:-CMOS
C:-POST D:-PING
Ans: C
80:-A quadbit is also known as __________.
A:-Nibble B:-Bit C:-Byte D:-Petabyte
Ans: A
(A) Insertion and deletion at front (B) Insertion at rear and deletion at front
(C) Insertion and deletion at rear (D) Insertion and deletion at rear and front
Ans: D
38. Which sorting algorithm has an average time complexity of O(nlogn) ?
(A) Bubble sort (B) Insertion sort
(C) Heap sort (D) Selection sort
Ans: C
39. In a 5-way B-tree maximum and minimum number of key values in a node are
(A) 2 and 4 (B) 3 and 5
(C) 3 and 4 (D) 2 and 5
Ans: A
40. The average number of comparisons in selection sort and insertion sort are respectively
(A) n(n–l)/2 and n(n–l)/4 (B) n(n–l)/4 and n(n–l)/2
(C) n(n–l)/2 and n(n–l)/2 (D) n(n–l)/4 and n(n–l)/4
Ans: A
41. The time complexity of merging two sorted arrays of size m and n is :
(A) O(mn) (B) O(m+n)
(C) O(mn
) (D) None of the above
Ans: B
42. The use of threaded binary tree helps to :
(A) Reduce the space occupied by nodes
(B) Traversals can be done without stack space
(C) Less number of pointers are required
(D) None of the above
Ans: B
43. Of the following which is not an advantage in using a linked list data structure than a linear array ?
(A) No space wastage
(B) Insertion and deletion without shifting
(C) A particular element can be accessed directly
(D) Nodes can be allocated dynamically
Ans: C
44. Prefix form of the expression (a+b)/c*d*e is
(A) +/**edca (B) **/+abcde
(C) +/ed*c*ba (D) /+ab*c*de
Ans: B
45. Dijktra’s algorithm finds :
(A) Minimum cost spanning tree
(B) Shortest path from one node to all other nodes
(C) Shortest path between all pair of nodes
(D) None of the above
Ans: B
46. In a noiseless channel with a bandwidth of 4000 Hz transmitting signal with 2 signal levels, what
is the theoretical maximum bitrate achieved ?
(A) 10000 bps (B) 6000 bps
(C) 8000 bps (D) 4000 bps
Ans: C
47. In the fibre optic cables, what makes the ray to undergo reflection ?
(A) Angle of Incidence < Critical Angle
(B) Angle of Incidence = Critical Angle
(C) Angle of Incidence > Critical Angle
(D) Angle of Incidence <= Critical Angle
Ans: C
48. The layer in which datagram switching is normally done ?
(A) Network Layer (B) Transport Layer
(C) Ethernet Layer (D) Physical Layer
Ans: A
49. The Hamming Distance D between the two code words (10101011 and 11010101) is
(A) 4 (B) 5
(C) 6 (D) 8
Ans: C
50. Bridge is a connecting device which operates in the following layers :
(A) Physical layer and Data Link layer
(B) Data link layer and Network layer
(C) Network layer and Physical layer
(D) Data link layer and Transport layer
Ans: A
51. The multiplexing technique used for digital signals is
(A) Frequency Division Multiplexing
(B) Wave Division Multiplexing
(C) Carrier Division Multiple Access
(D) Time Division Multiplexing
Ans: D
52. Five channels each with 110 kHz bandwidth are to be multiplexed together. In order to prevent
interference there is a guard band of 20 kHz between the channels. The minimum bandwidth of
the link is atleast
(A) 640 kHz (B) 650 kHz
(C) 630 kHz (D) 550 kHz
Ans: C
53. The address space of Ipv4 is
(A) 2 power 128 (B) 2 power 16
(C) 2 power 48 (D) 2 power 32
Ans: D
54. MTU ( Maximum Transfer Unit) in bytes for Ethernet is
(A) 576 (B) 1500
(C) 296 (D) 4352
Ans: B
55. Which header field in Ipv6 addressing takeover the function of Ipv4 Service Type field ?
(A) Header checksum (B) Hop limit
(C) Priority and flow label (D) Encrypted Security Payload
Ans: C
56. ARP reply is
(A) Broadcast (B) Multicast
(C) Unicast (D) Anycast
Ans: C
57. Two node / Three node instability is a problem that happens in
(A) Distance Vector Routing (B) Link State Routing
(C) Path Vector Routing (D) Shortest Path Routing
Ans: A
58. Which among the following is false ?
(A) SCTP is a reliable protocol
(B) SCTP is a byte oriented protocol
(C) SCTP combines the best features of TCP and UDP
(D) SCTP is a message oriented protocol
Ans: B
59. A situation where two or more threads access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called :
(A) aging (B) race condition
(C) data consistency (D) starvation
Ans: B
60. Bit used for trapping Illegal addresses is :
(A) access (B) protection
(C) error (D) valid – invalid
Ans: D
61. The offset of the logical address must be :
(A) greater than the segment number (B) between 0 and segment limit
(C) between 1 and the segment number (D) greater than segment limit
Ans: B
62. If the resources are always preempted from the same process, ______ can occur.
(A) starvation (B) deadlock
(C) system crash (D) aging
Ans: A
63. External fragmentation will not occur when
(A) best fit is used (B) worst fit is used
(C) first fit is used (D) it will always occur
Ans: D
64. Object modules generated by assembler that contains unresolved external references are resolved by
(A) Operating System (B) Loader
(C) Linker (D) Compiler
Ans: C
65. Special software that is used to create a job queue is called
(A) Loader (B) Spooler
(C) Linker (D) Linkage editor
Ans: B
66. Which of the following permanent database that has an entry for each terminal symbol ?
(A) Literal table (B) Identifier table
(C) Terminal table (D) Stack
Ans: C
67. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as
(A) Semaphore (B) Mutual exclusion
(C) Message passing (D) Multiprocessing
Ans: B
68. How many state can a process be in ?
(A) 3 (B) 4
(C) 5 (D) 2
Ans: C
69. Which of the following is the simplest way of deadlock recovery ?
(A) Pre-empt resource (B) Lock one of the processes
(C) Roll back (D) Kill one of the processes
Ans: D
70. The directory structure used in Unix file system is called
(A) Directed acyclic graph (B) Hierarchical directory
(C) Tree structured directory (D) None of the above
Ans: A
71. The degree of multiprogramming is controlled by
(A) CPU scheduler (B) Job scheduler
(C) Medium term scheduler (D) Kernel
Ans: B
72. The protocol which writes the information directly into main memory is
(A) Write through (B) Write back
(C) Write first (D) None of the mentioned
Ans: A
73. In a circular linked list the external pointer to the last node helps to :
(A) Delete an item from the front
(B) Add an item to the last position
(C) Delete an item from the first position
(D) All of the above
Ans: D
74:-_________ keyword allows a child class to inherit properties from its parent class in Java.
A:-Inherit B:-Extends C:-(1) and (2) D:-None
Ans: B
75:-Which memory allocation strategy places a program in the largest available partition in the main memory?
A:-Worst fit B:-Last fit C:-First fit D:-Best fit
Ans: A
76:-Which of the following has the lowest access time?
A:-Cache B:-RAM C:-Magnetic disc D:-Registers
Ans: D
77:-________ operator in C can only be used with integers.
A:-Addition B:-Modulus C:-Sizeof D:-Conditional
Ans: B
78:-URL stands for ________.
A:-Uniform Registry Locator B:-Universal Resource List
C:-Uniform Resource Locator D:-Universal Registry List
Ans: C
79:-____________ is the diagnostic testing sequence that BIOS runs to determine if the hardware components are working properly when the computer is turned on.
A:-DOT B:-CMOS
C:-POST D:-PING
Ans: C
80:-A quadbit is also known as __________.
A:-Nibble B:-Bit C:-Byte D:-Petabyte
Ans: A
- Computer Application
- Computer Application- Page 1
- Computer Science
- Computer Science- Page 1
- Computer Science- Page 2
- Computer Science- Page 3
- Computer Science- Page 4
- Computer Science- Page 5
- Computer Science- Page 6
- Computer Science- Page 7
- Computer Science- Page 8
- Computer Science- Page 9
- Computer Science- Page 10
- Computer Science- Page 11
- Computer Science- Page 12
- Computer Science- Page 13
- Computer Science- Page 14
- Computer Science- Page 15