Computer Science MCQs for FPSC, SPSC, PPSC KPPSC, NTS ,CSS and All types of tests.
Computer Science MCQs consists of Basic Computer Concepts MCQs, Computer Abbreviations MCQs, Computer Science Concepts MCQs, Networking MCQs, Database Management System MCQs, Computer Architecture and Design MCQs, Data Structure MCQs, Programming Languages C MCQs, C++ MCQs, JAVA MCQs, etc. These Computer MCQs are very important for all type of Government Exams conducted by FPSC, KPPSC, PPPSC, SPSC, NTS, CSS, and other testing agencies and commissions of Pakistan. Computer Science Multiple Choice Questions and answers including MCQs from past papers. Following are the most important and the most repeated Computer Science solved MCQS with Answers.
Latest Computer Science MCQs:
Big O, big theta and big Omega are:
(A) Wort, average and best case scenario of an algorithm
(B) Asymptotic notations that describe upper bound, both above and below bound and lower bound respectively.
(C) Notation used to compare order of growth.
(D) Set of algorithms with worst, second wort and best complexities respectively.
The answer is (B) Asymptotic notations that describe upper bound, both above and below bound and lower bound respectively.
“Software engineers should not use their technical skills to misuse other people’s computers.”Here the term misuse refers to:
a) Unauthorized access to computer material
b) Unauthorized modification of computer material
c) Dissemination of viruses or other malware
d) All of the mentioned
The answer is d) All of the mentioned
This MCQS is taken from www.sanfoundry.com
Which of the following is not an application of topological sorting?
a) Finding prerequisite of a task
b) Finding Deadlock in an Operating System
c) Finding Cycle in a graph
d) Ordered Statistics
The answer is d) Ordered Statistics
The algorithms that are designed to be executed on RAM are called
A- Random
B- Sequential
C- Circular
D- Arbitrary
The answer is B- Sequential
What is the maximum number of children that a binary tree node can have?
A) 0
B) 1
C) 2
D) 3
The answer is C) 2
The prefix form of an infix expression A+B-C*D is
(A) +AB-*CD
(B) -+A B C * D
(C) -+A B * C D
(D) – + *ABCD
The answer is (C) -+A B * C D
Java achieves polymorphism through:
A. Overrdiding
B. overloading
C. Interfaces
D. Pointers
The answer is C. Interfaces
Which of the following features from procedural language is not supported in java
A) Object-oriented
B) Use of pointers
C) Portable
D) Dynamic and Extensible
The answer is B) Use of pointers
Which of the following is a properly defined structure?
(a) struct {int a;}
(b) struct a_struct {int a;}
(c) struct a_struct int a;
(d) struct a_struct {int a;}
The answer is (d) struct a_struct {int a;}
Which of the followings is/are pointer-to-member declarator?
A. ->*
B. .*
C. ::*
D. both A and B
The answer is C. ::*