Microsoft Networking Essentials.                      Back To Resume

Distinguish network components and the appropriate network type for a given site

Identify and determine how to use different networking media

Distinguish standards, protocols, and access methods--and those most suitable for a given network

Understand architectures and which is best for a given proposed network

Identify network operating systems' functions and distinguish centralized from client/server environments

Determine how to implement and support major components--server, OS, clients, and others

Propose a system of security for a given network's data and components

Identify LANs and WANs and the components for expanding a LAN into a WAN

Determine how to implement modems in the LAN/WAN environment

Apply LAN support resources in troubleshooting

 

 

Implementing & Supporting Microsoft Windows NT Server 4      Back To Resume        

Install Windows NT 4.0

Configure the environment

Create and implement system policies

Implement and manage file systems and fault-tolerant volumes

Manage applications using Windows NT Task Manager

Install and configure network transport protocols, network services, Remote Access Server (RAS), Microsoft Internet Information Server, Services for NetWare, and Services for the Macintosh®

Install client software

Implement and troubleshoot directory replication and use file synchronization

Diagnose and resolve problems using Windows NT troubleshooting tools

Create and administer user and group accounts

Troubleshoot logon problems

Plan and manage resource sharing

Set up and administer permissions for files and folders

Set up, administer, and troubleshoot a printing environment

Use auditing functions to generate and view security logs

Monitor resources to obtain key information about network and computer resources

Use tapes to back up and restore files and folders

 

 

 

Implementing & Supporting Microsoft Windows NT Server 4.0 in the Enterprise.                                                               Back To Resume

Design and implement an optimization and performance strategy

Increase network performance and capacity by analyzing client-to-server and server-to-server traffic and by predicting traffic and optimizing traffic in peak hours

Create a measurement database

Plan and deploy a Directory Services structure

Identify files used in the Windows NT load sequence

Repair damaged files, interpret error messages, and use Kernel Debugger

Trace system dependencies for devices and services using the Registry

Plan for and implement a multidomain Windows NT network

 

 

Implementing & Supporting Microsoft Windows NT4 Workstation   Back To Resume

Install & configure NT4 Workstation & choose appropriate file system ( NTFS, FAT)

Set up a dual - boot system

Install and configure hardware components (e.g. Network Adapter drivers)

Configure server based installation for a wide scale development in a given situation

Set up and modify user profiles

set up permissions on NTFS partitions, folders and files

configure and install Dial-up Networking 

Troubleshoot boot process failure

Troubleshoot print job failure

Troubleshoot user login failure

 

 

 

 

Internetworking with Microsoft TCP/IP on Microsoft Windows NT4   Back To Resume

Install and configure Microsoft TCP/IP

Test a TCP/IP configuration using utilities such as PING and IPCONFIG

Define a custom subnet mask and define a range of valid IP addresses

Configure a Windows NT 4.0 server to function as an IP router

Install and configure a DHCP relay agent

Install and configure a WINS serve

Install and configure a DNS server

Install an FTP server, configure TCP/IP Network Printing Support, and connect to foreign hosts such as UNIX

Troubleshoot an IP network using TCP/IP utilities

 

 

Internet Information Server (IIS 4.0).                               Back To Resume

Installation

Configuration

Architecture

Security

Supporting features, including Open Database Connections (ODBC), Active Server pages, virtual servers and directories, site analyst, usage analyst, and transaction server

 

 

 

 

1992 - 1996 University of Kentucky , Lexington, Kentucky, United States

Bachelor of Science in Mechanical Engineering with Honors

1995 - AutoCAD                                                                   Back To Resume

Basic Engineering Graphics involves the use of basic engineering drawing equipment with freehand sketching and use of a micro-computer graphics workstation in the study of orthographic projection, auxiliary view projection, section views, pictorial drawing, with introduction to dimensioning and tolerance.

 

 

Statistical Analysis & Research Methodology              Back To Resume

DYNAMIC ANALYSIS OF DESIGN PROBLEMS.
A course emphasizing the role of analysis in design. Actual design objectives are met through the use of mathematical modeling techniques and the application of the principles of dynamics, kinematics and vibrations.

 

COMPUTER-AIDED GRAPHICS AND DESIGN.
Development of computer graphics and interactive graphics methods and applications to problem solving and design practices. Emphasis on graphics principles, data management, interactive programming, and integrated analysis/design.

 

Laboratory Procedures                                                       Back To Resume

ENGINEERING EXPERIMENTATION I.
An instrumentation laboratory to provide the student with an understanding of the characteristics and application of instrumentation related to basic measurements in mechanical engineering. Design and planning of experiments. Uncertainty analysis. Principles and application of technical writing and information retrieval.

 

ENGINEERING EXPERIMENTATION II.
A laboratory to instruct the student in the performance of basic mechanical engineering components and systems. Performance of experiments, application of theory and reporting. Introduction to experimentation. Introduction to error analysis.

 

Minor : Computer Science                                                  Back To Resume

Introduction to Numerical Methods
Floating point arithmetic. Numerical linear algebra; elimination with partial pivoting and scaling. Polynomial and piecewise interpolation. Least squares approximation. Numerical integration. Roots of nonlinear equations. Ordinary differential equations. Laboratory exercises using software packages available at computer center

 

Algorithm Design and Analysis
Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.

 

Introduction to Program Design, Abstraction, and Problem Solving
The course covers introductory object-oriented problem solving, design, and programming engineering. Fundamental elements of data structures and algorithm design will also be addressed. An equally balanced effort will be devoted to the three main threads in the course: concepts, programming language skills, and rudiments of object-oriented programming and software engineering.

 

Introduction to Software Engineering
Software engineering topics to include: life cycles, metrics, requirements specifications, design methodologies, validation and verification, testing, reliability and project planning. Students will study and practice use of object-oriented design techniques and software tools in a modern development environment. Implementation of large programming projects will be stressed.

 

Discrete Mathematics
Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions, Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees

 

1994-96 C++ Programming                                                  Back To Resume

Algorithm Design and Analysis
Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.

Introduction to Program Design, Abstraction, and Problem Solving
The course covers introductory object-oriented problem solving, design, and programming engineering. Fundamental elements of data structures and algorithm design will also be addressed. An equally balanced effort will be devoted to the three main threads in the course: concepts, programming language skills, and rudiments of object-oriented programming and software engineering.

Discrete Mathematics
Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions, Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees

Introduction to Software Engineering
Software engineering topics to include: life cycles, metrics, requirements specifications, design methodologies, validation and verification, testing, reliability and project planning. Students will study and practice use of object-oriented design techniques and software tools in a modern development environment. Implementation of large programming projects will be stressed.

 

 

1994-96 File Processing & Data Structure                         Back To Resume

Algorithm Design and Analysis
Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.

Introduction to Program Design, Abstraction, and Problem Solving
The course covers introductory object-oriented problem solving, design, and programming engineering. Fundamental elements of data structures and algorithm design will also be addressed. An equally balanced effort will be devoted to the three main threads in the course: concepts, programming language skills, and rudiments of object-oriented programming and software engineering.

Discrete Mathematics
Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions, Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees