Top N analysis requires () and ().
第1题:
A.top++;V[top]=x;
B.V[top]=x;top++;
C.top--;V[top]=x;
D.V[top]=x;top--;
第2题:
A.top==0
B.top!=0
C.top=-1
D.top==n-1
第3题:
若一个栈以向量V[1..n]存储,且空栈的栈顶指针top为n+1,则将元素x入栈的正确操作是(37)。
A.top=top+1;V[top]=x;
B.V[top]=x;top=top+1;
C.top=top-1;V[top]=x;
D.V[top]=x;top=top-1;
第4题:
若一个栈以向量V[1..n]存储,且空栈的栈顶指针top为n+1,则将元素x入栈的正确操作是______。
A.top=top+1;V[top]=x;
B.V[top]=x;top=top+1;
C.top=top-1;V[top]=x;
D.V[top]=x;top=top-1;
A.
B.
C.
D.
第5题:
A. You want to identify the most senior employee in the company.
B. You want to find the manager supervising the largest number of employees.
C. You want to identify the person who makes the highest salary for all employees.
D. You want to rank the top three sales representatives who have sold the maximum number of products.
第6题:
A、accounting manager
B、account manager
C、marketing manager
D、client manager
第7题:
A、top++
B、top—
C、top=0
D、top=N-1
第8题:
● 若一个栈以向量V[1..n]存储,初始使栈指针top为n,则下面x入栈的正确操作是()。设top指针指向栈顶元素。() A. top=top+1;V[top]=x B. V[top]=x;top=top+1C. top=top-1;V[top]=x D. V[top]=x ;top=top-1
第9题:
A. the use of rowid
B. a GROUP BY clause
C. an ORDER BY clause
D. only an inline view
E. an inline view and an outer query
第10题:
若一个栈以向量V[1..n]存储,初始栈顶指针top为n+1,则下面x进栈的正确操作是()。
A.top=top+1;V[top]=x
B.V[top]=x;top=top+1
C.top=top-1;V[top]=x
D.V[top]=x;top=top-1