Solved MCQ of C++ Set-1

0

1. C++ is an extension of C with a major addition of the class construct feature of ……………..
A) Simula67
B) Simula57
C) Simula47
D) Simula87

2. C++ has the name ………………….. before it was changed to C++.
A) Improved C  
B) Integrated C
C) C with classes
D) C with Simula

3. …………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer.
A) Keywords
B) Identifiers
C) Constraints
D) Strings

4. In C++, the keyword void was used ………..
A) To specify the return type of function when it is not returning any value.
B) To indicate an empty argument list to a function.
C) To declare the generic pointers.
D) All of the above.

5. Match the following
a) : :                                       i) Pointer to member declarator
b) : :*                                    ii) Pointer to member operator
c) ->*                                    iii) Scope resolution operator
A) a-ii, b-iii, c-i
B) a-iii, b-i, c-ii
C) a-i b-ii, c-iii
D) a-iii, b-ii, c-i

6. If m and n are int type variables, what will be the result of the expression
m% n     when m=5 and n=2 ?
A) 0
B) 1
C) 2
D) None of the above

 7. Some of the C++ operators cannot overloaded which are
i) Member access operators (. And .*)                   ii) Conditional operator (? :)
iii) Scope resolution operator (: :)                             iv) Size operator (sizeof)
A) only i, ii and iii
B) only ii, iii and iv
C) only ii and iv
D) All i, ii, iii and iv

8. Some of the situations where inline expansion may not work are:
A) For functions returning values, if a loop, a switch or goto exists.
B) If functions contain static variables and they are re-cursive.
C) For functions not returning values, if return statement exist.
D) All of the above.

9. Which of the following control expressions are valid for an if statement?
A) an integer expression
B) a Boolean expression
C) either A or B
D) Neither A nor B

10. …………… is a way to bind the data and its associated functions together which allows the data and functions to be hidden.
A) Structure
B) Class
C) Enum
D) Both A and B

Answers

1. A) Simula67
2.   C) C with classes
3.   B) Identifiers
4.  D) All of the above.
5.   B) ii-False, ii-True
6.   B) 1
7.  D) All i, ii, iii and iv
8.  D) All of the above.
9.   B) a Boolean expression
10.  B) Class

You Might also view the following Related Posts

You can view the following other posts

For other more Multiple Choice Questions (MCQs): Click Here

Solved MCQ of Data Structure Set-2

0

1. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

A) Weakly connected

B) Strongly Connected

C) Tightly Connected

D) Linearly Connected



2. In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex.

A) Depth First

B) Breadth First

C) With First

D) Depth Limited



3. State True of False.

i) Network is a graph that has weights or costs associated with it.

ii) An undirected graph which contains no cycles is called a forest.

iii) A graph is said to be complete if there is no edge between every pair of vertices.

A) True, False, True

B) True, True, False

C) True, True, True

D) False, True, True



4. Match the following.

a) Completeness          i) How long does it take to find a solution
b) Time Complexity    ii) How much memory need to perform the search.
c) Space Complexity  iii) Is the strategy guaranteed to find the solution when there in one.

A) a-iii, b-ii, c-i

B) a-i, b-ii, c-iii

C) a-iii, b-i, c-ii

D) a-i, b-iii, c-ii



5. The number of comparisons done by sequential search is ………………

A) (N/2)+1

B) (N+1)/2

C) (N-1)/2

D) (N+2)/2



6. In ……………, search start at the beginning of the list and check every element in the list.

A) Linear search

B) Binary search

C) Hash Search

D) Binary Tree search



7. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

A) True, False

B) False, True

C) False, False

D) True, True



8. Which of the following is not the internal sort?

A) Insertion Sort

B) Bubble Sort

C) Merge Sort

D) Heap Sort



9. State True or False.

i) An undirected graph which contains no cycles is called forest.

ii) A graph is said to be complete if there is an edge between every pair of vertices.

A) True, True

B) False, True

C) False, False

D) True, False



10. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

A) Partite

B) Bipartite

C) Rooted

D) Bisects



11. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

A) 0 and 1

B) 0 and -1

C) -1 and 0

D) 1 and 0



12. In a circular queue the value of r will be ..

A) r=r+1

B) r=(r+1)% [QUEUE_SIZE – 1]

C) r=(r+1)% QUEUE_SIZE

D) r=(r-1)% QUEUE_SIZE



13. Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

A) i-only

B) ii-only

C) Both i and ii

D) None of both



14. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

A) Lists

B) Linked Lists

C) Trees

D) Queues




15. What will be the value of top, if there is a size of stack STACK_SIZE is 5

