Alibaba 2016 School recruit Pen question (including answer)

Alibaba 2016 School recruit Pen question (including answer)

1, (7-6-3-5-4-1-2) heap sorting, ascending order, 3 position change several times

Answer: 2 times

2, the following program output is ()

Class A

{

Public

virtual void func (int val = 1)

{

Std::cout << "A->" << val << Std::endl;

}

virtual void Test ()

{

Func ();

}

};

Class B:public A

{

Public

void func (int val = 0)

{

Std::cout << "B->" << val << Std::endl;

}

};

int main (int argc,char* argv[])

{

B*p = new B;

P->test ();

return 0;

}

A:a->0

B:b->1

C:a->1

D:b->0

Answer: B

3, the two-,......, 99,100 randomly arranged into a circle, the difference between the adjacent number of the absolute sum of up to ()

a:100

b:198

c:200

d:500

e:2500

f:5000

Answer: F

4, if the following formula is established: 84*148=B6A8. is represented by a () binary.

A:15

B:11

C:12

D:14

E:16

F: None of the above is correct

Answer: C

5. In,...... 1000, there are () number of the product is 0.

a:100

B:101

c:172

d:181

e:190

f:191

Answer: D

6, there is a one-way list queue has a, b two adjacent elements, there is a pointer p point to element A, now a pointer r points to the s element to be inserted between A and B, the operation ()

A:p->next=p->next->next

B:r->next=p;p->next=r->next

C:r->next=p->next;p->next=r

D:r=p->next;p->next=r->next

E:r->next=p;p->next=r

F:p=p->next->next

Answer: C

7, in the matrix of the following 8*6, please calculate from a move to B a common () species go method. Requires only one cell to move up or to the right at a time, and cannot go through p.

a:456

b:492

c:568

d:626

e:680

F:70

Answer: A

8, an operating system using paging storage management method, the following figure shows the process a page table mechanism. If the size of the physical page is 512 bytes, a variable with a logical address of 0x0457 (hexadecimal) in process A is stored in the () number of the physical memory page.

A:9

B:2

C:4

D:6

E:8

F:5

Answer: D

9. A circular linked list with a length of 99, pointer A and pointer b both point to the same node in the list, a moves forward with a step of 1, B moves forward with a step of 3, and a total of how many steps a and B must be moved at the same time to point to the same node again ().

a:99

b:100

C:101