Gate CS pyqs - the other way [Eng]

small update

Gate 2016 pyq C Programming | What is output of following C program?void count(int n){static int d=1

Gate 2008 pyq C Programming | Choose the correct option to fill ?1 and ?2 so that the program below

Gate 2010 pyq C Programming | What does following program print?void f(int *p, int *q){p=q; *p=2;}

Gate 2010 pyq C Programming | What is the value printed by following C program?int f(int *a, int n){

Gate 2008 pyq C Programming | C program is given below:int main (){int i, j;char a[2][3]={{'a','b'..

Gate 2008 pyq C Programming |Consider the code written in C:void f (int n){if (n=1) printf ("%d", n)

Gate 2014 pyq C Programming | Consider following program in C language:main(){int i; int*pi = &i;

Gate 2011 pyq C Programming |What does the following C program print? char c[] = "GATE2011";

Gate 2016 pyq C Programming | The value printed by the following program is void f(int* p, int m){..

Gate 2016 pyq C Programming | Consider the following program:int f(int *p, int n){ if ...}

Gate 2017 pyq C Programming | The output of executing the following C program is? int total(int v) {

Gate 2019 pyq C Programming | Consider the following C program: int jumble(int x, int y) .......

Gate 2015 pyq C Programming | Consider the following C program. int main( ){ char s1[7] ="1234", *p;

Gate 2015 pyq CN |Suppose two hosts use a TCP connection to transfer a large file.

Gate 2008 pyq C Programming | What is printed by the C program?int f(int x, int *py, int **ppz)

Gate 2018 pyq CAO | A 32 – bit wide main memory unit with a capacity of 1 GB is built using 256M

Gate 2015 pyq C Programming | Consider the C program: int main(){int i, j, k = 0; j=2*3/4+2.0/5+8/5;

Gate 2020 pyq C Programming | Consider the following C functions int tob (int b, int* arr) { int i;

Gate 2000 pyq C Programming | The value of j at the end of the execution of C code int incr (int i)

Gate 2015 pyq C Programming | Consider the following recursive C function. If get(6) function.

Gate 2006 pyq CAO | The data path shown in the figure computes the number of 1s in the 32-bit

Gate 2014 pyq DIGITAL | Let k = 2n. A circuit is built by giving the output of an n-bit binary

Gate 2007 pyq CAO | Consider a machine with a byte addressable main memory of 2^16 bytes.

Gate 1999 pyq DIGITAL | The number of full and half-address required to add 16-bit number is:

Gate 2001 pyq CAO | Consider the following data path of a simple non-pilelined CPU. The registers

Gate 2007 pyq DIGITAL | (C012.25)H – (10111001110.101)B =

Gate 2003 pyq C Programming | Consider the C program shown below.

Gate 2017 pyq C Programming | Consider the following C code:int * assignval (int *x, int val){*x...}

Gate 1999 pyq C Programming | Consider the following C function int Trial (int a, int b, int c)

Gate 2007 pyq CN | The distance between two stations M and N is L kilometers.

Gate 2007 pyq DIGITAL | Let f(w, x, y, z) = ∑(0, 4, 5, 7, 8, 9, 13, 15). Which of the following.

Gate 2007 pyq DIGITAL | The following expression was to be realized using 2-input AND and OR gates.

Gate 2007 pyq DIGITAL | Which of the following Karnaugh Maps correctly represents the expression?

Gate 2007 pyq CAO | 6 marks (3 PARTS)|Consider the following program segment. Here R1, R2 and R3 are

Gate 2019 pyq CN | Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC

Gate 2008 pyq DIGITAL | In the Karnaugh map shown below, X denotes a don’t care term. What is the

Gate 2004 pyq DIGITAL | If 73x (in base-x number system) is equal to 54y (in base-y number system)

Gate 2006 pyq DIGITAL | The addition of 4-bit, two’s complement, binary numbers 1101 and 0100

Gate 2012 pyq CN | An Internet Service Provider (ISP) has the following chunk of CIDR-based IP

Gate 2017 pyq CAO | In a two-level cache system, the access times of L1 and L2 1 and 8 clock cycles.

Gate 2007 pyq DIGITAL | Define the connective * for the Boolean variables X and Y as

Gate 2017 pyq CAO | Consider a RISC machine where each instruction is exactly 4 bytes long.

Gate 2015 pyq C Programming | Consider the following C program. int f1(void);int f2(void);

Gate 2018 pyq C Programming | Consider the following program written in pseudo-code. Count (x, y)

gate 2013 pyq CAO| Consider an instruction pipeline with five stages without any branch prediction:

Gate 2019 pyq C Programming | Consider the following C program: int main(){ int arr[] = {1, 2, 3...

Gate 2018 pyq C Programming | Consider the following C program: int counter= 0;int calc(int a,int b)

Gate 2010 pyq COA | A 5-stage pipelined processor has Instruction Fetch(IF),Instruction Decode(ID).

Gate 2014 pyq CN | In the diagram shown below L1 is an Ethernet LAN and L2 is a Token-Ring LAN.

Gate 2007 pyq CN | The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1 to

Gate 2015 pyq CAO | Consider a processor with byte-addressable memory. Assume that all registers,

Gate 2014 pyq CAO| Consider a 6-stage instruction pipeline, where all stages are perfectly balanced.

Gate 2017 pyq CAO | Consider a machine with byte addressable memory of 2^32 bytes divided into

Gate 2017 pyq CAO | The read access times and the hit ratios for different caches in a memory

Gate 2001 pyq DIGITAL | Given the following karnaugh map, which one of the following represents

Gate 2018 pyq CAO | The instruction pipeline of a RISC processor has the following stages: