📚 Exam by Category
▾
Objective Questions

Latest JK SET Computer Science Exam Question (Objective Questions), MCQ in English

Subjects : Computer Science

Question Bank JK SET Computer Science (Paper 2) Exam - English
Back to Exam

Computer Science

Question 1Single Answer
The postfix expression AB + CD − can be evaluated using a
  1. A
    stack
  2. B
    tree
  3. C
    queue
  4. D
    linked list
Question 2Single Answer
The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal .
  1. A
    ABFCDE
  2. B
    ADBFEC
  3. C
    ABDECF
  4. D
    None of the above
Question 3Single Answer
The branch logic that provides making capabilities in the control unit is known as
  1. A
    Controlled transfer
  2. B
    Conditional transfer
  3. C
    Unconditional transfer
  4. D
    None of the above
Question 4Single Answer
The number of colour required to properly colour the vertices of every planer graph is
  1. A
    2
  2. B
    3
  3. C
    4
  4. D
    5
Question 5Single Answer
In multiuser database if two users wish update the same record at the same time, they are prevented from doing so by
  1. A
    Jamming
  2. B
    Password
  3. C
    Documentation
  4. D
    Record lock
Question 6Single Answer
A binary search tree is a binary tree :
  1. A
    All items in the left subtree are less than root
  2. B
    All items in the right subtree greater than or equal to the root
  3. C
    Each subtree is itself a binary search tree
  4. D
    All of the above
Question 7Single Answer
What deletes the entire file except the file structure ?
  1. A
    ERASE
  2. B
    DELETE
  3. C
    ZAP
  4. D
    PACK
Question 8Single Answer
Which command is the fastest among the following ?
  1. A
    COPY TO < NEW FILE >
  2. B
    COPY STRUCTURE TO < NEW FILE >
  3. C
    COPY FILE < FILE 1> < FILE 2 >
  4. D
    COPY TO MFILE-DAT DELIMITED
Question 9Single Answer
B+ tree are preferred to binary tree in Database because ?
  1. A
    Disk capacity are greater than memory
  2. B
    Disk access is much slower than memory access
  3. C
    Disk data transfer rates are much less than memory data transfer rate
  4. D
    Disks are more reliable than memory
Question 10Single Answer
A Transaction Manager is which of the following ?
  1. A
    maintains a log of transactions
  2. B
    Maintains before and after database images
  3. C
    maintains appropriate concurrency control
  4. D
    All of the above
Question 11Single Answer
Truth value of a proposition p ∧ ¬p is?
  1. A
    True
  2. B
    Cannot be determined
  3. C
    Sometimes True
  4. D
    False
Question 12Single Answer
Negation of “All humans are mortal” is?
  1. A
    Some humans are not mortal
  2. B
    All humans are not mortal
  3. C
    No human is mortal
  4. D
    Some humans are mortal
Question 13Single Answer
Which is a tautology?
  1. A
    p ∧ ¬p
  2. B
    p ∧ p
  3. C
    p ∨ ¬p
  4. D
    p → ¬p
Question 14Single Answer
Contrapositive of p → q is?
  1. A
    q → p
  2. B
    ¬p → ¬q
  3. C
    ¬q → ¬p
  4. D
    p → ¬q
Question 15Single Answer
A valid inference rule is?
  1. A
    Fallacy
  2. B
    Contradiction
  3. C
    Paradox
  4. D
    Modus Ponens
Question 16Single Answer
De Morgan’s law is?
  1. A
    ¬(p ∧ q) = ¬p ∧ ¬q
  2. B
    ¬(p ∨ q) = ¬p ∨ ¬q
  3. C
    p ∧ q = p ∨ q
  4. D
    ¬(p ∧ q) = ¬p ∨ ¬q
Question 17Single Answer
Disjunctive Normal Form (DNF) is?
  1. A
    Sum of products
  2. B
    Product of sums
  3. C
    Only AND form
  4. D
    Only OR form
Question 18Single Answer
Conjunctive Normal Form (CNF) is?
  1. A
    Sum of products
  2. B
    Only NOT form
  3. C
    Only OR form
  4. D
    Product of sums
Question 19Single Answer
A predicate becomes a proposition when?
  1. A
    It has variables
  2. B
    It has quantifiers
  3. C
    All variables are assigned values
  4. D
    It is negated
Question 20Single Answer
Universal quantifier symbol is?
  1. A
    ∃
  2. B
    ∈
  3. C
    ∀
  4. D
    ⊂
Question 21Single Answer
Existential quantifier means?
  1. A
    For all
  2. B
    None exists
  3. C
    There exists
  4. D
    Exactly one
Question 22Single Answer
Set A ∪ A equals?
  1. A
    Ø
  2. B
    A
  3. C
    Universal set
  4. D
    A'
Question 23Single Answer
Set A ∩ A equals?
  1. A
    Ø
  2. B
    A'
  3. C
    Universal set
  4. D
    A
Question 24Single Answer
A relation that is reflexive, symmetric, transitive is?
  1. A
    Partial order
  2. B
    Function
  3. C
    Equivalence relation
  4. D
    Injection
Question 25Single Answer
A partially ordered set must be?
  1. A
    Reflexive, symmetric, transitive
  2. B
    Symmetric only
  3. C
    Reflexive, antisymmetric, transitive
  4. D
    Transitive only
Question 26Single Answer
Number of subsets of a set with n elements is?
  1. A
    n²
  2. B
    2n
  3. C
    n!
  4. D
    2^n
Question 27Single Answer
Pigeonhole principle is used for?
  1. A
    Sorting
  2. B
    Searching
  3. C
    Counting distribution
  4. D
    Encryption
Question 28Single Answer
Permutation formula is?
  1. A
    nCr
  2. B
    r!
  3. C
    n!
  4. D
    n!/(n−r)!
Question 29Single Answer
Combination formula is?
  1. A
    n!/(n−r)!
  2. B
    n!/(r!(n−r)!)
  3. C
    n!
  4. D
    r!
Question 30Single Answer
Probability of sure event is?
  1. A
    0
  2. B
    1
  3. C
    -1
  4. D
    1/2
Question 31Single Answer
Bayes theorem is used for?
  1. A
    Sorting data
  2. B
    Updating probability
  3. C
    Graph traversal
  4. D
    Matrix inversion
Question 32Single Answer
A group must have?
  1. A
    Only closure
  2. B
    Closure, identity, inverse
  3. C
    Only identity
  4. D
    Only inverse
Question 33Single Answer
A subgroup is?
  1. A
    Subset of group that is itself a group
  2. B
    Not a group
  3. C
    Random subset
  4. D
    Empty set
Question 34Single Answer
A semigroup has?
  1. A
    Identity only
  2. B
    Inverse only
  3. C
    Associative operation
  4. D
    Commutativity only
Question 35Single Answer
Isomorphism preserves?
  1. A
    Structure
  2. B
    Size only
  3. C
    Elements only
  4. D
    Order only
Question 36Single Answer
Homomorphism preserves?
  1. A
    Only elements
  2. B
    Operation structure
  3. C
    Only identity
  4. D
    Only inverse
Question 37Single Answer
A ring has?
  1. A
    One operation
  2. B
    Three operations
  3. C
    Two operations
  4. D
    No operation
Question 38Single Answer
A field is?
  1. A
    Only additive group
  2. B
    Semigroup
  3. C
    Commutative division ring
  4. D
    Monoid
Question 39Single Answer
Graph with no loops and no multiple edges is?
  1. A
    Multigraph
  2. B
    Directed graph
  3. C
    Simple graph
  4. D
    Weighted graph
Question 40Single Answer
Eulerian circuit exists if graph is?
  1. A
    All vertices odd degree
  2. B
    Disconnected
  3. C
    All vertices even degree
  4. D
    Tree
Question 41Single Answer
Hamiltonian path visits?
  1. A
    Edges only once
  2. B
    Vertices exactly once
  3. C
    Edges twice
  4. D
    No vertices
Question 42Single Answer
Shortest path algorithm is?
  1. A
    DFS
  2. B
    BFS
  3. C
    Dijkstra
  4. D
    Prim
Question 43Single Answer
A tree is?
  1. A
    Cyclic graph
  2. B
    Disconnected graph
  3. C
    Connected acyclic graph
  4. D
    Weighted graph
Question 44Single Answer
Number of edges in tree with n nodes is?
  1. A
    n
  2. B
    n−1
  3. C
    n+1
  4. D
    2n
Question 45Single Answer
Bipartite graph has?
  1. A
    Two disjoint sets
  2. B
    One set
  3. C
    Three sets
  4. D
    No vertices
Question 46Single Answer
Graph coloring is used for?
  1. A
    Encryption
  2. B
    Scheduling
  3. C
    Sorting
  4. D
    Searching
Question 47Single Answer
Boolean algebra uses values?
  1. A
    0 and 2
  2. B
    -1 and 1
  3. C
    0 and 1
  4. D
    Any integer
Question 48Single Answer
Boolean identity: A + 0 = ?
  1. A
    A
  2. B
    0
  3. C
    1
  4. D
    A'
Question 49Single Answer
Boolean identity: A · 1 = ?
  1. A
    A
  2. B
    0
  3. C
    1
  4. D
    A'
Question 50Single Answer
Distributive law is?
  1. A
    A + (B·C) = (A+B)(A+C)
  2. B
    Both a and b
  3. C
    A·(B+C) = A·B + A·C
  4. D
    None
Important Questions Package

JK SET Computer Science Exam Online Question Bank Package

Buy JK SET Computer Science Important Questions, MCQ, question answer in Hindi & English. It will help you to score high marks in JK SET Computer Science question bank 2026 in Online, PDF & Print study material.

+ Free Monthly Current Affairs, GK & more PDF Download
Sr.Package NameAmount
1.JK SET Computer Science (Paper 2) Exam - English
Description : 1000 Question with Answer.
₹101 [₹500]
2.JK SET Computer Science (Paper 2) Exam - English
Description : 2000 Question with Answer.
₹151 [₹500]
3.JK SET Computer Science (Paper 2) Exam - English
Description : 3000 Question with Answer.
₹181 [₹500]
4.JK SET Computer Science (Paper 2) Exam - English
Description : 4000 Question with Answer.
₹201 [₹500]
5.JK SET Computer Science (Paper 2) Exam - English
Description : 5000 Question with Answer.
₹221 [₹500]
6.JK SET Computer Science (Paper 2) Exam - English
Description : 1000 Question & Answer Download in PDF (Send by Email)
₹151 [₹450]
7.JK SET Computer Science (Paper 2) Exam - English
Description : 1000 Question with Answer (Printed Material)
₹390 [₹600]
Back to Exam