For the issue of provisional certificate:
Step 1: Download the form from the link given below
Download Link
Step 2: Print the form and fill the details; In total percentage column, calculate the total marks obtained and then divide it by 7000
Note : First and Second semester marks have been taken only 50%
Step 3: Get the xerox of your mark-sheets/tabulation attested by any gazetted officer.
Step 4: Attach the photocopies and form together with an application for request of provisional
certificate
Note: Candidates who need it urgently, mention their date of joining in the application and attach a copy of joining letter with it as a matter of proof
Step 5 : Submit it into Examination department
When submitted at that time you will get to know when you can receive the provisional certificate. On an average it takes 3-4 days .
skip to main |
skip to sidebar
Anonymous Vella's 350 Mb collection of Online Mocks etc + A Collection of bookmarks pertaining to MBA entrance and technical stuff that all our batchmates and juniors might find of some use are stored in a .doc file in the given folder.
Download
Finally the final semester hope All's Well That Ends Well
Friday, May 28, 2010
Wednesday, April 28, 2010
Sunday, April 18, 2010
Notice
All Students are requested to submit the XEROX of their marksheets of 1st semester to 7th semester in Department on or before 20th April 2010
Tuesday, April 13, 2010
GATE AND INTERVIEW QUESTIONS
FOR GATE QUESTION PAPERS PLEASE VISIT http://ubjgatetutorial.blogspot.com/ GATE QUESTION PAPERS FROM 2006-2010 ARE UPLOADED IN IT.
FOR INTERVIEW QUESTIONS TOO VISIT THE ABOVE BLOG ...ALL INTERVIEW QUESTIONS HAVE BEEN UPLOADED OF CS CORE COMPANIES LIKE PERSISTENT AND BIRLASOFT.
---by Uddalok Banarjee
FOR INTERVIEW QUESTIONS TOO VISIT THE ABOVE BLOG ...ALL INTERVIEW QUESTIONS HAVE BEEN UPLOADED OF CS CORE COMPANIES LIKE PERSISTENT AND BIRLASOFT.
---by Uddalok Banarjee
Monday, April 12, 2010
Artificial Intelligence
Wednesday, April 7, 2010
AI Lab programs
Find below the link to download the .doc file containing the AI lab programs (1-14).
Download
File Should be handwritten
Download
File Should be handwritten
Tuesday, April 6, 2010
Rest of Neural Network Study Material
Saturday, April 3, 2010
Tuesday, March 30, 2010
MBA Entrance Material
Anonymous Vella's 350 Mb collection of Online Mocks etc + A Collection of bookmarks pertaining to MBA entrance and technical stuff that all our batchmates and juniors might find of some use are stored in a .doc file in the given folder.
--Amul Badjatya
Monday, March 29, 2010
Sunday, March 28, 2010
End Semester Timetable
16 April : Artificial Intelligence
27 April : Data Mining and Data Warehousing
30 April : Software Project Management
4 May : Neural Networks
6 May : Enterprise Resource Planning
27 April : Data Mining and Data Warehousing
30 April : Software Project Management
4 May : Neural Networks
6 May : Enterprise Resource Planning
Friday, March 26, 2010
Syllabus for Class Test
AI: Unit 3 and Unit 4
ERP: Unit 1 and Unit 4
DMDW, ANN, SPM : Till whatever is covered
ERP: Unit 1 and Unit 4
DMDW, ANN, SPM : Till whatever is covered
Monday, March 8, 2010
Cognizant Form Trouble
All the students who are placed in Cognizant have been mailed their TFF URL & Userid/Password to their respective Email Ids by Cognizant. All the selected candidates have to fill a form on the Cognizant Portal https://talent4future.cognizant.com
In the portal there is a form "I,Me & Myself" regarding personal information. There in UG Course section , the name of our college is not visible because the width of drop down menu is not enough to display entire name.
So the confusion is regarding which option to be selected. The correct entry has been marked in the Screenshots
below.
The portion of list below is in exact sequence as that is present in Cognizant Portal having our College's name
National Degree College, Nandyal
National engineering college
National Institute of Fashion Technology
National Institute of Managemet Calcutta
National Institute of Tech. Karnataka
National Institute of Tech. Rourkela
National Institute of Technology
National Institute of Technology, Raipur
National Institute of Technology,Hamirpur
Navarasam Arachalur
NCERC College
The screenshots will be helpful to identify the correct option
Please Fill the Form within this week and convey this information to your friends placed in Cognizant from other branches
In the portal there is a form "I,Me & Myself" regarding personal information. There in UG Course section , the name of our college is not visible because the width of drop down menu is not enough to display entire name.
So the confusion is regarding which option to be selected. The correct entry has been marked in the Screenshots
below.
The portion of list below is in exact sequence as that is present in Cognizant Portal having our College's name
National Degree College, Nandyal
National engineering college
National Institute of Fashion Technology
National Institute of Managemet Calcutta
National Institute of Tech. Karnataka
National Institute of Tech. Rourkela
National Institute of Technology
National Institute of Technology, Raipur
National Institute of Technology,Hamirpur
Navarasam Arachalur
NCERC College
The screenshots will be helpful to identify the correct option
Please Fill the Form within this week and convey this information to your friends placed in Cognizant from other branches
Thursday, February 18, 2010
List of AI Lab Exercise
1) Tree Representation
2)Family Representation
3)Who is Proud problem?
4)Hoofer's Club Problem
5)List Operatins-Union, Intersection,Append,Reversing,Max,Min Element
6)Arithmetic Operations
7)Conversion from degree Celcius to degree Fahrenheit
8)Factorial
9)Criminal of West Problem
10)DFA- To check if given string is acceptable or not?
11)Monkey Banana Problem
12)Nani Search Problem
13)Towers of Hanoi
14)Animal Identification Problem
2)Family Representation
3)Who is Proud problem?
4)Hoofer's Club Problem
5)List Operatins-Union, Intersection,Append,Reversing,Max,Min Element
6)Arithmetic Operations
7)Conversion from degree Celcius to degree Fahrenheit
8)Factorial
9)Criminal of West Problem
10)DFA- To check if given string is acceptable or not?
11)Monkey Banana Problem
12)Nani Search Problem
13)Towers of Hanoi
14)Animal Identification Problem
Saturday, February 13, 2010
Enterprise Resource Planning Slides
Official Slides from Alexis Leon
Download
Individual Slides
Each slide correspond to particular chapter of the book
Part I - Introduction
| ||
Part II - ERP and Technology
| ||
Part III - ERP Implementation
| ||
Part IV - ERP in Action
| ||
Part V - The Business Modules
| ||
Part VI - The ERP Market
| ||
Part VII - ERP—Present and Future
|
Wednesday, February 10, 2010
Thursday, February 4, 2010
Network Security Experiment 1
/*
Following is a Java program to check strength of password entered by user utilizing following parameters
a)Combination of alphabets with digits & special symbols
b)Length of password
c)Repetition of characters in password
This program uses HashTable to store frequency of characters.
*/
import java.io.*;
import java.util.Hashtable;
import java.util.Enumeration;
/**
* @author Pawan Singh
*
*/
public class passwordStrength {
public static void main(String[] args) throws IOException {
System.out.println("Enter password: ");
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String password=br.readLine();
int strength=passwordStrength.checkStrength(password);
// checkStrength static method called
System.out.println("Strength is "+strength+" out of 100");
if (strength<0)
System.out.println("Very Weak Password");
else if (strength<34)
System.out.println("Weak Password");
else if(strength<68)
System.out.println("Good Password");
else
System.out.println("Strong Password");
}
static public int checkStrength(String password)
{
int strength;
//Initially parameter evaluation
int len =password.length(),no_of_digits=0,no_of_alpha=0,no_of_spl=0;
Hashtable freq = new Hashtable ();
char c;
Integer t;
for(int i=0;i
{
//Evaluating number of types of characters
c=password.charAt(i);
if (Character.isDigit(c))
no_of_digits++;
else if (Character.isLetter(c))
no_of_alpha++;
else
no_of_spl++;
if (!freq.containsKey(c))
freq.put(c, 1);
else
{
t=freq.get(c);
freq.remove(c);
freq.put(c,t+1);
}
//End of for loop
}
//Finally Evaluation of strength
strength=len*4;
Enumeration e=freq.keys();
while(e.hasMoreElements())
{
c=(Character)e.nextElement();
if( freq.get(c)>1)
{
strength-=5*(Integer)freq.get(c);//Reduction on behalf of repetition
}
//End of loop
}
if (no_of_digits>2)
strength+=5;
if(no_of_spl>2)
strength+=10;
if(no_of_digits>0 && no_of_alpha>0)
strength+=15;
if(no_of_digits>0 && no_of_spl>0)
strength+=15;
if(no_of_spl>0 && no_of_alpha>0)
strength+=15;
if(no_of_alpha==0 && no_of_spl==0)
strength-=15;
if(no_of_digits==0 && no_of_spl==0)
strength-=20;
if(strength>100)
strength=100;
return strength;
}
}
Following is a Java program to check strength of password entered by user utilizing following parameters
a)Combination of alphabets with digits & special symbols
b)Length of password
c)Repetition of characters in password
This program uses HashTable to store frequency of characters.
*/
import java.io.*;
import java.util.Hashtable;
import java.util.Enumeration;
/**
* @author Pawan Singh
*
*/
public class passwordStrength {
public static void main(String[] args) throws IOException {
System.out.println("Enter password: ");
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String password=br.readLine();
int strength=passwordStrength.checkStrength(password);
// checkStrength static method called
System.out.println("Strength is "+strength+" out of 100");
if (strength<0)
System.out.println("Very Weak Password");
else if (strength<34)
System.out.println("Weak Password");
else if(strength<68)
System.out.println("Good Password");
else
System.out.println("Strong Password");
}
static public int checkStrength(String password)
{
int strength;
//Initially parameter evaluation
int len =password.length(),no_of_digits=0,no_of_alpha=0,no_of_spl=0;
Hashtable
char c;
Integer t;
for(int i=0;i
{
//Evaluating number of types of characters
c=password.charAt(i);
if (Character.isDigit(c))
no_of_digits++;
else if (Character.isLetter(c))
no_of_alpha++;
else
no_of_spl++;
if (!freq.containsKey(c))
freq.put(c, 1);
else
{
t=freq.get(c);
freq.remove(c);
freq.put(c,t+1);
}
//End of for loop
}
//Finally Evaluation of strength
strength=len*4;
Enumeration e=freq.keys();
while(e.hasMoreElements())
{
c=(Character)e.nextElement();
if( freq.get(c)>1)
{
strength-=5*(Integer)freq.get(c);//Reduction on behalf of repetition
}
//End of loop
}
if (no_of_digits>2)
strength+=5;
if(no_of_spl>2)
strength+=10;
if(no_of_digits>0 && no_of_alpha>0)
strength+=15;
if(no_of_digits>0 && no_of_spl>0)
strength+=15;
if(no_of_spl>0 && no_of_alpha>0)
strength+=15;
if(no_of_alpha==0 && no_of_spl==0)
strength-=15;
if(no_of_digits==0 && no_of_spl==0)
strength-=20;
if(strength>100)
strength=100;
return strength;
}
}