Question for HP SET Computer Science and Applications 2026 - Quiz / Questions / MCQ

Objective Questions

Latest HP SET Computer Science and Applications Exam Question (Objective Questions), MCQ in English

Subjects : Computer Science and Applications

Question Bank HP SET Computer Science and Applications Exam Paper 2 - English

Back to Exam

Computer Science and Applications

Question 1Single Answer

The postfix expression AB + CD − can be evaluated using a

Astack
Btree
Cqueue
Dlinked list

Question 2Single Answer

The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal .

AABFCDE
BADBFEC
CABDECF
DNone of the above

Question 3Single Answer

The branch logic that provides making capabilities in the control unit is known as

AControlled transfer
BConditional transfer
CUnconditional transfer
DNone of the above

Question 4Single Answer

The number of colour required to properly colour the vertices of every planer graph is

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

AJamming
BPassword
CDocumentation
DRecord lock

Question 6Single Answer

A binary search tree is a binary tree :

AAll items in the left subtree are less than root
BAll items in the right subtree greater than or equal to the root
CEach subtree is itself a binary search tree
DAll of the above

Question 7Single Answer

What deletes the entire file except the file structure ?

AERASE
BDELETE
CZAP
DPACK

Question 8Single Answer

Which command is the fastest among the following ?

ACOPY TO < NEW FILE >
BCOPY STRUCTURE TO < NEW FILE >
CCOPY FILE < FILE 1> < FILE 2 >
DCOPY TO MFILE-DAT DELIMITED

Question 9Single Answer

B⁺ tree are preferred to binary tree in Database because ?

ADisk capacity are greater than memory
BDisk access is much slower than memory access
CDisk data transfer rates are much less than memory data transfer rate
DDisks are more reliable than memory

Question 10Single Answer

A Transaction Manager is which of the following ?

Amaintains a log of transactions
BMaintains before and after database images
Cmaintains appropriate concurrency control
DAll of the above

Question 11Single Answer

Leaves of which of the following trees are at the sam level ?

ABinary tree
BB-tree
CAVL-tree
DExpression tree

Question 12Single Answer

Which of the following TCP/IP Internet protocol is diskless machine uses to obtain its IP address from a server ?

ARAP
BRIP
CARP
DX.25

Question 13Single Answer

Decryption and encryption of data are the responsibility of which of the following later ?

APhysical layer
BData Link layer
CPresentation layer
DSession layer

Question 14Single Answer

In which circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM ?

ASpace division
BTime division
CVirtual
DPacket

Question 15Single Answer

In which Routing Method do all the routers have a common database ?

ADistance vector
BLink state
CLink vector
DDijkestra method

Question 16Single Answer

Page Shift Keying (PSK) Method is used to modulate digital signal at 9600 bps using 16 level. Find the line signals and speed (i.e. modulation rate) .

A2400 bauds
B1200 bauds
C4800 bauds
D9600 bauds

Question 17Single Answer

The station to hub distance in which it is 2000 metres .

A100 Base - T_x
B100 Base-F_x
C100 Base-T₄
D100 Base-T₁

Question 18Single Answer

Main aim of software engineering is to produce

Aprogram
Bsoftware
Cwithin budget
Dsoftware within budget in the given schedule

Question 19Single Answer

Key process area of CMM level 4 are also clasified by a process which is

ACMM level 2
BCMM level 3
CCMM level 5
DAll of the above

Question 20Single Answer

Validation means -

Aare we bulding the product right
Bare we building the right product
CVerification of fields
DNone of the above

Question 21Single Answer

If a process is under statistical control, then it is

AMaintainable
BMeasurable
CPredictable
DVerifiable

Question 22Single Answer

In a function oriented design, we

Aminimize cohesion and maximize coupling
Bmaximize cohesion and minimize coupling
Cmaximize cohesion and maximize coupling
Dminimize cohesion and minimize coupling

Question 23Single Answer

Which of the following metric does not depend on the programming language used ?

ALine of code
BFunction count
CMember of token
DAll of the above

Question 24Single Answer

A/B⁺ tree index is to be built on the name atribute of the relation STUDENT. Asume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given the scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B⁺ tree ?

Question 25Single Answer

The inorder traversal of the tree will yield a sorted listing of elements of tree in

ABinary tree
BBinary search tree
CHeaps
DNone of the above

Question 26Single Answer

Mobile IP provides two basic functions .

