Sie sind auf Seite 1von 18

12/27/2016 Skills Explorer

MyBookmarks (MyBookmarks.aspx) Maximum
Test Name Date Marks Select
My Report (MyReport.aspx) Time
Change Password (ChangePassword.aspx) 12/12/2016 View
IT OFFICER 130 20.25/75.00
2:05:34 PM Report
IT OFFICER 12/12/2016 View
30 2.75/75.00
2 2:21:40 PM Report
IT OFFICER 12/18/2016 View
30 13.25/75.00
4(DBMS) 8:17:13 AM Report
IT OFFICER 12/20/2016 View
30 58.875/75.00
6 5:02:08 PM Report
IT OFFICER 12/27/2016 View
30 9.375/75.00
7 7:56:18 AM Report

OVERALL PERFORMANCE DETAIL IN TEST


My
Total No. of
14 My Rank : 10 Correct 9
Students:
Answers:

  Total Time My Wrong


30 My Time: 5.52 11
of Test: Answers:

Total My Attempted  My No-


50 29 9
Questions: Questions: Option

My Marks  My Left


Total Marks 75.00 9.375 21
Earned: Questions:

 
SUBJECT WISE REPORT
SUBJECTNAME:  PROFESSIONAL KNOWLEDGE
Maximum Mark: 1.50 Total Question in Subject 50
My Mark: 9.375 Correct Question 9
Time Used 5.52 Wrong Questions 11
Questions Attempted 29 Not Option Selected: 9
Subject Code 23 Questions Left 21

 
QUESTIONS IN THE SELECTED TEST

http://skillsexplorer.in/Myreport.aspx 1/18
12/27/2016 Skills Explorer

Q.1
Which data structure can be build with Heap sort?
1. Stack
2. Sparse Matrix
3. Priority Queue
4. Circular Linked List
5. None of these

Correct My Selected Option: 1


Bookmark
Answer : 3    Incorrect

Solution: Priority Queue  

Q.2
What is the return type of malloc function? 
1. int
2. clear
3. void
4. bool
5.
None of these

Correct My Selected Option: 5


Bookmark
Answer : 1    Incorrect

Solution: int  

Q.3
  What is the minimum number of nodes in a complete
binary tree with depth 3? 
1. 4
2. 5
3. 7
4. 6
5. None of these

Correct My Selected Option:


Bookmark
Answer : 3   3  Correct

Solution: 7  

http://skillsexplorer.in/Myreport.aspx 2/18
12/27/2016 Skills Explorer

Q.4
 The complexity of Quick sort is
1. O (logn)
2. O (nlogn)
3. O (2n)
4. O (n2)
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2   2  Correct

Solution:  O (nlogn)  

Q.5
Which of the following algorithm is slowest
1. Quick sort
2. Shell Sort
3. Heap Sort
4. Bubble Sort
5. None of these

Correct My Selected Option:


Bookmark
Answer : 4   4  Correct

Solution: Bubble Sort  

Q.6
 Which of the following data structure is of linear type?
1. Strings
2. Lists
3.  Queues
4. All of the above
5.  None of these

Correct My Selected Option: 2


Bookmark
Answer : 4    Incorrect

Solution:  All of the above  

http://skillsexplorer.in/Myreport.aspx 3/18
12/27/2016 Skills Explorer

Q.7
Which of the following used to implement recursion?
1. Graph
2.  Stack
3. List
4. Queue
5. None of these

Correct My Selected Option: 0


Bookmark
Answer : 2    No Option Selected

Solution: Stack  

Q.8
A binary tree whose every node has either zero or two
children is called
1. Complete binary tree
2. Binary search tree
3. Extended binary tree
4. B-Tree
5.  None of these

Correct My Selected Option: 2


Bookmark
Answer : 3    Incorrect

Solution: Extended binary tree  

Q.9
Which of the following is useful in traversing a given
graph by breadth ꊢ�rst search?
1. Stack
2. List
3. Queue
4. B-Tree
5. None of these

Correct My Selected Option: 1


