C++ Programming

1. Computer Programming 2. History of Prog.Language 3. Introduction to C++ 4. OOPS 5. Features of C++ 6. Starting Turbo C++ 7. C++ Tokens 8. Basic requirment of C++ 9. Comments 10. My First Program in C++ 11. Line Break 12. C++ Escape Sequence 13. Constants or Literals 14. Variable in C++ 15. Data Types in C++ 16. Range of data types in C++ 17. Declare Variables 18. Reserved Key Words 19. cout<< 20. Chained & Embedded state 21. Prog.to print sum of 2 nos 22. cin>> 23. Prg.to print sum & average 24. Area & Perimeter of Rectangle 25. Area Circumference of Circle 26. Prg.for Simple Calculator 27. Operatos in C++ 28. Ex. Of Operators 29. Swap two numbers 30. Hierarchy of Operators 31. if( ) statement 32. Prg.to check +ve,-ve or zero 33. if..else statement 34. Prg.to check Odd or Even 35. Prg.to print larger of 2 nos 36. Prg.to print largest of 3 nos 37. Prg.to check divisibility 38. Prg.to check print range 39. for. . . loop statement 40. prg.to print series of nos 41. Prg.to check divisibility 42. prg.to print sum of series 43. Prg.to print Pyramid 44. prg.for Factorial 45. prg.to fill screen 46. prg.for largest/smallest no 47. prg.to print reverse no 48. prg.to add each digit 49. prg.for sum of factorial 50. prg.for fibonacci series 51. prg.to check Prime nos 52. prg. Prime no from 1 to 100 53. prg.Specified Prime nos 54. while( ) statement 55. do. . While statement 56. goto statement 57. break & continue statement 58. switch case statement 59. Array in C++ 60. print reverse order using array 61. Ascending/Descending order 62. prg.to search no in Array 63. Double Dimension Array 64. String in C++ 65. String with spaces in C++ 66. prg.to print string in reverse 67. prg.to count A,E,I,O,U vowel 68. Function( ) in C++ 69. Function program examples 70. General Purpose Programs 71. Loan & EMI calculation prg. 72. Table print prg. 73. Leap year program 74. lower to UPPER case prg. 75. Age Distribution prg. 76. Bank note calculation prg. 77. Simple Interest prg. 78. Compound Interest prg. 79. Simple Depreciation prg. 80. Reducing bal.Depreciation prg. 81. Marksheet prg. 82. Income Tax prg. 83. Time calculator prg. 84. Distance converter prg. 85. Volume Air Calculation prg. 86. Time to fill Water Tank prg. 87. Salary Calculation prg. 88. Total Sale Calculation prg. 89. Male/Female percentage prg. 90. Library Rent prg. 91. Office Expence prg. 92. Total Salary Calculation prg. 93. Profit or Loss prg. 94. Total Profit/Loss prg. 95. Convert Amt to Word. 96. ASCII Table 97. C++ Operators 98. C & C++ Reserved Keyword 99. C & C++ Pre-Define Function 100. C++ Interview Part1 101. C++ Interview Part2 102. C++ Interview Part3 103. C++ Interview Part4 104. C++ Interview Part5 105. C++ Interview Part6 106. C++ Interview Part7 107. C++ Interview Part8 108. C++ Interview Part9 109. C++ Interview Part10 110. C++ Interview Part11 111. C++ Interview Part11
Pr.Pg Next Pg

C++ Interview Question and Answers Part 11


101.What is the difference between a Java application and a Java applet?

  • The difference between a Java application and a Java applet is that a Java application is a program that can be executed using the Java interpeter, and a JAVA applet can be transfered to different networks and executed by using a web browser (transferable to the WWW).


102.Name 7 layers of the OSI Reference Model?

  • Application layer

  • Presentation layer

  • Session layer

  • Transport layer

  • Network layer

  • Data Link layer

  • Physical layer


103.What are the advantages and disadvantages of B-star trees over Binary trees?

  • B-star trees have better data structure and are faster in search than Binary trees, but it’s harder to write codes for B-start trees.

104.Write the psuedo code for the Depth first Search.

  • dfs(G, v) //OUTLINE

  • Mark v as "discovered"

  • For each vertex w such that edge vw is in G:

  • If w is undiscovered:

  • dfs(G, w); that is, explore vw, visit w, explore from there as much as possible, and backtrack from w to v. Otherwise:

  • "Check" vw without visiting w. Mark v as "finished".


105.Describe one simple rehashing policy.

  • The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i].

  • The following function is used to generate alternative locations:
    rehash(j) = (j + 1) mod h

  • where j is the location most recently probed. Initially j = i, the hash code for K. Notice that this version of rehash does not depend on K.


106.Describe Stacks and name a couple of places where stacks are useful.

  • A Stack is a linear structure in which insertions and deletions are always made at one end, called the top.

  • This updating policy is called last in, first out (LIFO). It is useful when we need to check some syntex errors, such as missing parentheses


107.Suppose a 3-bit sequence number is used in the selective-reject ARQ, what is the maximum number of frames that could be transmitted at a time?

  • If a 3-bit sequence number is used, then it could distinguish 8 different frames.

  • Since the number of frames that could be transmitted at a time is no greater half the numner of frames that could be distinguished by the sequence number, so at most 4 frames can be transmitted at a time.


108.What are the Features of C++?

  • C++ Programmning language is based on C which is most widely used computer language is being taught today as a core subject in almost all the undergraduate program education.

  • In C++, you can develop new data types that contain functional descriptions member functions as well as data representations. These new data types are called classes. The work of developing such classes is known as data abstraction.

  • You can define a series of functions with different argument types that all use the same function name. This is called function overloading. A function can have the same name and argument types in base and derived classes.

  • Declaring a class member function in a base class allows you to override its implementation in a derived class. If you use virtual functions, class-dependent behavior may be determined at run time. This ability to select functions at run time, depending on data types, is called polymorphism.

  • You can redefine the meaning of the basic language operators so that they can perform operations on user-defined classes new data types, in addition to operations on system-defined data types, such as int, char, and float. Adding properties to operators for new data types is calledoperator overloading.


109.What are Tokens and Types of Tokens in C++?

  • A token is a group of characters that logically belong together. The programmer can write a program by using tokens.

  • In every C++ program, the most basic element recognized by the compiler, is a single character or group of characters called C++ token.

  • C++ has Six types of Tokens.

    1. Keyword:- for example int, char, while, else, class.

    2. Identifier:- for example main, amt, area, radius etc.

    3. Constant:- for example 121, 500, -150.

    4. String:- for example “cbtSAM”, “Hello” etc.

    5. Operators:- for example + - * /

    6. Special symbols:- for example{ } [ ] etc.


110.What are Comments in C++?

  • Comments are an important part of any program, it is usally written to write remarks and extra information about program, so that reader can understand what the program is about.

  • Compiler ignores comments.

Pr.Pg border                                              Next Pg