Mascot Previous Years Solved Sample Placement Papers
-
Which of the following is the product of data processing?
A) information (Ans)
B) data
C) software program
D) system
-
The process of putting data into a storage location is called?
A) reading
B) writing (Ans)
C) controlling
D) hand shaking
-
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.
-
What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head) { if (head == NULL) return; fun1(head->next); printf("%d ", head->data); }a) Prints all nodes of linked lists
b) Prints all nodes of linked list in reverse order
c) Prints alternate nodes of Linked List
d) Prints alternate nodes in reverse order
Answer: b
Explanation: fun1() prints the given Linked List in reverse manner. For Linked List 1->2->3->4->5, fun1() prints 5->4->3->2->1.
-
What must be the missing logic in place of missing lines for finding the sum of nodes of a binary tree in alternate levels?
//e.g: consider complete binary tree: height-3, [1,2,3,4,5,6,7] - answer must be 23
n = power(2, height) - 1; // assume input is height and a[i] contains tree elements
for(i = 1; i <= n;)
{
// present level is initialized to 1 and sum is initialized to 0
for(j = 1; j <= pow(2, currentlevel - 1); j++)
{
sum = sum + a[i];
i = i + 1;
}
// missing logic
}
A) i = i + pow(2, currentlevel); currentlevel = currentlevel + 2; j = 1; (Ans)
B) i = i + pow(2, currentlevel); currentlevel = currentlevel + 2; j = 0;
C) i = i - pow(2, currentlevel); currentlevel = currentlevel + 2; j = 1;
D) i = i + pow(2, currentlevel); currentlevel = currentlevel + 1; j = 1;
-
Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of a tree good?
A) Yes, because we are overcoming the need for pointers and so space efficiency
B) Yes, because array values are indexable
C) No, it is not efficient in case of sparse trees, and remaining cases it is fine (Ans)
D) No, linked list representation of tree is only fine