Questions without answers in Programming and DS

0 votes

0 answers

1

Precision Field in printf with %s specifier
We know that UNIX support a feature that allows for variable field with precision. please help me out in this statement -> printf(“% * .* s \n”,w,d,string); ? i know using of precision with string such as %10.4s <width>.<precision> indicating that first four character to be printed in a field with 10 columns.

asked Jun 6 in Programming by Aks9639 Active (1.3k points) | 92 views

+1 vote

0 answers

2

Allen Career Institute:Circular Queue
$1)$How circular queue can be implemented? $2)$ For which data structure circular queue cannot be implemented? $(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List $(D)$ Stack

asked May 24 in DS by srestha Veteran (117k points) | 205 views

0 votes

0 answers

3

doubly linked linked list
why we use double pointer struct Node** head here? can anyone explain with details /* Given a reference (pointer to pointer) to the head of a DLL and an int, appends a new node at the end */ void append(struct Node** head_ref, int new_data) { struct Node* ... } while (last->next != NULL) last = last->next; last->next = new_node; new_node->prev = last; return; }

asked May 24 in DS by Arun Rout (115 points) | 68 views

0 votes

0 answers

4

Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$

asked May 22 in DS by srestha Veteran (117k points) | 94 views

0 votes

0 answers

5

ISI2018-PCB-CS6
The following function computes an array $SPF$, where, for any integer $1 < i < 1000$, $SPF[i]$ is the smallest prime factor of $i$. For example, $SPF[6]$ is $2$, and $SPF[11]$ is $11$. There are five missing parts in the following code, commented as $/* Blank */$. For each of them ... < 1000; j+= i) { /* Blank 4 */ if (SPF[j] == j) { SPF[j] = _____; /* Blank 5 */ } } } } }

asked May 12 in Programming by akash.dinkar12 Boss (41.9k points) | 27 views

0 votes

0 answers

6

Made Easy Test Series : Programming Test4
Consider the following C code: int getNextGap(int gap){ gap=(gap*10)/13; if(gap<1)return 1; return gap; } void mystery(int a[ ],int n){ int gap=n; bool red=true; while(gap!=1||red==true){ gap=getNextGap(gap); red ... elements, then what output will print at last? I mostly stuck how bool function working here. Plz help me out, how program executing:(

asked May 10 in Programming by srestha Veteran (117k points) | 135 views

0 votes

0 answers

7

Made Easy Test Series:Programming Test4-Function Call
Consider the following function int fun(int a[ ],int l, int target){ int i=0,j=0,sum=0,count=0; while(j<l){ if(sum<target){ sum=sum+a[j]; j++; } else if(sum>target){ sum=sum-a[i]; i++; } else{ count++; sum= ... call $fun\left ( a,16,8 \right )=$_______________ Given ans $6,$ but I got $4.$ Which one correct?? Any shortcut to evaluate??

asked May 8 in Programming by srestha Veteran (117k points) | 159 views

0 votes

0 answers

8

Made Easy Test Series:Programming-Function Call
Consider the following program: void A(int n){ printf("*"); if(n>1){ A(n/4); A(n/4); A(n/4); A(n/4); } } Let $X$ be number of asterisks printed by above function when $n=1024.$ Then the value of $X$ will be ____________ How ans will be $\frac{4^{k+1}-1}{3}$ , where $k=5?$ .

asked May 4 in Programming by srestha Veteran (117k points) | 94 views

0 votes

0 answers

9

Made Easy Test Series:DS-Array
Consider the integer array $A\left [ 1.........100,1.......100 \right ]$ in which the elements are stored in $Z$ representation. An example of a $5\times 5$ array in $Z$ representation is shown below: If the base address of $A$ is ... $A$ is stored in Row Major Order, then the address corresponding to $A\left [ 100 \right ]\left [ 55 \right ]$ is ________________

asked May 4 in Programming by srestha Veteran (117k points) | 83 views

0 votes

0 answers

10

Argument passing in function by assigning value to a variable as argument.
Can we assign a value to a variable in calling a function as function argument? Ex- Int Func c( int); Int i =3; Void main(){ Fun c ( i=3)} Int Func c (int x) { Int x++; return x; } Please pardon me as the code above is not accurate but can give an idea of what i am trying to ask.

asked Apr 29 in Programming by ranarajesh495 (57 points) | 65 views

0 votes

0 answers

11

Assignment 2.9 (b) page no. 28 from book Classic Data Structures Second Edition by Debasis Samanta

asked Apr 18 in DS by mahi.0409 (5 points) | 52 views

0 votes

0 answers

12

Data Structures in C by Sahni - Circular Queue using Dynamic Arrays
I'm learning data structures from a book. In the topic, Circular Queue using Dynamic Array, the author has mentioned below point, Let capacity be the initial capacity of the circular queue,We must first increase the size of ... capacity elements. But how does array doubling and slide to right copy at most 2 * capacity -2 elements??

asked Apr 14 in DS by Durga Teja (31 points) | 91 views

0 votes

0 answers

13

AVL Tree Balancing
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY

asked Apr 13 in DS by kd..... Junior (853 points) | 48 views

–1 vote

0 answers

14

what is output
void fun(int,int*); int main() { int=-5,j=-2; fun(i,&j); print f(“i=%d j=%d\n”,i,j); return 0; } void fun(int i,int *j) { i=i*i; *j=*j * *j; }

asked Apr 12 in Programming by altamash (445 points) | 44 views

0 votes

0 answers

15

book name is" test ur c aptitude" i m not understanding 1st line of code
explain little bit more in easy way

asked Apr 8 in Programming by saket nandan Active (5.1k points) | 43 views

–2 votes

0 answers

16

book name is" test ur c aptitude"
plzzz explain how this code is executed

asked Apr 8 in Programming by saket nandan Active (5.1k points) | 67 views

0 votes

0 answers

17

Programming:Self Doubt
Can somebody explain this code line by line. I am unable to get and what will be it's output? #include<stdio.h> #include<stdlib.h> void transpose(int n, const double *A, double *B, const int *lda, int *perm) { } int transpose_equal(const double *A, ... , B, r_dim, r_perm); transpose_equal(A, B, total); free(A); free(B); free(B_trans); printf("\n"); } }

asked Apr 3 in Programming by srestha Veteran (117k points) | 63 views

0 votes

0 answers

18

CLRS CHAPTER 25
FOR THE EXTENDED-SHORTEST-PATH if we want to find the distance between 1->4 and the 1->5 +5->4 gives the shortest path and if 1->5 gets its shortest path as 1->2->5 and 5>4 gets its shortest path as 5->3->4 then how will we get it?? as one of the operands is always from the initial array.

asked Mar 30 in Programming by Doraemon Junior (729 points) | 18 views

0 votes

0 answers

19

self doubt
A directed acyclic graph has no connected components. TRUE OR FALSE???

asked Mar 30 in Programming by Doraemon Junior (729 points) | 17 views

0 votes

0 answers

20

self doubt
For multiplication method in hashing the formula is h(k)=m* (KA mod 1); m=2^p, k=key , 0<A<1 My question is how does it actually works. Please explain in a detailed way.

asked Mar 29 in Programming by Doraemon Junior (729 points) | 12 views

0 votes

0 answers

21

Allen Career Institute:Programming
Do something (x, n) { m = n, temp = 1, z = x ; while (m > 0) do { while ((m mod z) == 0) do { m = |m/2|; z = z^{2} ; } m = m – 1; } return temp ; } Complexity of the above problem $1)\Theta \left ( log n \right )$ $2)\Theta \left ( nlog n \right )$ $3)\Theta \left (n^{2} \right )$ $4)\Theta \left (n\right )$

asked Mar 28 in Programming by srestha Veteran (117k points) | 98 views

0 votes

0 answers

22

about array size
#include <stdio.h> // Note that arr[] for fun is just a pointer even if square // brackets are used void fun(char arr[]) // SAME AS void fun(int *arr) { unsigned int n = sizeof(arr)/sizeof(arr[0]); printf("\nArray size inside fun() is ... ********** output is confusing : need explaination how is it happening Array size inside main() is 6 Array size inside fun() is 8

asked Mar 23 in Programming by hitendra singh Active (1.7k points) | 71 views

0 votes

0 answers

23

Made Easy:Programming &DS
The number of possible ordered trees with 3 nodes A,B,C is ??

asked Mar 22 in DS by sandeep singh gaur (291 points) | 65 views

+1 vote

0 answers

24

Geeks for Geeks : C Program
In the above 4 Statements which would print 123 as output ? Explain also.

asked Mar 16 in Programming by Ashish Roy 1 (167 points) | 140 views

+1 vote

0 answers

25

ACE test Series: Programming and DS-Programming
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i-10){ if(x!=0) find(x-1); else{ printf("%d",y); } } } What will be output printed for find(4)?

