TISL Previous Years Solved Sample Placement Papers
- Example for infix expression
a) +ab
b) a+b
c) ab+
d) none
Answer: b) a+b - The condition top=-1 in stack indicates
a) stack is full
b) stack has one element
c) stack overflow
d) stack is empty
Answer: d) stack is empty -
What would be the Prefix notation for the given equation?
(A*B)+(C*D)
(a) +*AB*CD
(b) *+AB*CD
(c) **AB+CD
(d) +*BA*CD
Answer: (a)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Brackets evaluate toDC*
andBA*
, resulting in+*AB*CD
after reversal. -
What would be the Prefix notation for the given equation?
A+B*C^D
(a) +A*B^CD
(b) +A^B*CD
(c) *A+B^CD
(d) ^A*B+CD
Answer: (a)
Explanation: Reverse the equation or scan from right to left. Apply the infix-to-prefix algorithm. The order of precedence is+*
and^
. The reversed expression evaluates to+A*B^CD
. -
Out of the following operators (
^
,*
,+
,&
,$
), the one having the highest priority is?
(a) +
(b) $
(c) ^
(d) &
Answer: (c)
Explanation: According to the infix-to-prefix algorithm, exponentiation (^
) has the highest priority among the given operators. -
Out of the following operators (
|
,*
,+
,&
,$
), the one having the lowest priority is?
(a) +
(b) $
(c) |
(d) &
Answer: (c)
Explanation: Logical OR (|
) has the lowest precedence among the given operators, as defined in the infix-to-prefix algorithm. -
The process of copying data from a memory location is called?
A) reading (Ans)
B) writing
C) controlling
D) booting
-
A list of instructions used by a computer is called?
A) program (Ans)
B) CPU
C) text
D) output
-
The CPU consists of?
A) input, output and processing
B) control unit, primary storage and secondary storage
C) control unit, arithmetic logic unit and primary storage (Ans)
D) input, processing and storage
-
Which of the following is true about primary storage?
A) It is a part of the CPU
B) It allows very fast access to data
C) It is relatively more expensive
D) all of the above (Ans)
-
Linked list is considered as an example of ___________ type of memory allocation.
a) Dynamic
b) Static
c) Compile time
d) Heap
Answer: a
Explanation: As memory is allocated at the run time.
-
In Linked List implementation, a node carries information regarding ___________
a) Data
b) Link
c) Data and Link
d) Node
Answer: b
Explanation: A linked list is a collection of objects linked together by references from an object to another object. By convention these objects are named as nodes. Linked list consists of nodes where each node contains one or more data fields and a reference (link) to the next node.
-
Linked list data structure offers considerable saving in _____________
a) Computational Time
b) Space Utilization
c) Space Utilization and Computational Time
d) Speed Utilization
Answer: c
Explanation: Linked lists save both space and time.
-
Which of the following points is/are not true about Linked List data structure when it is compared with an array?
a) Arrays have better cache locality that can make them better in terms of performance
b) It is easy to insert and delete elements in Linked List
c) Random access is not allowed in a typical implementation of Linked Lists
d) Access of elements in linked list takes less time than compared to arrays
Answer: d
Explanation: To access an element in a linked list, we need to traverse every element until we reach the desired element. This will take more time than arrays as arrays provide random access to its elements.