LAISHA
Open Laisha

ICAR AICE-JRF/SRF Bioinformatics & Computational Biology: 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
95written 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.

Bioinformatics & Computational Biology in ICAR AICE-JRF/SRF

The third sub-subject of the ICAR Statistical Sciences group: molecular-biology basics, sequence databases, pairwise and multiple alignment, genome assembly, phylogenetics, and the statistics behind scoring and tree reliability. Taught from the statistician's side of the bench.

Our 95 ICAR AICE-JRF/SRF questions in this subject: 12 easy, 69 medium, 14 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 the classic lac operon, what happens when lactose (allolactose) is present?

  1. The repressor leaves the operator
  2. The repressor binds more tightly and transcription stops entirely
  3. RNA polymerase is destroyed and the cell switches to glucose
  4. The operon is spliced to remove its introns
Answer and working

A. The repressor leaves the operator

Allolactose binds the repressor, which then leaves the operator, allowing RNA polymerase to transcribe the lactose-utilisation genes.

Question 2 · medium

Where does the traceback start in Smith-Waterman local alignment?

  1. At the bottom-right cell
  2. At the matrix's highest-scoring cell
  3. At the top-left cell
  4. At the first cell that equals zero
Answer and working

B. At the matrix's highest-scoring cell

The best local alignment ends wherever the maximum score is; traceback continues until a cell with value zero.

Question 3 · medium

What is the first step of the BLAST algorithm?

  1. Filling a full Smith-Waterman matrix for every database entry
  2. Building a guide tree of the database sequences
  3. Listing query words and their high-scoring neighbourhood words
  4. Assembling the query into contigs
Answer and working

C. Listing query words and their high-scoring neighbourhood words

BLAST lists words (length 3 for proteins by default) and neighbours scoring at least T, then finds seed hits, extends them and reports HSPs.

Question 4 · medium

Which distribution describes the scores of the best local alignments between random sequences?

  1. The normal (Gaussian) distribution
  2. The extreme-value (Gumbel) distribution
  3. The Poisson distribution of scores
  4. The uniform distribution
Answer and working

B. The extreme-value (Gumbel) distribution

Maximum scores follow an extreme-value distribution, the basis of Karlin-Altschul statistics; the number of chance HSPs above a score is Poisson with mean E.

Question 5 · medium

A DNA alignment column contains only adenine in every sequence. What is its information content?

  1. 2 bits
  2. 0 bits
  3. 1 bit
  4. 4.32 bits
Answer and working

A. 2 bits

Information = log₂ 4 − H = 2 − 0 = 2 bits, the maximum for DNA. 4.32 bits is the maximum for proteins.

Question 6 · medium

What does a profile hidden Markov model of a protein family represent?

  1. A single consensus sequence with no variation
  2. A phylogenetic tree of the family
  3. The 3-D coordinates of a representative structure
  4. Position-specific match, insert and delete probabilities
Answer and working

D. Position-specific match, insert and delete probabilities

Profile HMMs, built from an MSA, score new sequences against the family; Pfam is a collection of them.

Question 7 · medium

Which assembly approach breaks reads into k-mers and finds a path through a graph of overlapping k-mers?

  1. De Bruijn graph assembly
  2. Overlap-layout-consensus
  3. Greedy pairwise merging
  4. Reference-guided mapping
Answer and working

A. De Bruijn graph assembly

De Bruijn graphs avoid computing all pairwise read overlaps, suiting billions of short reads; OLC suits fewer, longer reads.

Question 8 · hard

Which assembly error is generally most damaging for downstream genetic mapping and annotation?

  1. A few remaining base substitutions
  2. Slightly lower N50 than expected
  3. Misjoins of distant sequences
  4. Masked low-complexity regions
Answer and working

C. Misjoins of distant sequences

Misassemblies place genes and markers in the wrong order or chromosome, misleading QTL mapping, synteny and annotation; small base errors are less consequential.

Question 9 · medium

How many unrooted bifurcating trees are possible for 5 taxa?

  1. 105
  2. 120
  3. 15
  4. 3
Answer and working

C. 15

(2n − 5)!! = 5!! = 1 × 3 × 5 = 15. Rooted trees: (2n − 3)!! = 7!! = 105.

Question 10 · medium

What do ab initio gene-prediction programs mainly use?

  1. Only RNA-seq reads aligned to the genome
  2. Protein structures from the PDB
  3. Bootstrap resampling of contigs
  4. Models of genes and splice sites
Answer and working

D. Models of genes and splice sites

They learn sequence features of genes in the species; evidence-based pipelines combine them with transcript and protein alignments.

A study plan for Bioinformatics & Computational Biology 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 (49% of the 95 questions): BLAST and FASTA; scoring matrices PAM and BLOSUM (13, 14%); Phylogenetic trees: parsimony, distance (UPGMA, neighbour-joining) and maximum likelihood (12, 13%); Assembly quality, read coverage and sequencing error (11, 12%); Pairwise alignment: Needleman-Wunsch and Smith-Waterman (11, 12%).

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

  2. Then the middle band: Protein structure and functional annotation (introduction) (10, 11%); Tree reliability: bootstrap and jackknife (10, 11%); Multiple sequence alignment (8, 8%); Sequencing technologies and genome assembly: de novo and comparative (8, 8%).

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

  3. Then the lighter units: Genomic resources and databases: NCBI, EBI, ExPASy, GenBank, EMBL, DDBJ (7, 7%); Molecular biology basics: DNA, RNA, gene expression and recombinant DNA (5, 5%).

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

  4. Leave time for the hard ones: Assembly quality, read coverage and sequencing error (3 hard of 11), Molecular biology basics: DNA, RNA, gene expression and recombinant DNA (1 hard of 5), Pairwise alignment: Needleman-Wunsch and Smith-Waterman (2 hard of 11).

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

  5. Bank the easy marks: Protein structure and functional annotation (introduction) (2 easy of 10); Tree reliability: bootstrap and jackknife (2 easy of 10).

    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 Bioinformatics & Computational Biology

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.