LAISHA
Open Laisha

ICAR AIEEA-PG Computer Programming, Data Structures & Agricultural Informatics: practice questions

ICAR AIEEA-PG — Agricultural Engineering & Technology (Major Subject Group 10) · India · National Testing Agency for ICAR

Original practice questions written to the published syllabus · not past papers
10worked here, free
108written to this exam in this subject
8syllabus units

About ICAR AIEEA-PG

ICAR AIEEA-PG — Agricultural Engineering & Technology (Major Subject Group 10) is a postgraduate admission exam run by National Testing Agency for ICAR, for candidates in India. Computer-based, 120 minutes, 120 MCQs, +4 / −1, English only (2026 bulletin). One paper for the whole subject group.

Source: icar.org.in.

Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.

Computer Programming, Data Structures & Agricultural Informatics in ICAR AIEEA-PG

Unit II names computers alongside electric motors, instruments and power distribution. Papers are not published, so emphasis cannot be counted; the syllabus supports short single-answer MCQs on computer organisation and memory, number systems and two's complement, flowchart symbols and algorithm properties, the output of a short code fragment, operators and integer division, data structures (stack, queue, tree traversal), database keys, normal forms and SQL clauses, and basic AI and ML vocabulary. With +4/−1 marking, exact definitions and careful tracing are worth more than broad reading.

Programming, data and the basics of AI as used in agricultural engineering, from spreadsheets to decision support systems.

Our 108 ICAR AIEEA-PG questions in this subject: 37 easy, 52 medium, 19 hard, across 8 units.

10 practice questions, worked

Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.

These 10 were written to ICAR AIEEA-PG and are not shown on any other exam's page.

Question 1 · easy

A program keeps halving an interval to locate a root but contains no test to end the loop. Which of Knuth's algorithm properties is missing?

  1. Definiteness
  2. Effectiveness
  3. Generality of input
  4. Finiteness
Answer and working

D. Finiteness

Without a stopping condition the procedure never terminates, so finiteness fails. Each halving step is still precisely defined (definiteness) and basic enough to perform (effectiveness).

Question 2 · medium

The binary number 1101 0110 (unsigned) is written in hexadecimal and in decimal as:

  1. B6 and 182
  2. 6D and 109
  3. D6 and 214
  4. D6 and 196
Answer and working

C. D6 and 214

Group into four-bit nibbles: 1101 = D, 0110 = 6, so D6. Decimal = 13 × 16 + 6 = 214. Reading the nibbles in reverse gives 6D (109); 196 is C4; B6 mistakes 1101 for 1011.

Question 3 · medium

What does print(0.1 + 0.2 == 0.3) display in Python, and why?

  1. An error, because the == operator cannot compare two float values
  2. True, because both sides are stored internally as exactly 0.3
  3. True, because Python rounds every float sum to fifteen decimal places
  4. False, because 0.1 and 0.2 have no exact binary floating-point form
Answer and working

D. False, because 0.1 and 0.2 have no exact binary floating-point form

IEEE 754 doubles store 0.1 and 0.2 approximately; their sum is 0.30000000000000004, which differs from the stored 0.3. Python does not round sums, and == works on floats; compare with a tolerance such as abs(a − b) < 1e-9 instead.

Question 4 · hard

A program integrates a runoff hydrograph by the trapezoidal rule. Discharges at hourly intervals are 0, 4, 10, 6, 2 and 0 m³/s. What runoff volume does it compute?

  1. 79,200 m³
  2. 39,600 m³
  3. 1,320 m³
  4. 158,400 m³
Answer and working

A. 79,200 m³

h = 3600 s. V = h[Q0/2 + Q1 + Q2 + Q3 + Q4 + Q5/2] = 3600 × 22 = 79,200 m³. Halving every ordinate gives 39,600; using h = 60 (minutes as seconds) gives 1,320; 158,400 forgets the ½ in the h/2 factor.

Question 5 · medium

Keys 50, 30, 70, 20, 40, 60, 80 are inserted in that order into an empty binary search tree. What is the preorder traversal?

  1. 20 40 30 60 80 70 50
  2. 20 30 40 50 60 70 80
  3. 50 30 20 40 70 60 80
  4. 50 30 70 20 40 60 80
Answer and working

C. 50 30 20 40 70 60 80

The tree has 50 at the root, 30 (children 20, 40) on the left and 70 (children 60, 80) on the right. Preorder visits node, left, right: 50 30 20 40 70 60 80. 20 30 40 50 60 70 80 is the inorder (sorted) traversal, 20 40 30 60 80 70 50 the postorder, and the insertion order is the level-order traversal.

Question 6 · medium

