Sunday, September 30, 2012
Collected PPT Materials on 30.09.2012
The ppts collected from the instructors & other sources are uploaded for you to download..
2. Computer Graphics - Part 1 -
3. Computer Graphics - Part 2 -
(Which includes Algorithm analysis and Design materials + C++ Programs also)
4. Computer Graphics - Part 3 -
VIJAY KRISHNAN S
Wednesday, September 26, 2012
E-Kalappai Tamil Unicode typing software
ekalappai supports various keyboards layouts to type tamil
currently following keyboards are supported
Tamil99
phonetic
Typewriter
Bamini
Inscript.
Download Here
Do Pdf - a PDF Printer
Download - HERE
Monday, September 24, 2012
Cinema Review remembered by my Father.
தரையில் சண்டை !
தண்ணீரில் சண்டை !
கத்தி சண்டை !
குத்துச் சண்டை !
கத்திக்கொண்டே சண்டை !
இது தான் ஆயிரத்தில் ஒருவன் திரைப்படம்..
இதைப்போல்.. தாய்வீடு.. MGR, கே.ஆர். விஜயா நடித்து வெளிவந்த திரைப்பட விமர்சனம்.
"இந்த படத்தில் நடித்தது நான்கு குட்டி யானைகள்...
கே.ஆர் விஜயாவுடன் சேர்த்து மொத்தம் ஐந்து..."
(தந்தை பகிர்ந்து கொண்டது...)
Friday, September 21, 2012
Blogspot-Airtel problem - Data Communication practical analysis
Blogspot-Airtel Problem: Our Analysis
To understand that – let’s break Internet connection into parts as per TCP/IP model
Next, in command prompt type – tracert blogspot.com and then send us the screenshot.
Wednesday, September 19, 2012
Key for the Assignment of Computer Architecture
Tuesday, September 18, 2012
One of My Favourite Bharthiyaar Song..!
Monday, September 17, 2012
Data Structure Materials...!
Assignment questions on Data Structures and Algorithm in C++
Download the data structures Questions
Download Here
The SECRET REVEALED
Saturday, September 15, 2012
Key for the Graphics and Multimedia
KEY FOR DATA COMMUNICATION AND NETWORK
Even though it's too late, i am uploading the key prepared for Data Communication and Networks your future reference. It will be very much useful for the University Examinations.
Friday, September 14, 2012
Key to Operating System Questions
KEEP SCROLLING DOWN AND SEE
Office 2003 - 2007 Compatibility pack
Thursday, September 13, 2012
Model Questions for Expected Subject.
2 Marks Q & A Prepared by Giri
GIRI IS STILL GROWING TO GREATNESS
Monday, September 10, 2012
Graphics and Multimedia Materials Scanned
DRDO Sponsored Seminar on 13th and 14th September
Powerpoint materials for Computer Netowrks and Operating system
Sunday, September 9, 2012
Data Structure PPTs collected in Internet
Question Pattern for Internal Exam 1
Monday, September 3, 2012
How to do Automatic Shutdown in Windows XP
Change Internet Explorer Title Bar
Address calculation of 2D array
CALCULATION OF ADDRESS IN 2D ARRAY
Date : 02.09.2012
Definition 2 D Array: A 2D array is an array in which each element is itself an Array.
For instance, an array A[M][N] is an M X N matrix.
Where : M = No. of rows
N = No. of Columns
M X N = No. of elements.
Implementation of 2-D Array : There are two way to store elements of 2-D array in Memory
1. Row Major - Where elements are stored row wise.
2. Column Major. Where elements are stored Column wise.
Finding The Location (address) of an element in 2-D array:
CASE : 1 . When elements are stored row wise:
Case 1.1 When lower bond is not given.
A[M][N] or A[M,N]
Address of A[I][J] or A[I,J] = B+ W[N( I)+J] .
M= Total No of Rows
N= Total No of Columns
I = Expected row
J = Expected Column
W = size of each element in byte.
Case 1.2 When lower bound is given.
A[Lr…Ur][Lc…Uc] or A[Lr : Ur , Lc : Uc]
Address of A[I][J] or A[I,J] = B+ W[N( I - Lr )+(J-Lc )] .
N= Uc – Lc + 1 (Total No of Columns )
I = Expected row
J = Expected Column
W = size of each element in byte.
Lr = Lower Bound of row
Lc= Lower Bound of column
Uc = Upper Bound of column
CASE : 2 . When elements are stored column wise:
Case 2.1 When lower bond is not given.
A[M][N] or A[M,N]
Address of A[I][J] or A[I,J] = B+ W[M(J)+I] .
M= Total No of Rows
N= Total No of Columns
I = Expected row
J = Expected Column
W = size of each element in byte.
Case 2.2 When lower bound is given.
A[Lr…Ur][Lc…Uc] or A[Lr : Ur , Lc : Uc]
Address of A[I][J] or A[I,J] = B+ W[( I - Lr )+M(J-Lc )] .
M= Uc – Lc + 1 (Total No of row)
I = Expected row
J = Expected Column
W = size of each element in byte.
Lr = Lower Bound of row
Lc = Lower Bound of column
Uc = Upper Bound of column
Basic Arithmetic Operation On 2 D Array.
-Addition
-Subtraction
-Multiplication
Simple comparison of TCP/IP and OSI Reference
Sr. No. | TCP/IP Reference Model | OSI Reference Model |
1 | Defined after the advent of Internet | Defined before advent of internet |
2 | Service interface and protocols were not clearly distinguished before | Service interface and protocols are clearly distinguished |
3 | TCP/IP supports Internet working | Internet working not supported |
4 | Loosely layered | Strict layering |
5 | Protocol Dependent standard | Protocol independent standard |
6 | More Credible | Less Credible |
7 | TCP reliably delivers packets, IP does not reliably deliver packets | All packets are reliably delivered |