ICAR AIEEA-PG Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems: practice questions
ICAR AIEEA-PG - Group 07 Statistical Sciences (Master's admission and PG scholarship) · India · National Testing Agency for ICAR
Original practice questions written to the published syllabus · not past papers
10worked here, free
20written to this exam in this subject
11syllabus units
About ICAR AIEEA-PG
ICAR AIEEA-PG - Group 07 Statistical Sciences (Master's admission and PG scholarship) is a postgraduate admission exam run by National Testing Agency for ICAR, for candidates in India. Computer-based test, 120 minutes, single paper of 120 MCQs, +4 / -1, English. 2026 exam on 4 July 2026. Fills ICAR's all-India quota of Master's seats at agricultural universities.
Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.
Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems in ICAR AIEEA-PG
The computer-science core of the Computer Application sub-subject in the ICAR Statistical Sciences group: number systems and architecture, data structures and algorithms, operating systems, networks, compilers, software engineering and web programming. Statisticians need the data-structure and algorithm units; Computer Application candidates need all of it.
Our 20 ICAR AIEEA-PG questions in this subject: 17 easy, 2 medium, 1 hard, across 11 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
The register that holds the address of the next instruction is the:
Accumulator
Program counter
Instruction register
Status register
Answer and working
B. Program counter
The instruction register holds the current instruction itself.
Question 2 · easy
In the von Neumann architecture:
Programs are kept on punched cards, separate from data
Data are stored only in registers
Programs and data share the same memory
There is no control unit
Answer and working
C. Programs and data share the same memory
Instructions and data are fetched from one memory.
Question 3 · hard
Linear search in an unsorted list of n items takes time:
O(log n)
O(1)
O(n²)
O(n)
Answer and working
D. O(n)
In the worst case every item is examined.
Question 4 · easy
An object is:
A template for creating classes
An instance of a class
A compiled program
A database table
Answer and working
B. An instance of a class
The class is the template; objects are its instances.
Question 5 · easy
Inheritance expresses which relationship?
'Has-a'
'Uses-a'
'Calls-a'
'Is-a'
Answer and working
D. 'Is-a'
Composition expresses 'has-a'.
Question 6 · easy
A thread differs from a process in that threads of the same process:
Each have separate memory spaces
Cannot run concurrently
Share its memory space
Are scheduled by the user
Answer and working
C. Share its memory space
Processes have separate address spaces; threads within one share it.
Question 7 · easy
HTTPS uses which default port?
80
21
443
25
Answer and working
C. 443
HTTPS uses 443; plain HTTP uses 80.
Question 8 · easy
An interpreter differs from a compiler in that it:
Produces a separate machine-code file first
Executes the program statement by statement
Checks only syntax
Never reports errors
Answer and working
B. Executes the program statement by statement
Many modern systems mix the two with bytecode and just-in-time compilation.
Question 9 · easy
Client-side scripts that make pages interactive in the browser are written mainly in:
JavaScript
SQL
HTML only
CSS only
Answer and working
A. JavaScript
Server-side code may be in many languages.
Question 10 · medium
Which reference stays fixed when a formula is copied anywhere?
A1
$A$1
$A1
A$1
Answer and working
B. $A$1
$A1 fixes only the column and A$1 only the row.
A study plan for Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems 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.
First, the heavy units (45% of the 20 questions): Office tools and spreadsheets for data work (3, 15%); Computer organisation: CPU, memory hierarchy and input/output (2, 10%); Internet programming: HTML, client- and server-side scripting with databases (2, 10%); Networking: topologies, OSI and TCP/IP models, security and cryptography basics (2, 10%).
Read the manual chapters for these first and do every worked question you can find on them.
Then the middle band: Number systems, Boolean algebra and logic circuits (2, 10%); Object-oriented programming: encapsulation, inheritance and polymorphism (C++/Java) (2, 10%); Operating systems: processes, scheduling, memory management, deadlocks and file systems (2, 10%); Sorting and searching algorithms and their complexity (2, 10%).
Aim for one sitting per unit, then mixed questions across them.
Then the lighter units: Compilers: regular expressions, finite automata and parsing (1, 5%); Data structures: arrays, stacks, queues, linked lists, trees, heaps and graphs (1, 5%); Software engineering: process models, testing, metrics and PERT/CPM for projects (1, 5%).
Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.
Leave time for the hard ones: Sorting and searching algorithms and their complexity (1 hard of 2).
Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.
Bank the easy marks: Computer organisation: CPU, memory hierarchy and input/output (2 easy of 2); Internet programming: HTML, client- and server-side scripting with databases (2 easy of 2).
Do these early in revision so they are fast on the day.
Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.