ARoute discovery and registration
BAgent discovery and registration
CIP binding and registration
DNone of the above

Question 27Single Answer

Pre-emptive scheduling is the strategy of temporarily suspending a gunning process

Abefore the CPU time slice expires
Bto allow starving processes to run
Cwhen it requests I/O
Dto avoid collision

Question 28Single Answer

In round robin CPU scheduling as time quantum is increased the average turn around time

Aincreases
Bdecreases
Cremains constant
Dvaries irregularly

Question 29Single Answer

Resources are allocated to the process on nonsharable basis is

Amutual exclusion
Bhold and wait
Cno pre-emption
Dcircular wait

Question 30Single Answer

Cached and interleaved memories are ways of speeding up memory access between CPU's and slower RAM. Which memory models are best suited (i.e. improves the performance most) for which programs ?
(i) Cached memory is best suited for small loops
(ii) Inteleaved memory is best suited for small loops
(iii) Interleaved memory is best suited for large sequential
(iv) Cached memory is best suited for large sequential
code :

A(i) and (ii) are true
B(i) and (iii) are true
C(iv) and (ii) are true
D(iv) and (iii) are true

Question 31Single Answer

Consider the following page trace :
4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m = 4 will be

Question 32Single Answer

Check sum used along with each packet computes the sum of the data, where data is treated as a sequence of

AInteger
BCharacter
CReal numbers
DBits

Question 33Single Answer

If an integer needs two bytes of storage, then the maximum value of a signed integer is

A2¹⁶ − 1
B2¹⁵ − 1
C2¹⁶
D2¹⁵

Question 34Single Answer

Which of the following logic families is well suited for high-speed operations ?

ATTL
BECL
CMOS
DCMOS

Question 35Single Answer

Interrupts which are initiated by an instruction are

AInterrupts
BExternal
CHardware
DSoftware

Question 36Single Answer

printf (" %c", 100) ;

Aprints 100
Bprints ASCII equivalent of 100
Cprints garbage
DNone of the above

Question 37Single Answer

For the transmission of the signal, Bluetooth wireless technology uses

Atime division multiplexing
Bfrequency division multiplexing
Ctime division duplex
Dfrequency division duplex

Question 38Single Answer

Consider the following statements :
I. Recursive languages are closed under complementation
II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation
Which of the above statements are true ?

AI only
BI and II
CI and III
DII and III

Question 39Single Answer

What is the routing algorithm used by RIP and IGRP ?

AOSPF
BLink-state
CDynamic
DDijkestra vector

Question 40Single Answer

Identify the incorrect statement :

AThe overall strategy drives the E-commerce data warehousing strategy
BData warehousing in an E-Commerce environment should be done in a classical manner
CE-commerce opens up an entirely new world of web server
DE-Commerce security threats can be grouped into three major categories

Question 41Single Answer

Reliability of software is directly dependent on

Aquality of the design
Bnumber of errors present
Csoftware engineering experience
Duser requirement

Question 42Single Answer

_________is not an E-commerce application .

AHouse banking
BBuying stocks
CConducting an auction
DEvaluating an employee

Question 43Single Answer

______ is a satellite based tracking system that enables the determination of person's position .

ABluetooth
BWAP
CShort Message Service
DGlobal Positioning system

Question 44Single Answer

A complete microcomputer system consists of

AMicroprocessor
BMemory
CPeripheral equipment
DAll of the above

Question 45Single Answer

Where does a computer add and compare data ?

AHard disk
BFloppy disk
CCPU chip
DMemory chip

Question 46Single Answer

Pipelining strategy is called implement

Ainstruction execution
Binstruction prefetch
Cinstruction decoding
Dinstruction manipulation

Question 47Single Answer

Which of the following data structure is linear type ?

AStrings
BLists
CQueues
DAll of the above

Question 48Single Answer

To reresent hierarchical relationship between elements, which data structure is suitable ?

ADequeue
Bpriority
CTree
DAll of the above

Question 49Single Answer

Consider the following pseudocode segment :
K : = 0
       for i₁ : = 1 to n
            for i₂ : = 1 to i₁
              :
              :
              :
                     for i_m : = 1 to i_{m − 1}
                                    K : = K + 1
The value of K after the execution of this code shall be

AC (n + m – 1, m)
BC (n – m + 1, m)
CC (n + m – 1, n)
DC (n – m + 1, n)

Question 50Single Answer

