Data Structure Gate 2010 Problem Solution

Summary

The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the ... Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}. A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values ... In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. Computer organization lectures for Planning to take coaching on unacademy.com/ here is a code for 10% off PLUS1BPK1 Downloads resources from here ... A main memory unit with a capacity of 4 megabytes is built using 1M 1-bit DRAM chips. Each DRAM chip has 1K rows of cells with ... What is the value printed by the following C program? stdio.h int f(int *a, int n) { if (n lessThanOrEqual 0 ... P is a 16-bit signed integer. The 2's complement representation of P is (F87B)16. The 2's complement representation of 8*P is ...