GATE 2020 Question on Array // GATE PYQ // GATE CS/IT

114 || GATE CSE 2008 || C Programming || Question on Arrays & operator - Program Tracing – DebuggingПодробнее

114 || GATE CSE 2008 || C Programming || Question on Arrays & operator - Program Tracing – Debugging

86 || GATE CSE 2022 || C Programming || Question on 3D arrays - Program Tracing – DebuggingПодробнее

86 || GATE CSE 2022 || C Programming || Question on 3D arrays - Program Tracing – Debugging

Array: Practice Questions | L9 | GATE 2024/25 | Data Structure in C | Vishvadeep GothiПодробнее

Array: Practice Questions | L9 | GATE 2024/25 | Data Structure in C | Vishvadeep Gothi

GATE 2020 | DBMS | READ | WRITE | SCHEDULE | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEKПодробнее

GATE 2020 | DBMS | READ | WRITE | SCHEDULE | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEK

GATE 2020 | C PROGRAMMING | POINTERS | ARRAY |SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEKПодробнее

GATE 2020 | C PROGRAMMING | POINTERS | ARRAY |SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEK

printf("%d",*(*(a+**a+2)+3)) | printf("%u,%u,%u",x+3,*(x+3),*(x+2)+3) | 2D ARRAY PYQS GATE 2015,2020Подробнее

printf('%d',*(*(a+**a+2)+3)) | printf('%u,%u,%u',x+3,*(x+3),*(x+2)+3) | 2D ARRAY PYQS GATE 2015,2020

GATE CS 2020 | Q 23: Consider a double hashing scheme in which the primary hash function is h1(k)=kПодробнее

GATE CS 2020 | Q 23: Consider a double hashing scheme in which the primary hash function is h1(k)=k

GATE CSE 2020 Solutions | Que 29 | Subject - COA | Topic - Floating Point Numbers | Newton SchoolПодробнее

GATE CSE 2020 Solutions | Que 29 | Subject - COA | Topic - Floating Point Numbers | Newton School

GATE CS 2020 | Q40:Let G=(V,E) be a directed, weighted graph with weight function w:E→R. For someПодробнее

GATE CS 2020 | Q40:Let G=(V,E) be a directed, weighted graph with weight function w:E→R. For some

GATE CS 2020 | Q49:Consider a graph G=(V,E), where V={v1,v2,…,v100}, E={(vi,vj)∣1 i j 100}, and weigПодробнее

GATE CS 2020 | Q49:Consider a graph G=(V,E), where V={v1,v2,…,v100}, E={(vi,vj)∣1 i j 100}, and weig

GATE CS 2020 | Q 31:Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning TreeПодробнее

GATE CS 2020 | Q 31:Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning Tree

GATE CS 2020 | Q 47:Consider the array representation of a binary min-heap containing 1023 elements.Подробнее

GATE CS 2020 | Q 47:Consider the array representation of a binary min-heap containing 1023 elements.

GATE CS 2020 ,Q 6:What is the worst case time complexity of inserting n2 elements into an AVL-treeПодробнее

GATE CS 2020 ,Q 6:What is the worst case time complexity of inserting n2 elements into an AVL-tree

Gate 2020 pyq C Programming | Consider the following C functions int tob (int b, int* arr) { int i;Подробнее

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

Gate 2020 pyq C Programming | Consider the following C functions. int fun1(int n) { static int i= 0;Подробнее

Gate 2020 pyq C Programming | Consider the following C functions. int fun1(int n) { static int i= 0;

Gate 2020 pyq CN |Assume that you have made a request for a web page through your web browserПодробнее

Gate 2020 pyq CN |Assume that you have made a request for a web page through your web browser

Gate 2020 pyq CN |Consider a TCP connection between a client and a server with the followingПодробнее

Gate 2020 pyq CN |Consider a TCP connection between a client and a server with the following

Gate question cse | strings and pointers | pointer to stringПодробнее

Gate question cse | strings and pointers | pointer to string

array and pointers | gate questionПодробнее

array and pointers | gate question

gate question 2020 | pointers and 2 d arrayПодробнее

gate question 2020 | pointers and 2 d array

События