https://theiteducation.

com/how-to-prepare-for-mscs-admission-test-of-virtual-university-of-pakistan/

Solution of sample

https://www.mcqspk.com/vu-mcqs/

All VU mcqls link

Introduction to programming
https://www.scribd.com/doc/49192415/Almost-300-Solved-MCQs-of-CS201-Introduction-To-
Programing

just 18 pagination

end
http://www.vumultan.com/CS304Mcqs.aspx

https://www.sanfoundry.com/object-oriented-programming-questions-answers-online-test/

https://www.pakistangk.com/object-oriented-paradigm-mcqs-with-answers-for-nts-ppsc-fpsc/

https://www.facebook.com/NTSAndPPSCTestPreparation/posts/computer-mcqs-for-ppscoop-very-
important-1-where-does-the-execution-of-the-progr/1899684790289229/

https://www.careerride.com/mcq/polymorphism-object-oriented-programming-mcq-questions-2.aspx

https://www.vuzs.info/mcqs/247-mcqs-cs304-object-oriented-programming/5761-cs304-object-
oriented-programming-solved-mcqs-from-quiz-2-a.html

Polymorphism is the ability of an object to take on many forms. The most common use
of polymorphismin OOP occurs when a parent class reference is used to refer to a child class
object
Object − Objects have states and behaviors. Example: A dog has states - color, name, breed
as well as behaviors – wagging the tail, barking, eating. An object is an instance of
a class. Class − A class can be defined as a template/blueprint that describes the
behavior/state that the object of its type support.
Encapsulation is one of the fundamental concepts in object-oriented programming
(OOP).This concept is also often used to hide the internal representation, or state, of an object
from the outside.
A major topic in OOP is overloading methods, which lets you define the same method multiple
times so that you can call them with different argument lists
Abstraction is one of the key concepts of object-oriented programming (OOP) languages. Its
main goal is to handle complexity by hiding unnecessary details from the user.
A constructor is a special method of a class or structure in object-oriented programming that
initializes an object of that type. A constructor is an instance method that usually has the same
name as the class, and can be used to set the values of the members of an object, either to
default or to user-defined values.
Destructors. Whenever an object is destroyed and removed from memory, the
object's destructor is called. In object-oriented programming, a destructor gives an object a
last chance to clean up any memory it allocated or perform any other tasks that must be
completed before the object is destroyed
C++ access specifiers are used for determining or setting the boundary for the availability of
class members (data members and member functions) beyond that class. ... These keywords
are called access specifiers which define the accessibility or visibility level of class members.
By default the class members are private.
Private members are class members that are hidden from the outside world. Theprivate
members implement the OOP concept of data hiding. ... Private memberscannot be inherited
by other classes. Protected members are the members that can only be used by
the member functions and friends of the class in which it is declared.
Broadly speaking, public means everyone is allowed to access, private means that
only members of the same class are allowed to access, and protected means that members of
subclasses are also allowed.
A class declared inside a function becomes local to that function and is called Local Class in
C++
A member function of a class is a function that has its definition or its prototype within the
class
In object-oriented programming (OOP), an inner class or nested class is a class declared
entirely within the body of another class or interface.
A derived class is a class created or derived from another existing class. The
existing class from which the derived class is created through the process of inheritance is
known as a base class or superclass.
A base class is a class from which other classes are derived in an object-
oriented programming language.
Templates are powerful features of C++ which allows you to write generic programs. In simple
terms, you can create a single function or a class to work with different data types
using templates.
A pointer is declared using the * operator before an identifier. A pointer is a data type whose
value refers directly to (or "points to") another value stored elsewhere in the computer memory
using its address.
2nd topic Data communication
(FDDI) stands for Fiber Distributed Data Interface.
https://www.ilmkidunya.com/resources/cs601-data-communication-important-solved-mcqs-for-virtual-
university-students-862

http://www.vumultan.com/CS601Mcqs.aspx

Layer 7: The application layer: Enables the user (human or software) to

interact with the application or network whenever the user elects to read
messages, transfer files or perform other network-related activities. Web
browsers and other internet-connected apps, such as Outlook and Skype, use
Layer 7 application protocols.

Layer 6: The presentation layer: Translates or formats data for the application
layer based on the semantics or syntax that the application accepts. This layer
is also able to handle the encryption and decryption that the application layer
requires.

Layer 5: The session layer: It include check points. Wo book sa parna hain.
Sets up, coordinates and terminates conversations between applications. Its
services include authentication and reconnection after an interruption. This
layer determines how long a system will wait for another application to
respond. Examples of session layer protocols include X.225, AppleTalk and
Zone Information Protocol (ZIP).
Layer 4: The transport layer: It divides data into packets.
Is responsible for transferring data across a network and provides error-
checking mechanisms and data flow controls. It determines how much data to
send, where it gets sent and at what rate. The Transmission Control Protocol
is the best-known example of the transport layer.
Layer 3: The network layer: book sa parna ha
Primary function is to move data into and through other networks. Network
layer protocols accomplish this by packaging data with correct network
address information, selecting the appropriate network routes and forwarding
the packaged data up the stack to the transport layer.
Layer 2: The data-link layer: book
The physical layer: book
Name bhi yar krna hain flow k sath layers k

Software Engineering
http://cs-mcqs.blogspot.com/2012/11/software-engineering-solved-mcqs.html

All sets krna hain

https://www.gkseries.com/computer-science/software-engineering-and-case-tools/software-
engineering-fundamentals/fundamentals-of-software-engineering

3 pagination

https://www.gkseries.com/computer-science/software-engineering-and-case-tools/software-
requirements-analysis-and-specification/00002-questions-and-answers-on-srs-document

2 pagination

Waterfall model also called SDLC model.

Classical waterfall model is the basic software development life cycle model. It is very simple
but idealistic. Earlier this model was very popular but nowadays it is not used. But it is very
important because all the other software development life cycle models are based on the
classical waterfall model.
Classical waterfall model divides the life cycle into a set of phases. This model considers that
one phase can be started after completion of the previous phase. That is the output of one
phase will be the input to the next phase. Thus the development process can be considered as
a sequential flow in the waterfall. Here the phases do not overlap with each other.
The Prototyping Model is one of the most popularly used Software Development Life Cycle
Models (SDLC models).This model is used when the customers do not know the exact project
requirements beforehand. In this model, a prototype of the end product is first developed, tested
and refined as per customer feedback repeatedly till a final acceptable prototype is achieved
which forms the basis for developing the final product.
Spiral model is one of the most important Software Development Life Cycle models, which
provides support for Risk Handling. In its diagrammatic representation, it looks like a spiral with
many loops. The exact number of loops of the spiral is unknown and can vary from project to
project. Each loop of the spiral is called a Phase of the software development
process. The exact number of phases needed to develop the product can be varied by the
project manager depending upon the project risks. As the project manager dynamically
determines the number of phases, so the project manager has an important role to develop a
product using spiral model.

An iterative life cycle model does not attempt to start with a full specification of requirements.
Instead, development begins by specifying and implementing just part of the software, which
can then be reviewed in order to identify further requirements. This process is then repeated,
producing a new version of the software for each cycle of the model.
Black box testing is the Software testing method which is used to test thesoftware without
knowing the internal structure of code or program. White box testing is the software
testing method in which internal structure is being known totester who is going
to test the software
SDLC - RAD Model. Advertisements. The RAD (Rapid Application Development) model is
based on prototyping and iterative development with no specific planning involved. The
process of writing the softwareitself involves the planning required for developing the product.
SDLC phases in detailed

Algorithms
https://www.sanfoundry.com/computer-fundamentals-questions-answers-algorithms/

https://engineeringinterviewquestions.com/data-structures-and-algorithms-multiple-choice-questions-
and-answers/

again 35 sa phir start kr dana hain

An algorithm is a well-defined procedure that allows acomputer to solve a problem. Another

way to describe an algorithm is a sequence of unambiguous instructions. ... In fact, it is difficult
to think of a task performed by your computer that does not usealgorithms.
FIFO
LIFO
Selection algorithm. ... In computer science, a selection algorithm is an algorithmfor finding
the kth smallest number in a list or array; such a number is called the kth order statistic. This
includes the cases of finding the minimum, maximum, and median elements.
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent
elements if they are in wrong order.
https://www.programiz.com/dsa/bubble-sort

This link for bubble sort with example.

Quicksort is a popular sorting algorithm that is often faster in practice compared to other
sorting algorithms. It utilizes a divide-and-conquer strategy to quickly sort data items by
dividing a large array into two smaller arrays.
Examples of quicksort and merge sort must be watch on youtube
Sieve of Eratosthenes is an algorithm for finding all the prime numbers in a segment [1;n]
using O(nloglogn) operations. The algorithm is very simple: at the beginning we write down all
numbers between 2 and n. We mark all proper multiples of 2 (since 2 is the smallest prime
number) as composite.
Example on youtube
Heap sort example
In computer science, binary search, also known as half-interval search, logarithmic search,
or binarychop, is a search algorithm that finds the position of a target value within a sorted
array. ... If the search ends with the remaining half being empty, the target is not in the array
Example on net
Binary Search Tree is a node-based binary tree data structure which has the following
properties: The left subtree of a node contains only nodes with keys lesser than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
Example on net
A stack is an ordered list of elements where all insertions and deletions are made at the same
end, whereas a queueis exactly the opposite of a stack which is open at both the ends
meaning one end is used to insert data while the other to remove data. ... stack is known as lifo
and queueis kniwn as fifo rule
Linear type mean data in a line means queue and stacks and no linear mean data is not in a line
mean trees and graph.
breadth first search algorithm
All alogorithms times

Automata
https://www.tutorialspoint.com/automata_theory/regular_expressions.htm

regular expressions examples.

https://www.youtube.com/watch?v=WJpcfASA17c

for DFA

https://www.youtube.com/watch?v=zn1CGSyV8mQ

for NFA

https://onlinesmarttrainer.blogspot.com/2019/02/automata-theory-multiple-choice.html

sara MCQLZ krna hai with examples

https://www.sanfoundry.com/automata-theory-multiple-choice-questions-answers/

The term "Automata" is derived from the Greek word "αὐτόματα" which means "self-acting"

An automaton with a finite number of states is called a Finite Automaton (FA) or Finite
State Machine (FSM).
 Q is a finite set of states.
 ∑ is a finite set of symbols, called the alphabet of the automaton.
  δ is the transition function.
 q0 is the initial state from where any input is processed (q0 ∈ Q).
 F is a set of final state/states of Q (F ⊆ Q).

Automata converts information from one form into another according to a

definite procedure automatically.
If a string in accepted by automata is called language of atumata.
Regular Expression. The language accepted by finiteautomata can be easily described by
simpleexpressions called Regular Expressions
In the theory of computation, a branch of theoretical computer science, a deterministic finite
automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite state
machine (DFSM), or deterministic finite state automaton (DFSA)—is a finite-state machine that
accepts or rejects strings of symbols
NFA stands for non-deterministic finite automata. It is easy to construct an NFA than DFA for a
given regular language. The finite automata are called NFA when there exist many paths for
specific input from the current state to the next state.