Sat Mar 6 03:51:18 2021
EVENTS
 FREE
SOFTWARE
INSTITUTE

POLITICS
JOBS
MEMBERS'
CORNER

MAILING
LIST

NYLXS Mailing Lists and Archives
NYLXS Members have a lot to say and share but we don't keep many secrets. Join the Hangout Mailing List and say your peice.

DATE 2015-02-01

LEARN

2021-03-06 | 2021-02-06 | 2021-01-06 | 2020-12-06 | 2020-11-06 | 2020-10-06 | 2020-09-06 | 2020-08-06 | 2020-07-06 | 2020-06-06 | 2020-05-06 | 2020-04-06 | 2020-03-06 | 2020-02-06 | 2020-01-06 | 2019-12-06 | 2019-11-06 | 2019-10-06 | 2019-09-06 | 2019-08-06 | 2019-07-06 | 2019-06-06 | 2019-05-06 | 2019-04-06 | 2019-03-06 | 2019-02-06 | 2019-01-06 | 2018-12-06 | 2018-11-06 | 2018-10-06 | 2018-09-06 | 2018-08-06 | 2018-07-06 | 2018-06-06 | 2018-05-06 | 2018-04-06 | 2018-03-06 | 2018-02-06 | 2018-01-06 | 2017-12-06 | 2017-11-06 | 2017-10-06 | 2017-09-06 | 2017-08-06 | 2017-07-06 | 2017-06-06 | 2017-05-06 | 2017-04-06 | 2017-03-06 | 2017-02-06 | 2017-01-06 | 2016-12-06 | 2016-11-06 | 2016-10-06 | 2016-09-06 | 2016-08-06 | 2016-07-06 | 2016-06-06 | 2016-05-06 | 2016-04-06 | 2016-03-06 | 2016-02-06 | 2016-01-06 | 2015-12-06 | 2015-11-06 | 2015-10-06 | 2015-09-06 | 2015-08-06 | 2015-07-06 | 2015-06-06 | 2015-05-06 | 2015-04-06 | 2015-03-06 | 2015-02-06 | 2015-01-06 | 2014-12-06 | 2014-11-06 | 2014-10-06

Key: Value:

Key: Value:

MESSAGE
DATE 2015-02-24
FROM Maneesh Kongara
SUBJECT Re: [LIU Comp Sci] Binary tree Excersize
From owner-learn-outgoing-at-mrbrklyn.com Tue Feb 24 12:32:59 2015
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix)
id 9B5D1161162; Tue, 24 Feb 2015 12:32:59 -0500 (EST)
Delivered-To: learn-outgoing-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix, from userid 28)
id 896EE161168; Tue, 24 Feb 2015 12:32:59 -0500 (EST)
Delivered-To: learn-at-mrbrklyn.com
Received: from mail-qa0-f54.google.com (mail-qa0-f54.google.com [209.85.216.54])
by mrbrklyn.com (Postfix) with ESMTP id 04CB4161162
for ; Tue, 24 Feb 2015 12:32:58 -0500 (EST)
Received: by mail-qa0-f54.google.com with SMTP id x12so28173631qac.13
for ; Tue, 24 Feb 2015 09:32:58 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
d=gmail.com; s=20120113;
h=mime-version:in-reply-to:references:date:message-id:subject:from:to
:content-type;
bh=nodR+17OcYwbf5pts1CEHsmGhhVm70F6YeJJ8gULfx4=;
b=UANY03sE02So6GmG4nKFhPhJtcY0n/ddPVHV7yUKPODSdmSpekXGe2EFYH13/EVa4u
VFNkTyZBxiqjW6utlREvI4pTsEtNqFqqu/dQrcOnxNfaVtrLeNVvIwzQL2Ta92WnhSYE
psolFf+X8pkYELXjtZW8SMFOXXHTBMqwJ8mThtPBtswm/qDKd09J2RVUOn/NxAHKMKeH
8vwoSlA3DMrcg+jZNsLYvBb1dDCgUUTbFV64cTpFBnFXOCySOME5m2eeUbU5IOPFG/B6
ouIJdJjaSszwSjPVJQpRCtsGa7hOMrXJ0RYoIAzfw2Qi2cbERoFi28qxXTioX/kW11C5
IjwA==
MIME-Version: 1.0
X-Received: by 10.140.231.204 with SMTP id b195mr11606265qhc.98.1424799178152;
Tue, 24 Feb 2015 09:32:58 -0800 (PST)
Received: by 10.229.19.4 with HTTP; Tue, 24 Feb 2015 09:32:57 -0800 (PST)
Received: by 10.229.19.4 with HTTP; Tue, 24 Feb 2015 09:32:57 -0800 (PST)
In-Reply-To: <54EBFCC9.8070605-at-my.liu.edu>
References:
<54EB4BE9.6020505-at-panix.com>