Bookmark
Answer : 3    Incorrect

Solution:
Queue
 
 

http://skillsexplorer.in/Myreport.aspx 4/18
12/27/2016 Skills Explorer

Q.10
In an extended-binary tree, the nodes with two children
are called ……..

1. Interior node
2. Domestic node
3.
External node

4. Internal node
5.  None of these

Correct My Selected Option: 0


Bookmark
Answer : 4    No Option Selected

Solution:  Internal node  

Q.11
Sparse matrices have ?
1. many zero entries
2. many non- zero entries
3. higher dimension
4. All of the above
5. none of above

Correct My Selected Option: 1


Bookmark
Answer : 1    Correct

Solution: many zero entries  

http://skillsexplorer.in/Myreport.aspx 5/18
12/27/2016 Skills Explorer

Q.12
O log(n) can be conneted with
1. Selection sort
2. Insertion sort
3. Binary sort
4. Merge sort
5. None of these

Correct My Selected Option: 4


Bookmark
Answer : 3    Incorrect

Solution: Binary sort  

Q.13
Linked list are not suitable data structure of which one of
the following problems ?
1. Insertion sort
2. Binary search
3. Radix sort
4. Polynomial manipulation
5. None of these

Correct My Selected Option: 1


Bookmark
Answer : 2    Incorrect

Solution: Binary search  

Q.14
You can make telephone calls over the Internet using a
technology called
1. Intertel
2. Telenet
3. VoIP
4. VoRP
5. None of these

Correct My Selected Option: 2


Bookmark
Answer : 3    Incorrect

Solution: VoIP  

http://skillsexplorer.in/Myreport.aspx 6/18
12/27/2016 Skills Explorer

Q.15
The operation of processing each element in the list is
known as
1. Sorting
2. Merging
3. Inserting
4. Traversal
5. None of these

Correct My Selected Option:


Bookmark
Answer : 4   4  Correct

Solution: Traversal  

Q.16
Which of the following ways below is a pre order
traversal?
1. Root->left sub tree-> right sub tree
2. Root->right sub tree-> left sub tree
3. right sub tree-> left sub tree->Root
4. left sub tree-> right sub tree->Root
5. None of these

Correct My Selected Option: 1


Bookmark
Answer : 4    Incorrect

Solution: left sub tree-> right sub tree->Root  

Q.17
Breadth First search is used in
1. Binary trees
2. Stacks
3.  Graphs
4. Both a and c above
5. None of above

Correct My Selected Option: 2


Bookmark
Answer : 3    Incorrect

Solution:  Graphs  

http://skillsexplorer.in/Myreport.aspx 7/18
12/27/2016 Skills Explorer

Q.18
In a heap, element with the greatest key is always in the
_______ node.
1. leaf
2.  root
3. ꊢ�rst node of left sub tree
4. ꊢ�rst node of right sub tree
5. None of these

Correct My Selected Option: 4


Bookmark
Answer : 2    Incorrect

Solution: root  

Q.19
The e韉�cient data structure to insert/delete a number in a
stored set of numbers is
1. Queue
2. Linked list
3. Doubly linked list
4. Binary tree
5. None of these

Correct My Selected Option: 0


Bookmark
Answer : 3    No Option Selected

Solution: Doubly linked list  

Q.20
Which of the following case does not exist in complexity
theory
1. Best case
2. Worst case
3. Average case
4. Null case
5. None of these

Correct My Selected Option:


Bookmark
Answer : 4   4  Correct

Solution: Null case  

http://skillsexplorer.in/Myreport.aspx 8/18
12/27/2016 Skills Explorer

Q.21
A binary search tree whose left subtree and right subtree
di韁�er in hight by atmost 1 unit called_____
1. AVL Tree
2. Red-black tree
3. Lemma tree
4. All of above
5. None of above

Correct My Selected Option: 1


Bookmark
Answer : 1    Correct

Solution: AVL Tree  

Q.22
Minimum number of stacks of size n required to
implement a queue of size n
1. One
2. Two
3. Three
4. Four
5. None of above

