LAISHA
Open Laisha

ICAR AICE-JRF/SRF Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems: practice questions

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) · India · National Testing Agency for ICAR

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

About ICAR AICE-JRF/SRF

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) is a PhD, fellowship and lectureship exam run by National Testing Agency for ICAR, for candidates in India. Computer-based test, 2 hours, 120 MCQs, +4 / -1 (Part A general, Part B core group, Part C subject). 2026 exam held with AIEEA-PG in July 2026.

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 Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems in ICAR AICE-JRF/SRF

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 48 ICAR AICE-JRF/SRF questions in this subject: 2 easy, 36 medium, 10 hard, across 10 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 AICE-JRF/SRF and are not shown on any other exam's page.

Question 1 · medium

In a half adder, the sum and carry outputs are:

  1. A OR B and A AND B
  2. A XOR B and A AND B
  3. A AND B and A XOR B
  4. A NAND B and A OR B
Answer and working

B. A XOR B and A AND B

Sum is 1 when exactly one input is 1; carry when both are.

Question 2 · hard

A double-precision IEEE 754 number has 52 fraction bits. Its precision is about:

  1. 7 significant decimal digits
  2. 52 significant decimal digits
  3. 15–17 significant decimal digits
  4. 32 significant decimal digits
Answer and working

C. 15–17 significant decimal digits

2⁻⁵² ≈ 2.2 × 10⁻¹⁶; single precision gives about 7 digits.

Question 3 · medium

Breadth-first search of a graph uses which structure?

  1. A stack
  2. A heap
  3. A hash table
  4. A queue
Answer and working

D. A queue

Depth-first search uses a stack or recursion.

Question 4 · medium

In a binary min-heap, the time to find the minimum and to remove it is:

  1. O(1) and O(log n)
  2. O(log n) and O(1)
  3. O(n) and O(n)
  4. O(1) and O(1)
Answer and working

A. O(1) and O(log n)

The minimum is the root; removing it requires sifting down.

Question 5 · hard

Processes with burst times 24, 3 and 3 arrive in that order. Under FCFS, the average waiting time is:

  1. 3
  2. 10
  3. 17
  4. 27
Answer and working

C. 17

Waits are 0, 24 and 27; (0 + 24 + 27)/3 = 17.

Question 6 · medium

For the same processes (24, 3, 3), SJF scheduling gives an average waiting time of:

  1. 17
  2. 9
  3. 1
  4. 3
Answer and working

D. 3

Order 3, 3, 24: waits 0, 3, 6; average 3.

Question 7 · medium

Routing of packets between networks takes place at which OSI layer?

  1. Data link
  2. Transport
  3. Session
  4. Network
Answer and working

D. Network

Switches work at the data link layer; TCP at the transport layer.

Question 8 · medium

Context-free languages are recognised by:

  1. Finite automata
  2. Linear-bounded automata only
  3. Lexical analysers
  4. Pushdown automata
Answer and working

D. Pushdown automata

A stack gives the extra memory needed for nesting.

Question 9 · medium

A grammar is ambiguous if:

  1. It has more than ten production rules
  2. It is context-free
  3. A sentence has two different parse trees
  4. It contains recursion
Answer and working

C. A sentence has two different parse trees

Ambiguity is removed by rewriting rules, for example to encode precedence.

Question 10 · medium

Which HTTP method sends form data in the body of the request?

  1. GET
  2. HEAD
  3. TRACE
  4. POST
Answer and working

D. POST

GET places parameters in the URL.

A study plan for Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems in ICAR AICE-JRF/SRF

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 (48% of the 48 questions): Compilers: regular expressions, finite automata and parsing (6, 13%); Number systems, Boolean algebra and logic circuits (6, 13%); Operating systems: processes, scheduling, memory management, deadlocks and file systems (6, 13%); Computer organisation: CPU, memory hierarchy and input/output (5, 10%).

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

  2. Then the middle band: Internet programming: HTML, client- and server-side scripting with databases (5, 10%); Networking: topologies, OSI and TCP/IP models, security and cryptography basics (5, 10%); Object-oriented programming: encapsulation, inheritance and polymorphism (C++/Java) (5, 10%); Software engineering: process models, testing, metrics and PERT/CPM for projects (4, 8%).

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

  3. Then the lighter units: Data structures: arrays, stacks, queues, linked lists, trees, heaps and graphs (3, 6%); Sorting and searching algorithms and their complexity (3, 6%).

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

  4. Leave time for the hard ones: Operating systems: processes, scheduling, memory management, deadlocks and file systems (2 hard of 6), Sorting and searching algorithms and their complexity (1 hard of 3), Software engineering: process models, testing, metrics and PERT/CPM for projects (1 hard of 4).

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

  5. Bank the easy marks: Computer organisation: CPU, memory hierarchy and input/output (1 easy of 5); Number systems, Boolean algebra and logic circuits (1 easy of 6).

    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 AICE-JRF/SRF Computer Science Fundamentals: Architecture, Data Structures, Networks &

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.