In Delta Rule for error minimization

Aweights are adjusted w.r.to change in the output
Bweights are adjusted w.r.to difference between desired output and actual output
Cweights are adjusted w.r.to difference between input and output
Dnone of the above

Important Questions Package

HP SET Computer Science and Applications Exam Online Question Bank Package

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

+ Free Monthly Current Affairs, GK & more PDF Download

Sr.	Package Name	Amount
1.	HP SET Computer Science and Applications Exam Paper 2 - English Description : 1000 Question with Answer	₹101 ~~[₹500]~~
2.	HP SET Computer Science and Applications Exam Paper 2 - English Description : 1900 Question with Answer	₹151 ~~[₹500]~~
3.	HP SET Computer Science and Applications Exam Paper 2 - English Description : 1000 Question & Answer Download in PDF (Send by Email)	₹151 ~~[₹450]~~
4.	HP SET Computer Science and Applications Exam Paper 2 Question Bank Book - English Description : 1000 Question with Answer (Printed Material)	₹390 ~~[₹600]~~

Computer Science and Applications

Question 51Single Answer

The concept of pipelining is most effective in improving performance if the task being performed in different stages :

Arequire different amount of time
Brequire about the same amount of time
Crequire different amount of time with time difference between any two task being same
Drequire different amount with time difference between any two tasks being different

Question 52Single Answer

What is Granularity ?

AThe size of database
BThe size of data item
CThe size of record
DThe size of file

Question 53Single Answer

Suppose that a given application is run on a 64-processor machine and that 70 per cent of the application can be parallelized. Then expected performance improvement using Amdahl's law is

A4.22
B3.22
C3.32
D3.52

Question 54Single Answer

If two fuzzy sets A and B are given with membership functions
µ_A (x) = { 0.2, 0.4, 0.8, 0.5, 0.1}
µ_B (x) = {0.1, 0.3, 0.6, 0.3, 0.2}
Then the value of µ

â€‹ will be

A{0.9, 0.7, 0.4, 0.8, 0.1}
B{0.2, 0.4, 0.8, 0.5, 0.2}
C{0.1, 0.3, 0.6, 0.3, 0.1}
DNone of these

Question 55Single Answer

Match the following :
List – I List – II
(a) OLAP (i) Regression
(b) OLTP (ii) Data Warehouse
(c) Decision Tree (iii) RDBMS
(d) Neural Network (iv) Classification
Choose the correct answer from the options given below :

A(A) (B) (C) (D)
2 3 1 4
B2 3 4 1
C3 2 1 4
D3 2 4 1

Question 56Single Answer

Which level of Abstraction describes what data are stored in the Database ?

APhysical level
BVeiw level
CAbstraction level
DLogical level

Question 57Single Answer

The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ______ .

ATemporary Select Problem
BTemporary Modify Problem
CDirty Read Problem
DNone of these

Question 58Single Answer

In an image compression system 16384 bits are used to represetn 256 × 256 image with 256 gray levels. What is the compression ratio for this system ?

A1
B2
C4
DNone of these

Question 59Single Answer

X. 25 is ________ Network .

AConnection Oriented Network
BConnection Less Network
CEither connection oriented or Connection Less
DNeither Connection Oriented nor connection less

Question 60Single Answer

Which of the followin an be used for clustering of data ?

ASingle layer perception
BMultiplayer perception
CSelf Organizing map
DRadial basis function

Question 61Single Answer

Which of the following is scheme to deal with deadlock ?

ATime out
BTime in
CBoth (a) & (b)
DNone of the above

Question 62Single Answer

If the pixels of an image are shuffled then the parameter that may change is

AHistogram
BMean
CEntropy
DCovariance

Question 63Single Answer

The common property of functional language and logical programming language :

ABoth are declarative
BBoth are based on λ-calculus
CBoth are procedural
DBoth are functional

Question 64Single Answer

Given the following statements :
(i) The power of deterministic finite state machine and non-deterministic finite state machine are same
(ii) The power of deterministic pushdown automaton and non-deterministic pushdown automaton are same
Which of the above is the correct statement(s) ?

ABoth (i) and (ii)
BOnly (i)
Conly (ii)
DNeither (i) nor (ii)

Question 65Single Answer

Let Q (x, y) denote "x + y = 0" and let there be two quantifications given as
(i)

(ii)

where x & y are real numbers. Then which of the following is valid ?