Correct My Selected Option: 0


Bookmark
Answer : 2    No Option Selected

Solution: Two  

Q.23
Merge sort uses
1. Divide and conquer strategy
2. Backtracking approach
3. Heuristic search
4. Greedy approach
5. None of these

Correct My Selected Option: 1


Bookmark
Answer : 1    Correct

Solution: Divide and conquer strategy  

http://skillsexplorer.in/Myreport.aspx 9/18
12/27/2016 Skills Explorer

Q.24
Which are  lookup caches?
1. Persistent cache 
2. Dynamic cache 
3. Pre-build lookup cache 
4. Shared Cache 
5. None of these

Correct My Selected Option: 0


Bookmark
Answer : 1    No Option Selected

Solution: Persistent cache  

Q.25
What is meaning of tracing level?
1. Data store in cache
2. Data store in database
3. Data store in log ꊢ�le
4. Data store in bu韁�er
5. None of hese

Correct My Selected Option: 0


Bookmark
Answer : 3    No Option Selected

Solution: Data store in log ꊢ�le  

Q.26
Generally collection of Nodes is called as __________.
1. Stack
2. Linked List
3. Heap
4. Pointer
5. None of these

Correct My Selected Option: 0


Bookmark
Answer : 2    No Option Selected

Solution: Linked List  

http://skillsexplorer.in/Myreport.aspx 10/18
12/27/2016 Skills Explorer

Q.27
A linear collection of data element given by mean of
pointer is called ______________.
1. Linked List
2. Queue
3. Stack
4.
Graph

5. None of these

Correct My Selected Option: 0


Bookmark
Answer : 1    No Option Selected

Solution: Linked List  

Q.28
Which of the following is not a type of Linked List ?
1. Doubly Linked List
2. Singly Linked List
3. Circular Linked List
4. Hybrid Linked List
5. None of these

Correct My Selected Option:


Bookmark
Answer : 4   4  Correct

Solution:
Hybrid Linked List
 

http://skillsexplorer.in/Myreport.aspx 11/18
12/27/2016 Skills Explorer

Q.29
Linked list is generally considered as an example of
_________ type of memory allocation.
1. Static
2. Dynamic
3. Compile Time
4. All of above
5.
None of these

Correct My Selected Option: 0


Bookmark
Answer : 2    No Option Selected

Solution: Dynamic  

Q.30
Each Node contain minimum two ꊢ�elds one ꊢ�eld called
data ꊢ�eld to store data. Another ꊢ�eld is of type
_________.
1. Pointer to Class
2. Pointer to an Integer
3. Pointer to Character
4. Pointer to node
5. None of these

Correct My Selected Option:


Bookmark
Answer : 4    Not Attempted

Solution: Pointer to node  

Q.31
A directed graph is ………………. if there is a path from each
vertex to every other vertex in the digraph.
1. Weakly connected
2. Strongly Connected
3. Tightly Connected
4. Linearly Connected
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: Strongly Connected  

http://skillsexplorer.in/Myreport.aspx 12/18
12/27/2016 Skills Explorer

Q.32
In the …………….. traversal we process all of a vertex’s
descendants before we move to an adjacent vertex.
1. Depth First
2. Breadth First
3. Width First
4. Depth Limited
5. None of these

Correct My Selected Option:


Bookmark
Answer : 1    Not Attempted

Solution: Depth First  

Q.33
The number of comparisons done by sequential search is
………………
1. (N/2)+1
2. (N+1)/2
3. (N-1)/2
4. (N+2)/2
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: (N+1)/2  

Q.34
In ……………, search start at the beginning of the list and
check every element in the list.
1. Linear search
2. Binary search
3. Hash Search
4. Binary Tree search
5. None of these

Correct My Selected Option:


Bookmark
Answer : 1    Not Attempted

Solution: Linear search  

http://skillsexplorer.in/Myreport.aspx 13/18
12/27/2016 Skills Explorer

Q.35
A graph is said to be ……………… if the vertices can be split
into two sets V1 and V2 such there are no edges between
two vertices of V1 or two vertices of V2.
 

1. Partite
2.
Bipartiale

3.  Rooted
4. Bisects
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: Bipartiale  

Q.36
What will be the value of top, if there is a size of stack
STACK_SIZE is 5
1. 5
2. 6
3. 4
4. 7
5. None of these

Correct My Selected Option:


Bookmark
Answer : 3    Not Attempted

Solution: 4  

http://skillsexplorer.in/Myreport.aspx 14/18
12/27/2016 Skills Explorer

Q.37
There is an extra element at the head of the list called a
……….

1. Antinel
2. Sentinel
3.  List header
4. List head
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: Sentinel  

Q.38
A graph is a collection of nodes, called ………. And line
segments called arcs or ……….. that connect pair of nodes.
1. vertices, edges
2.  edges, vertices
3. vertices, paths
4. graph node, edges
5. None of these

Correct My Selected Option:


Bookmark
Answer : 1    Not Attempted

Solution: vertices, edges  

Q.39
Stack over韺�ow result in:-
1. Software interrupt
2. Internal interrupt
3. External interrupt
4. Machine check interrupt
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: Internal interrupt  

http://skillsexplorer.in/Myreport.aspx 15/18
12/27/2016 Skills Explorer

Q.40
Maximum number of children in a node in a B-tree of
order m is:-
1. m
2. m/2-1
3. m/2+1
4. m/2
5. None of these

Correct My Selected Option:


Bookmark
Answer : 1    Not Attempted

Solution: m  

Q.41
A strict binary tree with n leaves always contains how
many nodes?
1. n2
2. 2n
3. 2n-1
4. n2-1
5. n3

Correct My Selected Option:


Bookmark
Answer : 3    Not Attempted

Solution: 2n-1
A strict binary tree is a node must have two child node.
So if n leaves in strict binary tree. Then n-1 intenal node.
Hence total nodes will be = n+n-1=2n-1  

Q.42
If stack is empty, then after a POP operation it is
called____
1. Over韺�ow
2. under韺�ow
3. empty
4. none
5. All of above

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: under韺�ow  

http://skillsexplorer.in/Myreport.aspx 16/18
12/27/2016 Skills Explorer

Q.43
A EULER graph is one 
1. Only two vertices are of even degree and rest are odd
degree.
2. Only two vertices are of odd degree and rest are even
degree.
3. all vertices are of odd degree
4. all vertices are of even degree
5. None of above

Correct My Selected Option:


Bookmark
Answer : 4    Not Attempted

Solution: all vertices are of even degree  

Q.44
A BST is traversed in the following order recursively:
Right, root, left
The output sequence will be in

1. Ascending order 
2. Descending order 
3. Bitomic sequence 
4. No speciꊢ�c order 
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: Descending order   

Q.45
To represent hierarchical relationship between elements,
which data structure is suitable?
1. Deque
2. Priority
3. Tree
4. Stack
5. All of above

Correct My Selected Option:


Bookmark
Answer : 3    Not Attempted

Solution: Tree  

http://skillsexplorer.in/Myreport.aspx 17/18
12/27/2016 Skills Explorer

Q.46
A binary tree whose every node has either zero or two
children is called
1. Complete binary tree
2. Binary search tree
3. Extended binary tree
4. All of above
5. None of above

Correct My Selected Option:


Bookmark
Answer : 1    Not Attempted

Solution: Complete binary tree  

Q.47
When new data are to be inserted into a data structure,
but there is no available space; this situation is usually
called
1. under韺�ow
2. over韺�ow
3. housefull
4. saturated 
5. None of these

Correct My Selected Option:


Bookmark
Answer : 2    Not Attempted

Solution: over韺�ow  

Q.48
Which of the following sorting algorithm is stable

1. insertion sort
2. bubble sort.
3.  quick sort.
4. heap sort.
5. None of these

Correct My Selected Option:


Bookmark
Answer : 4    Not Attempted

Solution: heap sort.  

http://skillsexplorer.in/Myreport.aspx 18/18