Telegram group: T.me/BBCNOUN ====== CIT237 ====== 1. The efficiency of Quick sort is represented as _________ --->> Cworst(n) ÃŽq(n2) Cworst(n) ÃŽq(n log n) Cf(x)worst(n) ÃŽq(n2) Cworst(n) ÃŽq(m2) 2. If there's no base criteria in a recursive program, the program will ______________ execute until all conditions match not be executed. obtain progressive approach. --->> execute infinitely. 3. Major functional programming languages are____________ Lisp, R, Visual Basic, Scheme, Haskell, and ML. Lisp, Scheme, C++, Haskell, and ML. --->> Lisp, Scheme, Haskell, and ML. Lisp, Scheme, Haskell, C++, and ML. 4. The fundamental building blocks of OO programming are _________ classification, object modelling, , interface, and inheritance --->> object modelling, classification and inheritance object modelling, classification and polymorphisms classification, Clustereing, inheritance and object modelling 5. In assembly language, memory addresses are referenced by symbols rather than addresses in _________ high level language --->> machine language low level langauge compiller 6. Traditionally, MIS have been developed in programming languages like: _________ COBOL, FORTRAN, PYTHON, AND C++. COBOL,BASIC, FORTRAN, C, AND C++. --->> COBOL, RPG, and SQL. COBOL, RPG, PERL and MSQL. 7. _______ is an integral part of software development. --->> Testing Documentation design Algorithm 8. C++, encourages the use of_______ instead of pointers --->> references hashing function linkages 9. The worst case complexity of binary search matches with _________ --->> linear search interpolation search merge sort binary search 10. Major procedural programming languages are ____________ --->> COBOL, FORTRAN, C, AND C++. COBOL, FORTRAN, PYTHON, AND C++. COBOL,BASIC, FORTRAN, C, AND C++. COBOL, LATEX, FORTRAN, C, AND C++.