John
P. Najarian,
Ph.D. in Computer Science (Homepage)
- Class Materials (for courses taught or
in progress)
|
- CS 130 Intro Programming in Visual BASIC
- CS 201 Computer and Info Technology
CS 210 Web Page and Site Design
CS 215 Computer and Info Tech for
Educators
- CS 230 Computer Science I
- CS 240 Computer Science II
CS 260 Discrete Structures
- CS 341 Digital Logic & Computer
Org.
- CS 342 Data Structures
- CS 345 Operating Systems
CS 350 Software Engineering
- CS 372 Design & Analysis of
Algorithms
- CS 382 Programming Languages
- CS 399 Special Topics
-
(Network & Dist.
OS, 1995)
- CS 399 Special Topics
-
(Game Programming,
2005)
CS 402 Numerical Methods
|
- CS 404 Computer Simulation
- CS 410 Artificial Intelligence
- CS 420 Compiler Construction
CS 440 Database Management
- CS 441 Computer Architecture
- CS 445 Theory of Computation
- CS 461 Computer Graphics
- CS 610 (NJIT Graduate Course)
-
Data Structures
and Algorithms
Math 202 (1999) Linear Algebra
WPU 101 First Year Seminar
No Longer Offered:
CS 235 Fortran Programming
CS 270 Computer Statistical Techniques
CS 330 Linear Prog. & Operations
Research
CS 462 System Simulation (Disc. &
Cont.)
|
Office:
Coach House 201 (Come, visit, stay a while, ...)
Telephone:
973-720-3383 (Email is faster, reliable &
documented. Avoid
voice-mail tag if possible.)
FAX:
973-720-2973 (only for
departmental work)
|
Note that meetings and other faculty responsibilities may cause
an occasional deviation
from this timetable. Meetings
often occur on Tues. &
Thurs. at 12:30-1:45PM.
Use this schedule to avoid known conflicting activities (as a
necessary
condition).
Also, before or after a
class session, genuinely-urgent issues could be addressed.
Interests:
- Theory of Computation
- 1. computational complexity
(abstract, middle-level, and "some" low-level)
- 2. models of computation
- 3. computability (0' and above)
- 4. formal languages (not the applied area)
- Artificial Intelligence
- 1. syntactic pattern recognition
& higher grammars
- 2. logic programming
- 3. representation & search strategies
4. alternate computational models (connectionist and
neural net models)
5. automated theorem proving
- Computer Graphics
- 1. generative models
- 2. L-systems, fractals, and other abstract
representations
- 3. computer game design
- 4. ...
- Algorithmics (Analysis (first) and Design) and Modelling
Other Interests: Operations Research, other
areas of Computer Science,
Mathematics (Algebra, not Analysis),
Sciences
in general, Reading, ...
Ponderings and rules by which to live:
The word "should" embodies a spectrum of semantics.
Reversing time could correct the past but consider achieving the
equivalent by
living forward optimally.
Each moment leads to infinitely many next states and therefore
equipollent quantum realities, so choose wisely.
The triumph of foresight over regret avoids the paradoxes and saves
both effort and anguish.
As the R.E. is the limit of the recursive, so in seeking virtue to the
limit is perfection.
Study without bound and be rewarded bountifully. Do
Good to all and do it well.
When faced with the opportunity to make a false boast, instead, make
that
statement a reality and then nothing need be said.
Happiness is a state of
mind. Stop trying to seek it as a causal consequence of
externalities.
Just choose to be happy. No effort is required. Was it so
hard to just smile and avoid stress's medical and analyst's
bills.
In the final analysis,
mind prevails over matter... unless you choose otherwise.
