登录
|
注册
公司
标签
文章
搜索
微软
研发工程师
所有
有回答
没回答
新题目
有最佳答案
排序
热度
·
时间
·
经典指数
1
0
2513
A table CANNOT have one or more of the following index configurations. No indexes A clustered index clustered index and many non-clustered indexes Many clustered index ...
阅读题目
微软
研发工程师
数据库
单选题
经典指数
0
0
2472
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'); } abdcccd abdd abcc abddcccd Access Violation ...
阅读题目
微软
研发工程师
C语言工程师
单选题
经典指数
1
0
2446
C#程序段的结果: int[][] array = new int[3][]{ new int[3]{5,6,2}, new int[5]{6,9,7,8,3}, new int[2]{3,2} }; array[2][2] 返回() 9 6 2 溢出 ...
阅读题目
微软
研发工程师
数组
单选题
经典指数
1
0
2413
What is the result of binary number 01011001 after multiplying by 0111001 and adding 1101110? 0001 0100 0011 1111 0101 0111 0111 0011 0011 0100 0011 0101 ...
阅读题目
微软
研发工程师
基础知识
单选题
经典指数
0
0
2376
Which of the following statements are true? Insertion sort and bubble sort are not effcient for large data sets. Quick sort makes O(n^2) comparisons in the worst case. There is an array: 7, 6, 5, 4, 3, 2, 1. If using selection sort (ascending), the number of swap operation is 6. Heap sort uses two heap operations: insertion and root deletion. None of above. ...
阅读题目
微软
研发工程师
排序
多选题
经典指数
1
0
2364
Initialize integer i as 0, what's the value of i after the following operation?i += i > 0 ? i++ : i--; -2 -1 0 1 2 ...
阅读题目
微软
研发工程师
C语言工程师
单选题
经典指数
0
0
2354
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 static/const const/static –/static const static/static None of the above ...
阅读题目
微软
研发工程师
C语言工程师
多选题
经典指数
1
0
2346
Which of following C++ code is correct? int f() { int *a = new int(3); return *a; } int *f() { int a[3] = {1, 2, 3}; return a; } vector<int> f() {vector<int> v(3); return v; } void f(int *ret) { int a[3] = {1, 2, 3}; ret = a; return; } ...
阅读题目
微软
研发工程师
C语言工程师
单选题
经典指数
1
0
2297
In which case(s) would you use an outer join? The table being joined have NOT NULL columns. The table being joined have only matched data. The columns being joined have NULL values. The table being joined have only unmatched data. The table being joined have both matched and unmatched data. ...
阅读题目
微软
研发工程师
数据库
多选题
经典指数
1
0
2277
To speed up data access , we build cache system. In one system , The L1 cache access time is 5 ns , the L2 cache access time is 50 ns and the memory access time is 400 ns. The L1 cache miss rate is 50% , the L2 cache miss rate is 10%. The average data access time of this system is: 5 30 45 50 55 ...
阅读题目
微软
研发工程师
编译和体系结构
单选题
经典指数
1
2
3
4
5
47
题目数
1
贡献者
39
答案数
扫描后移动端查看
我也分享一个题目
"微软"公司热门职位
C语言工程师
测试工程师
C#工程师
"研发工程师"
职位热门公司
腾讯
百度
搜狐
阿里巴巴
美团
迅雷
奇虎360
京东
人人网
携程
×
登录
注册
找回密码
记住登录
登录
快速注册
直接第三方登录