The dual of the Boolean theorem $P \cdot (Q + R) = P \cdot Q + P \cdot R$ is

B) $P + Q \cdot R = (P + Q)(P + R)$

PSC Buddy

100 questions with answersFinal answer keyAssistant Grade

Assistant Professor in Information Technology - echnical Education Engineering Colleges question paper 2023

Date of test: 21-06-2023
Question paper code: 89/2023/OL
Questions: 100
Answer key: Final Answer Key
Exam mode: Online (computer based)

See questions with answers Practise as a mock test

Source: Kerala PSC (keralapsc.gov.in) · official document· Last updated 25 Sept 2026· How we check content

Official PDFs

As published by the Kerala Public Service Commission.

Question paperOpen PDF
Answer key (Final Answer Key)Open PDF

All 100 questions with answers

Tap an option to check yourself, or open the answer. Answers follow the official Kerala PSC answer key.

1.
From the given Karnaugh map, 🔍 Click to zoom which one of the following represents the boolean expression in product-of-sums form ?
Show answer and explanation
Answer: C —
Derived from the standard Karnaugh map simplification rules.
Report a mistake
2.
What is the value of base $r$ if $(211)_r = (152)_{10}$ ?
Show answer and explanation
Answer: B —
9
Solving the equation $2r^2 + 1r + 1 = 152$ yields $r = 9$ .
Report a mistake
3.
Given $f_1$ , $f_2$ and $f$ in canonical sum of products form (decimal notation) for the logic circuit $f_1 = \Sigma m(8, 9, 10)$ , $f_2 = \Sigma m(7, 8, 11, 14, 15)$ , $f = \Sigma m(8, 9)$ then, function $f_3$ is
Show answer and explanation
Answer: C —
$\Sigma m(9)$
Question Cancelled / Correct answer mapping as per official key.
Report a mistake
4.
The dual of the Boolean theorem $P \cdot (Q + R) = P \cdot Q + P \cdot R$ is
Show answer and explanation
Answer: B —
$P + Q \cdot R = (P + Q)(P + R)$
The dual is obtained by interchanging AND ( $\cdot$ ) and OR ( $+$ ) operations.
Report a mistake
5.
The excess-3 code representation of decimal number 15.46 is
Show answer and explanation
Answer: A —
0100 1000 . 0111 1001
Add 3 to each decimal digit: 1+3=4 (0100), 5+3=8 (1000), 4+3=7 (0111), 6+3=9 (1001).
Report a mistake
6.
Assume that for a certain processor, a read request takes 50 ns on a cache miss and 5 ns on a cache hit. While running a program, it was observed that 80% of the processor's read requests result in a cache hit. The average read access time in nanoseconds is
Show answer and explanation
Answer: C —
14
Average access time = $(0.80 \times 5) + (0.20 \times 50) = 4 + 10 = 14$ ns.
Report a mistake
7.
A computer system has a main memory consisting of 1M 16-bit words and a 4K-word cache organized in the block set-associative manner with 4 blocks per set and 64 words per block. The number of bits in each of the Tag, Set and Word fields of main memory address format are
Show answer and explanation
Answer: A —
10, 4, 7
Word bits = $\log_2(64) = 6$ bits. Cache size = 4K words, block size = 64 words, so number of blocks = $4096 / 64 = 64$ . With 4 blocks per set, number of sets = $64 / 4 = 16$ . Set bits = $\log_2(16) = 4$ bits. Main memory = 1M words = $2^{20}$ words. Tag = $20 - (4 + 6) = 10$ bits.
Report a mistake
8.
A 100KB memory is managed using variable partitions but no compaction. It currently has two partitions of sizes 200 KB and 26 KB respectively. The smallest allocation request in KB that could be denied is for
Show answer and explanation
Answer: B —
231
Based on memory management partition allocations.
Report a mistake
9.
Assume that the time required for the five functional units, which operate in each of the cycles are 10ns, 8ns, 9ns, 10 ns and 7 ns. Find the speed up versus the single cycle data path if the pipelining adds 1ns of overhead.
Show answer and explanation
Answer: B —
4.0
Single cycle time = $10 + 8 + 9 + 10 + 7 = 44$ ns. Pipelined clock cycle = $\max(10, 8, 9, 10, 7) + 1 = 10 + 1 = 11$ ns. Speedup = $44 / 11 = 4.0$ .
Report a mistake
10.
The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage with a delay of 800 ps is replaced with a functionality equivalent design involving two stages with respective delays 600 ps and 350 ps. The throughput increase of the pipeline in percent is
Show answer and explanation
Answer: C —
33.33
Original max delay = 800 ps. New max delay = 600 ps. Throughput increase = $(800 - 600) / 600 = 200 / 600 = 33.33\%$ .
Report a mistake
11.
The interrupt vector location from which RST 7.5 interrupt in 8085 executes the interrupt service routing.
Show answer and explanation
Answer: C —
003CH
RST 7.5 corresponds to vector address $7.5 \times 8 = 60 = 003CH$ .
Report a mistake
12.
A small microprocessor's micro instructions has 6 control fields, each one triggering the following number of control lines: Control fields: 1, 2, 3, 4, 5, 6 with Number of Control Lines: 7, 4, 5, 2, 1, 3 respectively. What is the fewest number of control bits required to describe all the control fields?
Show answer and explanation
Answer: C —
14
Using encoded control word format, bits required = $\sum \lceil \log_2(n_i + 1) \rceil$ .
Report a mistake
13.
A microprogram control unit is required to generate a total of 25 control signals. Assume that during any microinstruction at most two control signals are active. The minimum number of bits required in the control word to generate the required control signals will be
Show answer and explanation
Answer: D —
10
Combination formula for at most two active signals out of 25.
Report a mistake
14.
The interface chip used for data transmission between 8086 and a 16-bit ADC is
Show answer and explanation
Answer: C —
8255
Intel 8255 PPI is used for parallel data transfer.
Report a mistake
15.
The execution time for the instruction, "STA addr" of an 8085 microprocessor with a clock frequency of 3MHz in nano seconds is
Show answer and explanation
Answer: B —
4333
STA requires 13 T-states. At 3 MHz, clock period = $1 / 3$ MHz = $333.33$ ns. Execution time = $13 \times 333.33 = 4333$ ns.
Report a mistake
16.
Out of the following terms, which is related to polymorphism in Object oriented concepts ?
Show answer and explanation
Answer: C —
Dynamic binding
Polymorphism is implemented in OOP via dynamic binding (or late binding).
Report a mistake
17.
The operating system maintains the addresses of each variable as it allocates ______ for them during _______
Show answer and explanation
Answer: D —
memory, run time
Dynamic memory allocation occurs during run time, where the OS manages variable addresses.
Report a mistake
18.
What will happen if a List is created as shown below in JAVA : List 1=new LinkedList ()
Show answer and explanation
Answer: B —
compile time error
In Java, variable names cannot start with a digit. '1' is an invalid identifier.
Report a mistake
19.
What is the priority assigned to all Java threads by default ?
Show answer and explanation
Answer: B —
5
The default priority for a Java thread is NORM_PRIORITY, which is 5.
Report a mistake
20.
What was the name of the team that developed Java ?
Show answer and explanation
Answer: A —
Green Team
Java was developed by the Green Team at Sun Microsystems.
Report a mistake
21.
In pass by value, values of actual parameters are copied to the variables in the parameter list of the called function. So
Show answer and explanation
Answer: A —
original data in the calling function cannot be changed accidently
Pass by value creates a copy, protecting the original data from modification.
Report a mistake
22.
Which of the following is not the category of the functions in C ?
Show answer and explanation
Answer: D —
Functions with return multiple values
C functions can return only one value (or a pointer/struct to multiple values), but they do not natively support returning multiple values directly.
Report a mistake
23.
Identify error in the following C program : #include<stdio.h> void main(){ char ch; void ASCII(char); printf("Enter any character:\n"); scanf("%c",&ch); ASCII(ch); } void ASCII(int c){ printf("The ASCII value of %c is %d",c,c); }
Show answer and explanation
Answer: A —
conflicting types for ASCII function
The prototype declares ASCII as taking a char, but the definition takes an int, causing a type conflict.
Report a mistake
24.
The scope of an automatic variables is within ________ in a C Program.
Show answer and explanation
Answer: B —
the function where it has been declared
Automatic variables are local to the block or function in which they are declared.
Report a mistake
25.
A function that calls itself is called
Show answer and explanation
Answer: C —
recursive
A function that calls itself is defined as a recursive function.
Report a mistake
26.
What is the output of the following python program ? x='Kerala' for i in range(len(x)): x[i].upper() print(x)
Show answer and explanation
Answer: B —
Kerala
Strings in Python are immutable. The .upper() method returns a new string and does not modify the original string 'x'.
Report a mistake
27.
What is the output of the following python program ? my_tuple=(1,2,3,4) my_tuple.append((5,6,7)) print(my_tuple)
Show answer and explanation
Answer: C —
Attribute Error
Tuples are immutable and do not have an 'append' method.
Report a mistake
28.
In python programming, suppose list1 is [1,2,3], what is list1*2 ?
Show answer and explanation
Answer: D —
[1,2,3,1,2,3]
The * operator on a list performs repetition, resulting in [1, 2, 3, 1, 2, 3].
Report a mistake
29.
What is the output of the following python program ? b="Hello World" print(b[::-1])
Show answer and explanation
Answer: B —
dlroW olleH
The slice notation [::-1] reverses the string.
Report a mistake
30.
What will be the output after executing following python code ? list1=[1,2,3,'X','Y'] list2=list1+list1 print (list2)
Show answer and explanation
Answer: B —
[1,2,3,'X','Y',1,2,3,'X','Y']
The + operator on lists performs concatenation.
Report a mistake
31.
How many stacks are required to implement a queue ?
Show answer and explanation
Answer: B —
2
A queue can be implemented using two stacks (one for enqueue and one for dequeue).
Report a mistake
32.
Which of the following is/are valid balance factor in AVL tree ?
Show answer and explanation
Answer: D —
All of the above
The balance factor of any node in an AVL tree must be -1, 0, or 1.
Report a mistake
33.
Which sorting algorithm is best when list is already sorted ?
Show answer and explanation
Answer: A —
Insertion Sort
Insertion sort has a best-case time complexity of $O(n)$ when the input is already sorted.
Report a mistake
34.
How many stacks are required for evaluation of preﬁx expression ?
Show answer and explanation
Answer: B —
2
Evaluating prefix expressions typically uses stacks.
Report a mistake
35.
Which of the following data structure is most appropriate for implementing simple chaining ?
Show answer and explanation
Answer: B —
Doubly Linked List
Linked lists are used for resolving collisions in hashing via separate chaining.
Report a mistake
36.
Consider following code segment. The time complexity for following code segment will be : Algorithm Sample : Begin for i = 1 to n for j = i to n A[i][j]=0; end for End
Show answer and explanation
Answer: B —
$O(n^2)$
The nested loops run approximately $n + (n-1) + \dots + 1 = \frac{n(n+1)}{2}$ times, giving $O(n^2)$ .
Report a mistake
37.
The minimum number of operations required for the following matrix chain multiplication using dynamic programming: A(5×10) * B(10×3) * C(3×12) * D(12×5) * E(5×50) * F(50×6)
Show answer and explanation
Answer: C —
2010
Standard matrix chain multiplication dynamic programming computation yields 2010 operations.
Report a mistake
38.
We have given two sequences X[m] and Y[n] of lengths m and n, respectively with indexes of X and Y starting from 0. We wish to ﬁnd the length of the longest common sub-sequence (LCS) of X[m] and Y[n] as c(m,n), where an incomplete recursive deﬁnition for the function c(i,j) to compute the length of the LCS of X[m] and Y[n] is given below : c[i,j]=0, if either i=0 or j=0 =expr1, if i,j > 0 and X[i−1]=Y[j−1] =expr2, if i,j > 0 and X[i−1]≠Y[j−1] Which one of the following options is correct ?
Show answer and explanation
Answer: D —
expr2=max{c[i−1, j],c[i,j−1]}
When characters do not match, the LCS length is the maximum of excluding either element from one of the sequences.
Report a mistake
39.
What is true about Greedy Algorithms ? 1. It makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution. 2. Always yield optimal solutions. 3. Generally faster than dynamic programming.
Show answer and explanation
Answer: C —
1 and 3 only
Greedy algorithms make locally optimal choices and are generally faster than dynamic programming, but they do not always yield globally optimal solutions.
Report a mistake
40.
Which of the following is not example of NP Complete problem ?
Show answer and explanation
Answer: B —
Halting problem
The halting problem is undecidable, hence it is not NP-complete.
Report a mistake
41.
How many tokens are there in the following C programming language statement ? printf("%d+%d=%d",a,b,c);
Show answer and explanation
Answer: C —
11
Counting the lexical tokens in the statement yields 11 tokens.
Report a mistake
42.
Which of the following class of automata is used for parsing in a compiler ?
Show answer and explanation
Answer: B —
Push Down Automata
Push Down Automata are used for syntax analysis (parsing) of context-free grammars in compilers.
Report a mistake
43.
Which of the following in not used in any compiler optimisation process ?
Show answer and explanation
Answer: D —
Symbolic execution
Symbolic execution is primarily a program analysis technique for verification, not a standard compiler optimization.
Report a mistake
44.
Which of the following is not a necessary part of any compiler ?
Show answer and explanation
Answer: A —
Abstract Interpretation
Abstract interpretation is an advanced static analysis technique, not a mandatory phase of a standard compiler.
Report a mistake
45.
Which of the following is not a Regular language ?
Show answer and explanation
Answer: D —
None of these
All the listed languages are regular as they can be represented by finite automata.
Report a mistake
46.
Which of the following language is not closed under complementation ?
Show answer and explanation
Answer: B —
Recursively Enumerable
Recursively enumerable languages are not closed under complementation.
Report a mistake
47.
Which of the following problem is not decidable ?
Show answer and explanation
Answer: C —
Checking whether a Context Free language is FULL
The problem of determining if a context-free language is equal to $\Sigma^*$ (FULL) is undecidable.
Report a mistake
48.
Which of the following is not a deterministic Context Free Language ?
Show answer and explanation
Answer: A —
{x ∈ {a,b}*|x is an even length palindrome}
Even length palindromes are inherently non-deterministic context-free languages.
Report a mistake
49.
Which of the following is not an application of Myhill Nerode Theorem ?
Show answer and explanation
Answer: D —
None of these
The Myhill-Nerode theorem is used for all the mentioned purposes regarding regular languages.
Report a mistake
50.
Which of the following is not equivalent in power with a standard (single tape, deterministic) Turing Machine ?
Show answer and explanation
Answer: C —
Linear Bounded Automata
Linear Bounded Automata (LBA) are less powerful than standard Turing Machines as they are restricted by tape size.
Report a mistake
51.
Which of the following is a non-preemptive scheduling algorithm ?
Show answer and explanation
Answer: A —
Shortest job first
Shortest Job First (SJF) can be non-preemptive, whereas Round Robin is inherently preemptive.
Report a mistake
52.
When a page fault occurs ?
Show answer and explanation
Answer: D —
None of these
A page fault occurs when a program attempts to access a page that is not currently mapped in the physical memory (RAM).
Report a mistake
53.
Which one of the following is a command in Unix to find the number of characters in a text file ?
Show answer and explanation
Answer: B —
wc
The 'wc -c' command in Unix counts the number of bytes/characters in a file.
Report a mistake
54.
Let s be a semaphore to allow only one process to enter a critical section. Then, which of the following is the initial value required for s ?
Show answer and explanation
Answer: C —
1
A binary semaphore initialized to 1 is used for mutual exclusion.
Report a mistake
55.
Which of the following is most desirable in an OS which allows to execute a program whose size is greater than the size of the main memory ?
Show answer and explanation
Answer: A —
Virtual memory
Virtual memory allows execution of programs larger than physical RAM by swapping parts of the program to disk.
Report a mistake
56.
Which of the following can represent the term attribute in a relational database ?
Show answer and explanation
Answer: C —
Column
In a relational database, an attribute corresponds to a column in a table.
Report a mistake
57.
Which of the following is a correct about a relational database system ?
Show answer and explanation
Answer: A —
BCNF is stronger than 3NF
BCNF (Boyce-Codd Normal Form) is a stricter form of normalization than 3NF.
Report a mistake
58.
Which one of the following is the most typical database normal form used in practise ?
Show answer and explanation
Answer: B —
3NF
3NF is widely considered the standard for most practical database designs.
Report a mistake
59.
Which of the following is most correct about views in database ?
Show answer and explanation
Answer: D —
Used to hide unnecessary attributes
Views are primarily used to provide a virtual table that can hide sensitive or unnecessary data from users.
Report a mistake
60.
Which of the following is not correct about a partial order relation ?
Show answer and explanation
Answer: B —
Symmetric
A partial order relation is reflexive, antisymmetric, and transitive, but not necessarily symmetric.
Report a mistake
61.
Let a and b are two Natural numbers such that : a <= 100, b <= 100 and a > b. Consider an equivalence relation which relates a and b when a - b is divisible by 13. Then, how many equivalence classes are induced by this relation ?
Show answer and explanation
Answer: D —
None of these
The relation is defined on the set {1, ..., 100}. The number of equivalence classes is 13 (remainders 0 to 12).
Report a mistake
62.
Let A and B be two sets with cardinalities m and n respectively. Then, how many functions are possible from A to B ?
Show answer and explanation
Answer: A —
$n^m$
For each of the $m$ elements in set A, there are $n$ choices in set B, leading to $n^m$ possible functions.
Report a mistake
63.
Which of the following is not correct about software testing ?
Show answer and explanation
Answer: B —
It is a technique for proving the absence of bugs in a software
Testing can show the presence of bugs, but it cannot prove the total absence of bugs.
Report a mistake
64.
Which of the following is a functional requirement of a software ?
Show answer and explanation
Answer: C —
Correctness
Correctness is a functional requirement, whereas efficiency and availability are non-functional requirements.
Report a mistake
65.
Which of the following situation demands prototyping model of software development ?
Show answer and explanation
Answer: B —
Requirements are not clearly defined
Prototyping is ideal when requirements are ambiguous or not clearly defined to help stakeholders visualize the system.
Report a mistake
66.
A packet arrives with destination address 135.46.52.2. The router has the following (CIDR) entries in its routing table: | Address/mask | Next hop | |---|---| | 135.46.56.0/22 | Interface 0 | | 135.46.60.0/22 | Interface 1 | | 192.53.40.0/23 | Router 1 | | default | Router 2 | The packet will be routed to :
Show answer and explanation
Answer: D —
Router 2
The destination address 135.46.52.2 does not match any of the specific CIDR prefixes, so it defaults to Router 2.
Report a mistake
67.
A channel has a bit rate of 4 kbps and a propagation delay of 20 msec. The minimum frame size to achieve at least 50% efficiency in stop-and-wait protocol
Show answer and explanation
Answer: C —
160 bits
Efficiency $\eta = \frac{1}{1 + 2a}$ , where $a = \frac{Propagation Delay}{Transmission Delay}$ . For $\eta \ge 0.5$ , $1 + 2a \le 2$ , so $a \le 0.5$ . $Transmission Delay \ge 2 \times 20ms = 40ms$ . Frame size = $4000 bps \times 0.04s = 160$ bits.
Report a mistake
68.
Following figure shows the process of TCP connection establishment in simultaneous connection establishment on both sides. Which of the following is true ?
Show answer and explanation
Answer: C —
A=y, B=x+1 and C=x, D=y+1
In simultaneous TCP connection establishment, the sequence numbers are acknowledged with incremented values.
Report a mistake
69.
The purpose of ARP is to resolve :
Show answer and explanation
Answer: B —
IP Address to MAC Address
Address Resolution Protocol (ARP) maps an IP address to a physical MAC address.
Report a mistake
70.
Which of the following is true about dynamic IP address assignment by DHCP to a host ?
Show answer and explanation
Answer: B —
Addresses are leased to the host. A host will usually keep the same address by periodically contacting the DHCP server to renew the lease.
DHCP uses a leasing mechanism where the client requests renewal of the IP address before the lease expires.
Report a mistake
71.
Which statement(s) about IPv4 and IPv6 addresses are true ? 1. An IPv6 address is 32 bits long, represented in decimal. 2. An IPv6 address is 128 bits long, represented in hexadecimal. 3. An IPv6 does not support stateless address auto configuration. 4. IPv6 doesn't allow routers to fragment packets.
Show answer and explanation
Answer: D —
All of the above
The question was cancelled in the final key, but based on standard networking, IPv6 is 128-bit and routers do not fragment packets.
Report a mistake
72.
Which of the following is not an advantages of link state routing over distance vector routing ?
Show answer and explanation
Answer: A —
easy to configure
Link state routing protocols are generally more complex to configure than distance vector protocols.
Report a mistake
73.
The principal of Non-repudiation ensures
Show answer and explanation
Answer: C —
Proves that nobody but on only sender could have sent a particular message
Non-repudiation prevents a sender from denying that they sent a message.
Report a mistake
74.
AES uses a _______ bit block size and a key size of _______ bits.
Show answer and explanation
Answer: D —
128; 128, 192 or 256
AES (Advanced Encryption Standard) uses a fixed block size of 128 bits and key sizes of 128, 192, or 256 bits.
Report a mistake
75.
Which of the following is not true about Digital Signature Algorithm (DSA) ?
Show answer and explanation
Answer: B —
It is used for encryption and key exchange.
DSA is specifically designed for digital signatures, not for encryption or key exchange.
Report a mistake
76.
Using the RSA with p=3, q=1 and e=7. Encrypt message=2 to ﬁnd ciphertext. Ciphertext will be :
Show answer and explanation
Answer: A —
29
RSA encryption formula is $C = M^e \pmod n$ . Given $p=3, q=1$ , $n=3$ , $e=7$ , $M=2$ . $2^7 \pmod 3 = 128 \pmod 3 = 2$ . Note: The question paper answer key indicates A.
Report a mistake
77.
Which of the following is not included in IP security?
Show answer and explanation
Answer: C —
Multi-Protocol Support
IPsec components include AH, ESP, and IKE; Multi-Protocol Support is not a standard component.
Report a mistake
78.
A proxy ﬁrewall ﬁlters at
Show answer and explanation
Answer: D —
Application Layer
Proxy firewalls operate at the Application Layer of the OSI model.
Report a mistake
79.
Which of the following is not an example of cyber-attack?
Show answer and explanation
Answer: C —
Hashing
Hashing is a cryptographic technique, not an attack.
Report a mistake
80.
Which of the following deﬁnes how a web server communicates with external applications?
Show answer and explanation
Answer: B —
CGI
CGI (Common Gateway Interface) is the standard for web servers to interface with external programs.
Report a mistake
81.
Which tag allows you to add a row in the tables?
Show answer and explanation
Answer: D —
<tr>
The <tr> tag defines a table row in HTML.
Report a mistake
82.
In CSS, how do you display a border like this? top border = 10 pixels, bottom border = 5 pixels, left border = 20 pixels, right border = 1 pixel
Show answer and explanation
Answer: A —
border-width:10px 1px 5 px 20px
CSS border-width shorthand follows the order: top, right, bottom, left.
Report a mistake
83.
Which of the following represents a positive look ahead regular expression?
Show answer and explanation
Answer: B —
X(?=Y)
The syntax for positive lookahead in regex is (?=Y).
Report a mistake
84.
Which method is used to parse an XML document?
Show answer and explanation
Answer: A —
parse()
The standard method for parsing XML in many environments is parse().
Report a mistake
85.
What is the use of controller in mvc?
Show answer and explanation
Answer: D —
All of above
The controller in MVC handles user input, application flow, and response generation.
Report a mistake
86.
In machine learning, the process of adding labels to the data is referred as
Show answer and explanation
Answer: B —
Unsupervised Learning
The process of labeling data is often associated with preparing data for supervised learning, but the question key indicates B (Unsupervised Learning context).
Report a mistake
87.
Reinforcement learning system learns through
Show answer and explanation
Answer: A —
Trial and Error
Reinforcement learning is based on an agent learning through trial and error interactions with an environment.
Report a mistake
88.
Following essentials are involved in Principal Components Analysis (PCA)
Show answer and explanation
Answer: D —
All of the above
PCA involves calculating the covariance matrix and finding its eigenvalues and eigenvectors.
Report a mistake
89.
The ratio of correctly predicted labels and the total number of predicted labels is termed as
Show answer and explanation
Answer: B —
Precision
Precision is defined as the ratio of true positives to the total number of predicted positives.
Report a mistake
90.
Principal Components Analysis (PCA) is used for
Show answer and explanation
Answer: A —
Dimensionality Reduction
PCA is a standard technique for reducing the dimensionality of large datasets.
Report a mistake
91.
$Y=Xb + e$ This equation represents
Show answer and explanation
Answer: D —
Linear Model
The equation $Y=Xb + e$ is the standard matrix representation of a linear regression model.
Report a mistake
92.
Following can be the kernel functions for a Support Vector Machine (SVM) classiﬁer
Show answer and explanation
Answer: D —
All of the above
SVMs use various kernel functions like Linear, Polynomial, Radial Basis Function (RBF), and Gaussian to map data into higher-dimensional spaces.
Report a mistake
93.
________ are used to model situations where all the information of the system necessary to predict the future can be encoded in the current state.
Show answer and explanation
Answer: C —
Markov chain
A Markov chain is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event.
Report a mistake
94.
Average pairwise misranking is plotted in
Show answer and explanation
Answer: B —
Area under the ROC curve
The Area Under the ROC Curve (AUC) is related to the probability that a classifier will rank a randomly chosen positive instance higher than a randomly chosen negative one.
Report a mistake
95.
The area under an ROC curve (AUC) is
Show answer and explanation
Answer: C —
Both 1 and 2
The AUC is equivalent to the Wilcoxon-Mann-Whitney statistic and is also related to the Gini coefficient by the formula $Gini = 2(AUC - 0.5)$ .
Report a mistake
96.
Support vector machine (SVM) algorithm solves
Show answer and explanation
Answer: A —
Convex optimization problem
SVM training involves solving a convex quadratic programming problem, which guarantees a global optimum.
Report a mistake
97.
Boosting techniques is used to make a weak learning algorithm strong.
Show answer and explanation
Answer: A —
True
Boosting is an ensemble technique that combines multiple weak learners to create a single strong learner.
Report a mistake
98.
The idea of trying to use a large unlabeled data set U to augment a given labeled data set L in order to produce more accurate rules than would have been achieved using just L alone is referred as
Show answer and explanation
Answer: C —
Semi-supervised learning
Semi-supervised learning uses a small amount of labeled data and a large amount of unlabeled data to improve learning accuracy.
Report a mistake
99.
Which of the following is a heuristic for k-means clustering algorithm ?
Show answer and explanation
Answer: C —
Both 1 and 2
Both Lloyd's algorithm and Ward's method are common heuristics/approaches used in clustering tasks.
Report a mistake
100.
The "Q Function" is used in
Show answer and explanation
Answer: C —
Reinforcement learning
The Q-function (or action-value function) is central to Q-learning, a popular reinforcement learning algorithm.
Report a mistake

Try the whole paper in one go

Answer all 100 questions first and see your score at the end.

Practise as a mock test →

How Kerala PSC marks objective papers

1 mark for each right answer.
1/3 mark is taken off for each wrong answer.
Questions you leave blank don’t lose marks.
Marks are counted with the final answer key, published after complaints on the provisional key.

Found a wrong answer or a typo on this page? Report it and we’ll check it against the official key.

This recruitment

Matched by post name.

Papers for the same or similar posts.

All question papers

Final answer keyAssistant GradeSame post
Confidential Assistant GR II - Various
-VARIOUS Medium of question:-ENGLISH Paper Code:-22/2015/OL
Final answer keyAssistant GradeSame post
Junior Instructor - Laboratory Assistant - Chemical Plant - Industrial Training Department
- INDUSTRIAL TRAINING Medium of question:-ENGLISH Paper Code:-55/2016/OL
Final answer key- KERALA WATER AUTHORITYSame post
Assistant Engineer - SR for PH - Kerala Water Authority
- Kerala Water Authority
Final answer keyAssistant GradeSame post
Technical Assistant - Khadi - Kerala Khadi and Village Industries Board
- KERALA KHADI AND VILLAGE INDUSTRIES BOARD Medium of question:-ENGLISH Paper Code:- 33/2016/OL
Final answer keyAssistant GradeSame post
Statistical Assistant GR II / Statistical Investigator GR II / Computer Operator GR II - Economics and Statistics
Economics and Statistics Medium of Question : English Alphacode : A
Date of test
25/07/2018
Questions with answersFinal answer keyAssistant GradeSame post
Assistant Professor-medical education
QP code
-37/2017/OL

Not affiliated with the Kerala Public Service Commission. Questions and answers are copied from the official PDFs; always check the PDF.

Official PDFs

All 100 questions with answers

How Kerala PSC marks objective papers

This recruitment

More papers to practise

Confidential Assistant GR II - Various

Junior Instructor - Laboratory Assistant - Chemical Plant - Industrial Training Department

Assistant Engineer - SR for PH - Kerala Water Authority

Technical Assistant - Khadi - Kerala Khadi and Village Industries Board

Statistical Assistant GR II / Statistical Investigator GR II / Computer Operator GR II - Economics and Statistics

Assistant Professor-medical education