Start learning →

ICSE Class 10 Arrays in Java (Single and Double Dimensional) — practice questions — page 3

Explore 96 free Arrays in Java (Single and Double Dimensional) questions in ICSE Class 10 Computer Applications. Open each question or exercise to read its content, reference answers and available explanation.

Practise Arrays in Java (Single and Double Dimensional) with Quill →

Arrays in Java (Single and Double Dimensional) questions and exercises with answers

Showing questions 61–90 of 96.

Match memory forms: 1. Packed: p. One word 2. Bit: q. Bool array 3. Unit: r. Low spaceRead the answer and worked solution →Match dynamic arrays: 1. Static: p. Fixed 2. Dynamic: q. Resize 3. Amort: r. O 1 timeRead the answer and worked solution →Match bubble passes: 1. Pass 1: p. Move max 2. Flag: q. Early exit 3. Adapt: r. Fast sortRead the answer and worked solution →Match 1D formula: 1. Base: p. Start addr 2. Stride: q. Size c 3. Index: r. Pos multRead the answer and worked solution →Match search limits: 1. Sorted: p. Binary 2. Unsort: q. Linear 3. Short: r. EitherRead the answer and worked solution →Match access cost: 1. Array: p. Const O 1 2. Tree: q. Log O logn 3. List: r. Linear O nRead the answer and worked solution →Match branch cases: 1. Equal: p. Match pos 2. Less: q. Lower half 3. More: r. Upper halfRead the answer and worked solution →Match sort history: 1. Friend: p. 1956 2. Iverson: q. Name 3. ACM: r. JournalRead the answer and worked solution →Match array structs: 1. Dope: p. Descriptor 2. Handle: q. Pass arg 3. Slice: r. Sub-arrayRead the answer and worked solution →Match search trees: 1. Cascad: p. Multiple 2. Expon: q. Unbounded 3. Tree: r. Data modelRead the answer and worked solution →Match bounds early: 1. B5000: p. Mainframe 2. Bounds: q. Hardware 3. Neumann: r. MergeRead the answer and worked solution →Match bubble gaps: 1. Invert: p. Misorder 2. Front: q. Move slow 3. Turtle: r. One stepRead the answer and worked solution →Match 2D basics: 1. Matrix: p. 2D grid 2. Rows: q. Horizontal 3. Cols: r. VerticalRead the answer and worked solution →Match matrix size: 1. Size: p. Row by col 2. Dims: q. M by N 3. Square: r. Equal rcRead the answer and worked solution →Match 2D index: 1. Row i: p. First idx 2. Col j: q. 2nd index 3. Cell: r. a i jRead the answer and worked solution →Match matrix forms: 1. Square: p. Equal rc 2. Rect: q. M by N 3. Vector: r. 1D arrayRead the answer and worked solution →Match transpose: 1. Rows: p. To columns 2. Size: q. Flips n m 3. Mark: r. Power TRead the answer and worked solution →Match diagonals: 1. Main: p. Diagonal 2. Diag: q. Line 3. Match: r. Same i jRead the answer and worked solution →Match triangulars: 1. Upper: p. Below 0 2. Lower: q. Above 0 3. Diag: r. Off-diag 0Read the answer and worked solution →Match identity: 1. Main: p. All 1s 2. Off: q. All 0s 3. Size: r. N by NRead the answer and worked solution →Match layout forms: 1. Row: p. C layout 2. Col-maj: q. Fortran 3. Order: r. SequenceRead the answer and worked solution →Match 2D addresses: 1. Base: p. Start addr 2. Row inc: q. Coeff c 3. Col inc: r. Coeff dRead the answer and worked solution →Match symmetry: 1. Symm: p. A = AT 2. Skew: q. A = -AT 3. Trans: r. Flip rcRead the answer and worked solution →Match cache spatial: 1. Local: p. Spatial 2. Virtual: q. Hits 3. Scan: r. Fast scanRead the answer and worked solution →Match square rules: 1. Order n: p. N by N 2. Add: q. Same order 3. Ring: r. Matrix opsRead the answer and worked solution →Match jagged rows: 1. Iliffe: p. Row refs 2. Ptr: q. Row array 3. Jagged: r. VaryingRead the answer and worked solution →Match lower diag: 1. Lower: p. Above 0 2. Tri: q. Half shape 3. Diag: r. Mid lineRead the answer and worked solution →Match matrix math: 1. Add: p. Same dims 2. Mult: q. Row by col 3. Square: r. Order nRead the answer and worked solution →Match bit strides: 1. Power 2: p. Fast 2. Coeff: q. Stride c 3. Shift: r. Bit stepRead the answer and worked solution →Match mult cache: 1. Mat A: p. Row major 2. Mat B: q. Col major 3. Prod: r. Optimal GCRead the answer and worked solution →

Worked practice questions

Match memory forms: 1. Packed: p. One word 2. Bit: q. Bool array 3. Unit: r. Low space

  1. 1-p, 2-q, 3-r
  2. 1-p, 2-r, 3-q
  3. 1-q, 2-p, 3-r
  4. 1-r, 2-p, 3-q
Show answer and solution

Correct answer: A. 1-p, 2-q, 3-r

Packed arrays bundle multiple items into a single word, bit arrays represent boolean states compactly, and standard arrays avoid per-element overhead.

Open this question →

Match dynamic arrays: 1. Static: p. Fixed 2. Dynamic: q. Resize 3. Amort: r. O 1 time

  1. 1-p, 2-q, 3-r
  2. 1-p, 2-r, 3-q
  3. 1-q, 2-p, 3-r
  4. 1-r, 2-p, 3-q
Show answer and solution

Correct answer: A. 1-p, 2-q, 3-r

Static arrays have fixed capacity, dynamic arrays resize by allocating new storage, and append operations take amortized constant time.

Open this question →

Match bubble passes: 1. Pass 1: p. Move max 2. Flag: q. Early exit 3. Adapt: r. Fast sort

  1. 1-p, 2-q, 3-r
  2. 1-p, 2-r, 3-q
  3. 1-q, 2-p, 3-r
  4. 1-r, 2-p, 3-q
Show answer and solution

Correct answer: A. 1-p, 2-q, 3-r

The first pass places the maximum element at the end, tracking swaps allows early completion, and nearly sorted lists finish rapidly.

Open this question →

How to practise

  1. Choose a Arrays in Java (Single and Double Dimensional) question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

Put it into practice

Continue with Arrays in Java (Single and Double Dimensional) practice for ICSE Class 10. Read explanations as you go. No signup form needed to start.

Practise Arrays in Java (Single and Double Dimensional) →

More Computer Applications topics

Classes, Encapsulation and ScopeString Handling and Wrapper ClassesUser-Defined Methods and Constructors