Major Field Test in Computer Science Sample Questions The following questions illustrate the range of the test in terms of the abilities measured, the disciplines covered, and the difficulty of the qu[.]
Major Field Test in Computer Science Sample Questions The following questions illustrate the range of the test in terms of the abilities measured, the disciplines covered, and the difficulty of the questions posed They should not, however, be considered representative of the entire scope of the test in either content or difficulty The notation pages and the answer key follow the questions x int i int j while ( i < 10 ) j j * i i i + if ( i == x ) break end if end while while ( i == 10 ) ( i == x ) x > 10 i == 10 j == x == A[0 N-1] and a variable pos The push and pop operations are defined by the following code push (x) A[pos] x pos pos – end push pop ( ) pos pos + return A[pos] end pop N pos pos pos pos pos -1 N - N C M 2C M C 2M C M ε (1 ε) (01 0)* (01 10) * (0 1) * (0 ε) int Fun ( int n ) if ( n == ) return else return * Fun ( n + ) end if end Fun Fun ( ) 16 24 A[0 n-1] n Swap A int j while ( j < n - ) int k while ( k < n - j - ) if ( A[k] < A[k + 1] ) Swap ( A[k], A[k + 1] ) end if k k + end while j j + end while A Swap n n - n n(n - 1)/2 (n - 1)(n - 2) n(n - 1) widget byte short int widget widgets struct A struct widget short s byte b long l int i end widget widget A[10] A A lw lw A long P1, P2 , P3 , P1 P2 P3 P4 P4 B x F x E x, y x F x y E y, x B y ? { Last Name} { Room} { Shift} { Rank, Room} { Room, Shift} Major Field Test in Computer Science Notation, Conventions, and Definitions ëê ûú êé úù ( ) = ( ( )) ( ) ( ) ( )£ ( ) ( )³ ( ) > ( ) = W( ( ) ) ( ) ( ) > ( ) = Q( ( ) ) f ( n) g ( n) ( )£ ( )£ ( ) > $ " ® Ø Ø Ú + Å Ù Ỉ È Ç - Í Ì Í { } È{ } x+y ST = { xy x Ỵ S and y Ỵ T } + S S È T; n S+ ẩ { }ẩ ẩ ẩ + ađb ... B y ? { Last Name} { Room} { Shift} { Rank, Room} { Room, Shift} Major Field Test in Computer Science Notation, Conventions, and Definitions ëê ûú êé úù ( ) = ( ( )) ( ) ( ) ( )£ ( ) (