asked Mar 6 in Programming by srestha Veteran (117k points) | 136 views

0 votes

0 answers

26

ACE Test Series:Programming in C
#include <stdio.h> int main(void) { char s1[15]="SREE"; char s2[10]="ALL THE BEST"; strcpy(s2,s1); printf("\n%s",s2); return 0; } 1)How s2 will contain a string of size 12, while it only contain ... copying , I mean SREETHE BEST Will it work like pointer that s2 pointing to same as s1? Anything link good to read about strcpy

asked Mar 5 in Programming by srestha Veteran (117k points) | 89 views

+2 votes

0 answers

27

ACE Test Series: Programming in C
What will be output of the program? int d=0; int f(int a,int b){ int c; d++; if(b==3) return a*a*a; else{ c=f(a,b/3); return(c*c*c); } } int main(){ printf("%d",f(4,81)); return 0; }

asked Mar 5 in Programming by srestha Veteran (117k points) | 166 views

0 votes

0 answers

28

Locality of Rference(OS+DS) (ACE)
An OS uses virtual memory with paging technique for memory allocation. Which of the following searching technique on given data structure use locality of reference? Linear search on linked list Binary search on array Linear search on array Binary search on linked list

asked Mar 2 in Programming by srestha Veteran (117k points) | 92 views

0 votes

0 answers

29

JNU , DS TREE, INORDER
If inorder traversing a tree results in E A C K F H D B G, the preorder traversal would return (a) FAEKCDBHG (b) FAEKCDHGB (c) EAFKHDCBG (d) FEAKDCHBG

asked Feb 24 in DS by 8676rau (9 points) | 182 views

0 votes

0 answers

30

DataStructureDeQueue
Suppose a dequeue is stored in a circular array with N memory cells. At which of the following condition is the dequeue is full? (i) LEFT = N and RIGHT = 1 (ii) LEFT = RIGHT + 1 (iii) LEFT = 1 and RIGHT = N (iv) LEFT = RIGHT - 1 + N (i) and (iii) (iii) and (iv) (ii) and (iii) (i) and (iv)

asked Feb 24 in DS by Abhisek Tiwari 4 Active (5.2k points) | 85 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions without answers in Programming and DS

Recent Posts

Recent Blog Comments