100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
COS2621 EXAM PACK 2023 R50,00   Add to cart

Exam (elaborations)

COS2621 EXAM PACK 2023

 40 views  4 purchases

COS2621 Latest exam pack questions and answers, perfect for OCTOBER NOVEMBER 2023 exam preparation

Last document update: 1 year ago

Preview 4 out of 415  pages

  • October 18, 2022
  • October 6, 2023
  • 415
  • 2023/2024
  • Exam (elaborations)
  • Questions & answers
book image

Book Title:

Author(s):

  • Edition:
  • ISBN:
  • Edition:
All documents for this subject (34)
avatar-seller
VarsityC
COS2621
EXAM PACK

Solutions, Explanations, workings, and references




+27 81 278 3372

, COS2621
2 Oct/Nov 2022




Oct/Nov 2022



90 marks



Prof F Bankole




This paper consists of 7 pages plus an appendix.

INSTRUCTIONS
1. Answer all questions on word document/answer sheet, convert to pdf before submitting
2. The mark for each question is given in brackets next to the question.
3. The appendix contains a list of x86 Assembly Language instructions
ALL THE BEST!

, COS2621
3 Oct/Nov 2022
UNIVERSITY EXAMINATIONS




OCTOBER/NOVEMBER 2022

COS2621

Introduction to Programming I
Exam date:2 March 2022
Duration: 2 hrs
Total marks: 90

Welcome to COS2621 exam.

This paper consists of 7 pages.

Instructions:.
• Remember to accept the pledge of Honesty by clicking to activate it

Additional student instructions
1. Students must upload their answer scripts in a single PDF file (answer scripts must not be
password protected or uploaded as “read only” files)
2. Incorrect file format and uncollated answer scripts will not be considered.
3. NO emailed scripts will be accepted.
4. Students are advised to preview submissions (answer scripts) to ensure legibility and that the
correct answer script file has been uploaded.
5. Incorrect answer scripts and/or submissions made on unofficial examinations platforms
(including the invigilator cell phone application) will not be marked and no opportunity will be
granted for resubmission.
6. Mark awarded for incomplete submission will be the student’s final mark. No opportunity for
resubmission will be granted.
7. Mark awarded for illegible scanned submission will be the student’s final mark. No opportunity for
resubmission will be granted.
8. Submissions will only be accepted from registered student accounts.
9. Students who have not utilised invigilation or proctoring tools will be subjected to disciplinary
processes (only include if applicable).
10. Students suspected of dishonest conduct during the examinations will be subjected to
disciplinary processes. UNISA has a zero tolerance for plagiarism and/or any other forms of
academic dishonesty.
11. Students are provided one hour to submit their answer scripts after the official examination
time. Submissions made after the official examination time will be rejected by the examination
regulations and will not be marked.
12. Students experiencing network or load shedding challenges are advised to apply together with
supporting evidence for an Aegrotat within 3 days of the examination session.
13. Students experiencing technical challenges, contact the SCSC 080 000 1870 or email
Examenquiries@unisa.ac.za or refer to URL link for the list of additional contact numbers or
alternatively email your module lecturer. ONLY communication from your myLIfe account will be
considered.

, COS2621
4 Oct/Nov 2022


Question 1: General knowledge [30]

Choose from alternatives (1) to (5) the correct one. Each question counts 2 marks.

a). The exists in one of two states and, in the absence of input, remains in that state.

(1) assert
(2) complex PLD
(3) decoder
(4) flip-flop
(5) oscillator



b). instructions provide computational capabilities for processing numeric data.

(1) Boolean
(2) Logic
(3) Memory
(4) Arithmetic
(5) Comparison


c). NASM is a(n) while DEBUG is a(n) .

(1) compiler, linker and loader
(2) assembler, assembler
(3) assembler, utility to assemble and debug programs
(4) translator, interpreter
(5) compiler, assembler

d). Consider the following assembly language program fragment:

org 0x100
label1: dw 0x76EF
nop
mov ax,ax
nop


Which one of the following statements is true?

(1) 76h is stored in position 101h and EFh is stored in position 100h.
(2) 76h is stored in position 100h and EFh is stored in position 101h.
(3) 67h is stored in position 101h and EFh is stored in position 100h.
(4) 67h is stored in position 100h and EFh is stored in position 101h.
(5) None of the above.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

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

Quick and easy check-out

You can quickly pay through EFT, credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

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 this summary from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller VarsityC. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy this summary for R50,00. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

84866 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy summaries for 14 years now

Start selling
R50,00  4x  sold
  • (0)
  Buy now