My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Numerical Computation and Estimation - General Aptitude - General Aptitude (GA) Previous Year Questions

Practice Numerical Computation and Estimation - General Aptitude - General Aptitude (GA) previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

17Papers
10Years
110Questions
1Topics

Numerical Computation and Estimation question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Numerical Computation and Estimation. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 59 53.6%
Easy 50 45.5%
Hard 1 0.9%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 71 64.5%
Numerical Answer Type (NAT) 39 35.5%

Subject weightage

Top subjects by unique question coverage.

General Aptitude (GA)
110 Qs

Most asked topics

Top topics across the included previous year papers.

General Aptitude
110 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Numerical Computation and Estimation
110 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 3]
27 Qs
Computer Science & Information Technology (CS) 2015 [Session 1]
23 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
17 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2012
21 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620263View paper
Computer Science and Information Technology (CS) 202620261View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20251View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20251View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20191View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20182View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20161View paper
Computer Science & Information Technology (CS) 2015 [Session 1]201523View paper
Computer Science & Information Technology (CS) 2015 [Session 2]201517View paper
Computer Science & Information Technology (CS) 2015 [Session 3]201527View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20144View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2012201221View paper

All Numerical Computation and Estimation previous year questions

Practice every matching question in batches of 20, with every available option.

1
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Q.5 The worst case running time to search for an element in a balanced binary search tree with n2n elements is
Open complete paper
2
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Q.8 A process executes the code
fork();
fork();
fork();
The total number of child processes created is
Open complete paper
3
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Q.16 The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Open complete paper
4
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Q.18 Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
Open complete paper
5
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Q.19 The amount of ROM needed to implement a 4 bit multiplier is
Open complete paper
6
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

Which of the following transport layer protocols is used to support electronic mail?

Open complete paper
7
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

In the IPv4 addressing format, the number of networks allowed under Class C addresses is

Open complete paper
8
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

Let G be a weighted graph with edge weights greater than one and G' be the graph constructed by squaring the weights of edges in G. Let T and T' be the minimum spanning trees of G and G', respectively, with total weights t and t'. Which of the following statements is TRUE?

Open complete paper
9
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

Consider the 3 processes, P1, P2 and P3 shown in the table.

ProcessArrival timeTime Units Required
P105
P217
P334
The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are
Open complete paper
10
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of addresses to A and B?

Open complete paper
11
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Suppose a circular queue of capacity \((n-1)\) elements is implemented with an array of \(n\) elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
Open complete paper
12
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is

Open complete paper
13
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is

Open complete paper
14
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Consider the virtual page reference string
1, 2, 3, 2, 4, 1, 3, 2, 4, 1
on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then
Open complete paper
15
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Consider a source computer (S) transmitting a file of size 10^6 bits to a destination computer (D) over a network of two routers (R1 and R2) and three links (L1, L2, and L3). L1 connects S to R1; L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of length 100 km. Assume signals travel over each link at a speed of 10^8 meters per second. Assume that the link bandwidth on each link is 1Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D?
Open complete paper
16
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.
Open complete paper
17
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
What output will be generated by the given code segment?
Open complete paper
18
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

What output will be generated by the given code segment if: Line 1 is replaced by auto int a = 1; Line 2 is replaced by register int a = 2;

Open complete paper
19
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012
The number of bits in the tag field of an address is
Open complete paper
20
2012 · General Aptitude (GA) · General Aptitude · Numerical Computation and Estimation
Computer Science & Information Technology (CS) 2012

The size of the cache tag directory is

Open complete paper

Showing 20 of 109 questions