Register

Kerala PSC AP Exam

557 views

2 Answers

3 votes
3 votes
A

Steps:

Convert AE27 to Binary= 1010 0111 0010 1110

Octal: Group 3 bits from right, and convert into equivalent octal number- 123456

Base-4: Group 2 bits from right, and convert into equivalent number (0,1,2,3): 22130232
User Avatar
0 votes
0 votes

(A72E)16

convert each digit and letter to binary 

(A72E)16=(1010011100101110)2=(make grouping of 3 digits from left side and convert each to octal)=(001 010 011 100 101 110)=(123456)8

for converting it to base 4.. make grouping of 2 digits as (10 10 01 11 00 10 11 10)2=(22130232)4

hence answer is A.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Sankaranarayanan P.N asked Oct 27, 2016
308 views
Kerala PSC AP Exam
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is A) 15 B) 11 C) 12 D) 10
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree isA) 15B...
User Avatar
0 votes
0 votes
0 answers
2
Sankaranarayanan P.N asked Oct 27, 2016
329 views
Kerala PSC AP Exam
The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
User Avatar
0 votes
0 votes
1 answer
3
Sankaranarayanan P.N asked Oct 27, 2016
666 views
Kerala PSC AP Exam
A problem in NP is NP complete if A) Some problem in NP can be reduced to it in polynomial time B) The 3-SAT problem can be reduced to it in polynomial time C) It can be reduced to any other problems in NP in polynomial time D) It can be reduced to the 3SAT problem in polynomial time
A problem in NP is NP complete ifA) Some problem in NP can be reduced to it in polynomial timeB) The 3-SAT problem can be reduced to it in polynomial timeC) It can be red...
User Avatar
0 votes
0 votes
0 answers
4
Sankaranarayanan P.N asked Oct 27, 2016
371 views
Kerala PSC AP Exam
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete node X from the list? A) O(n) B) O(log 2 n) C) O(log n) D) O(1)
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete no...
User Avatar
Link Copied!