Computer Science MCQ for Competitive Exams

objective practice questions and answers on Computer Science : Computer Science always plays an important role in the exam and proves to be effective in getting your good marks. Computer Science MCQ with detailed explanations for students & freshers preparing for entrance exams .Today in this post we are giving you important questions and their answers of Computer Science Objective GK Questions and Answers.

If you prepare competitive exam you read other article . Computer Science questions and answers with explanations are provided for your competitive exams and entrance tests. These Computer MCQ most important for many exam like – State TET, UPTET, CTET, MPTET, REET. Here in this article you read Computer Science MCQ for Competitive Exams Question Answer.

Bpsc computer science mcq questions

Computer Science Questions (MCQ) with Answers

Q. What is the foll form of SQL?

  1. Structured Query List
  2. Structure Query Language
  3. Sample Query Language
  4. None of these.

Answer :- B

Explanation: SQL is a programming language used for managing data in a relational database management system. It is pronounced as See-Qwell.

Q. Which of the following are TCL commands?

  1. COMMIT and RolLBACK
  2. UPDATE and TRUNCATE
  3. SELECT and INSERT
  4. GRANT and REVOKE

Answer :- A

Explanation: TCL stands for Transaction Control Commands

Q. Which statement is used to delete all rows in a table without having the action logged?

  1. DELETE
  2. REMOVE
  3. DROP
  4. TRUNCATE

Answer :- D

Explanation: TRUNCATE statement removes all rows in a table without logging the individual row deletions.

Q. Which of the following is not Constraint in SQL?

  1. Primary Key
  2. Not Noll
  3. Check
  4. Union

Answer :- D

Q. Which data manipolation command is used to combines the records from one or more tables?

  1. SELECT
  2. PROJECT
  3. JOIN
  4. PRODUCT

Answer :- C

