<strike id="6q0um"></strike>
  • <strike id="6q0um"><s id="6q0um"></s></strike>
  • <ul id="6q0um"></ul><strike id="6q0um"></strike>

    當(dāng)前位置:高考升學(xué)網(wǎng) > 招聘筆試題 > 正文

    微軟暑期實(shí)習(xí)筆試題和面試題答案及答案(二)

    更新:2023-09-20 13:19:08 高考升學(xué)網(wǎng)

      (A) y ^ ((x ^ y) & ~(x < y))

      (B) y ^(x ^ y)

      (C) x ^ (x ^ y)

      (D) (x ^ y) ^ (y ^ x)

      (E) None of the above

      11. The Orchid Pavilion (蘭亭集序) is well known as the top of "行書(shū)" in history of Chinese literature. The most fascinating sentence "Well I know it is a lie to say that life and death is the same thing, and that longevity and early death make no difference! Alas!" ("周知一死生為虛誕, 齊彭殤為妄作。") By counting the characters of the whole content (in Chinese version), the result should be 391 (including punctuation). For these characters written to a text file, please select the possible file size without any data corrupt.

      (A) 782 bytes in UTF-16 encoding

      (B) 784 bytes in UTF-16 encoding

      (C) 1173 bytes in UTF-8 encoding

      (D) 1176 bytes in UTF-8 encoding

      (E) None of the above

      12. Fill the blanks inside class definition

      class Test

      {

      public:

      ____ int a;

      ____ int b;

      public:

      Test::Test(int _a, int _b) : a(_a) {b = _b;}

      };

      int Test::b;

      int _tmain(int argc, __TCHAR argv[])

      {

      Test t1(0, 0), t2(1, 1);

      t1.b = 10;

      t2.b = 20;

      printf("%u %u %u %u", t1.a, t1.b, t2.a, t2.b);

      }

      Running result: 0 20 1 20

      (A) static/const

      (B) const/static

      (C) --/static

      (D) const static/static

      (E) None of the above

      13. A 3-order B-tree has 2047 key words, what is the maximum height of the tree?

      (A) 11 (B) 12 (C) 13 (D) 14

      14. In C++, which of the following keyword(s) can be used on both a variable and a function?

      (A) static (B) virtual (C) extern (D) inline (E) const

      15. What is the result of the following program?

      char f(char str, char ch)

      {

      char it1 = str;

      char it2 = str;

      while (it2 != '\0') {

      while (it2 == ch) {

      it2++;

      }

      it1++ = it2++;

      }

      return str;

      }

      void main(int argc, char argv[])

      {

      char a = new char[10];

      strcpy(a, "abcdcccd");

      cout << f(a, 'c');

      }

      (A) abdcccd (B) abdd (C) abcc (D) abddcccd (E) Access Violation

      16. Consider the following definition of a recursive function, power, that will perform exponentiation.

      int power(int b, int e)

      {

      if (e == 0) return 1;

      if (e %2 == 0) return power (b b, e / 2);

      return b power(b b, e / 2);

      }

      Asymptotically (漸進(jìn)地) in terms of the exponent e, the number of calls to power that occur as a result of the call power(b, e) is

      (A) logarithmic (B) linear (C) quadratic (D) exponential

      17. Assume a full deck of cards has 52 cards, 2 black suits (spade and club) and 2 red suits (diamond and heart).

      If you are given a full deck, and a half deck (with 1 red suit and 1 black suit), what's the possibility for each one getting 2 red cards if taking 2 cards?

      (A) 1/2, 1/2 (B) 25/102, 12/50 (C) 50/51, 24/25 (D) 25/51, 12/25 (E) 25/51, 1/2

      18. There is a stack and a sequence of n numbers (i.e., 1, 2, 3, ..., n). Push the n numbers into the stack following the sequence and pop out randomly. How many different sequences of the number we may get? Suppose n is 2, the output sequence may be 1, 2 or 2, 1, so we get 2 different sequences.

      (A) C_2n^n

      (B) C_2n^n - C_2n^(n + 1)

      (C) ((2n)!) / (n + 1)n!n!

      (D) n!

      (E) None of the above

      19. Longest Increasing Subsequence (LIS) means a sequence containing some elements in another sequence by the same order, and the values of elements keeps increasing.

      For example, LIS of {2, 1, 4, 2, 3, 7, 4, 6} is {1, 2, 3, 4, 6}, and its LIS length is 5.

      Considering an array with N elements, what is the lowest time and space complexity to get the length of LIS?

      (A) Time: N^2, Space: N^2

      (B) Time: N^2, Space: N

      (C) Time: NlogN, Space: N

      (D) Time: N, Space: N

      (E) Time: N, Space: C

      20. What is the output of the following piece of C++ code?

      #include

      using namespace std;

      struct Item

      {

      char c;

      Item next;

      };

      Item Routine1(Item x)

      {

      Item prev = NULL, curr = x;

      while (curr) {

      Item next = curr->next;

      curr->next = prev;

      prev = curr;

      curr = next;

      }

      return prev;

      }

      void Routine2(Item x)

      {

      Item curr = x;

      while (curr) {

      cout << curr->c << " ";

      curr = curr->next;

      }

      }

      void _tmain(void)

      {

      Item x,

      d = {'d', NULL},

      c = {'c', &d},

      b = {'b', &c},

      a = {'a', &b};

      x = Routine1(&a);

      Routine2(x);

      }

      (A) cbad (B) badc (C) dbca (D) abcd (E) dcba

    相關(guān)文章

    最新圖文

    2020年河北新聞網(wǎng)兩學(xué)一做

    時(shí)間:2023-09-18 07:0:24

    2020年河北新聞網(wǎng)兩學(xué)一做

    時(shí)間:2023-09-15 11:0:59

    兩學(xué)一做學(xué)習(xí)教育知

    時(shí)間:2023-09-21 06:0:30
    亚洲一卡二卡三卡四卡无卡麻豆| 99久久精品国产亚洲| 亚洲日本va在线观看| 亚洲视频一区二区在线观看| 亚洲AV日韩精品久久久久久 | 亚洲午夜无码久久久久| 亚洲人午夜射精精品日韩| 亚洲国产精品一区二区第四页| 国产成人精品亚洲| www国产亚洲精品久久久日本| 亚洲AV成人精品日韩一区| 久久亚洲AV成人无码国产电影| 亚洲成a人无码亚洲成av无码| 亚洲第一成年网站视频| 亚洲aⅴ天堂av天堂无码麻豆| 国产亚洲人成在线播放| 免费亚洲视频在线观看| 亚洲国产精品嫩草影院久久| 亚洲男人在线无码视频| 国产亚洲美女精品久久久2020| 亚洲线精品一区二区三区| 亚洲va久久久噜噜噜久久狠狠 | 久久九九亚洲精品| 亚洲av无码成h人动漫无遮挡 | 午夜亚洲www湿好大| 久久精品a亚洲国产v高清不卡| 亚洲美免无码中文字幕在线| 亚洲国产精品综合久久久| 亚洲精品综合在线影院| 亚洲第一综合天堂另类专| 亚洲成网777777国产精品| 综合亚洲伊人午夜网 | 亚洲国产成人高清在线观看| 亚洲AV日韩精品久久久久| 中文字幕亚洲综合精品一区| 亚洲中文字幕人成乱码| 亚洲精品成a人在线观看☆| 妇女自拍偷自拍亚洲精品| 中文字幕第一页亚洲| 亚洲av无码专区在线播放| 亚洲精品成人久久|