Register
Filter

Recent activity by Udhay Brahmi

4 answers
2
ISRO2020-23
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is $\text{A B C D E F G H I}$ $\text{F B A D C E G I H}$ $\text{F A B C D E G H I}$ $\text{A B D C E F G I H}$
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is$\text{A B C D E F G H I}$$\text{F B A D C E G I H}$$\text{F A B C D E G H I}$$\t...
2 answers
4
ISRO2020-62
What is output of the following ‘C’ code assuming it runs on a byte addressed little endian machine? #include<stdio.h> int main() { int x; char *ptr; x=622,100,101; printf("%d",(*(char *)&x)*(x%3)); return 0; } $622$ $311$ $22$ $110$
What is output of the following ‘C’ code assuming it runs on a byte addressed little endian machine?#include<stdio.h int main() { int x; char *ptr; x=622,100,101; pri...
4 answers
5
UGC NET CSE | December 2019 | Part 2 | Question: 88
Match $\text{List-I}$ with $\text{List-II}$ ... $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$
Match $\text{List-I}$ with $\text{List-II}$:$$\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Micro operation} & \text{(i)} & \text{Speci...
2 answers
6
UGC NET CSE | December 2019 | Part 2 | Question: 35
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b( \text{mod } n)$? $160$ $166$ $157$ $67$
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b...
1 answer
9
UGC NET CSE | December 2004 | Part 2 | Question: 14
A function object : is an instance of a class for which operator ( ) is a member function is an instance of a class for which operator → is a member function is a pointer to any function is a member function of a class
A function object :is an instance of a class for which operator ( ) is a member functionis an instance of a class for which operator → is a member functionis a pointer ...
2 answers
11
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
3 answers
12
#linkedlist #pointers #datastructure
Suppose you have a singly Linked List of n nodes and you want to insert a node in the middle of the Linked List, At least how many pointers do you need to handle to perform this task?
Suppose you have a singly Linked List of n nodes and you want to insert a node in the middle of the Linked List, At least how many pointers do you need to handle to perfo...
2 answers
13
Data Structure
How to use substitution method
How to use substitution method
1 answer
15
Gate applied Test Series
Can anyone help explain the concept of enums through this question,please?
Can anyone help explain the concept of enums through this question,please?
3 answers
16
&* Operator in C
#include <stdio.h> int main() { int a=20; int *ptr=&a; int x=a; printf ("%p\n",&*ptr); printf ("%p\n",&a); return 0; } Why both printf() line printing the same address value??
#include <stdio.h>int main(){ int a=20; int *ptr=&a; int x=a; printf ("%p\n",&*ptr); printf ("%p\n",&a); return 0;}Why both printf() line printing the s...
1 answer
18
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
2 answers
19
Gate@Zeal Test series
How to calculate the sizeof(arr2)?
How to calculate the sizeof(arr2)?
1 answer
20
Telegram Test Series
1 answer
21
Testbook Test Series
Consider the following C program: #include <stdio.h> int r( ){ static int num = 7; return num--; } int main ( ) { for (r( ) ;r ( ) ;r ( ) ) printf(“ % d”, r( ) ); return 0; } Which one of the following values will be displayed on execution of the programs? 41 52 63 630
Consider the following C program:#include <stdio.h>int r( ){static int num = 7;return num ;}int main ( ) {for (r( ) ;r ( ) ;r ( ) )printf(“ % d”, r( ) );return 0;}Whi...
5 answers
22
MadeEasy Subject Test: Programming & DS - Trees
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
3 answers
23
ACE Test Series:C-program
What should be the ans. Isn’t the Function initialization should be outside main function? They are given inside main. If declaration would be outside main then ans should be C else i don’t think options are correct here. Anyone ?
What should be the ans. Isn’t the Function initialization should be outside main function? They are given inside main. If declaration would be outside main then ans sho...
2 answers
24
Please explain with some example that How Right to Left associativity takes place in case of Ternary operators?
Please explain with some example that How Right to Left associativity takes place in case of Ternary operators?
4 answers
25
#university exam
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
4 answers
26
number of ordered trees
The number of possible ordered trees with 3 nodes A, B, C is: (a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?
The number of possible ordered trees with 3 nodes A, B, C is:(a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?
1 answer
28
###Doubt
Is there any shortcut method to find the optimal solution of 0/1 knapsack problem?
Is there any shortcut method to find the optimal solution of 0/1 knapsack problem?
2 answers
29
Applied Test series: C-programming
I know the answer but need a good explanation for this question. Can anyone help. Thanks!
I know the answer but need a good explanation for this question. Can anyone help. Thanks!