COS1501 Assignment 3 (COMPLETE ANSWERS) 2024 (653581) - DUE 22 July 2024
COS1501 Assignment 3 (COMPLETE ANSWERS) 2024 (653581) - DUE 22 July 2024
COS1521 Assignment 3 (COMPLETE ANSWERS) 2024 (532267) - DUE 22 July 2024
All for this textbook (9)
Written for
University of South Africa
Theoretical Computer Science I
All documents for this subject (30)
Seller
Follow
MasterVincent
Reviews received
Content preview
COS1501 Assignment
3 (COMPLETE
ANSWERS) 2024
(532267) - DUE 22 July
2024 ; 100% TRUSTED
Complete, trusted
solutions and
explanations.
ADMIN
[COMPANY NAME]
,Question 1 Complete Marked out of 1.00 Question 2 Complete
Marked out of 1.00 QUIZ Suppose a list contains the following
elements: 27 37 7 What is the order of the elements in the list after
three passes when selection sort is used? a. 27 37 71 b. 73 77 37 c.
73 37 71 d. 73 47 71 Which of the following statements regarding
sorting algorithms is TRUE? a. Insertion sort is the most effi cient
sorting algorithm. b. Selection sort is more effi cient than bucket
sort. c. Heap sort is less suffi cient than bubblesort. d. Merge sort is
more effi cient that selection sort. Question 3 Complete Marked out
of 1.00 Question 4 Complete Marked out of 1.00 Question 5
Complete Marked out of 1.00 Question 6 Complete Marked out of
1.00 Which one of the following statements is NOT true regarding
selection sort? a. The list to be sorted is divided into two sublists –
sorted and unsorted. b. A sort pass is defi ned as moving an element
from the unsorted sublist to the sorted sublist. c. If we have a list of
20 elements to be sorted, it will take 19 passes to get the list sorted.
d. Selection sort is faster than merge sort and bucket sort. Which of
the following statements is NOT TRUE regarding sub-algorithms?
a. A structured algorithm is broken down into sub-algorithms. b.
Sub-algorithms perform specifi c functions and are thus more
understandable. c. Sub-algorithms are written once in the program,
and can be executed multiple times. d. A sub-algorithm cannot
further be divided into more sub-algorithms. Which one of the
following options is NOT a sorting algorithm? a. Bubble sort b.
Selection sort c. Binary sort d. Insertion sort Compilation
__________. a. …is used in the fi rst approach to interpretation. b.
…translates and executes the source code one line at a time. c.
…translates the whole source program into the object module before
it is executed. d. …is a slow process in comparison to the fi rst
approach to interpretation. Question 7 Complete Marked out of 1.00
, Question 8 Complete Marked out of 1.00 Question 9 Complete
Marked out of 1.00 Question 10 Complete Marked out of 1.00
Which one of the following statements regarding programming
languages is TRUE? a. Prolog is a procedural programming
language. b. Ada is a functional programming language. c. Pascal is
a procedural programming language. d. LISP is an object-oriented
programming language. Which part of the translation process of a
program uses tokens to, for example, create an assignment statement
such as x =1? a. Lexical analyser b. Syntax analyser c. Semantic
analyser d. Code generator Which computer programming language
paradigm is known for using INHERITANCE? a. Declarative
paradigm b. Object-oriented paradigm c. Functional paradigm d.
Procedural paradigm Which one of the following statement is NOT
true for the declarative programming paradigm? a. The declarative
paradigm uses the principle of logical reasoning to answer queries.
b. The declarative paradigm is based on fi rst-order predicate logic.
c. Ada is an example of a programming language that uses the
declarative approach. d. In the declarative paradigm logic rules are
defi ned, from which the program then deduces facts.
Let's break down each question:
1. Selection Sort: The initial list is [27, 37, 7].
o First pass: [7, 37, 27]
o Second pass: [7, 27, 37]
o Third pass: [7, 27, 37] So, the answer is a. 27 37 71.
2. Sorting Algorithms: Correct statement among options:
o a. Insertion sort is not generally the most efficient.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller MasterVincent. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $2.57. You're not tied to anything after your purchase.
