Data Structure Gate 2011 Problem Solution

Summary

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree ... What does the following fragment of C program print? char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p[1]); Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r ... Computer organization lectures for GATE, Complete Computer Organization lecture series. Computer Architecture and Organization ... 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}. Planning to take coaching on unacademy.com/ here is a code for 10% off PLUS1BPK1 Telegram Notification Group link:- ... A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values ... The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the ... The minimum number of D flip-flops needed to design a mod-258 counter is A- 9 B- 8 C- 512 D- 258