Our team has conducted extensive research to compile a set of Introduction to Programming MCQs. We encourage you to test your Introduction to Programming knowledge by answering these multiple-choice questions provided below.
Simply scroll down to begin!
A. False
B. True
A. Ternary operator
B. Special operator
C. Unary operator
D. Boolean operator
A. diamond
B. rectangle
C. circle
D. arrow
A. Introducing errors in the program to see how it holds up
B. Testing the program
C. Finding and fixing errors in your program.
D. Usability Testing
A. Looping
B. Encapsulation
C. Abstraction
D. Inheritance
A. Attribute
B. Variable
C. Parameter
D. Constant
A. iteration
B. culmination
C. enumeration
D. pass through
A. The real word
B. A loop that includes variables
C. A multi dimensional array
D. An array with a list of values
A. string
B. boolean
C. integer
D. alphanumeric
A. A list of values
B. A non changeable variable
C. A large variable
A. JavaScript
B. C++
C. Objective-C
D. C#
A. When we don't know how many times a loop has to run, but want it to run when a criteria is active
B. To halt a program
C. If you don't have space for a for loop
D. To save memory
A. Nothing, it isn't used anymore
B. Takes your programming language and converts it to machine readable code
C. Takes a program and turns it into human readable code
D. It packages your code in a .zip file
A. Not Equal
B. True
C. Equal
D. False
A. C++
B. Pascal
C. C#
D. All of these
E. Java
A. Equality between two variables
B. It prints out a variable
C. The result of a code block
D. The sum of two numbers
A. Text based instructions
B. A popular programming language
C. A graphical user interface
D. A Generic User Instruction
A. int
B. float
C. double
D. void
A. 0 and 1
B. 0, 1, 2, 3
C. 0 through 10
D. 0 through 5
A. removed
B. reset
C. declared
D. erased
A. It is only used on non object-oriented languages
B. When a value is equal
C. To repeat code a known number of times
A. 6
B. -1
C. text'
D. False
A. 2
B. 1024
C. 8
D. 100
A. A loop that assigns variables
B. A loop within a loop
C. A large "while" loop
D. A large "for" loop
A. Using a computer for spreadsheets or word processing
B. Controlling a computer with a mouse
C. Provide (a computer or other machine) with coded instructions for the automatic performance of a particular task.
D. Telling the computer what to do in human language
A. public
B. protected
C. inherited
D. private
A. procedure oriented
B. object oriented
C. none of these
D. method oriented
A. Fourth-Generation Programming Language
B. Compiler
C. Debugger
D. Third-Generation Programming Language
A. 1
B. -1
C. any number
D. 0
A. It assigns a value to a variable
B. It checks for equality
C. It removes code from being executed
A. False
B. True
A. web programming
B. imperative programming
C. object oriented programming
D. procedural programming
A. Addition
B. Modulo
C. Multiplication
D. Division
A. OR
B. IF
C. AND
D. NOT
A. False
B. True
A. When the condition is true.
B. When the condition is true or false.
C. Statement 1 will never be executed.
D. When the condition is false.
A. False
B. 1
C. 777
D. 887
A. Cleans up garbage on the screen.
B. Collects and disposes of junk email.
C. Takes out your office garbage.
D. Reclaims memory occupied by data that is no longer in use.
E. Allocates memory for new objects.
A. do { statements; } while ( condition );
B. ( condition) while; do { statements; };
C. while ( condition ); do { statements; };
D. { statements; } do-while();
A. Statement 2 will be executed when statement 1 is executed.
B. When the condition is true or false.
C. When the condition is true.
D. When the condition is false.
A. data type
B. variable
C. object
D. class
A. i = i + j;
B. i += j;
A. pointer
B. function
C. class
D. object
A. algorithm
B. program
C. statement
D. routine
A. Equality
B. Less than or equal to
C. Assignment
D. Greater than
A. FrontPage
B. Visual Studio
C. Notepad
D. DreamWeaver
A. unary
B. logical
C. arithmetic
D. relational
A. Method
B. Array
C. Function
D. Object
A. 0
B. 3
C. 1
D. 2
A. data protection
B. data inheritance
C. data encapsulation
D. internal data
A. Analytical Student Comprehension Intelligence Index
B. Automation Standards for Computing Information Institution
C. American Standard Code for Information Interchange
D. Analytical Standard Code for Information Interchange
A. Ruby
B. C++
C. JAVA
D. COBOL
A. printf("Hello World")
B. println("Hello World")
C. println(Hello World)
D. printf(Hello World)
A. a queue
B. a map
C. an array
D. a stack
E. a hash
A. 0
B. False
C. True
D. 1
A. An object
B. Pass by reference
C. Pass by value
D. A class
A. The array cannot be sorted.
B. The array must be partitioned into two lists.
C. The array must be sorted.
D. You cannot binary sort an array.
A. None of them.
B. For
C. While
D. All of them
E. Do OR Do While
A. A node that has at least one child node
B. A node that is the root
C. A node that owns intself
A. 10
B. 7
C. 8
D. 5
A. Syntax
B. ASCII
C. Standards
D. Programming language
A. compiler
B. object oriented languages
C. HTML
D. interpretted language
A. Pass by value
B. A class
C. An object
D. Pass by reference
A. LINUX
B. Windows
C. UNIX
D. Other
A. infinite loop
B. precheck loop
C. fixed loop
D. postcheck loop
A. local variable
B. index variable
C. global variable
D. private variable
A. 10
B. 8
C. 255
D. 1
A. Both compile-time and run-time
B. Compile-time
C. It's impossible to have syntax errors in a compiled language.
D. Run-time
A. fixed loop
B. infinite
C. precheck loop
D. postcheck loop
A. 101
B. 2
C. 5
D. 9
A. Javascript
B. PHP
C. Ruby
D. C++
A. 1024
B. 255
C. 254
D. 0
E. #FFFFFF
A. compiler
B. Object Oriented programming language
C. First-Generation programming language (1GL)
D. Second-Generation programming language (2GL)
A. If either children node of the Tree is null, then the other node must also be null.
B. None of these.
C. A Binary Tree's nodes have not more than two child nodes, typically named 'left' and 'right'.
D. The value of left node must be less than the value of the right node.
A. 0
B. 5
C. 10
D. 2
A. Java Language
B. UNIX
C. C Language
D. Fortran Language
A. Linear search
B. Binary search
C. Quick search
D. Random search
A. 1
B. 0
C. NULL
D. Depends on the language specification
E. a variable must be instantiated upon creation
A. NOT false
B. true or false
C. (NOT false and true)
D. NOT (true or false)
A. False
B. True
A. queue
B. binary tree
C. doubly linked list
D. linked list
E. array
A. C++, C#, C
B. Objective C
C. Ruby, Perl
D. Java
A. O(n^2), O(2^n), O(n*log(n)), O(n), O(log(n)), O(1)
B. O(2^n), O(n^2), O(log(n)), O(n), O(n*log(n)), O(1)
C. O(n^2), O(2^n), O(log(n)), O(n), O(n*log(n)), O(1)
D. O(2^n), O(n^2), O(n*log(n)), O(n), O(log(n)), O(1)
A. CPU
B. operating system
C. secondary storage device
D. main memory
A. a nibble
B. a byte
C. 2 bytes
D. half byte
A. Merge Sort
B. Bubble Sort
C. Selection Sort
D. Quick Sort
A. Selection Sort
B. Heap Sort
C. Insertion Sort
D. Merge Sort
A. JavaScript
B. CodeScript
A. Sequence
B. Selection
C. Pseudocode
D. Compiled
A. Static, dynamic
B. System requirements model
C. Data declaration
D. Symbol table
A. Totals button
B. Field Properties
C. Lookup
D. Number
A. Message
B. Alert
C. Prompt
A. Join
B. Project
C. Find
D. Select
A. Stacked
B. Nested
C. Priming
D. Posttest
A. Sleep or hibernate
B. Process
C. Driver
D. Spooling
A. Variable
B. String
C. Character
A. Technical writer
B. Systems analyst
C. Programmer
D. Business analyst
E. Programmer
A. Stub
B. Driver
C. Main function
D. Dummy program
A. Void method
B. Void
C. None of these
A. Binary
B. Unary
C. Linear
D. Relative
E. None of these