A) 5

B) 6

C) 4

D) None




16. ………… is not the operation that can be performed on queue.

A) Insertion

B) Deletion

C) Retrieval

D) Traversal




17. There is an extra element at the head of the list called a ……….

A) Antinel

B) Sentinel

C) List header

D) List head




18. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

A) vertices, edges

B) edges, vertices

C) vertices, paths

D) graph node, edges




19. A ……….. is a graph that has weights of costs associated with its edges.

A) Network

B) Weighted graph

C) Both A and B

D) None A and B



20. In general, the binary search method needs no more than ……………. comparisons.

A) [log2n]-1

B) [logn]+1

C) [log2n]

D) [log2n]+1



View Answers:



1. B) Strongly Connected

2. A) Depth First

3. B) True, True, False

4. C) a-iii, b-i, c-ii

5. B) (N+1)/2

6. A) Linear search

7. D) True, True

8. C) Merge Sort

9. A) True, True10. B) Bipartite

11. B) 0 and -1

12. C) r=(r+1)% QUEUE_SIZE

13. C) Both i and ii

14. B) Linked Lists

15. C) 4

16. D) Traversal

17. B) Sentinel

18. A) vertices, edges

19. C) Both A and B
20. D) [log2n]+1

 Related posts:

        For more Multiple Choice Questions(MCQs): Click Here

        Solved MCQ of Data Structure Set-1

        0

        1. Which if the following is/are the levels of implementation of data structure

        A) Abstract level

        B) Application level

        C) Implementation level

        D) All of the above


        2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

        A) AVL tree

        B) Red-black tree

        C) Lemma tree

        D) None of the above


        3. ……………….. level is where the model becomes compatible executable code

        A) Abstract level

        B) Application level

        C) Implementation level

        D) All of the above


        4. Stack is also called as

        A) Last in first out

        B) First in last out

        C) Last in last out

        D) First in first out


        5. Which of the following is true about the characteristics of abstract data types?

        i) It exports a type.

        ii) It exports a set of operations

        A) True, False

        B) False, True

        C) True, True

        D) False, False


        6. …………… is not the component of data structure.

        A) Operations

        B) Storage Structures

        C) Algorithms

        D) None of above


        7. Which of the following is not the part of ADT description?

        A) Data

        B) Operations

        C) Both of the above

        D) None of the above


        8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

        A) push, pop

        B) pop, push

        C) insert, delete

        D) delete, insert


        9. ……………. Is a pile in which items are added at one end and removed from the other.

        A) Stack

        B) Queue

        C) List

        D) None of the above


        10. ………… is very useful in situation when data have to stored and then retrieved in reverse order.

        A) Stack

        B) Queue

        C) List

        D) Link list


        11. Which data structure allows deleting data elements from and inserting at rear?

        A) Stacks

        B) Queues

        C) Dequeues

        D) Binary search tree


        12. Which of the following data structure can't store the non-homogeneous data elements?

        A) Arrays

        B) Records

        C) Pointers

        D) Stacks


        13. A ....... is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

        A) Queue linked list

        B) Stacks linked list

        C) Both of them

        D) Neither of them


        14. Which of the following is non-liner data structure?

        A) Stacks

        B) List

        C) Strings

        D) Trees


        15. Herder node is used as sentinel in .....

        A) Graphs

        B) Stacks

        C) Binary tree

        D) Queues


        16. Which data structure is used in breadth first search of a graph to hold nodes?

        A) Stack

        B) queue

        C) Tree

        D) Array


        17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

        A) Input restricted dequeue

        B) Output restricted qequeue

        C) Priority queues

        D) Stack


        18. Which of the following data structure is non linear type?

        A) Strings

        B) Lists

        C) Stacks

        D) Graph


        19. Which of the following data structure is linear type?

        A) Graph

        B) Trees

        C) Binary tree

        D) Stack


        20. To represent hierarchical relationship between elements, Which data structure is suitable?

        A) Dequeue

        B) Priority

        C) Tree

        D) Graph

        Answers:

        1. D) All of the above
        2. A) AVL tree
        3. C) Implementation level
        4. A) Last in first out
        5. C) True, True
        6. D) None of above
        7. D) None of the above
        8. A) push, pop
        9. B) Queue
        10. A) Stack
        11. B) Queues
        12. A) Arrays
        13. A) Queue linked list
        14. D) Trees
        15. C) Binary tree
        16. B) queue
        17. A) Input restricted dequeue
        18. D) Graph
        19. D) Stack
        20. C) Tree


        Related Posts

          

          For other more Multiple Choice Questions (MCQs): Click Here

          Solved MCQ of Database Management System (DBMS) Set - 3

          0

          1. State true or false.
          i) Select operator is not a unary operator.
          ii) Project operator chooses subset of attributes or columns of a relation.

          A) i-True, ii-False

          B) i-True, ii-True

          C) i-False, ii-True

          D) i-False, ii-False


          2. …………… database is used as template for all databases created.

          A) Master

          B) Model

          C) Tempdb

          D) None of the above


          3. One aspect that has to be dealt with by the integrity subsystem is to ensure that only valid values can be assigned to each data items. This is referred to as

          A) Data Security

          B) Domain access

          C) Data Control

          D) Domain Integrity


          4. ………………….. operator is basically a join followed by a project on the attributes of first relation.

          A) Join

          B) Semi-Join

          C) Full Join

          D) Inner Join


          5. Which of the following is not a binary operator in relational algebra?

          A) Join

          B) Semi-Join

          C) Assignment

          D) Project


          6. Centralizing the integrity checking directly under the DBMS ………….. Duplication and ensures the consistency and validity of the database.

          A) Increases

          B) Skips

          C) Does not reduce

          D) Reduces


          7. Which of the following is/are the DDL statements?

          A) Create

          B) Drop

          C) Alter

          D) All of the above


          8. In snapshot, …………………. clause tells oracle how long to wait between refreshes.

          A) Complete

          B) Force

          C) Next

          D) Refresh


          9. ……………… defines rules regarding the values allowed in columns and is the standard mechanism for enforcing database integrity.

          A) Column

          B) Constraint

          C) Index

          D) Trigger


          10. For like predicate which of the following is true.
          i) % matches zero of more characters.
          ii) _ matches exactly one character.

          A) i-only

          B) ii-only

          C) Both of them

          D) None of them


          Answers:

          1. C) i-False, ii-True
          2. B) Model
          3. D) Domain Integrity
          4. B) Semi-Join
          5. D) Project
          6. D) Reduces
          7. D) All of the above
          8. D) Refresh
          9. B) Constraint
          10. C) Both of them


          Related Posts

          For other more Multiple Choice Questions (MCQs): Click Here

          Solved MCQ of Database Management System (DBMS) Set - 2

          0

          1. The candidate key is that you choose to identify each row uniquely is called ……………..

          A) Alternate Key

          B) Primary Key

          C) Foreign Key

          D) None of the above


          2. …………….. is used to determine whether of a table contains duplicate rows.

          A) Unique predicate

          B) Like Predicate

          C) Null predicate

          D) In predicate


          3. To eliminate duplicate rows ……………… is used

          A) NODUPLICATE

          B) ELIMINATE

          C) DISTINCT

          D) None of these


          4. State true or false

          i) A candidate key is a minimal super key.

          ii) A candidate key can also refer to as surrogate key.

          A) i-true, ii-false

          B) i-false, ii-true

          C) i-true, ii-true

          D) i-false, ii-false


          5. DCL stands for

          A) Data Control Language

          B) Data Console Language

          C) Data Console Level

          D) Data Control Level


          6. …………………… is the process of organizing data into related tables.

          A) Normalization

          B) Generalization

          C) Specialization

          D) None of the above


          7. A ………………. Does not have a distinguishing attribute if its own and mostly are dependent entities, which are part of some another entity.

          A) Weak entity

          B) Strong entity

          C) Non attributes entity

          D) Dependent entity


          8. …………….. is the complex search criteria in the where clause.

          A) Sub string

          B) Drop Table

          C) Predict

          D) Predicate


          9. ………………… is preferred method for enforcing data integrity

          A) Constraints

          B) Stored Procedure

          C) Triggers

          D) Cursors


          10. The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ………………..

          A) Degree, Cardinality

          B) Cardinality, Degree

          C) Rows, Columns

          D) Columns, Rows


          11) The language that requires a user to specify the data to be retrieved without specifying exactly how to get it is

          A. Procedural DML

          B. Non-Procedural DML

          C. Procedural DDL

          D. Non-Procedural DDL


          12) Which two files are used during operation of the DBMS?

          A. Query languages and utilities

          B. DML and query language

          C. Data dictionary and transaction log

          D. Data dictionary and query language


          13) The database schema is written in

          A. HLL

          B. DML

          C. DDL

          D. DCL


          14) The way a particular application views the data from the database that the application uses is a

          A. module

          B. relational model

          C. schema

          D. sub schema


          15) The relational model feature is that there

          A. is no need for primary key data

          B. is much more data independence than some other database models

          C. are explicit relationships among records.

          D. are tables with many dimensions


          16) Which one of the following statements is false?

          A. The data dictionary is normally maintained by the database administrator

          B. Data elements in the database can be modified by changing the data dictionary.

          C. The data dictionary contains the name and description of each data element.

          D. The data dictionary is a tool used exclusively by the database administrator.


          17) Which of the following are the properties of entities?

          A. Groups

          B. Table

          C. Attributes

          D. Switchboards


          18) Which database level is closest to the users?

          A. External

          B. Internal

          C. Physical

          D. Conceptual


          19) Which are the two ways in which entities can participate in a relationship?

          A. Passive and active

          B. Total and partial

          C. Simple and Complex

          D. All of the above


          20) ........ data type can store unstructured data

          A. RAW

          B. CHAR

          C. NUMERIC

          D. VARCHAR

          Answers:


          1. B. Primary Key
          2. A. Unique predicate
          3. C. DISTINCT
          4. C. i-true, ii-true
          5. A. Data Control Language
          6. A. Normalization
          7. A. Weak entity
          8. D. Predicate
          9. A. Constraints
          10. B. Cardinality, Degree
          11. B. Non-Procedural DML
          12.C. Data dictionary and transaction log
          13. C. DDL
          14. D. sub schema
          15. B. is much more data independence than some other database models
          16. B. Data elements in the database can be modified by changing the data dictionary.
          17. C. Attributes
          18. A. External
          19. B. Total and partial
          20. A. RAW


          Related Posts

          For other more Multiple Choice Questions (MCQs): Click Here

          Solved MCQ of Database Management System (DBMS) Set - 1

          0

          1. DBMS is a collection of ………….. that enables user to create and maintain a database.

          A) Keys

          B) Translators

          C) Program

          D) Language Activity


          2. In a relational schema, each tuple is divided into fields called

          A) Relations

          B) Domains

          C) Queries

          D) All of the above


          3. In an ER model, ……………. is described in the database by storing its data.

          A) Entity

          B) Attribute

          C) Relationship

          D) Notation


          4. DFD stands for

          A) Data Flow Document

          B) Data File Diagram

          C) Data Flow Diagram

          D) Non of the above


          5. A top-to-bottom relationship among the items in a database is established by a

          A) Hierarchical schema

          B) Network schema

          C) Relational Schema

          D) All of the above


          6. ……………… table store information about database or about the system.

          A) SQL

          B) Nested

          C) System

          D) None of these


          7. …………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs.

          A) Instance

          B) Schema

          c) Program

          D) Super Key


          8. ……………… clause is an additional filter that is applied to the result.

          A) Select

          B) Group-by

          C) Having

          D) Order by


          9. A logical schema

          A) is the entire database

          B) is a standard way of organizing information into accessible parts.

          C) Describes how data is actually stored on disk.

          D) All of the above


          10. ………………… is a full form of SQL.

          A) Standard query language

          B) Sequential query language

          C) Structured query language

          D) Server side query language


          11) A relational database developer refers to a record as

          A. a criteria

          B. a relation

          C. a tuple

          D. an attribute


          12) .......... keyword is used to find the number of values in a column.

          A. TOTAL

          B. COUNT

          C. ADD

          D. SUM


          13) An advantage of the database management approach is

          A. data is dependent on programs

          B. data redundancy increases

          C. data is integrated and can be accessed by multiple programs

          D. none of the above


          14) The collection of information stored in a database at a particular moment is called as ......

          A. schema

          B. instance of the database

          C. data domain

          D. independence


          15) Data independence means

          A. data is defined separately and not included in programs.

          B. programs are not dependent on the physical attributes of data

          C. programs are not dependent on the logical attributes of data

          D. both B and C


          16) A ......... is used to define overall design of the database

          A. schema

          B. application program

          C. data definition language

          D. code


          17) Key to represent relationship between tables is called

          A. primary key

          B. secondary key

          C. foreign key

          D. none of the above


          18) Grant and revoke are ....... statements.

          A. DDL

          B. TCL

          C. DCL

          D. DML


          19) DBMS helps achieve

          A. Data independence

          B. Centralized control of data

          C. Neither A nor B

          D. Both A and B


          20) .......... command can be used to modify a column in a table

          A. alter

          B. update

          C. set

          D. create


          Answers:


          1. C) Program
          2. B) Domains
          3. A) Entity
          4. C) Data Flow Diagram
          5. A) Hierarchical schema
          6. C) System
          7. B) Schema
          8. C) Having
          9. B) is a standard .. accessible parts.
          10. C) Structured query language
          11) C. a tuple
          12) B. COUNT
          13) C. data is integrated and can be accessed by multiple programs
          14) B. instance of the database
          15) D. both B and C
          16) A. schema
          17) C. foreign key
          18) C. DCL
          19) D. Both A and B
          20) A. alter


          Related Posts

           


          For other more Multiple Choice Questions (MCQs): Click Here

          Secure Socket Layer (SSL)

          0

          Secure Socket Layer (SSL) is a security protocol that was developed by Netscape Communications Corporation, along with RSA Data Security, Inc. The Primary goal of the SSL protocol is to provide a private channel between communicating applications, which ensures privacy of data, authentication of the partners, and integrity. The Secure Socket Layer (SSL) technology was used for the websites or web applications which need more security.


          Schematic representation of the SSL handshake ...
           SSL handshake protocol with two way authentication with certificates. (Photo credit: Wikipedia)

           

          Secure Socket Layer (SSL) is composed of two layers:


          • At the lower layer, a protocol for transferring data using a variety of predefined cipher and authentication combinations, called the SSL Record Protocol.
          • On the upper layer, a protocol for initial authentication and transfer of encryption keys, called the SSL Handshake Protocol.

          An SSL session is initiated as follows:


          • On the client (browser), the user requests a document with a special URL that starts with https: instead of http: either by typing it into the URL input field, or by clicking the link. For example the major search engines like Google, Yahoo, Bing and other money transactions websites uses Secure Socket Layer (SSL).The client computers which do not installed the Secure Socket Layer (SSL) certificates on their computer unable to browse those sites.
          • The client code recognizes the SSL request and establishes a connection through TCP port 443 to the SSL code on the server.
          • The client then initiates the SSL handshake phase, using the SSL Record Protocol as a carrier. At this point, there is no encryption or integrity checking built into the connection.

          The Secure Socket Layer (SSL) Protocol addresses the following security issues:


          • Privacy: After the symmetric key is established in the initial handshake, the messages are encrypted using this key.
          • Integrity: Messages contain a message authentication code (MAC) ensuring the message integrity.
          • Authentication: During the handshake, the client authenticates the server using an asymmetric or public key. It can also be based on certificates. SSL requires that each message is encrypted and decrypted and therefore has a high performance and resource cost.

          Secure Socket Layer (SSL) Protocol


          The SSL protocol is located at the top of the transport layer. SSL is also a layered protocol itself. It simply takes the data from the application layer, re-formats it, and transmits it to the transport layer. SSL handles a message as follows.

          The sender performs the following tasks

          • Takes the message from upper layer.
          • Fragments the data to manageable blocks.
          • Optionally compress the data.
          • Applies a message authentication code (MAC)
          • Encrypts the data.
          • Transmits the result to the lower layer.

           The receiver performs the following tasks.


          • Takes the data from lower layer.
          • Decrypts.
          • Verifies the data with the negotiated MAC key.
          • Decompress the data if compression was used.
          • Reassembles the message.
          • Transmits the message to the upper layer.


          An SSL session works in different states. These states are session and connection states. The SSL handshake protocol coordinates the states of the client and the server. In addition, there are read and write states defined to coordinate the encryption according to the change Cipher Spec messages.


          Change Cipher Spec Protocol


          The change Cipher Spec protocol is responsible for sending change Cipher Spec messages. At any time, the client can request to change current cryptographic parameters such as the handshake key exchange. Following the change Cipher Spec notification, the client sends a handshake key exchange and if available, certificate verify messages, and the server sends a change Cipher Spec message after processing the key exchange message. After that, the newly agreed keys will be used until the next change Cipher Spec request. The change Cipher Spec message is sent after the hello messages during the negotiation.


          SSL handshake protocol


          The SSL handshake protocol allows the client and server to determine the required parameters for and SSL connection such as protocol version, cryptographic algorithms, optional client or server authentication, and public key encryption methods to generate shared secrets. During this process, all handshake messages are forwarded to the SSL record layer to be encapsulated into special SSL messages. Figure below illustrates an SSL handshake process.



          Secure Socket Layer (SSL)



          SSL record protocol


          After the master key has been determined, the client and server can use it to encrypt application data. The SSL record protocol specifies a format for these messages in general, they include a message digest ensure that they have not been altered and the whole message is encrypted using a symmetric cipher.



          Other Internet security methods are: Transport Layer Security (TSL), Pretty Good Privacy (PGP) and Firewall, I will post about them later. Keep following this blog.



          You Might also view the following Related Posts

          For more Posts: Click Here
          يتم التشغيل بواسطة Blogger.