Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Falahamin
0
votes
1
ISI2015-PCB-CS-1a
Consider the following C program. #include <stdio.h> main() { int arr[] = {1, 1, 2, 4, 8, 16, 32, 64}; int i, j, val, t = 16; unsigned char c; for (i = 0; i < 256; i++) { c = i; val = 0; for (j = 0; j < 8; j++) val = val ... ) & 0x1)*arr[j]; if (val == t) printf("%d\n", i); } } Trace the execution of the code inside the for loop indexed by i when i = 35.
Consider the following C program.#include <stdio.h main() { int arr[] = {1, 1, 2, 4, 8, 16, 32, 64}; int i, j, val, t = 16; unsigned char c; for (i = 0; i < 256; i++) { c...
487
views
answered
Sep 5, 2020
Programming in C
descriptive
isi2015-pcb-cs
programming-in-c
+
–
0
votes
2
ISI2016-PCB-CS-5
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case, your answer must include proper justifications without which no credit will be given. #include<stdio.h> main() { unsigned char i, j, a[]={1, 2, 3, 4, 5}; ... ;, i, j, n); while(j-- !=0) a[0]+=n; printf("j=%d, a[0]=%d\n", j, a[0]); }
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case, your answer must include proper jus...
395
views
answered
Sep 5, 2020
Programming in C
isi2016-pcb-cs
programming-in-c
output
non-gate
descriptive
+
–
0
votes
3
ISI2016-MMA-19
Let $A$ be a real $2 \times 2$ matrix. If $5+3i$ is an eigenvalue of $A$, then $det(A)$ equals 4 equals 8 equals 16 cannot be determined from the given information
Let $A$ be a real $2 \times 2$ matrix. If $5+3i$ is an eigenvalue of $A$, then $det(A)$equals 4equals 8equals 16cannot be determined from the given information
632
views
answered
Aug 23, 2020
Linear Algebra
isi2016-mmamma
linear-algebra
matrix
eigen-value
+
–
0
votes
4
CMI2014-B-07c
Consider the code below, defining the function $A$: A(m, n, p) { if (p == 0) return m+n; else if (n == 0 && p == 1) return 0; else if (n == 0 && p == 2) return 1; else if (n == 0) return m; else return A(m, A(m,n-1,p), p-1); } Compute $A(2, 2, 3)$ and $A(2, 3, 3)$.
Consider the code below, defining the function $A$:A(m, n, p) { if (p == 0) return m+n; else if (n == 0 && p == 1) return 0; else if (n == 0 && p == 2) return 1; else if ...
635
views
answered
Aug 14, 2020
Algorithms
cmi2014
descriptive
algorithms
identify-function
+
–
0
votes
5
ISI2014-PCB-CS-1
Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job is to split the bar into small squares by breaking along the lines between the squares. We obviously want to do it with the minimum ... m as inputs and print the line numbers along the length and the breadth according to your strategy of breaking the chocolate.
Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job is to split the bar into small squares by breaki...
597
views
answered
Jul 26, 2020
Algorithms
isi2014-pcb-cs
descriptive
algorithms
algorithm-design
+
–
0
votes
6
CMI2010-B-02
Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1, \dots , v_k$ such that for $0 \leq i < k,$ $v_i$ is connected to $v_{i+1}$ in $G$.
Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1...
625
views
answered
May 15, 2020
Graph Theory
cmi2010
descriptive
graph-theory
graph-connectivity
+
–
1
votes
7
CMI2011-B-01a
A multinational company is developing an industrial area with many buildings. They want to connect the buildings with a set of roads so that: Each road connects exactly two buildings. Any two buildings are connected via a sequence of roads. Omitting any road ... it always possible to colour each building with either red or blue so that every road connects a red and blue building?
A multinational company is developing an industrial area with many buildings. They want to connect the buildings with a set of roads so that:Each road connects exactly tw...
705
views
answered
May 14, 2020
Graph Theory
cmi2011
descriptive
graph-coloring
+
–
0
votes
8
ISI2016-PCB-CS-8
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than 1 in a given tree. What is the maximum possible value of $k$? Justify your answer. Consider $2n$ committees, each having at least $2n$ persons, formed from a group of $4n$ persons. Prove that there exists at least one person who belongs to at least $n$ committees.
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than 1 in a given tree. What is the maximum possible value of $k$? Justify ...
563
views
answered
Mar 18, 2020
Combinatory
isi2016-pcb-cs
combinatory
descriptive
+
–
0
votes
9
ISI2016-MMA-25
A integer is said to be a $\textbf{palindrome}$ if it reads the same forward or backward. For example, the integer $14541$ is a $5$-digit palindrome and $12345$ is not a palindrome. How many $8$-digit palindromes are prime? $0$ $1$ $11$ $19$
A integer is said to be a $\textbf{palindrome}$ if it reads the same forward or backward. For example, the integer $14541$ is a $5$-digit palindrome and $12345$ is not a ...
381
views
answered
Mar 18, 2020
Combinatory
isi2016-mmamma
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
