AP_S1_AM-Basic_Theory
![]() |
![]() |
![]() |
Title of test:![]() AP_S1_AM-Basic_Theory Description: Reviewer |




New Comment |
---|
NO RECORDS |
Binary of 7 ÷ 32. A. B. C. D. Non-Zero int D or B. A. B. C. D. n-bit binary integer... [Table: 1's & 2's Complements]. A. B. C. D. - Add hexadecimals "45B"F0000 and 41300000 - (mantissa) Radix point to the leftmost digit of the fraction. Exponent has a bias of 64. A. B. C. D. Result of √151 - √150. A. B. C. D. - A & B have 6 & 2 Significant digits (4) Arithmetic operations. A. B. C. D. Subsets A & B in universal set S, equivalent to: "not_A intersection not_B". A. B. C. D. Rep. SHADED Area. A. B. C. D. Number of students: studying "ALL 3 Languages". A. B. C. D. Truth table: f(x,y,z). A. B. C. D. A, B, C, D Karnaugh map. A. B. C. D. - Weather conditions - using Markov process. Probability of a clear day, k2) days after a rainy day?. A. B. C. D. (2) Unevenly weighted DICE A & B. 3/10 & 3/5 Probability it is die A. A. B. C. D. - Factory produces product - "STANDARD NORMAL DISTRIBUTION TABLE" - Rejected by Internal Inspection What percentage of the products manufactured is rejected?. A. B. C. D. Least # of Multiplication operations "Y = X^5 + aX^4 + bX^3 + cX^2 + dX +e". A. B. C. D. - "Server" in a queuing sys. - "M/M/1" queuing model 6 transactions & seconds ave. response time. A. B. C. D. - (2) "Branch Offices" - "ATM" "M/M/1" queuing model. A. B. C. D. shortest paths P, R, Q. A. B. C. D. encoded bit string char 0-9. A. B. C. D. To encode msg's 4 letters ABCD. A. B. C. D. Finite Automaton. A. B. C. D. <S> :: = 01 | 0 <S> 1 BNF. A. B. C. D. - Reverse Polish Notation (RPN) AB - CA -* BA /-. A. B. C. D. Collision is Negligible (sharing of identical values). A. B. C. D. PCM transmission. A. B. C. D. 1-bit even parity 7-bit char codes. A. B. C. D. Hamming Code. A. B. C. D. Feedback Control. A. B. C. D. Least effort to insert to queue. A. B. C. D. Empty queue Empty stack. A. B. C. D. [Tokyo, Shinagawa, Nagoya, s-Osaka, s-Yokohama]. A. B. C. D. Heap constructed array. A. B. C. D. Binary Tree - Same depth k of 2. A. B. C. D. Binary tree - Traversed. A. B. C. D. Flowchart Positive integers. A. B. C. D. Data Sorting. A. B. C. D. Insertion algo Doubled. A. B. C. D. In SORTING Methods: - nlogn & "stable" - nlogn & "NOT stable" - n^2 & "stable". A. B. C. D. searching: Specific & "Unordered" data. A. B. C. D. "n" pairs of employee #s ... A. B. C. D. array sorted Ascending A(1) .... A(n) - "A(m) = k". A. B. C. D. "remainder of key value / 97". A. B. C. D. Hash table - NO Synonyms occur. A. B. C. D. Non-negative int x F(10) print(x mod 8). A. B. C. D. Non-negative int n f(n). A. B. C. D. Flowchart - Mid-flow - Parallel processing. A. B. C. D. Reg. Expression "[A-Z] + [0-9] *". A. B. C. D. Standardization of Programming. A. B. C. D. Prog. Structure *combo. A. B. C. D. func "add" - [Main prog] [Func add] - "CALL BY: Value & Reference". A. B. C. D. PROGRAMMING Language & Paradigm *combo. A. B. C. D. Java. A. B. C. D. XML. A. B. C. D. Computer Language. A. B. C. D. |