LAISHA
Open Laisha

ICAR-IASRI MSc and PhD Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems: practice questions

ICAR-IASRI MSc and PhD (Agricultural Statistics, Computer Application, Bioinformatics) · India · ICAR-Indian Agricultural Statistics Research Institute with the IARI Graduate School

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

About ICAR-IASRI MSc and PhD

ICAR-IASRI MSc and PhD (Agricultural Statistics, Computer Application, Bioinformatics) is a postgraduate admission exam run by ICAR-Indian Agricultural Statistics Research Institute with the IARI Graduate School, for candidates in India. Admission through ICAR AIEEA-PG (Master's) and AICE-JRF/SRF (PhD) plus the Graduate School's own process.

Official site: iasri.icar.gov.in.

We have not been able to confirm these details against the exam body's own specification, so fees, dates and pass marks are left out on purpose. Check the current format, eligibility, fees and dates on the official site.

Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems in ICAR-IASRI MSc and PhD

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 22 ICAR-IASRI MSc and PhD questions in this subject: 10 easy, 11 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-IASRI MSc and PhD and are not shown on any other exam's page.

Question 1 · easy

What is binary 1101 in decimal?

  1. 11
  2. 13
  3. 15
  4. 26
Answer and working

B. 13

Place values 8, 4, 2, 1: 8 + 4 + 0 + 1 = 13.

Question 2 · easy

A stack follows which access rule?

  1. Last in, first out
  2. First in, first out
  3. Random access by key
  4. Highest priority first
Answer and working

A. Last in, first out

Queues are FIFO; priority queues serve the highest priority.

Question 3 · medium

An adjacency matrix for a graph with n vertices uses memory of order:

  1. n
  2. n²
  3. log n
  4. n + edges
Answer and working

B. n²

Adjacency lists use space proportional to n plus the number of edges.

Question 4 · easy

Binary search requires that the data are:

  1. Stored in a linked list
  2. Unique
  3. Numeric
  4. Sorted
Answer and working

D. Sorted

Each comparison discards half of a sorted range.

Question 5 · medium

Java allows a class to:

  1. Extend one class and implement many interfaces
  2. Extend many classes at once, as C++ allows
  3. Implement no interfaces at all ever
  4. Inherit only from interfaces
Answer and working

A. Extend one class and implement many interfaces

C++ allows multiple inheritance of classes.

Question 6 · hard

How many usable host addresses does an IPv4 /24 subnet provide?

  1. 256
  2. 255
  3. 24
  4. 254
Answer and working

D. 254

2⁸ = 256 minus the network and broadcast addresses.

Question 7 · medium

A cryptographic hash such as SHA-256 is used mainly to:

  1. Encrypt data so it can be decrypted later
  2. Compress files for storage
  3. Assign IP addresses
  4. Check that data have not been altered
Answer and working

D. Check that data have not been altered

Hashes are one-way digests; any change alters the digest.

Question 8 · easy

The compiler phase that breaks source code into tokens is:

  1. Lexical analysis
  2. Syntax analysis
  3. Code generation
  4. Optimisation
Answer and working

A. Lexical analysis

Parsing then checks the token sequence against the grammar.

Question 9 · medium

Because HTTP is stateless, web applications remember users between requests with:

  1. Static HTML pages regenerated on every request
  2. Larger images
  3. Longer URLs only
  4. Cookies and server-side sessions
Answer and working

D. Cookies and server-side sessions

Each request is otherwise independent.

Question 10 · medium

Sorting a single column in a spreadsheet instead of whole rows will:

  1. Scramble the records
  2. Speed up the file
  3. Remove duplicates
  4. Recalculate formulas only
Answer and working

A. Scramble the records

Values in that column no longer line up with their rows.

A study plan for Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems in ICAR-IASRI MSc and PhD

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 (45% of the 22 questions): Networking: topologies, OSI and TCP/IP models, security and cryptography basics (3, 14%); Office tools and spreadsheets for data work (3, 14%); Compilers: regular expressions, finite automata and parsing (2, 9%); Computer organisation: CPU, memory hierarchy and input/output (2, 9%).

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

  2. Then the middle band: Data structures: arrays, stacks, queues, linked lists, trees, heaps and graphs (2, 9%); Internet programming: HTML, client- and server-side scripting with databases (2, 9%); Object-oriented programming: encapsulation, inheritance and polymorphism (C++/Java) (2, 9%); Operating systems: processes, scheduling, memory management, deadlocks and file systems (2, 9%).

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

  3. Then the lighter units: Sorting and searching algorithms and their complexity (2, 9%); Number systems, Boolean algebra and logic circuits (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.

  4. Leave time for the hard ones: Networking: topologies, OSI and TCP/IP models, security and cryptography basics (1 hard of 3).

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

  5. Bank the easy marks: Number systems, Boolean algebra and logic circuits (1 easy of 1); Compilers: regular expressions, finite automata and parsing (1 easy of 2).

    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-IASRI MSc and PhD Computer Science Fundamentals: Architecture, Data Structures, Netwo

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.