How are the Baldrige Principles evident in your workplace, a self owned business, ( bakery).
Which ones are most prominent? Are there any that are missing?
Solution
He explained some core values and practices to be followed by people at workplaces to become
success at their work. They are:
These are important to become succesful in the given field. If I starts a won business, i may
follow most of these values at my workplace, and my workers may follow these by looking at
me. I may not insist my workers to follow all these becasue i convinced and interested in the
above. They must beleive that, these will be help to them personally and professionally in their
lives. Then they must follow all these.
From above all, I give high priority to RESPECT STAFF, FACULTY & PATTERNS, I can say
that, every human must carry respect irrespective of their work and profession. Hence, where
people are respected, the place is fully filled with values and ethics. These two are two major
pillars for success of any profession or organization.
He covered all the aspects, and as of my knowledge, these are sufficient to become success in
profession or business..
I am failing a few tests with my Double Linked List program. Can som.pdf
1. I am failing a few tests with my Double Linked List program. Can someone show me the
following methods for doubly linked lists? (In Java)
public void addAfter(Object element, Object target)
public int indexOf(Object element)
public void add(int index, Object element)
public boolean contains(Object target)
Thanks!
Solution
public class DoubleLinkedList {
class Node{
Node next;
Node prev;
Object val;
Node(){
next = null;
prev = null;
val = null;
}
}
Node start = null;
public DoubleLinkedList() {
super();
this.start = null;
}
public void addAfter(Object element, Object target){
Node t = this.start;
2. while(!t.val.equals(target) && t != null){
t = t.next;
}
if(t == null) System.out.println("Target not found");
else{
Node temp = t;
Node n = new Node();
n.val = element;
n.prev = temp;
n.next = temp.next;
temp.next.prev = n;
temp.next = n;
}
}
public int indexOf(Object element){
int i = 0;
Node t = start;
while(t!=null){
i++;
if(!t.val.equals(element)) t = t.next;
else break;
}
if(t!=null) return i;
else return -1;
//return i;
}
public void add(int index, Object element){
3. //assume index starts from 1
Node t = start;
int i = 0;
if(index == 1)
{
Node n = new Node();
n.prev = null;
n.val = element;
n.next = start;
start.prev = n;
start = n;
} else {
while(i
