Java, OOPS and Networking Protocols
Topic : Basics of Java, OOPS and Networking Protocols
Venue and audience : At a Professor’s house , his daughter who
finished engineering
Date: 24-09-2006
Resources used: IBM GREATMINDS CD and notes of my friend
Java Basics:à
With the Java(TM) programming language, every computer program must define one or more user-defined data types via the class construct. For example, to create a program that behaves like a dog, we can define a class that (minimally) represents a dog: class Dog { void bark() { System.out.println("Woof."); }}
This user-defined data type begins with the keyword class, followed by the name for the data type, in this case, Dog, followed by the specification of what it is to be a dog between opening and closing curly brackets. This simple example provides no data fields, only the single behavior of barking, as represented by the method bark().
A method is the object-oriented equivalent of a procedure in nonobject-oriented languages. That is, a method is a program construct that provides the mechanism (method) for performing some act, in this case, barking. Given an instance of some entity, we invoke behavior with a dot syntax that associates an instance with a method in the class definition
Creating a class instance
public class ADogsLife { public static void main(String[] args) { Dog dog = new Dog(); dog.bark(); System.exit(0); }}
Method overloading
class Dog { void bark() { System.out.println("Woof."); } void bark(String barkSound) { System.out.println(barkSound); }}
Method overloading
Methods have same name but perform different operations
public class DogChorus { public static void main(String[] args) { Dog fido = new Dog(); Dog spot = new Dog(); fido.bark(); spot.bark("Arf. Arf."); fido.bark("Arf. Arf."); System.exit(0); }}
int sum(int a, int b,int c)
{
c= a+b;
return c;
}
Instance variables(barksound is instance variable) class Dog { String barkSound = new String("Woof."); void bark() { System.out.println(barkSound); } void bark(String barkSound) { System.out.println(barkSound); }}
class
class is a template which specifies the structural information about the real world
class classname
{ type var;
}
returntype method( parameter)
{
…..
}
objects
to access members of a class an object must be defined. When object is created memory will be allocated
constructor
constructor is a method with the class name that will be executed when you create the object
the difference between constructor and method is that constructor can not return value but method can return value
class xyz
{
xyz()
{
sop(“object created”);
}
}
class abc
{
xyz obj;
obj = new xyz;
}
Abstraction
Access Methods
In order for the value of an instance variable to vary over time, we must supply a method to change its value; such a method is typically referred to as an access method. By convention, a method that's provided simply to affect a change to an instance variable's value begins with the word "set": void setBark(String barkSound) { this.barkSound = barkSound; }
public class DogChorus { public static void main(String[] args) { Dog fido = new Dog(); fido.setBark("Ruff."); fido.bark(); System.exit(0); }}
this.barkSound = barkSound;
replaces the current value of the instance variable (this.barkSound with the new value passed as an argument (barkSound) to setBark().
Garbage collection finalize method free() new delete
Whatever is the purpose of malloc(), calloc(), free(), realloc() in C i.e. dynamic
memory allocation or during runtime same is the purpose of new and delete in C++ and garbage collector and new in Java while finalize is a method which is invoked before garbage collection.
Applets
The Java(TM) programming language is powerful and elegant. Ironically, however, many people think of it only in terms of its use for developing applets. In reality, the Java programming language is becoming the language of choice for a broad range of other development areas. Nevertheless, applets play an role important in many intranet environments because they provide an (elegant) way of implementing Web-based user interfaces to enterprise-wide computing services.
An applet is an instance of a user-defined class that specializes (inherits from) Applet (java.applet.Applet). Class inheritance is beyond the scope of this tutorial, but, for now, to specialize a class is to extend its capabilities. Applet is a placeholder class with an empty paint() method. Thus, to develop a minimal applet that displays in a portion of a Web browser window, you implement a paint() method that renders graphical output.
Applets employ the Java Abstract Windowing Toolkit (AWT) for the Graphics class, which provides drawing primitives, as well as for GUI components such as Button and TextField. With these components it's straightforward to design graphical forms-entry utilities that corporate-wide users access from a Web browser.
Although applet programmers often develop task-specific implementations of several methods such as init(), start(), stop() that control the applet lifecycle in the browser window, a minimal example with init() and paint() is sufficient here. DogApplet.java implements a simple applet that renders a graphical barking message: import java.awt.*;import java.applet.Applet;public class DogApplet extends Applet { public void init() { setBackground(Color.pink); } public void paint(Graphics g) { g.drawString("Woof!", 10, 20); }}
init() set the background to an uncommon color to ensure that its allocated browser window area is visible. Java-enabled Web browsers execute init() only once, and prior to other methods. paint() uses the Graphics instance, passed as an argument by the browser environment, to draw a string at coordinates (10, 20) relative to the applet's window area.
To specify an applet in a Web page, you must provide an HTML applet tag that specifies the class file (code="class-file") and its relative location (codebase="location"), as well as a width and height request for the applet's window area relative to other components in the Web page. For example, this document includes the following applet tag:
In processing this tag the Web browser:
Loads the DogApplet class file
Allocates its area in the window
Instantiates DogApplet
Executes prescribed methods such as init()
DogApplet appears as follows:
.
public static void main()
main() -à starting point of the program
static-àobject need not be created
public --à can access anywhere
encapsulation
it means wrapping of data into a single unit to hide or to safeguard from the outside world.
It means combining elements to create a new entity
A procedure, a class, a record are an example of encapsulation
encapsulation means that the attributes (data) and the behaviors (code) are encapsulated in to a single object.
class CheckingAccount {
private double balance = 0;
public void setBalance(double bal) {
balance = bal;
};
public double getBalance(){
return balance;
};
}
class Encapsulation {
public static void main(String args[]) {
System.out.println("Starting myEncapsulation...");
CheckingAccount myAccount = new CheckingAccount();
myAccount.setBalance(40.00);
System.out.println("Balance = " + myAccount.getBalance());
}
}
data hiding one of the features of encapsulation
class Encapsulation {
public static void main(String args[]) {
System.out.println("Starting myEncapsulation...");
CheckingAccount myAccount = new CheckingAccount();
myAccount.balance = 40.00;
System.out.println("Balance = " + myAccount.getBalance());
}
}
public private protected are the access specifiers
Inheritance where in specific classes derive attributes from general classes
From Base class/super class attributes are derived by sub class, extends keyword is used to achieve inheritance in Java
Inheritance is used for reusability of code.
Class A
{
…….
}
class B extends A
{
……..
}
class A
{
int x;
int y;
int Add(int I, int j)
{
x=I;
y=j;
return(x+y)
}}
class B extends A
{
int z;
add(int I, int j, int k)
{
x=I;
y=j;
z=k;
s.o.p)x+y+z);
}
}
pvsm()
{
A objA = new A();
B objB = new B();
s.o.p(obj.Add(2,3));
}
method
a function that is part of a class
constructor
a special method that is called when an object is created
superclass
the class that is inherited from (the parent class)
subclass
the class the does the inheriting (the child class)
extends
in Java the keyword extends means that a class will inherit from another class
overload
a method is overloaded if there are two or more methods with the same name in a class. Each overloaded method has a different set of parameters. That's how you can tell which one will get called.
override
a method is overridden if there is a method in the subclass that has the same name and the same set of parameters. The superclass method is then NOT inherited
Multiple inheritance is achieved thru interfaces.
This continued and ended with a brief overview of protocols like TCP/IP, ARP/RARP, DHCP, ICMP/IGMP, RIP/OSPF/BGP, DNS, WEB APPLICATIONS, MVC ARCHITECTURE, LAMP/MAMP/WIMP, LUCID, RAD, SOA etc.
Monday, January 15, 2007
CPM FAQs
CPM FAQs
Topic : CPM FAQs
Venue: Newtons College of Engg. macharla
Audience: Final year engg. Students facing campus
placement interviews
Objectives: Make them aware of all the interview rounds,
concepts of C, C++, DBMS, Networking
Date: 24-08-2006
Resources used: Downloads from chetanas, vyoms, schaum's
series for C and Data structures
1. A TEST ON C was conducted. The pattern was 30 questions 30 min
2. SOME PLACEMENT SCENARIOS WERE EXPLAINED LIKE
A. CPM B. IN CAMPUS C. COMPANIES
3. C BASICS were covered.
4. C++ BASICS by MY collegue Mr. radhesham
5. CN BASICS by me
6. WEBSITES like chetanas, vyoms etc were mentioned
2. SOME SCENARIOS of placements!!!
2A. CPM 2B. IN CAMPUS 2C. COMPANIES
2A. CPM 2A.1. Written Examination 2A.2. Technical Round
2A.3. H R Round 2A.4. GD 2A.1. Written Examination 2A.1.1. Analytical/Aptitude Test 2A.1. 2.Verbal Test 2A.1. 3.Technical Test
2A.1.1. Analytical/Aptitude Test Blood Relation Problems
Percentage Problem
Train Problems
Distance Problems
Maths and Probability Problems
9) Worker W produces n units in 5 hours. Workers V and W, worker independently but at the same time, produce n units in 2 hours. how long would it take V alone to produce n units? a) 1 hr 26 min b) 1 hr 53 min c) 2 hr 30 min d) 3 hr 30 min e) 3 hr 20 min ans: d (e)
Profit and loss
Pick the odd man out
Data interpretation
Data sufficiency
A if only (1) is sufficent. B if only (2) is sufficient. C if either is sufficient. D if both are sufficient. E data insufficient. 11. What fraction of his salary did Mr. Johnson put into savings last week ? 1) Last week Mr.Johnson put Rs 17 into savings. 2) Last week Mr.Johnson put 5% of his salary into savings. (A) (B) (C) (D) (E) ans. B.) only 2nd.
2A.1. 2.Verbal Test Basic vocabulary Missing Spellings,Synonyms,Antonyms,
Meanings of words like Plethora, Elude
Resources !!!
AGARWALS VERBAL AND NON-VERBAL
REASONING
www.mathsworld.com
2A.1. 3.Technical Test i. for(i=0;;i++) /* for is entry controlled loop*/ { printf(“hello”);}/* for(empty;empty;empty) true*/ a. hello… b. infinite loop c. hello d. error c constructs :- sequence, selection, Iteration(for known iterations,while,do while), Jump loops, stmt:-expr, compound, control stmts(sentinel control vs counter control)
Which of the following is true of the following program main() { char *c; int *ip; c =(char *)malloc(100);/*dynamic memory allocation malloc(),calloc()*/ ip=(int *)c; /*instead of a[200] malloc(0 reserves a block of free(ip); /* memory*/ } ans: The code functions properly releasing all the memory allocated
main() {enum Months {JAN =1,FEB,MAR,APR}; Months X = JAN; if(X==1) {printf("Jan is the first month");}} a) Does not print anything b) Prints : Jan is the first month c) Generates compilation error d) Results in runtime error Answer: b) Prints : Jan..
enum is a data type
Storage class enum tag var1, var2, …,var n;
Storage class enum tag {member1, member2, …, membern;
Variables can be characterized by their data types and storage classes.storage classes refer to permanence of a variableand its scope within the program
Auto, extern, static, register
Auto is declare within a function and its scope is within the function
Extern suitable to transfer data betn two functions,global variables,f1 int I, j, f2 extern int I, j
Static permanent var within a function
Main(){incre();incre();incre();}incre(){char var=65; print var++ is 65 65 65
Main(){incre();incre();incre();}incre(){char var=65; print var++ is 65 66 66
Register faster operations, like auto but dynamic
main() {int l=6; switch(l) { default : l+=2; case 4: l=4; case 5: l++; break;} printf("%d",l); } a)8 b)6 c)5 d)4 e)none Answer : c)5
ii. IEEE standards cn session by rajesh kulkarni
iii. Ethernet Standards
iv. 8086 microprocessor
v. Pointers
2A.2. Technical Round
Virtual functions session by radhesham
Loop
Tree traversal techniques
It is a nonlinear data structure
Tree is finite set of one or more data items(nodes) such that there is a special data
item called root of the tree and its remaining data items are partitioned into number
of mutually exclusive subsets each of which is called as a subtree
Terminology :- root, node, degree of a node is the number of subtrees of a node in a
given tree,degree of a tree is the maximum degree of nodes in a given tree, nodes with
zero degree are called as ,levels,edge is connecting line,depth is the maximum level
of a tree ,Binary tree is either empty or consist of root and two disjoint binary trees
called left subtree and right subtree,maximum degree of any node in a binary tree is at
most two preorder traversal :- root, left, right
Inorder traversal :- left, root, right
postorder traversal :- left, right, root
Search techniques
Searching refers to the operation of finding the location of an item from a list.
The method which traverses the item sequentially is called linear search.
LINEAR(DATA,N,ITEM,LOC):- COMPARE DATA WITH ITEM, IF
ITEM=DATA[N+1]
BINARY SEARCH:- synonymous to telephone directory
DATA[BEG], DATA[BEG+1], … DATA[END],
MID=(INT(BEG+END)/2)
IF DATA[MID]= ITEM SEARCH IS SUCCESSFUL
IF ITEM < DATA[MID] THEN END:=MID-1 AND REPEAT
IF ITEM > DATA[MID] THEN BEG:=MID+1 AND REPEAT
HASHING :- NO COMPARISONS,LOCATION OF A DESIRED RECORD IS
COMPUTED IN ORDER TO RETRIEVE IT IN A SINGLE ACCESS FOR
EXAMPLE SUDENT RECORDS ROLL NO IS KEY WHICH CAN ACT AS AN
INDEX, HASH TABLEàBUCKETSàRECORDS HASH FUNCTION
Complexity of Algorithms
Analysis, comparison, measuring the efficiency of algorithms. M is an algorithm and
N is the size of the input data. The time and space used by the algorithm M are the
two main measures for the efficiency of M.The time is measured by counting the
number of key operations-in searching and sorting algorithms, for example, the
number of comparisons. The space is measured by counting the maximum of memory
needed by the algorithm. The complexity of an algorithm M is the function f(n) which
gives the running time and/or storage space requirement of the algorithm in terms of
the size n of the input data.
Worst case, average case, best case
Rate of growth of complexity. Logn, n, nlog n, n2,n3…,2n
Difference between structures and unions
Functions call by value and call by reference
Oops concepts
WAP to find whether a number is prime or not Sorting techniques
Quick sort, Insertion sort, Selection sort, Bubble sort,Stacks,Queues,Circular Queue, DBMS queries, Primary key, super key, candidate key, normalization
What is an Entity? It is a 'thing' in the real world with an independent existence.
What is an Entity type?
It is a collection (set) of entities that have same attributes.
What is an Entity set?
It is a collection of all entities of particular entity type in the database
What is the use o UML
2A.3. H R Round
Talk about CHICKEN GUNIYA
Why you want to join this job? why u want to do job than studiesHow many days will you work with our organisation
Why you should be considered for this job
What will be your contribution to the organisation
If the company says your team has done excellent work what will be your reaction
Why your percentage is decreasing?
Your hobbies and extracurricular activities
What are your weaknesses, strengths?
Tell about your family background
Tell the story of a movie in exactly twenty minutes, again same story in 3 minutes
2A.4. Group discussion
feedback…
Topic : CPM FAQs
Venue: Newtons College of Engg. macharla
Audience: Final year engg. Students facing campus
placement interviews
Objectives: Make them aware of all the interview rounds,
concepts of C, C++, DBMS, Networking
Date: 24-08-2006
Resources used: Downloads from chetanas, vyoms, schaum's
series for C and Data structures
1. A TEST ON C was conducted. The pattern was 30 questions 30 min
2. SOME PLACEMENT SCENARIOS WERE EXPLAINED LIKE
A. CPM B. IN CAMPUS C. COMPANIES
3. C BASICS were covered.
4. C++ BASICS by MY collegue Mr. radhesham
5. CN BASICS by me
6. WEBSITES like chetanas, vyoms etc were mentioned
2. SOME SCENARIOS of placements!!!
2A. CPM 2B. IN CAMPUS 2C. COMPANIES
2A. CPM 2A.1. Written Examination 2A.2. Technical Round
2A.3. H R Round 2A.4. GD 2A.1. Written Examination 2A.1.1. Analytical/Aptitude Test 2A.1. 2.Verbal Test 2A.1. 3.Technical Test
2A.1.1. Analytical/Aptitude Test Blood Relation Problems
Percentage Problem
Train Problems
Distance Problems
Maths and Probability Problems
9) Worker W produces n units in 5 hours. Workers V and W, worker independently but at the same time, produce n units in 2 hours. how long would it take V alone to produce n units? a) 1 hr 26 min b) 1 hr 53 min c) 2 hr 30 min d) 3 hr 30 min e) 3 hr 20 min ans: d (e)
Profit and loss
Pick the odd man out
Data interpretation
Data sufficiency
A if only (1) is sufficent. B if only (2) is sufficient. C if either is sufficient. D if both are sufficient. E data insufficient. 11. What fraction of his salary did Mr. Johnson put into savings last week ? 1) Last week Mr.Johnson put Rs 17 into savings. 2) Last week Mr.Johnson put 5% of his salary into savings. (A) (B) (C) (D) (E) ans. B.) only 2nd.
2A.1. 2.Verbal Test Basic vocabulary Missing Spellings,Synonyms,Antonyms,
Meanings of words like Plethora, Elude
Resources !!!
AGARWALS VERBAL AND NON-VERBAL
REASONING
www.mathsworld.com
2A.1. 3.Technical Test i. for(i=0;;i++) /* for is entry controlled loop*/ { printf(“hello”);}/* for(empty;empty;empty) true*/ a. hello… b. infinite loop c. hello d. error c constructs :- sequence, selection, Iteration(for known iterations,while,do while), Jump loops, stmt:-expr, compound, control stmts(sentinel control vs counter control)
Which of the following is true of the following program main() { char *c; int *ip; c =(char *)malloc(100);/*dynamic memory allocation malloc(),calloc()*/ ip=(int *)c; /*instead of a[200] malloc(0 reserves a block of free(ip); /* memory*/ } ans: The code functions properly releasing all the memory allocated
main() {enum Months {JAN =1,FEB,MAR,APR}; Months X = JAN; if(X==1) {printf("Jan is the first month");}} a) Does not print anything b) Prints : Jan is the first month c) Generates compilation error d) Results in runtime error Answer: b) Prints : Jan..
enum is a data type
Storage class enum tag var1, var2, …,var n;
Storage class enum tag {member1, member2, …, membern;
Variables can be characterized by their data types and storage classes.storage classes refer to permanence of a variableand its scope within the program
Auto, extern, static, register
Auto is declare within a function and its scope is within the function
Extern suitable to transfer data betn two functions,global variables,f1 int I, j, f2 extern int I, j
Static permanent var within a function
Main(){incre();incre();incre();}incre(){char var=65; print var++ is 65 65 65
Main(){incre();incre();incre();}incre(){char var=65; print var++ is 65 66 66
Register faster operations, like auto but dynamic
main() {int l=6; switch(l) { default : l+=2; case 4: l=4; case 5: l++; break;} printf("%d",l); } a)8 b)6 c)5 d)4 e)none Answer : c)5
ii. IEEE standards cn session by rajesh kulkarni
iii. Ethernet Standards
iv. 8086 microprocessor
v. Pointers
2A.2. Technical Round
Virtual functions session by radhesham
Loop
Tree traversal techniques
It is a nonlinear data structure
Tree is finite set of one or more data items(nodes) such that there is a special data
item called root of the tree and its remaining data items are partitioned into number
of mutually exclusive subsets each of which is called as a subtree
Terminology :- root, node, degree of a node is the number of subtrees of a node in a
given tree,degree of a tree is the maximum degree of nodes in a given tree, nodes with
zero degree are called as ,levels,edge is connecting line,depth is the maximum level
of a tree ,Binary tree is either empty or consist of root and two disjoint binary trees
called left subtree and right subtree,maximum degree of any node in a binary tree is at
most two preorder traversal :- root, left, right
Inorder traversal :- left, root, right
postorder traversal :- left, right, root
Search techniques
Searching refers to the operation of finding the location of an item from a list.
The method which traverses the item sequentially is called linear search.
LINEAR(DATA,N,ITEM,LOC):- COMPARE DATA WITH ITEM, IF
ITEM=DATA[N+1]
BINARY SEARCH:- synonymous to telephone directory
DATA[BEG], DATA[BEG+1], … DATA[END],
MID=(INT(BEG+END)/2)
IF DATA[MID]= ITEM SEARCH IS SUCCESSFUL
IF ITEM < DATA[MID] THEN END:=MID-1 AND REPEAT
IF ITEM > DATA[MID] THEN BEG:=MID+1 AND REPEAT
HASHING :- NO COMPARISONS,LOCATION OF A DESIRED RECORD IS
COMPUTED IN ORDER TO RETRIEVE IT IN A SINGLE ACCESS FOR
EXAMPLE SUDENT RECORDS ROLL NO IS KEY WHICH CAN ACT AS AN
INDEX, HASH TABLEàBUCKETSàRECORDS HASH FUNCTION
Complexity of Algorithms
Analysis, comparison, measuring the efficiency of algorithms. M is an algorithm and
N is the size of the input data. The time and space used by the algorithm M are the
two main measures for the efficiency of M.The time is measured by counting the
number of key operations-in searching and sorting algorithms, for example, the
number of comparisons. The space is measured by counting the maximum of memory
needed by the algorithm. The complexity of an algorithm M is the function f(n) which
gives the running time and/or storage space requirement of the algorithm in terms of
the size n of the input data.
Worst case, average case, best case
Rate of growth of complexity. Logn, n, nlog n, n2,n3…,2n
Difference between structures and unions
Functions call by value and call by reference
Oops concepts
WAP to find whether a number is prime or not Sorting techniques
Quick sort, Insertion sort, Selection sort, Bubble sort,Stacks,Queues,Circular Queue, DBMS queries, Primary key, super key, candidate key, normalization
What is an Entity? It is a 'thing' in the real world with an independent existence.
What is an Entity type?
It is a collection (set) of entities that have same attributes.
What is an Entity set?
It is a collection of all entities of particular entity type in the database
What is the use o UML
2A.3. H R Round
Talk about CHICKEN GUNIYA
Why you want to join this job? why u want to do job than studiesHow many days will you work with our organisation
Why you should be considered for this job
What will be your contribution to the organisation
If the company says your team has done excellent work what will be your reaction
Why your percentage is decreasing?
Your hobbies and extracurricular activities
What are your weaknesses, strengths?
Tell about your family background
Tell the story of a movie in exactly twenty minutes, again same story in 3 minutes
2A.4. Group discussion
feedback…
Current Trends In Software Industry… Rethinking The Future… Insight in to CSE and IT Dept…
study circle biet 16-12-06
Current Trends In Software Industry… Rethinking The Future… Insight in to CSE and IT Dept…
Rajesh Kulkarni
http://children-off-lesser-gods.blogspot.com
http://360.yahoo.com/rkpv2005
Venue:Study circle biet audience: all staff 16-12-06
SOA SERVICE ORIENTED ARCHITECTURE
Web services such as SOAP and REST permit interoperability among different platforms such as .net and java
SOX COMPLIANCE
SERBANESE OXLEY REGULATORY EDICT AND PRIVACY LAWS
SIX SIGMA
METHOD FOR ELIMINATING DEFECTS 3.4 DEFECTS PER MILLION OPPORTUNITIES
BS7799
Information Security Management Systems - Guidelines for Information Security Risk Management
LAMP LINUX APACHE MYSQL perl/PHP/PYTHON
Apache is open source web server used for web applications, dynamic content generation
Mysql is the database component
Accessed thru APIs written in ruby,perl,lisp,c# or thru ODBC connectivity
PHP HYPERTEXT PROCESSOR
Server side scripting language for dynamic web page generation
PYTHON dynamically typed interpreted programing language used by google
Perl is a dynamic interpreted programming language
LAMP WAMP MAMP
.net framework àc# àaspàiis serverànative server
javaàservletsàjspàscripletsàweb serveràweblogic
Technocentric vs LUCIDàusabilityàReusability
Technologyà web applnsàhtml,cgi,servlets,jsp,asp,xml,ejb Interfaceà cli, gui, hci, cgi
MY FATHER … ME…MY DAUGHTER
TECHNOCENTRIC…..LUCID
Rapid Prototype Development iterative refinement model and incremental model
TechnocentricàLUCIDàevaluationàTestingàUser Acceptance TestàUsabilityàEthnography.
Eclipse Eclipse SDK=Java JDT + PDE
It is a platform which provides services necessary for integrating software development tools which are implemented as pluggins
TIVOLI client server appln, storage manager, intelligent backups
DB2 database
DB2 Express-C :- replication, warehouse management
WASCE:- websphere appln sever community edition
PRESENT
INTERNET JUNKEYS
ORKUT
YOUTUBE-$1.775 BILLIONS
BLOG
VIRTUAL COMMUNITIES
FUTURE
CYBORG
WASHING MACHINE
ROBOT OF CSE HOD
MOBILE
VIRTUAL REALITY
RETHINKING THE FUTURE
OUR COLEGE HAS A MISSION AND VISION OF BECOMING A HEALTHY COLLEGE, NBA ACCREDITATION
IT IS BLESSED WITH VISIONARIES LIKE SECRETARY, PRINCIPAL, DEAN, HOD EEE, HOD ECE
INSIGHT INTO CSE AND IT DEPT
• OBJECTIVE
EFFORTS TOWARDS healthy academics
• CDD
• CRs meet last meeting on 09-nov-2006
• Weekly meets last meeting on 14-dec-2006
• Counsellor files- monthly audit on 8th and 22nd
• KRAs=2R+1NR
magazines
• Prayaas
• Akruthi
Lab management
• Lab service head – Nagaraju
– LIC LAB1-Ms. Vasantha
– LIC LAB2-Ms. Babitha
– LIC LAB3-Ms. Krishnaveni
– LIC development lab-Mr. Sriharikumar
– LIC ITworkshop-Mr. Raghavendra
ONLINE EXAMS
• ONLINE COORDINATOR- S.ANAND
– ONLINE TECHNICAL
• K.SRINIVAS
– RADHESHAM
– RAJESH
– PAVAN
– DEPARTMENTAL COORDINATORS
• MS. LENINA, MS.REVATHI, MR. RANA, MR.MECH
STUDENT MANAGEMENT
• CR
• SR
• DISCO
• ALLCOM
• PCOM
• WEBR
• SDR
FREQUENT GETTOGETHERS
• FAREWELLTO MR. KRANTHIKIRAN KranthiKiranBIETCSITHODFarewelll.htm
• FIESTA LUNCH
• FIESTADSC00876.JPG
• FIESTADSC00885.JPG
• FIESTADSC00878.JPG
• FIESTADSC00899.JPG
REQUIREMENT
• BATTERY OPERATED TROLLEY
Current Trends In Software Industry… Rethinking The Future… Insight in to CSE and IT Dept…
Rajesh Kulkarni
http://children-off-lesser-gods.blogspot.com
http://360.yahoo.com/rkpv2005
Venue:Study circle biet audience: all staff 16-12-06
SOA SERVICE ORIENTED ARCHITECTURE
Web services such as SOAP and REST permit interoperability among different platforms such as .net and java
SOX COMPLIANCE
SERBANESE OXLEY REGULATORY EDICT AND PRIVACY LAWS
SIX SIGMA
METHOD FOR ELIMINATING DEFECTS 3.4 DEFECTS PER MILLION OPPORTUNITIES
BS7799
Information Security Management Systems - Guidelines for Information Security Risk Management
LAMP LINUX APACHE MYSQL perl/PHP/PYTHON
Apache is open source web server used for web applications, dynamic content generation
Mysql is the database component
Accessed thru APIs written in ruby,perl,lisp,c# or thru ODBC connectivity
PHP HYPERTEXT PROCESSOR
Server side scripting language for dynamic web page generation
PYTHON dynamically typed interpreted programing language used by google
Perl is a dynamic interpreted programming language
LAMP WAMP MAMP
.net framework àc# àaspàiis serverànative server
javaàservletsàjspàscripletsàweb serveràweblogic
Technocentric vs LUCIDàusabilityàReusability
Technologyà web applnsàhtml,cgi,servlets,jsp,asp,xml,ejb Interfaceà cli, gui, hci, cgi
MY FATHER … ME…MY DAUGHTER
TECHNOCENTRIC…..LUCID
Rapid Prototype Development iterative refinement model and incremental model
TechnocentricàLUCIDàevaluationàTestingàUser Acceptance TestàUsabilityàEthnography.
Eclipse Eclipse SDK=Java JDT + PDE
It is a platform which provides services necessary for integrating software development tools which are implemented as pluggins
TIVOLI client server appln, storage manager, intelligent backups
DB2 database
DB2 Express-C :- replication, warehouse management
WASCE:- websphere appln sever community edition
PRESENT
INTERNET JUNKEYS
ORKUT
YOUTUBE-$1.775 BILLIONS
BLOG
VIRTUAL COMMUNITIES
FUTURE
CYBORG
WASHING MACHINE
ROBOT OF CSE HOD
MOBILE
VIRTUAL REALITY
RETHINKING THE FUTURE
OUR COLEGE HAS A MISSION AND VISION OF BECOMING A HEALTHY COLLEGE, NBA ACCREDITATION
IT IS BLESSED WITH VISIONARIES LIKE SECRETARY, PRINCIPAL, DEAN, HOD EEE, HOD ECE
INSIGHT INTO CSE AND IT DEPT
• OBJECTIVE
EFFORTS TOWARDS healthy academics
• CDD
• CRs meet last meeting on 09-nov-2006
• Weekly meets last meeting on 14-dec-2006
• Counsellor files- monthly audit on 8th and 22nd
• KRAs=2R+1NR
magazines
• Prayaas
• Akruthi
Lab management
• Lab service head – Nagaraju
– LIC LAB1-Ms. Vasantha
– LIC LAB2-Ms. Babitha
– LIC LAB3-Ms. Krishnaveni
– LIC development lab-Mr. Sriharikumar
– LIC ITworkshop-Mr. Raghavendra
ONLINE EXAMS
• ONLINE COORDINATOR- S.ANAND
– ONLINE TECHNICAL
• K.SRINIVAS
– RADHESHAM
– RAJESH
– PAVAN
– DEPARTMENTAL COORDINATORS
• MS. LENINA, MS.REVATHI, MR. RANA, MR.MECH
STUDENT MANAGEMENT
• CR
• SR
• DISCO
• ALLCOM
• PCOM
• WEBR
• SDR
FREQUENT GETTOGETHERS
• FAREWELLTO MR. KRANTHIKIRAN KranthiKiranBIETCSITHODFarewelll.htm
• FIESTA LUNCH
• FIESTADSC00876.JPG
• FIESTADSC00885.JPG
• FIESTADSC00878.JPG
• FIESTADSC00899.JPG
REQUIREMENT
• BATTERY OPERATED TROLLEY
BITS-WIPRO:MS IN SOFTWARE ENGINEERING
BITS-WIPRO:MS IN SOFTWARE ENGINEERING
14-01-2007
Course number and course title
SEWP ZC221 Structured Programming
Instructer : Rajesh Kulkarni
hodcse@biet.ac.in
rkpv2002@gmail.com
http://children-off-lesser-gods.blogspot.com
http://360.yahoo.com/rkpv2005
week 1: Elementary computer organization; introduction to number
systems, Representation of Integers, Real numbers, Overflow,
Bit, Data types and operations
1.1.1 Computer OrganizationThe way hardware components are connected together in a computer system.Computer architecture is the structure and behavior of various functional modules and how they interact to provide the processing needs of the user.Computer design is the development of hardware according to given set of specifications. Computer organization is I. CPU Organization II. Memory Organization III. I/O OrganizationI. CPU Organization: ALU,CU, Registers which are memory elements for temporary storage Registers are memory element for temporary storage. Size of register indicates how much information the processor can operate at one time, 16, 32, 64 bit.Buses : data buses indicate information moving capability 16,32,64, address buses indicate ram size or memory handling capability; 8086 220= 1M.II.Memory Organization: MAR,MBR,CacheIII. I/O Organization: Programmed I/O, Interrupt driven I/O, DMA
1.2 Data Representation
Registers contain both data and control information for data manipulation. Data are numbers and other binary coded information. Common types of data indicate Data Types.
Data Types
1. Numbers2.Letters or alphabets3.symbols
Data are represented in registers in binary coded form. Registers are made of flip-flops have two states which are capable of storing one bit of information. This change with the arrival of a clock pulse.1.2.1Number systems
Radix or base: 2, 10, 8, 16, rBinary coded octal numbers
----TABLE OF BCD,HEXA,OCTAL CAN BE KEPT
Number system
ASCII
Character Code in microcomputers Communication
Seven Bit Scheme
27 = 128 Unique code
Extended ASCII = 2 8 = 256
Information is Stored in the form of Bits for two voltages or magnetic States
A à 01000001 à 65
B à 01000010 à 66
----- HERE ASCII TABLE CAN BE KEPT------ BINARY Machine language Two Digits 0 and 1 Compatible with digital electronic Circuits
BITSON - True - 0
Off – False – 1
Binary Notation ……… 16s 8s 4s 2s 1s
1. ( 1101)2 = ( ? ) 10
1 1 0 1
8 4 2 1 =
+ + + = 13
2. 1 0 1 0
8 4 2 1 = 10
+ + +
27 26 25 24 23 22 21 20
128 64 32 16 8 4 2 1
Binary Addition
1. 8 4 2 1
1 0 1 1 11
1 1 01 +13
------------- -------
24 ß 1 1 0 0 0 24
-----------------------------------
2. 1 1 0 1
1 1 1 0
3. 1 0 1 1
0 0 1 1
4. 1 1 1 0
1 1 1 1
Binary Multiply
1. 1 0 0 1 9
x 1 1 1 0 x 14
______________ _____________
0 0 0 0 ( 126)10
1 0 0 1
1 0 0 1
1 0 0 1
_______________
( 1111110) 2 = (126)10
_________________
2. 1 0 1 1 11
1 1 0 0 12
_________
132
_____________
Decimal = 10 hexa = 6
Hexadecimal
6 + 10 = 16
0 1 2 3 4 5 6 7 8 9 A B C D E F
Integer Representation
1 0 1 0 1 0 1 0 = 170
Unsigned Representation
1 0 1 0 1 0 1 0 = -42
Signed
MS B = 1 à Negative
= 0 à Positive
complements
Simplifying the subtraction and logical manipulation
Allows to represent positive and negative numbers.
Deal with subtraction using addition
10s complement
9s complement
1s complement
2s Complement
base or radix ==== r
r’s complement
r-1’s complement
r=10
10’s complement
10-1= 9’s complement
9’s complement
N Base r-1 r – 1’s Complement of N
N r r-1 (rn - 1) - N
10 9 (10n – 1) – N where 10n – 1 = n 9s
n=4 , 10000 – 1 = 9999
546700 999999 – 546700= 453299
10’s complement is 9’s complement + 1
r=2
2’s complement
2-1=1’s complement
1’s complement
16 = 10000
24 - 1 = 1111 subtraction of binary is done thru
2’s complement is 1’s complement + 1
Base Conversion Table
======= ADDITION, MULTIPLICATION TABLE CAN BE KEPT HERE =====
Binary To Decimal
1. ( 1 0 0 1 0) 2 = ( ? )10
2 4 x 1 + 0 + 0 + 2 1 x 1 + 20 x 0 =
16 +2 + 0 = ( 18) 10
2. ( 1 0 1 1 0 ) 2 = ( ?) 10
2 0 x 0 + 21x1 +22 x 1 + 23 x 0 + 24 x 1
= 0 + 2 +4 + 0+ 16 = (22) 10
3. ( 1 1 0 1 0 )2 =
4. ( 1 1 1 1 0 )
5. ( 1 0 0 0 1 1 1 1) 2
6. ( 0 1 0 1 0 0 0 1 ) 2
7. ( 0 1 1 1 0 0 1 1) 2
Binary to Hexadecimal
( 1 1 0 11 0) 2 = ( ? ) 16
Group digits in set of four, begining at the right
11 0110
____ __________ = (36) 16
3 6
___________________
2. ( 1 0 11 11) 2 = 10 1 1 1 1
____ _____________
2 15
= ( 2 F) 16
3. ( 10 111 0) 2 = ( ?) 16
4. (11 0 0 11 0) 2
5. ( 11 00 10) 2
6. (11 01 11) 2
7. ( 00 1100) 2
8. ( 111010) 2
9. ( 111111) 2
10. (1001011)2
Decimal to Binary
Divide the number by 2
( 24 ) 10 = ( ?) 2
2 24 0
2 12 0
2 16 0
2 3 1
2 1 1
0 ( 1 1 0 0 0 ) 2
1 .( 48) 10 =
(113) 10 =
(127) 10 =
Decimal to Hexadecimal
Divide the number by the base Number
1. ( 1 6 9) 10
16 169
16 10 9
0 10
( A 9 ) 16
2. ( 95 ) 10 =
3. ( 46) 10 =
4. ( 3315.3) 10 = ( ? ) 16
Hexadecimal to Binary
Convert each digital to its four digit binary equivalent and record from left to right
1. ( A C ) 16 = A C
1010 1100
Hexa To Decimal
1. ( A9) 16 = ( ? ) 10
A X 16 1 + 16 0 x 9
= 16 x 10 +9
= (169) 10
2. ( A F) 16
3. (4 B3.3) 16
4. CF3.4CC
Octal to Decimal
Sol – B2D
1. ( 234.14) 8 = ( ? ) 10
3( 26) 10
( 30) 10
(143) 10
(81) 10
(114) 10
Sol – B2H
3. ( 2E) 16
4. (66) 16
5. (32) 16
6. (37)16
7. (OD) 16
8. (3A) 16
9. ( 7F) 16
10. (4B) 16
Sol – D2 B
1. ( 1 1 0 0 0 0) 2
2. ( 1 1 1 0 0 0 1 ) 2
3. ( 1 1 1 1 1 1 1) 2
2. ( 5F) 16
3. ( 2E) 16
H 2 D
2. ( 175 ) 10
3. 1203 .1875
Octal 2 D
1. 156 .1875
14-01-2007
Course number and course title
SEWP ZC221 Structured Programming
Instructer : Rajesh Kulkarni
hodcse@biet.ac.in
rkpv2002@gmail.com
http://children-off-lesser-gods.blogspot.com
http://360.yahoo.com/rkpv2005
week 1: Elementary computer organization; introduction to number
systems, Representation of Integers, Real numbers, Overflow,
Bit, Data types and operations
1.1.1 Computer OrganizationThe way hardware components are connected together in a computer system.Computer architecture is the structure and behavior of various functional modules and how they interact to provide the processing needs of the user.Computer design is the development of hardware according to given set of specifications. Computer organization is I. CPU Organization II. Memory Organization III. I/O OrganizationI. CPU Organization: ALU,CU, Registers which are memory elements for temporary storage Registers are memory element for temporary storage. Size of register indicates how much information the processor can operate at one time, 16, 32, 64 bit.Buses : data buses indicate information moving capability 16,32,64, address buses indicate ram size or memory handling capability; 8086 220= 1M.II.Memory Organization: MAR,MBR,CacheIII. I/O Organization: Programmed I/O, Interrupt driven I/O, DMA
1.2 Data Representation
Registers contain both data and control information for data manipulation. Data are numbers and other binary coded information. Common types of data indicate Data Types.
Data Types
1. Numbers2.Letters or alphabets3.symbols
Data are represented in registers in binary coded form. Registers are made of flip-flops have two states which are capable of storing one bit of information. This change with the arrival of a clock pulse.1.2.1Number systems
Radix or base: 2, 10, 8, 16, rBinary coded octal numbers
----TABLE OF BCD,HEXA,OCTAL CAN BE KEPT
Number system
ASCII
Character Code in microcomputers Communication
Seven Bit Scheme
27 = 128 Unique code
Extended ASCII = 2 8 = 256
Information is Stored in the form of Bits for two voltages or magnetic States
A à 01000001 à 65
B à 01000010 à 66
----- HERE ASCII TABLE CAN BE KEPT------ BINARY Machine language Two Digits 0 and 1 Compatible with digital electronic Circuits
BITSON - True - 0
Off – False – 1
Binary Notation ……… 16s 8s 4s 2s 1s
1. ( 1101)2 = ( ? ) 10
1 1 0 1
8 4 2 1 =
+ + + = 13
2. 1 0 1 0
8 4 2 1 = 10
+ + +
27 26 25 24 23 22 21 20
128 64 32 16 8 4 2 1
Binary Addition
1. 8 4 2 1
1 0 1 1 11
1 1 01 +13
------------- -------
24 ß 1 1 0 0 0 24
-----------------------------------
2. 1 1 0 1
1 1 1 0
3. 1 0 1 1
0 0 1 1
4. 1 1 1 0
1 1 1 1
Binary Multiply
1. 1 0 0 1 9
x 1 1 1 0 x 14
______________ _____________
0 0 0 0 ( 126)10
1 0 0 1
1 0 0 1
1 0 0 1
_______________
( 1111110) 2 = (126)10
_________________
2. 1 0 1 1 11
1 1 0 0 12
_________
132
_____________
Decimal = 10 hexa = 6
Hexadecimal
6 + 10 = 16
0 1 2 3 4 5 6 7 8 9 A B C D E F
Integer Representation
1 0 1 0 1 0 1 0 = 170
Unsigned Representation
1 0 1 0 1 0 1 0 = -42
Signed
MS B = 1 à Negative
= 0 à Positive
complements
Simplifying the subtraction and logical manipulation
Allows to represent positive and negative numbers.
Deal with subtraction using addition
10s complement
9s complement
1s complement
2s Complement
base or radix ==== r
r’s complement
r-1’s complement
r=10
10’s complement
10-1= 9’s complement
9’s complement
N Base r-1 r – 1’s Complement of N
N r r-1 (rn - 1) - N
10 9 (10n – 1) – N where 10n – 1 = n 9s
n=4 , 10000 – 1 = 9999
546700 999999 – 546700= 453299
10’s complement is 9’s complement + 1
r=2
2’s complement
2-1=1’s complement
1’s complement
16 = 10000
24 - 1 = 1111 subtraction of binary is done thru
2’s complement is 1’s complement + 1
Base Conversion Table
======= ADDITION, MULTIPLICATION TABLE CAN BE KEPT HERE =====
Binary To Decimal
1. ( 1 0 0 1 0) 2 = ( ? )10
2 4 x 1 + 0 + 0 + 2 1 x 1 + 20 x 0 =
16 +2 + 0 = ( 18) 10
2. ( 1 0 1 1 0 ) 2 = ( ?) 10
2 0 x 0 + 21x1 +22 x 1 + 23 x 0 + 24 x 1
= 0 + 2 +4 + 0+ 16 = (22) 10
3. ( 1 1 0 1 0 )2 =
4. ( 1 1 1 1 0 )
5. ( 1 0 0 0 1 1 1 1) 2
6. ( 0 1 0 1 0 0 0 1 ) 2
7. ( 0 1 1 1 0 0 1 1) 2
Binary to Hexadecimal
( 1 1 0 11 0) 2 = ( ? ) 16
Group digits in set of four, begining at the right
11 0110
____ __________ = (36) 16
3 6
___________________
2. ( 1 0 11 11) 2 = 10 1 1 1 1
____ _____________
2 15
= ( 2 F) 16
3. ( 10 111 0) 2 = ( ?) 16
4. (11 0 0 11 0) 2
5. ( 11 00 10) 2
6. (11 01 11) 2
7. ( 00 1100) 2
8. ( 111010) 2
9. ( 111111) 2
10. (1001011)2
Decimal to Binary
Divide the number by 2
( 24 ) 10 = ( ?) 2
2 24 0
2 12 0
2 16 0
2 3 1
2 1 1
0 ( 1 1 0 0 0 ) 2
1 .( 48) 10 =
(113) 10 =
(127) 10 =
Decimal to Hexadecimal
Divide the number by the base Number
1. ( 1 6 9) 10
16 169
16 10 9
0 10
( A 9 ) 16
2. ( 95 ) 10 =
3. ( 46) 10 =
4. ( 3315.3) 10 = ( ? ) 16
Hexadecimal to Binary
Convert each digital to its four digit binary equivalent and record from left to right
1. ( A C ) 16 = A C
1010 1100
Hexa To Decimal
1. ( A9) 16 = ( ? ) 10
A X 16 1 + 16 0 x 9
= 16 x 10 +9
= (169) 10
2. ( A F) 16
3. (4 B3.3) 16
4. CF3.4CC
Octal to Decimal
Sol – B2D
1. ( 234.14) 8 = ( ? ) 10
3( 26) 10
( 30) 10
(143) 10
(81) 10
(114) 10
Sol – B2H
3. ( 2E) 16
4. (66) 16
5. (32) 16
6. (37)16
7. (OD) 16
8. (3A) 16
9. ( 7F) 16
10. (4B) 16
Sol – D2 B
1. ( 1 1 0 0 0 0) 2
2. ( 1 1 1 0 0 0 1 ) 2
3. ( 1 1 1 1 1 1 1) 2
2. ( 5F) 16
3. ( 2E) 16
H 2 D
2. ( 175 ) 10
3. 1203 .1875
Octal 2 D
1. 156 .1875
Subscribe to:
Posts (Atom)