<54EBF7E1.2070605-at-panix.com>
<54EBFCC9.8070605-at-my.liu.edu>
Date: Tue, 24 Feb 2015 12:32:57 -0500
Message-ID:
Subject: Re: [LIU Comp Sci] Binary tree Excersize
From: Maneesh Kongara
To: learn-at-mrbrklyn.com
Content-Type: multipart/alternative; boundary=001a11c0b0f0e3e016050fd8e8ad
Sender: owner-learn-at-mrbrklyn.com
Precedence: bulk
Reply-To: learn-at-mrbrklyn.com

--001a11c0b0f0e3e016050fd8e8ad
Content-Type: text/plain; charset=UTF-8

Is this the answer for the assignment?
On Feb 23, 2015 11:23 PM, "Ruben" wrote:

> On 02/23/2015 11:02 PM, Ruben Safir wrote:
> > On 02/23/2015 03:04 PM, Keisha Sylvester wrote:
> >> sight*
> >>
> > OK - spelling correction noted. This is now the THIRD answer I sent to
> you.
> >
> #include "binary.h"
> #include
> #include
> /* Binary Tree Function File for Binary exercises
> * from LIU Comp Sci Allorgithms Class
> * J Rodriguez
> * 2015
> * Ruben Safir
> */
>
> using namespace std;
> char c;
> BinTree NewBinTree()
> {
> srand(time(NULL));
> return 0;
> }; //this just seeds a new radnom number generator fresh with each new
> node, avoiding a repeating psuedorandom number
> int node_counter = 0;
> int level_counter;
> void InsertOrdered(BinTree& top, int val){
> cout << endl << "CALLED: " << "Recieved =>" << val << endl ;
>
> static int index = -1;
> int odd = index %2;
>
> if(top == 0){
> cout << "Opening New Node" << endl;
> top = new bnode;
> top->data = val;
> top->left = top->right = 0;
> index++;
> return;
> }
> if(odd == 0){
> cout << "Going Left " << endl;
> InsertOrdered(top->left, val);
> cout << "Left Exited" << endl;
> }else{
> cout << "Going Right" << endl;
> InsertOrdered(top->right, val);
> cout << "Right Exited" << endl;
> }
> return;
> }
>
> void InsertRandom(BinTree& top, int val)
> {
> if(top == 0){
> cout << "\tInserting into the New Node: Node Identifier ==> "<<
> node_counter++ << endl;
> cout << "\tLevel entered is ==> " << level_counter;
> top = new bnode;
> cout << "\tcreated a new node" << endl;
> top->data = val;
> cout << "\tNode Inserted with value==> " << val << endl;
> top->left = top->right = 0;
> cout << "\tDaughter nodes defined as null" << endl;
> return;
> }
>
> int r = rand() % 2;
> cout << "node occupied ==>find an Empty Node at random" << endl;
> cout << "\tGoing Down ==>" << ++level_counter << endl;
> cout << "Trying ";
> if (r == 0){
> cout << "Inserting on Left " << endl;
> InsertRandom(top->left, val);
> cout << "Left Path Done -- Going Up" << endl;
> }
> else{
> cout << "Inserting Right " << endl;
> InsertRandom(top->right, val);
> cout << "Right Path Done -- Going Up" << endl;
> }
> level_counter--;
> cout << "Next Level -->" << level_counter << endl;
> return;
> }
>
> void PrintNested(BinTree& top, char tag)
> {
> char save_tag;
>
> if (top == 0){
> cout << "[ ]";
> }
> else{
> cout << "(" << tag << " " << top->data << ", ";
> save_tag = tag;
> tag++;
> PrintNested(top->left, tag);
> cout << ", ";
> PrintNested(top->right, tag);
> cout << ", " << save_tag << ")";
> }
> return;
> }
>
> int Height(const BinTree& top)
> {
> // cout << endl << "START NEW HEIGHT FUNCTION " << endl;
> static int cycles = 0;
> cycles++;
> // int height = 0;
> // cout << "CYLCLES " << cycles << ":Height " << height << endl;
> int hl, hr;
> if (top == 0){
> cout << "end of path" << endl;
> cycles--;
> return -1;
> }
> int step = cycles;
> //cout << "Cycle" << cycles << endl;
> cout << "Left " << step << endl;
> hl = Height(top->left);
> cout << "return Left: ==> " << step << ": ";
> cout << "hl: " << hl << endl;
> cout << "RIGHT " << step << endl;
> hr = Height(top->right);
> cout << "return RIGHT: ==> " << step << ":";
> cout << "hr:" << hr << endl;
> //height = 1 + ((hl <= hr)?hr:hl);
> return 1 + ((hl <= hr)?hr:hl);
> //cout << "height " << height << " hl " << hl << " hr " << hr << endl;
>
> // return height;
> }
>
> int node_count(const BinTree& node)
> {
> int static count = 0;
> if(node == 0)
> {
> return count;
> }
> node_count(node->left);
> node_count(node->right);
> count++;
> return count;
> }
>
> void preorder(const BinTree& root)
> {
> if(root == 0)
> return;
>
> cout << "Node ==>" << root->data << " ";
> preorder(root->left);
> preorder(root->right);
> return;
> }
>
>

