LAISHA
Open Laisha

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
9worked here, free
20written to this exam in this subject
11syllabus units

What this subject covers

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.

In the exams: AICE-JRF subject 70 Computer Application Units 1-9 (heavy: the whole paper); AIEEA-PG Group 07 computer unit (heavy for sub-subject 7.2); GATE DA data structures and algorithms (present)

Where the 20 questions fall

How our questions for ICAR AIEEA-PG spread across the units of Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems. Difficulty: 17 easy, 2 medium, 1 hard.

Office tools and spreadsheets for data work3
Number systems, Boolean algebra and logic circuits2
Computer organisation: CPU, memory hierarchy and input/output2
Sorting and searching algorithms and their complexity2
Object-oriented programming: encapsulation, inheritance and polymorphism (C++/Java)2
Operating systems: processes, scheduling, memory management, deadlocks and file systems2
Networking: topologies, OSI and TCP/IP models, security and cryptography basics2
Internet programming: HTML, client- and server-side scripting with databases2
Data structures: arrays, stacks, queues, linked lists, trees, heaps and graphs1
Compilers: regular expressions, finite automata and parsing1
Software engineering: process models, testing, metrics and PERT/CPM for projects1

9 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.

1 · Number systems, Boolean algebra and logic circuits · 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.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

2 · Computer organisation: CPU, memory hierarchy and input/output · easy

The register that holds the address of the next instruction is the:

  1. Accumulator
  2. Program counter
  3. Instruction register
  4. Status register
Answer and working

B. Program counter

The instruction register holds the current instruction itself.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

3 · Computer organisation: CPU, memory hierarchy and input/output · easy

In the von Neumann architecture:

  1. Programs are kept on punched cards, separate from data
  2. Data are stored only in registers
  3. Programs and data share the same memory
  4. There is no control unit
Answer and working

C. Programs and data share the same memory

Instructions and data are fetched from one memory.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

4 · Sorting and searching algorithms and their complexity · 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.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

5 · Sorting and searching algorithms and their complexity · hard

Linear search in an unsorted list of n items takes time:

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

D. O(n)

In the worst case every item is examined.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

6 · Object-oriented programming: encapsulation, inheritance and polymorphism (C++/Java) · easy

An object is:

  1. A template for creating classes
  2. An instance of a class
  3. A compiled program
  4. A database table
Answer and working

B. An instance of a class

The class is the template; objects are its instances.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

7 · Object-oriented programming: encapsulation, inheritance and polymorphism (C++/Java) · easy

Inheritance expresses which relationship?

  1. 'Has-a'
  2. 'Uses-a'
  3. 'Calls-a'
  4. 'Is-a'
Answer and working

D. 'Is-a'

Composition expresses 'has-a'.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

8 · Operating systems: processes, scheduling, memory management, deadlocks and file systems · easy

A thread differs from a process in that threads of the same process:

  1. Each have separate memory spaces
  2. Cannot run concurrently
  3. Share its memory space
  4. Are scheduled by the user
Answer and working

C. Share its memory space

Processes have separate address spaces; threads within one share it.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

9 · Networking: topologies, OSI and TCP/IP models, security and cryptography basics · easy

HTTPS uses which default port?

  1. 80
  2. 21
  3. 443
  4. 25
Answer and working

C. 443

HTTPS uses 443; plain HTTP uses 80.

Further reading: Cormen et al., Introduction to Algorithms (2022); Silberschatz, Galvin and Gagne, Operating System Concepts (2018); Tanenbaum and Wetherall, Computer Networks (2011); Aho et al., Compilers (2006); Sommerville, Software Engineering (2015)

Ten here, 20 in the app. The Laisha app has every practice question we have written to ICAR AIEEA-PG in this subject, marked as you go, with timed papers, a jump-to-unanswered list and a certificate when you pass at 70 per cent.

Free for ten days, then one subscription of US$10 a month. We would rather say so here than have you find it later.

Practise the full set in Laisha →

Read the subject

Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating SystemsThe full study manual, free ICAR AIEEA-PGFormat, sections and how it has changed

More ICAR AIEEA-PG practice

Statistical Methods for Agricultural SciencesAgriculture for StatisticiansDifferential Equations, Finite Differences & Numerical AnalysisPrinciples of Experimental Design & Basic DesignsProbability TheoryStatistical Inference II: Testing of Hypotheses & Sequential AnalysisProbability Distributions & Sampling DistributionsStatistical Quality Control & ReliabilityNonparametric & Rank-Based MethodsBioinformatics & Computational Biology

Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems for other exams

ICAR AICE-JRF/SRF · IndiaICAR-IASRI MSc and PhD · India

Ask Laisha about this

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