题目内容

The input sequence of a stack is 1, 2, 3, ..., n, and the first element of the output sequence is n, then the i-th output element is ( ).

A n-i+1
B n-1
C i
D Any element is possible

查看答案

搜索结果不匹配？点我反馈

更多问题

Existing infix expression E = ((100-4) / 3 + 3 * (36-7)) * 2. Which of the following is the equivalent postfix expression of E? （There is only one correct answer）

A、 ( ( 100 4 – ) 3 / 3 ( 36 7 – ) * + ) 2 *
B、 * + / – 100 4 3 * 3 – 36 7 2
C、 100 4 – 3 / 3 36 7 – * + 2 *
D、 * ( + / ( – 100 4 ) 3 * 3 ( – 36 7 ) ) 2

查看答案

1 Which of the following statements about string is incorrect ( ).

A. Null string is a string of spaces.
B. String is a finite sequence of characters.
C. Pattern matching is an important operation of string.
D. String can use not only sequential storage, but also linked storage.

查看答案

2 String is a special linear list,its particularity is reflected in ( ).

A. data element is characters
B. sequential storage
C. linked storage
D. logical structure is linear structure

查看答案

3 If the string S='software',the number of its prefix true substrings is ( ).

A. 7
B. 10
C. 9
D. 8

查看答案

The input sequence of a stack is 1, 2, 3, ..., n, and the first element of the output sequence is n, then the i-th output element is ( ).

A n-i+1 B n-1 C i D Any element is possible

Existing infix expression E = ((100-4) / 3 + 3 * (36-7)) * 2. Which of the following is the equivalent postfix expression of E? （There is only one correct answer）

1 Which of the following statements about string is incorrect ( ).

2 String is a special linear list,its particularity is reflected in ( ).

3 If the string S='software',the number of its prefix true substrings is ( ).

A n-i+1
B n-1
C i
D Any element is possible