ICSE − Q & A

Any easy way to remember operator precedence???

I HAVE MADE A LIST OF ALL THE KEYWORDS AND TERMS THAT CAN COME FOR COMPUTER APPLICATION....PLS FILL IN MORE IN THE COMMENT SECTION IF YOU KNOW OF SOMETHING I HAVE MISSED


List of keywords-

1.break
2.this
3.try
4.catch
5.throw
6.throws
7.finally
8.continue
9.while
10.for
11.do
12.if
13.else
14.extends
15.final
16.import
17.new
18.package
19.private
20.protected
21.public
22.return
23.static
24.this
25.void
26.default in switch

List of definitions and terms-

1.Object
2.Class
3.Abstraction
4.Polymorphism
5.Inheritance
6.Encapsulation
7.Tokens
8.Comments
9.Whitespace
10.Keyword
11.Identifiers
12.Constants/literals
13.Operator
14.Operand
15.Expression
16.Java Virtual Machine
17.Java Development Kit
18.Java applets
19.Java applications
20.Java servlet
21.ASCII code
22.Byte Code
23.Compiler
24.Unary,binary,ternary operators
25.Arithmetic Operators
26.Prefix and Postfix in arithmetic operators
27.Relational Operators
28.Logical Operators
29.Assignment Operators
30.Compound assignment/Short hand operators
31.Ternary Operator
32.Pure and mixed expressions
33.Rule of precedence
34.Data type
35.Unicode
36.Dynamic Initialisation
37.Type Converion
38.Implicit,Coericon,Widening or automatic converion
39.Explicit,Narrowing or type casting
40.Instantiation
41.Object Reference
42.Scope and life time of variables
43.Local Variables
44.Global Variables
45.Functions
46.Function prototype
47.Function body
48.Predefined functions
50.User defined Functions
51.Pure Functions/Accessor methods
52.Impure Functions/Mutator methods
53.Actual parameters
54.Formal parameters
55.Function Overloading
56.Call by reference
57.Call by value
58.Static/Class Variables
59.Instance /Object Variables
60.Constructor
61.Parameterised constructor
62.Constructor overloading
63.Destructor
64.Copy constructor
65.Copy initialisation
66.Primitive data type
67.Composite/user defined data type
68.Wrapper classes
69.Iteration
70.Jump statements
71.Access Specifiers
72.Data Hiding
73.Modularity
74.Dangling if condition
75.Infinite loop
76.Entry controlled loop
77.exit controlled loop
78.Stream
79.Character Stream
80.Byte stream
81.Packge
82.Exceptions
83.Runtime error
84.Syntax error or compilation error
85.Logical error
86.Simple inheritance
87.Multilevel inheritance
88.Hierarchical inheritance
89.Arrays
90.Bubblesort
91.Selection sort
92.Linear Search
93.Binary Search
94.Compound statement
95.Static Function
96.Library Classes
97.Escape Sequences

THANKS:)

anyone awake now?..........its 2:10 am..............i'm definitely burning d midnight oil.!lol

+ 1 more questions by rishabsaphal  

can anybody plz upload a simple pgm with variable description? its just tht v hav never done tht sort of thing in school and comments also if possible............it would b really helpful if u could write in paper and take a snap thnx
asked by Turbanator (rishabsaphal) 7 years ago
1

Are types of exceptions and their eg. Included in the syllabus??

Can maths be revised in 7 days

Name the class used for different mathematical calculations.

1) explain String args{}
2)sopln("a"+1+1);

why has the cookery specimen paper been the same since five years?

In bubble sorting or selection sorting of Arrays .... If there is a Question to arrange in descending order can we just change the part of the program that displays the answer ... i mean the program will have the logic of ascending order but program gets printed in descending order by just changing the order of displaying arrays
or is it mandatory that we have to change the logic part of the program only(descending logic)???

Your task is to construct a building which will be a pile of n cubes. The cube at the bottom will have a volume of n^3, the cube above will have volume of (n-1)^3 and so on until the top which will have a volume of 1^3.

You are given the total volume m of the building. Being given m can you find the number n of cubes you will have to build?

The parameter of the function findNb (find_nb, find-nb, findNb) will be an integer m and you have to return the integer n such as n^3 + (n-1)^3 + ... + 1^3 = m if such a n exists or -1 if there is no such n.