Why is reaching the k-th element of a singly linked list slower than reaching the k-th element of an array?

  1. The list keeps a hash of every element, and computing that hash takes time proportional to k
  2. The list stores its nodes in contiguous memory, so each access must first sort the nodes
  3. The list must be walked node by node from the head, which takes time proportional to k
  4. The list can be read only from its tail end, so the whole list must be reversed each time
Answer and working

C. The list must be walked node by node from the head, which takes time proportional to k

Array elements are contiguous, so element i sits at base + i × size and is reached in constant time. Linked-list nodes are scattered and joined by pointers, so reaching node k takes k steps. Linked lists are not contiguous, not hashed, and are walked from the head.

Question 7 · easy

A spreadsheet reports a circular reference in cell F9. What does this mean?

  1. A formula in F9 depends, directly or through other cells, on its own value
  2. F9 refers to a cell on a different sheet that has since been deleted
  3. F9 is a merged cell that spans more than one row and column
  4. F9 contains a number formatted as text, so it cannot be summed
Answer and working

A. A formula in F9 depends, directly or through other cells, on its own value

A circular reference is a dependency loop; it is usually an error unless iterative calculation was enabled on purpose for an implicit equation. A deleted reference gives a reference error, and text-formatted numbers or merged cells are different problems.

Question 8 · easy

A model is trained on past records of rainfall, fertiliser and sowing date, each labelled with the yield obtained (t/ha), to predict yield for new fields. What kind of learning task is this?

  1. Unsupervised clustering
  2. Supervised regression
  3. Reinforcement learning
  4. Supervised classification
Answer and working

B. Supervised regression

The examples carry known answers (supervised) and the answer is a number (regression). Classification predicts categories; clustering has no labels; reinforcement learning learns from rewards through interaction.

Question 9 · medium

A 12-bit analogue-to-digital converter measures 0 to 3.3 V. Taking resolution as range/2^n, what voltage does one count represent?

  1. 0.403 mV
  2. 3.223 mV
  3. 275 mV
  4. 0.806 mV
Answer and working

D. 0.806 mV

2^12 = 4096 levels, so 3.3 V/4096 = 0.806 mV per count. 3.223 mV is a 10-bit converter; 275 mV divides by the number of bits instead of the number of levels. 0.403 mV divides by 2^13.

Question 10 · medium

A vibration signal on a pump contains frequencies up to 50 Hz. According to the sampling theorem, what sampling rate is needed to avoid aliasing?

  1. Exactly 50 samples per second
  2. One sample per second is enough
  3. More than 25 samples per second
  4. More than 100 samples per second
Answer and working

D. More than 100 samples per second

The sampling rate must exceed twice the highest frequency present (the Nyquist criterion): more than 2 × 50 = 100 Hz. Sampling at 50 Hz or below makes the 50 Hz component appear as a false lower frequency.

A study plan for Computer Programming, Data Structures & Agricultural Informatics in ICAR AIEEA-PG

This plan follows where our questions actually fall, so the time goes where the marks are likely to be. It is our reading of the syllabus, not the exam body's weighting.

  1. First, the heavy units (56% of the 108 questions): Programming in C or Python (24, 22%); Introduction to artificial intelligence and machine learning (22, 20%); Data structures (14, 13%).

    Read the manual chapters for these first and do every worked question you can find on them.

  2. Then the middle band: Algorithms and flowcharts (13, 12%); Databases (12, 11%); Decision support systems (8, 7%).

    Aim for one sitting per unit, then mixed questions across them.

  3. Then the lighter units: Spreadsheets for engineering calculations (8, 7%); Agricultural apps and IoT data (7, 6%).

    Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.

  4. Leave time for the hard ones: Programming in C or Python (6 hard of 24), Introduction to artificial intelligence and machine learning (5 hard of 22), Databases (2 hard of 12).

    Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.

  5. Bank the easy marks: Spreadsheets for engineering calculations (4 easy of 8); Databases (5 easy of 12).

    Do these early in revision so they are fast on the day.

  6. Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.

Last updated · How Laisha writes and checks its pages · Report a mistake

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.

Unlock every question — ICAR AIEEA-PG Computer Programming, Data Structures & Agricultural Informatics

US$10 a month · one price worldwide · cancel any time

  • Every practice question in this subject, with full working
  • Timed exam papers and progress by unit
  • Ask Laisha to explain any answer — up to 1,000 questions a month
Free or Smarter
FreeSmarter
Grow guides, pest pages, articlesRead allRead all
Ask Laisha5 a dayUp to 1,000 a month
Exam practiceThe sample on each pageEvery question, timed papers
Crop calendar and pest alerts—For your own fields
Calculators and tools—All
Uploads and reports—100 a month, real files
10 days free for every new account, no card.