A(i) is true & (ii) is false
B(i) is false & (ii) is true
C(i) is false & (ii) is also false
DBoth (i) & (ii) are true

Question 66Single Answer

Consider a schema R (A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition R₁ (A, B) and R₂ (C, D) is

ADependency preserving but not lossless join
BDependency preserving and lossless join
CLossless join but not dependency preserving
DLossless join

Question 67Single Answer

The quantiser in an image-compression system is a

Alossy element which exploits the psychovisual redundancy
Bloss element which exploits the psychovisual redundancy
Clossy element which exploits the statistical redundancy
Dlossless element which exploits the statistical redundancy

Question 68Single Answer

Data Warehouse provides

ATansaction Responsiveness
BStorage, Functionality Responsiveness to queries
CDemand and Supply Responsiveness
DNone of the above

Question 69Single Answer

A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to teh current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set .

Ag = 1
Bg = 0
Ch' = 0
Dh' = 1

Question 70Single Answer

The transform which possesses the highest 'energy compaction' property is

ASlant transform
BCosine transform
CFourier transform
DKarhunen-Loeve transform

Question 71Single Answer

Which one of the following prolog programs correctly implement "if G succeeds then execute goal p else execute goal θ ?"

Aif-else (G, P, θ) ;-!, call (G), call (P), if-else (G, P, θ) :- call (θ)
Bif-else (G, P, θ) ;-, call (G), !, call (P), if-else (G, P, θ) :- call (θ)
Cif-else (G, P, θ) ;- call (G), call (P), ! if-else (G, P, θ) :- call (θ)
DAll of the above

Question 72Single Answer

The _________ memory allocation function modifies the previous allocated space .

Acalloc( )
Bfree( )
Cmalloc( )
Drealloc( )

Question 73Single Answer

Which is not the correct statement(s) ?
(i) Every context sensitive language is recursive
(ii) There is a recursive language that is not context sensitive

A(i) is true, (ii) is false
B(i) is true and (ii) is true
C(i) is false, (ii) is false
D(i) is false and (ii) is true

Question 74Single Answer

The mechanism that binds code and data together and keeps then secure from outside world is known as

AAbstraction
BInheritance
CEncapsulation
DPolymorphism

Question 75Single Answer

â€‹â€‹Identify the addressing modes of below instructions and match them :
List – I List – II
(a) ADI (i) Immediate addressing
(b) STA   (ii) Direct addressing
(c) CMA    (iii) Implied addressing
(d) SUB    (iv) Register addressing
Choose the correct answer from the options given below :

A(a) (b) (c) (d)
1 2 3 4
B2 1 4 3
C3 2 1 4
D4 3 2 1

Question 76Single Answer

Which one of the following is not a Greibach Normal form grammar ?
(i) S → a | bA | aA | bB
A → a
B → b
(ii) S → a | aA | AB
A → a
B → b
(iii) S → a | A | aA
â€‹ A → a

A(i) and (ii)
B(i) and (iii)
C(ii) and (iii)
D(i), (ii) and (iii)

Question 77Single Answer

Which of the following IP address class is a multicast address ?

AClass A
BClass B
CClass C
DClass D

Question 78Single Answer

While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is

Aat least greater that 0.9
Bequal to 0.9
Catmost 0.81
Dat least 1/0.81

Question 79Single Answer

The upper bound of computing time of m colouring decision problem is

AO(nm)
BO(n^m)
CO(nmⁿ⁾
DO(n^mmⁿ)

Question 80Single Answer

The equivalent grammar corresponding to the grammar G : S → aA, A → BB, B → aBb | ∈ is

AS → aA, A → BB, B → aBb
BS → a | aA, A → BB | B, B → aBb | ab
CS → a | aA, A → BB | B, B → aBb
DS → a | aA, A → BB | B, B → aBb | ab

Question 81Single Answer

Which one of the following statement is incorrect ?

AThe number of regions corresponds to the cyclomatic complexity
BCyclometric complexity for a flow graph G is V(G) = N – E + 2, where E is the number of edges and N is the number of nodes in the flow graph
CCyclometric complexity for a flow graph G is V(g) = E – N + 2, where E is the number of edges & N is the number of nodes in the flow graph
DCyclometric complexity for a flow graph G is V(G) = P + 1, where p is the number of predicate nodes contained in the flow graph G

Question 82Single Answer

Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has weight 65. Which statement is always true ?

AWeight (u, v) ≤ 12 B
BWeight (u, v) = 12
CWeight (u, v) ≥ 12 D
DWeight (u, v) > 12

Question 83Single Answer

Consider the regular expression (a + b) (a + b) ....... (a + b) (n – times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

An states
Bn + 1 states
Cn + 2 states
D2ⁿ states

Question 84Single Answer

Number of binary trees formed with 5 nodes are

A32
B36
C120
D42

Question 85Single Answer

Are we building the right product ? This statement refers to

AVerification
BValidation
CTesting
DSoftware quality assurance

Question 86Single Answer

The following postfix expression is evaluated using a stack
823^/23* + 51* −
â€‹The top two elements of the stack after first * is evaluated

A6, 1
B5, 7
C3, 2
D1, 5

Question 87Single Answer

AOdd number of a's and odd number of b's
Beven number of a's and even number of b's
Cequal number of a's and b's
Dnot equal number of a's and b's

Question 88Single Answer

â€‹Consider the following pseudo-code :
If (A > B) and (C > D) then
A = A + 1
B = B + 1
Endif
â€‹The cyclomatic complexity of the pseudo-code is

Question 89Single Answer

Which layer of OSI reference model uses the ICMP (Internet Control Message Protocol) ?

ATransport layer
BData link layer
CNetwork layer
DApplicaton layer

Question 90Single Answer

Which one of the following binary search tree is optimal, if probabilities of successful search and unsuccessful search are same ?

Question 91Single Answer

The regular expression for the following DFA

Aab* (b + aa*b)*
Ba*b(b + aa*b*)
Ca*b(b* + aa*b)
Da*b(b * + aa*b)*

Question 92Single Answer

Which diagram provides a formal graphic notation for modelling objects, classes and their relationships to one another ?

AObject diagram
BClass diagram
CInstance diagram
DAnalysis diagram

Question 93Single Answer

A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true ?

AEfficient implementation of multiuser support is no longer possible
BThe processor cache can be made more efficient
CHardware support for memory management is not needed
DCPU scheduling can be made more efficient

Question 94Single Answer

The feasible region represented by the constraints x₁ – x₂ ≤ 1, x₁ + x₂ ≥ 3, x₁ > 0, x₂ ≥ 0 of the objective function Max Z = 3x₁ + 2x₂ is

AA polygon
Bunbounded feasible region
CA point
DNone of these

Question 95Single Answer

The colour of an object is largely determined by its diffuse reflection coefficient. If K_d = (0.8, 0.4, 0), then what shall be the colour of the object, if the light uses is blue and magenta ?

AWhite and Red
BRed and Blue
CBlack and White
DBlack and Red

Question 96Single Answer

If an instruction takes 'i' microseconds and a page fault takes an additional 'j' microseconds. The effective instruction time, if on the average a pagge fault occurs every k instructions, is

Ai + j/k
Bi + j * k
C(i + j)/k
D(i + j) * k

Question 97Single Answer

In any simplex table, if corresponding to any negative Δj, all elements of the column are negative or zero, the solution under the test is

Adegenerate solution
Bunbounded solution
Calternative solution
Dnon-existing solution

Question 98Single Answer

How many relations are there on a set with n elements that are symmetric and a set with n elements that are relfexive and symmetric ?

A2^{n(n + 1)/2} and 2ⁿ.3^{n(n – 1 )/2}
B3^{n(n – 1)/2}and 2^{n(n – 1)}
C2n^{(n + 1)/2} and 3^{n(n – 1)/2}
D2^n(n+1)/2and 2^{n(n – 1)/2}

Question 99Single Answer

The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is

AMinmax strategy
BAlpha-beta pruning strategy
CConstraint satisfaction strategy
DStatic max strategy

Question 100Single Answer

Match the following :
(a) Regular Grammar (i) Pushdown automaton
(b) Context free Grammar (ii) Linear bounded automaton
(c) Unrestricted Grammar (iii) Deterministic finite automaton
(d) Context Sensitive grammar (iv) Turing machine
Codes :

A(a) (b) (c) (d)
3 1 2 4
B3 1 4 2
C3 2 1 4
D3 2 4 1

Back to Exam

Latest HP SET Computer Science and Applications Exam Question (Objective Questions), MCQ in English

Computer Science and Applications

HP SET Computer Science and Applications Exam Online Question Bank Package

Computer Science and Applications

Quick View