menu
search
Log In
Quick search syntax
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

Subjects

Recent questions tagged isi2012

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged isi2012

1 vote
1 answer
1
ISI2012-PCB-A-3
Given an array $A = \{a_1, a_2, \dots, a_n\}$ of unsorted distinct integers, write a program in pseudo-code for the following problem: given an integer $u$, arrange the elements of the array $A$ such that all the elements in A which are less than or equal to ... which are greater than $u$ are at the end of the array. You may use at most 5 extra variables apart from the array $A$.
Given an array $A = \{a_1, a_2, \dots, a_n\}$ of unsorted distinct integers, write a program in pseudo-code for the following problem: given an integer $u$, arrange the elements of the array $A$ such that all the elements in A which are less than or equal to $u$ ... the elements which are greater than $u$ are at the end of the array. You may use at most 5 extra variables apart from the array $A$.
asked Jun 2, 2016 in Algorithms jothee 153 views
2 votes
1 answer
2
ISI2012-PCB-A-2b
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $30$; the two binary operators $’+’$ and $’*’$ respectively denote the LCM (least common multiple) and GCD (greatest common divisor) of two integer operands. Which are the identity elements for $\mathcal{B}$?
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $30$; the two binary operators $’+’$ and $’*’$ respectively denote the LCM (least common multiple) and GCD (greatest common divisor) of two integer operands. Which are the identity elements for $\mathcal{B}$?
asked Jun 2, 2016 in Digital Logic jothee 132 views
1 vote
1 answer
3
ISI2012-PCB-A-2a
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $30$; the two binary operators $'+'$ ... common multiple) and GCD (greatest common divisor) of two integer operands. Show that the two operations of $\mathcal{B}$ satisfy associativity commutativity distributivity.
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $30$; the two binary operators $'+'$ ... (least common multiple) and GCD (greatest common divisor) of two integer operands. Show that the two operations of $\mathcal{B}$ satisfy associativity commutativity distributivity.
asked Jun 2, 2016 in Digital Logic jothee 126 views
1 vote
1 answer
5
ISI2012-PCB-A-1a
A group of $15$ boys plucked a total of $100$ apples. Prove that two of those boys plucked the same number of apples.
A group of $15$ boys plucked a total of $100$ apples. Prove that two of those boys plucked the same number of apples.
asked Jun 2, 2016 in Numerical Ability jothee 288 views
To see more, click for the full list of questions or popular tags.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...