Q. What is returned by INSTR (‘JAVAT POINT’, ‘P’?

  1. 6
  2. 7
  3. POINT
  4. JAVAT

Answer :- B

Q. A command that lets you change one or more field in a table is:

  1. INSERT
  2. MODIFY
  3. LOOK-UP
  4. All of the above

Answer :- B

Q. Which of the following is true about the HAVING clause?

  1. Similar to the WHERE clause but is used for columns rather than groups.
  2. Similar to WHERE clause but is used for rows rather than columns.
  3. Similar to WHERE clause but is used for groups rather than rows.
  4. Acts exactly like a WHERE clause.

Answer :- C

Q. _______ clause creates temporary relation for the query on which it is defined.

  1. WITH
  2. FROM
  3. WHERE
  4. SELECT

Answer :- A

Q. The SQL statement:SELECT ROUND (65.726, -1 FROM DUAL;

Prints:

  1. is illegal
  2. garbage
  3. 726
  4. 70

Answer :- D

Q. How many bytes are needed for encoding 2000 bits of data?

  1. 5 Byte
  2. 2 bytes
  3. 4 bytes
  4. 8 bytes

Answer :- b 2 bytes

Explanation: Only 2 bytes are required for encoding the 2000 bits of data.

Q. The cardinality of the set of even positive integers less than 20 is__________?

  1. 8
  2. 10
  3. 9
  4. 12

Answer :- c 9

Q. How many relations exist from set X to set Y if the set X and set Y has 7 and 8 elements?

  1. 256
  2. 272
  3. 356
  4. 56

Answer :- a 256

Q. The number of reflexive closure of the relation {(0,1, (1,1, (1,3, (2,1, (2,2, (3,0} on the set {0, 1, 2, 3} is________.

  1. 36
  2. 8
  3. 6
  4. 26

Answer :- c 6

Q. Which option is the negation of the bits “1001011”?

  1. 11011011
  2. 10110100
  3. 0110100
  4. 1100100

Answer :- c 0110100

Explanation: The negation of the given bits is the opposite value of the bits.

Q. Boolean algebra deals with how many values.

  1. It deals with only four discrete values.
  2. It deals with only five discrete values.
  3. It deals with only three discrete values.
  4. It deals with only two discrete values.

Answer :- d It deals with only two discrete values.

Q. Which of the following matrix having only one column and moltiple rows?

  1. Diagonal Matrix
  2. Row Matrix
  3. Column Matrix
  4. None of the mentioned

Answer :- (C) Column Matrix.

Q. Universal logic gate is__________.

  1. OR
  2. NOT
  3. NAND
  4. AND

Answer :- (C) NAND

Q. In which year Maurice Karnaughin introduced the Karnaugh map?

  1. 1953
  2. 1956
  3. 1952
  4. 1950

Answer :- (A) 1953

Explanation: In the year 1953, Maurice Karnaughin invented the Karnaugh map.

Q. Canonical forms for a boolean expression has _______ types.

  1. Three types
  2. Four types
  3. Two types
  4. Five types

Answer :- (C) Two types.

Q. Which search compares each element with the searching element till not found?

  1. Merge search
  2. Sequential Search
  3. Binary search
  4. none of the mentioned

Answer :- (B) Sequential search

Q. What is the complexity of the bubble sort algorithm?

  1. O(n2
  2. O(n
  3. O(log n
  4. O(n log n

Answer :- (A) O(n2

Q. How can we initialize an array in C language?

  1. int arr[2]=(10, 20
  2. int arr(2={10, 20}
  3. int arr[2] = {10, 20}
  4. int arr(2 = (10, 20

Answer :- (C)

Q. Which of the following highly uses the concept of an array?

  1. Binary Search tree
  2. Caching
  3. Spatial locality
  4. Schedoling of Processes

Answer :- (C)

Q. When the user tries to delete the element from the empty stack then the condition is said to be a ____

  1. Underflow
  2. Garbage collection
  3. Overflow
  4. None of the above

Answer :- (A)

Q. Which data structure is mainly used for implementing the recursive algorithm?

  1. Queue
  2. Stack
  3. Binary tree
  4. Linked list

Answer :- (B)

Q. Which of the following is the prefix form of A+B*C?

  1. A+(BC*
  2. +AB*C
  3. ABC+*
  4. +A*BC

Answer :- (D)

Q. What is another name for the circolar queue among the following options?

  1. Square buffer
  2. Rectangle buffer
  3. Ring buffer
  4. None of the above

Answer :- (C)

Q. If the elements ‘1’, ‘2’, ‘3’ and ‘4’ are inserted in a queue, what woold be order for the removal?

  1. 1234
  2. 4321
  3. 3241
  4. None of the above

Answer :- (A)

Q. Which one of the following is not the type of the Queue?

  1. Linear Queue
  2. Circolar Queue
  3. Double ended Queue
  4. Single ended Queue

Answer :- (D)

Q. Consider the following code.int fun( { if(isEmpty( { return -10; } else { int n; n= q[front]; front++; return n; } }

Which operation does the above code perform?

  1. Enqueue
  2. Dequeue
  3. Return the front element
  4. Both b and c

Answer :- (D)

Q. The necessary condition to be checked before deletion from the Queue is__

  1. Overflow
  2. Underflow
  3. Rear value
  4. Front value

Answer :- (B)

Q. Which of the following principle is used if two elements in the priority queue have the same priority?

  1. LIFO
  2. FIFO
  3. Linear tree
  4. None of the above

Answer :- (B)

Q. A linear data structure in which insertion and deletion operations can be performed from both the ends is___

  1. Queue
  2. Deque
  3. Priority queue
  4. Circolar queue

Answer :- (B)

Q. The oldest DB model is _______________

(A) Network
(B) Physical
(C) Hierarchical
(D) Relational

Answer: a

Q. The logical design, and the snapshot of the data at a given instant in time is known as?

(A) Instance & Relation
(B) Relation & Schema
(C) Domain & Schema
(D) Schema & Instance

Answer: d

Share Now :-