--001a11c0b0f0e3e016050fd8e8ad
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

Is this the answer for the assignment?


On Feb 23, 2015 11:23 PM, "Ruben" <=
ruben.safir-at-my.liu.edu> wr=
ote:
gin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">On 02/23/2015 1=
1:02 PM, Ruben Safir wrote:

> On 02/23/2015 03:04 PM, Keisha Sylvester wrote:

>> sight*

>>

> OK - spelling correction noted.=C2=A0 This is now the THIRD answer I s=
ent to you.

>

#include "binary.h"

#include <iostream>

#include <cstdlib>

/* Binary Tree Function File for Binary exercises

=C2=A0* from LIU Comp Sci Allorgithms Class

=C2=A0* J Rodriguez

=C2=A0* 2015

=C2=A0* Ruben Safir

=C2=A0*/



using namespace std;

char c;

BinTree NewBinTree()

{

=C2=A0 =C2=A0 srand(time(NULL));

=C2=A0 =C2=A0 return 0;

};=C2=A0 //this just seeds a new radnom number generator fresh with each ne=
w

node, avoiding a repeating psuedorandom number

int node_counter =3D 0;

int level_counter;

void InsertOrdered(BinTree& top, int val){

=C2=A0 =C2=A0 cout << endl << "CALLED:=C2=A0 " <&l=
t;=C2=A0 "Recieved =3D>" << val << endl ;



=C2=A0 =C2=A0 static int index =3D -1;

=C2=A0 =C2=A0 int odd =3D index %2;



=C2=A0 =C2=A0 if(top =3D=3D 0){

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Opening New Node" <=
< endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 top =3D new bnode;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 top->data =3D val;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 top->left =3D top->right =3D 0;

=C2=A0 =C2=A0 =C2=A0 =C2=A0index++;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 return;

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 if(odd =3D=3D 0){

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Going Left " << =
endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 InsertOrdered(top->left, val);

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Left Exited" << =
endl;

=C2=A0 =C2=A0 }else{

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Going Right" << =
endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 InsertOrdered(top->right, val);

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Right Exited" <<=
endl;

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 return;

}



void InsertRandom(BinTree& top, int val)

{

=C2=A0 =C2=A0 if(top =3D=3D 0){

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "\tInserting into the New No=
de: Node Identifier =3D=3D> "<<

node_counter++ << endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "\tLevel entered is =3D=3D&g=
t; " << level_counter;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 top =3D new bnode;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "\tcreated a new node" =
<< endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 top->data =3D val;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "\tNode Inserted with value=
=3D=3D> " << val <<=C2=A0 endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 top->left =3D top->right =3D 0;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "\tDaughter nodes defined as=
null" << endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 return;

=C2=A0 =C2=A0 }



=C2=A0 =C2=A0 int r =3D rand() % 2;

=C2=A0 =C2=A0 cout << "node occupied =3D=3D>find an Empty Nod=
e at random" << endl;

=C2=A0 =C2=A0 cout << "\tGoing Down =3D=3D>" << ++=
level_counter << endl;

=C2=A0 =C2=A0 cout << "Trying ";

=C2=A0 =C2=A0 if (r =3D=3D 0){

=C2=A0 =C2=A0 =C2=A0 cout << "Inserting on Left " << =
endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 InsertRandom(top->left, val);

=C2=A0 =C2=A0 =C2=A0 cout << "Left Path Done -- Going Up" &=
lt;< endl;

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 else{

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Inserting Right " <=
< endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 InsertRandom(top->right, val);

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "Right Path Done -- Going Up=
" << endl;

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 level_counter--;

=C2=A0 =C2=A0 cout << "Next Level -->" << level_co=
unter << endl;

=C2=A0 =C2=A0 return;

}



void PrintNested(BinTree& top, char tag)

{

=C2=A0 =C2=A0 char save_tag;



=C2=A0 =C2=A0 if (top =3D=3D 0){

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "[ ]";

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 else{

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "(" << tag <&l=
t; " " << top->data << ", ";

=C2=A0 =C2=A0 =C2=A0 =C2=A0 save_tag =3D tag;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 tag++;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 PrintNested(top->left, tag);

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << ", ";

=C2=A0 =C2=A0 =C2=A0 =C2=A0 PrintNested(top->right, tag);

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << ", " << save_tag =
<< ")";

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 return;

}



int Height(const BinTree& top)

{

//=C2=A0 =C2=A0 cout << endl << "START NEW HEIGHT FUNCTION=
" << endl;

=C2=A0 =C2=A0 static int cycles =3D 0;

=C2=A0 =C2=A0 cycles++;

//=C2=A0 =C2=A0 int height =3D 0;

//=C2=A0 =C2=A0 cout << "CYLCLES " << cycles <<=
":Height " << height << endl;

=C2=A0 =C2=A0 int hl, hr;

=C2=A0 =C2=A0 if (top =3D=3D 0){

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cout << "end of path" << =
endl;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 cycles--;

=C2=A0 =C2=A0 =C2=A0 =C2=A0 return -1;

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 int step =3D cycles;

=C2=A0 =C2=A0 //cout << "Cycle" << cycles << en=
dl;

=C2=A0 =C2=A0 cout << "Left " << step << endl;<=
br>
=C2=A0 =C2=A0 hl =3D Height(top->left);

=C2=A0 =C2=A0 cout << "return Left: =3D=3D> " << s=
tep << ": ";

=C2=A0 =C2=A0 cout << "hl: " << hl << endl;

=C2=A0 =C2=A0 cout << "RIGHT " << step << endl;=


=C2=A0 =C2=A0 hr =3D Height(top->right);

=C2=A0 =C2=A0 cout << "return RIGHT: =3D=3D> " << =
step << ":";

=C2=A0 =C2=A0 cout << "hr:" << hr << endl;

=C2=A0 =C2=A0 //height =3D 1 + ((hl <=3D hr)?hr:hl);

=C2=A0 =C2=A0 return 1 + ((hl <=3D hr)?hr:hl);

=C2=A0 =C2=A0 //cout << "height " << height << =
" hl " << hl << " hr " << hr <<=
endl;



//=C2=A0 =C2=A0 return height;

}



int node_count(const BinTree& node)

{

=C2=A0 =C2=A0 int static count =3D 0;

=C2=A0 =C2=A0 if(node =3D=3D 0)

=C2=A0 =C2=A0 {

=C2=A0 =C2=A0 =C2=A0 =C2=A0 return count;

=C2=A0 =C2=A0 }

=C2=A0 =C2=A0 node_count(node->left);

=C2=A0 =C2=A0 node_count(node->right);

=C2=A0 =C2=A0 count++;

=C2=A0 =C2=A0 return count;

}



void preorder(const BinTree& root)

{

=C2=A0 =C2=A0 if(root =3D=3D 0)

=C2=A0 =C2=A0 =C2=A0 =C2=A0 return;



=C2=A0 =C2=A0 cout << "Node =3D=3D>" << root->d=
ata=C2=A0 << " ";

=C2=A0 =C2=A0 preorder(root->left);

=C2=A0 =C2=A0 preorder(root->right);

=C2=A0 =C2=A0 return;

}





--001a11c0b0f0e3e016050fd8e8ad--

  1. 2015-02-01 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] DMA memory and CPU activity
  2. 2015-02-01 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] DMA memory and CPU activity
  3. 2015-02-01 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] DMA memory and CPU activity
  4. 2015-02-02 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] DMA memory and CPU activity
  5. 2015-02-02 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Operating System History
  6. 2015-02-02 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Operating System History
  7. 2015-02-02 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] study hall today
  8. 2015-02-02 Kamran <kamran.mirzayev-at-my.liu.edu> Re: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC
  9. 2015-02-02 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] blackboard notice
  10. 2015-02-02 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Landing Jobs in the IT Field
  11. 2015-02-02 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Operating System History
  12. 2015-02-02 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Operating Systems Quiz
  13. 2015-02-02 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Re: Operating System History
  14. 2015-02-02 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Re: Operating System History
  15. 2015-02-02 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC meetups Tuesday]
  16. 2015-02-03 Ruben <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC
  17. 2015-02-04 Tony Genao <tony.genao-at-my.liu.edu> Re: [LIU Comp Sci] Compus Meeting
  18. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Compus Meeting
  19. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Compus Meeting
  20. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC
  21. 2015-02-04 Tony Genao <tony.genao-at-my.liu.edu> Re: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC
  22. 2015-02-04 Kamran <kamran.mirzayev-at-my.liu.edu> Re: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC
  23. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: [isoc-ny] Two NYC
  24. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  25. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  26. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  27. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  28. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  29. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  30. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  31. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Operating System Design
  32. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Re: Operating System Design
  33. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Re: Operating System Design
  34. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Re: Operating System Design
  35. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Re: Operating System Design
  36. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Re: Operating System Design
  37. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] (fwd) Re: Operating System Design
  38. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] algorithms pop tarts
  39. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] cgroups meeting
  40. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Compus Meeting
  41. 2015-02-04 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Essentail Database tools
  42. 2015-02-04 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] tony
  43. 2015-02-04 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [info-at-fsf.org: Gorgeous animated video against DRM]
  44. 2015-02-05 Tony Genao <tony.genao-at-my.liu.edu> Re: [LIU Comp Sci] tony
  45. 2015-02-05 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] tony
  46. 2015-02-05 Tony Genao <tony.genao-at-my.liu.edu> Re: [LIU Comp Sci] tony
  47. 2015-02-05 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] SOC assignment
  48. 2015-02-05 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [NYLXS - HANGOUT] Very Good Jobs
  49. 2015-02-07 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: why not use naked delete ?]
  50. 2015-02-07 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: why not use naked delete ?]
  51. 2015-02-07 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: why not use naked delete ?]
  52. 2015-02-08 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] Double Stacks
  53. 2015-02-08 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] Double Stacks
  54. 2015-02-08 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: =?utf-8?Q?=5B?=
  55. 2015-02-09 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Fwd: Invitation: cgroups and cgroups v2
  56. 2015-02-09 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] OS Design
  57. 2015-02-10 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Fwd: operating systems design
  58. 2015-02-10 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Student Computer Sciences Study Center
  59. 2015-02-10 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [info-at-meetup.com: Invitation: NYLUG Open hacker hours]
  60. 2015-02-10 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [info-at-meetup.com: Monday: Join 56 Rubyists at "Project Night"]
  61. 2015-02-11 Maneesh Kongara <maneeshkongara-at-gmail.com> Re: [LIU Comp Sci] Friday Morning Volunteer
  62. 2015-02-11 Ruben <ruben.safir-at-my.liu.edu> Re: [LIU Comp Sci] Friday Morning Volunteer
  63. 2015-02-11 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Friday Morning Volunteer
  64. 2015-02-11 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] tony
  65. 2015-02-11 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Friday Morning Volunteer
  66. 2015-02-11 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Friday Morning Volunteer
  67. 2015-02-11 Ruben <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Friday Morning Volunteer
  68. 2015-02-11 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Towers of Hanio
  69. 2015-02-12 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] NEtworking Class
  70. 2015-02-12 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Re: Operating Systems (CS_643_001_BK_SPRG2015): Next Meeting Friday
  71. 2015-02-12 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Friday Morning Volunteer
  72. 2015-02-12 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [announce-at-lists.isoc-ny.org: =?utf-8?Q?=5B?=
  73. 2015-02-12 mrbrklyn-at-panix.com Subject: [LIU Comp Sci] [dmarti-at-zgp.org: [linux-elitists] No results found for "social
  74. 2015-02-13 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Fwd: Re: Operating Systems (CS_643_001_BK_SPRG2015): Next Meeting
  75. 2015-02-15 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Friday Morning Volunteer
  76. 2015-02-15 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Re: Journal Article
  77. 2015-02-16 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Home Works
  78. 2015-02-17 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] OS Class Ctp 2 Dtrace
  79. 2015-02-18 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Hwk4 Allorithms
  80. 2015-02-18 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Recursive Allorithms
  81. 2015-02-19 From: "keisha.sylvester" <keisha.sylvester-at-my.liu.edu> RE: [LIU Comp Sci] Hwk4 Allorithms
  82. 2015-02-19 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Hwk4 Allorithms
  83. 2015-02-19 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Midterm Exams Samples
  84. 2015-02-20 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] a little C++ insite
  85. 2015-02-22 Ruben <ruben.safir-at-my.liu.edu> Re: [LIU Comp Sci] Binary tree Excersize
  86. 2015-02-22 Ruben <ruben.safir-at-my.liu.edu> Re: [LIU Comp Sci] Binary tree Excersize
  87. 2015-02-22 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Binary tree Excersize
  88. 2015-02-22 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Binary tree Excersize
  89. 2015-02-23 From: "keisha.sylvester" <keisha.sylvester-at-my.liu.edu> RE: Re: [LIU Comp Sci] Binary tree Excersize
  90. 2015-02-23 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Binary tree Excersize
  91. 2015-02-23 Keisha Sylvester <keisha.sylvester-at-my.liu.edu> Re: [LIU Comp Sci] Binary tree Excersize
  92. 2015-02-23 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Binary tree Excersize
  93. 2015-02-23 Ruben <ruben.safir-at-my.liu.edu> Re: [LIU Comp Sci] Binary tree Excersize
  94. 2015-02-23 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] scheduler resources
  95. 2015-02-23 Maneesh Kongara <maneeshkongara-at-gmail.com> Re: [LIU Comp Sci] Study Schedule for Tuesday
  96. 2015-02-23 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Study Schedule for Tuesday
  97. 2015-02-23 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Operating Systems Class on Friday
  98. 2015-02-23 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] scheduler resources
  99. 2015-02-23 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Study Schedule for Tuesday
  100. 2015-02-24 From: "keisha.sylvester" <keisha.sylvester-at-my.liu.edu> RE: Re: [LIU Comp Sci] Binary tree Excersize
  101. 2015-02-24 Ruben Safir <mrbrklyn-at-panix.com> Re: Re: [LIU Comp Sci] Binary tree Excersize
  102. 2015-02-24 From: "keisha.sylvester" <keisha.sylvester-at-my.liu.edu> RE: Re: [LIU Comp Sci] Study Schedule for Tuesday
  103. 2015-02-24 Maneesh Kongara <maneeshkongara-at-gmail.com> Re: [LIU Comp Sci] Binary tree Excersize
  104. 2015-02-24 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Binary tree Excersize
  105. 2015-02-24 Keisha Sylvester <keisha.sylvester-at-my.liu.edu> Re: [LIU Comp Sci] Study anyone??
  106. 2015-02-24 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Study anyone??
  107. 2015-02-25 Ruben <ruben.safir-at-my.liu.edu> Re: [LIU Comp Sci] Binary tree Excersize
  108. 2015-02-25 Ruben Safir <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Binary tree Excersize
  109. 2015-02-25 Keisha Sylvester <keisha.sylvester-at-my.liu.edu> Re: [LIU Comp Sci] Binary tree Excersize
  110. 2015-02-26 Ruben <mrbrklyn-at-panix.com> Re: [LIU Comp Sci] Binary tree Excersize
  111. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Campus
  112. 2015-02-26 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Fwd: [NYLXS - HANGOUT] Bios
  113. 2015-02-26 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Re: Fwd: [NYLXS - HANGOUT] Bios
  114. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  115. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  116. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  117. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  118. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  119. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  120. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  121. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  122. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  123. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  124. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  125. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Re: Role of functional dependencies in
  126. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [mrbrklyn-at-panix.com: (fwd) Role of functional dependencies in
  127. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [mrbrklyn-at-panix.com: (fwd) Re: [LIU Comp Sci] Need tutoring on
  128. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [mrbrklyn-at-panix.com: (fwd) Re: [LIU Comp Sci] Need tutoring on
  129. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [mrbrklyn-at-panix.com: (fwd) Re: [LIU Comp Sci] Need tutoring on
  130. 2015-02-26 Ruben Safir <mrbrklyn-at-panix.com> Subject: [mrbrklyn-at-panix.com: (fwd) Re: [LIU Comp Sci] Need tutoring on
  131. 2015-02-27 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] a hate this question
  132. 2015-02-27 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Allorithms Midterm
  133. 2015-02-27 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Read the FUCKING NOTES
  134. 2015-02-28 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Allgorithm Examination
  135. 2015-02-28 Ruben <ruben.safir-at-my.liu.edu> Subject: [LIU Comp Sci] Linked List Test Question
  136. 2015-02-28 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] Re: [NYLXS - HANGOUT] Read the FUCKING NOTES
  137. 2015-02-28 Ruben Safir <mrbrklyn-at-panix.com> Subject: [LIU Comp Sci] [prmarino1-at-gmail.com: Re: [NYLXS - HANGOUT] Read the FUCKING NOTES

NYLXS are Do'ers and the first step of Doing is Joining! Join NYLXS and make a difference in your community today!