Skip to content
VUBuddy

CS101 Final Term Collection of Assessments by Maha Malik

Introduction to Computing PDF 1.7 MBUpdated 23 Oct 2026
Final term past paper CS101 Final Term Collection of Assessments by Maha Malik PDF 1.7 MB
vubuddy.com
Type
Final term past paper
Course
CS101 Introduction to Computing
Size
PDF 1.7 MB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 1.7 MB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 67. Download the file for all 67 pages.

  1. When code is converted to machine language then it is ______ to see the output. compiled assembled executed translated
  2. Mnemonics are ______ to represent early generation language codes. names symbols characters words
  3. Machine language consists of _______ digit system. binary hexadecimal octal decimal
  4. ________ converts mnemonic expressions into machine language instructions. assembler

compiler convertor

  1. Computer uses_________ language to communicate within its modules. natural JAVA C binary
  2. Descriptive names used to represent mnemonic expressions are called as ________? constants

identifiers program variables

  1. A complete mnemonic system used for representing is collectively known as _______.

assembly language

machine language

  1. The process of locating and correcting an error in a programming language is called ______. debugging correcting executing editing
  2. COBOL Stands for ________. Comprehensive business oriented language Common business oriented language Comprehensive business object language Common business object language
  3. _________ translates one instruction to machine language at a time. interpreter both a,b compiler
  4. Identifiers are also known as _______. variables names values constants
  5. FORTRAN stands for _________. Formula transporter Formula transition Formula translator Formula transfer
  6. ________ language is precisely defined by rules and grammar. Formal Programming Natural English
  7. A program written in a third-generation language could be used on any machine simply by applying the appropriate compiler is called ________.
  8. The extended part of the compiler ,which is not the actual part of the standard language, is called _________. compiler extension

language extension

Q16. Which of the following is the disadvantage of assembly language?

code is machine dependent. works in small increments. code is machine independent.

  1. A compiler translates _______ code to machine language at a time. one by one each instruction complete module by module. function by function
  2. If a program is installed on two different machines and by making small changes it can be used on both. This is known as _________. goal of machine independence disadvantage of machine dependence disadvantage of machine independence goal of machine dependence
  3. By definition, ___________ is if code does not run on a variety of computer systems.
  4. _______ languages lies under imperative paradigm. C++ and Python FORTRAN and COBOL C and C++ C++ and JAVA
  5. The procedural paradigm is also known as _______.
  6. Start finding an algorithm and then express that algorithm in sequence of commands. This approach is known as ________.
  7. Programming languages are evolved in _______ no of paradigms
  8. Programming paradigms are known as _________ approaches to the programing process. alternate
All CS101 files →
CS101 Introduction to Computing All CS101 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.