B.Tech. II Year II Semester Results - April, 2011

Check the below link for results

B.Tech. II Year II Semester (R09) Results - April, 2011

http://www.jntu.ac.in/results/htno.php?ecode=1029
 OR
http://122.252.228.147/results/htno.php?ecode=1029

B.Tech. II Year II Semester (R07) Results - April, 2011

http://www.jntu.ac.in/results/htno.php?ecode=1030
 OR
http://122.252.228.147/results/htno.php?ecode=1030

B.Tech. II Year II Semester (R05) Results - April, 2011

http://www.jntu.ac.in/results/htno.php?ecode=348
 OR
http://122.252.228.147/results/htno.php?ecode=348

B.Tech. II Year II Semester (RR) Results - April, 2011

http://www.jntu.ac.in/results/htno.php?ecode=349
 OR
http://122.252.228.147/results/htno.php?ecode=349

B.Tech. II Year II Semester (NR) Results - April, 2011

http://www.jntu.ac.in/results/htno.php?ecode=350
 OR
http://122.252.228.147/results/htno.php?ecode=350

NOTE : Last date for Recounting/Revaluation:07-07-2011

Recruitment of teaching assistants positions in JNTUCEH , Hyderabad.

 Applications in the prescribed form are invited for the following posts in the College of engineering Hyderabad JNTU  . 

 Teaching assistants:
English,Mathematics, physics, chemistry, Civil engineering , Computer science engineering,ECE,EEE.



Scale of Pay:
qualification B.Tech :10000 per month .
qualification M.Tech :12000 per month.

The Prescribed application form and information to candidates can be downloaded from JNTUH Website (www.jntuh.ac.in).

Registration fee through a Demand Draft: Rs.250/- (in case of SC/ST candidates the fees is Rs.100/-)

The Bio Data(resume) form together with  certificates and a Demand Draft towards Registration fee  on any Nationalized Bank in favour of the Principal, JNTUCEH payable at Hyderabad.



Last date:
on or before 24.06.2011by 4:00 PM

Differences and Advantages Between 32-bit (x86) VS 64-bit (x64) Windows Vista

Differences and Advantages Between 32-bit (x86) VS 64-bit (x64) Windows Vista

Each editions of Windows Vista operating system is available in both 32-bit and 64-bit versions (x86 anx x64 are terms used by Microsoft), making 64-bit OS option now a widely available choice. And with almost all CPU processor and motherboard nowadays is x64 based which capable of running 64-bit OS, it presents hard decision to consumers to decide and pick whether 32-bit or 64-bit versions of Windows Vista is suitable choice.

Microsoft publishes KB946765 which details the main differences between 32-bit and 64-bit Windows Vista, which mainly relate to memory accessibility, memory management, and enhanced security features, as listed in table below.

Architecture	Windows Vista, 32-bit versions	Windows Vista, 64-bit versions
System requirements	1-gigahertz (GHz) 32-bit (x86) processor or 64-bit (x64) processor, 512 MB of RAM	1-GHz 64-bit (x64) processor, 1 GB of RAM (4 GB recommended)
Memory access	A 32-bit version of Windows Vista can access up to 4 GB of RAM.	A 64-bit version of Windows Vista can access from 1 GB of RAM to more than 128 GB of RAM.
Memory access per edition	All 32-bit versions of Windows Vista can access up to 4 GB of RAM.	Windows Vista Home Basic – 8 GB of RAM Windows Vista Home Premium – 16 GB of RAM Windows Vista Business – 128 GB of RAM or more Windows Vista Enterprise – 128 GB of RAM or more Windows Vista Ultimate – 128 GB of RAM or more
DEP	32-bit versions of Windows Vista use a software-based version ofDEP.	64-bit versions of Windows Vista support hardware-backed DEP.
Kernel Patch Protection (PatchGuard)	This feature is not available in 32-bit versions of Windows Vista.	This feature is available in 64-bit versions of Windows Vista. KernelPatch Protection helps prevent a malicious program from updating the Windows Vista kernel. This feature works by helping to prevent a kernel-mode driver from extending or replacing other kernel services. Also, this feature helps prevent third-party programs from updating (patching) any part of the kernel.
Driver signing	Unsigned drivers may be used with 32-bit versions of Windows Vista.	64-bit versions of Windows Vista require that all device drivers be digitally signed by the developer.
32-bit driver support	32-bit versions of Windows Vista support 32-bit drivers that are designed for Windows Vista.	64-bit versions of Windows Vista do not support 32-bit device drivers.
16-bit program support	32-bit versions of Windows Vistasupport 16-bit programs, in part.	64-bit versions of Windows Vista do not support 16-bit programs.

If you value the benefits and advantages of switching and embracing 64-bit Windows Vista, here's a few considerations to ponder before making the move to install x64 Windows Vista:

• 64-bit device drivers may not be available for one or more devices in the computer.
• Device drivers must be digitally signed.
• 32-bit device drivers are not supported.
• 32-bit programs may not be fully compatible with a 64-bit operating system.
• It may be difficult to locate programs that are written specifically for a 64-bit operating system.
• Not all hardware devices may be compatible with a 64-bit version of Windows Vista.

Top 50 Questions of Basic C programming

 Top 50 Questions of Basic C programming

Here I am discussing top 50 questions of basic C programming asked in the technical interview. Prepare these question before appearing in the interview.

   1. Write a program to print numbers from 1 to 100 without using loops
   2. Write a C program to swap two variables without using a temporary variable.
   3. What is the 8 queens problem? Write a C program to solve it?
   4. Write a C program to print a square matrix helically.
   5. Write a C program to reverse a string.
   6. Write a C program to reverse the words in a sentence in place.
   7. Write a C program generate permutations.
   8. Write a C program for calculating the factorial of a number.
   9. Write a C program to calculate pow(x,n)?
  10. Write a C program which does wildcard pattern matching algorithm.
  11. How do you calculate the maximum sub array of a list of numbers?
  12. How to generate fibonacci numbers? How to find out if a given number is a Fibonacci number or not? Write C programs to do both.
  13. Solve the Rat In A Maze problem using backtracking.
  14. What Little-Endian and Big-Endian? How can I determine whether a machine's byte order is big-endian or little endian? How can we convert from one to another?
  15. Write C code to solve the Tower of Hanoi problem.
  16. Write C code to return a string from a function.
  17. Write a C program which produces its own source code as its output.
  18. Write a C program to convert from decimal to any base (binary, hex, oct etc…).
  19. Write C code to check if an integer is a power of 2 or not in a single line?
  20. Write a C program to find the GCD of two numbers.
  21. Write code to remove duplicates in a sorted array.
  22. Find the maximum of three integers using the ternary operator.
  23. How do you initialize a pointer inside a function?
  24. Write C code to dynamically allocate one, two and three dimensional arrays (using malloc()).
  25. How would you find the size of structure without using sizeof()?
  26. Write a C program to multiply two matrices.
  27. Write a C program to check for palindromes.
  28. Write a C program to convert a decimal number into a binary number.
  29. Write C code to implement the Binary Search algorithm.
  30. Write code to evaluate a polynomial.
  31. Write code to add two polynomials.
  32. Write a program to add two long positive numbers (each represented by linked lists).
  33. How do you compare floating point numbers?
  34. What's a good way to implement complex numbers in C?
  35. How can I display a percentage-done indication on the screen?
  36. Write a program to check if a given year is a leap year or not?
  37. Is there something we can do in C but not in C++?
  38. How to swap the two nibbles in a byte ? How to generate the next prime after a given prime?
  39. How to scan a string till we hit a new line using scanf()?
  40. Write pseudocode to compare versions (like 115.10.1 vs 115.11.5).
  41. How do you get the line numbers in C?
  42. Write your own sqrt() function in C.
  43. Write a simple piece of code to split a string at equal intervals.
  44. Is there a way to multiply matrices in lesser than o(n^3) time complexity?
  45. How do you find out if a machine is 32 bit or 64 bit?
  46. Write a program to have the output go two places at once (to the screen and to a file also).
  47. How can we sum the digits of a given number in single statement?
  48. Given two strings A and B, how would you find out if the characters in B were a subset of the characters in A?
  49. Write a program to merge two arrays in sorted order, so that if an integer is in both the arrays, it gets added into the final array only once.
  50. Write your own trim() or squeeze() function to remove the spaces from a string.

CATE 2011 solved paper questions, pattern

CATE 2011 solved paper questions, pattern

CATE exam did not throw any surprises. The question paper consisted of four parts. Part 1 and 2 had objective type questions. There was no negative marking and each question had four options to choose from. Part 1 consisted of a single cloze test of 20 questions. The text of this cloze test seems to have been taken from The Autobiography of Dalai Lama. Part 2 primarily had questions based on books both contemporary and classics, idioms etc.

Part 3 and 4 of the question paper were descriptive type. Part three had a poem (Under the Hazy, Blossom-Laden Sky) followed by 5 questions. Part 4 was essay-writing section. Topic given was " Globalisation will destroy our cultural heritage – Agree or disagree "

Students were given an hour and a half to attempt this paper. It was clearly written in the instructions that students can carry the question booklets but surprisingly booklets were also collected by invigilators. On being asked about the same they said that the booklet would be put on Delh i University website within 72 hours.

Memory based Questions:
1. Which one of the following Shakespeare works deals with issue of inter racial marriage?
1. Othello
2. Macbeth
3. Romeo Juliet

2. Which one of the books was not originally written in En glish?
1. Godaan
2. Malgudi days
3. Coolie

3. Which one of the following is not a Shakespeare tragedy?
1. Much ado about nothing
2. Hamlet
3. Antony and Cleopatra
4. Julius ceaser

4. Which one of these books has been authored by Kiran Desai?
1. Inheritance of loss

5. Soliloquy and asides are used in which of the following?
1. Drama

6. In which of the following places was Bamian Buddha originally located?
1. Afghanistan
2. Libya
3. Algiers

7. Which of the following authors has written the book - Old man and the sea?
2

8. Which one of the following is not a form of dance?
1. Odissi
2. Bharatnatyam
3. Mohiniattyam
4. Tamasha

9. Tale of two cities has been authored by –
1. Charles dickens
2. Emily Bronte
3. Margaret Michelle.

10. The idiom 'Kick the bucket 'means-
1. To die
2. To make a clatter

11. What is the meaning of the idiom 'Salad days'?
1. In one's youth
2. A healthy diet

12. a ' Hymn' is
1. A sad song
2. A poem
3. A lullaby
4. A religious song

13. Which of the following authors writes in Malayalam?

14. What is the meaning of Apartheid?

15. 'The Face that launched a thousand ships 'Refers to which one of the following personalities
1. Penelope
2. Helen of Troy

Source: Career Launcher

SBI 4987 PO Associate Bank August 2011 exam syllabus, sample paer, books, pattern

SBI 4987 PO Associate Bank August 2011 exam syllabus, sample paer, books, pattern

On August 7, 2011 SBI will be conducting a written exam for the recruitment of 4987 PO in associate banks. Here is a look at its exam pattern, what and how to prepare and download books for SBI PO exam as well.


Phase-I - Written Examination :
Time Duration: 3 Hrs.
(Objective & Descriptive Type Tests -- Max. Marks - 250).

The duration of objective type test will be 2 hours max. marks 200 and will consist of :

i) Test of English Language (Grammer, Vocabulary, Comprehension etc.): 50 questions 50 marks.
ii) Test of General Awareness, Marketing & Computers:  50 questions 50 marks.
iii) Test of Data Analysis & Interpretation:  50 questions 50 marks.
iv) Test of Reasoning (High Level): 50 questions 50 marks.


Phase-II : Group Discussion & Interview :
Max Marks - 50 (GD - 20, Interview - 30)
The aggregate marks of objective and descriptive test will be arranged in descending order and the candidate who have qualified in both the written tests will be called for group discussion and interview depending upon the vacancies in each category, subject to maximum of 3 times of the vacancies.

PGEC 2011 Notification for GATE / GPAT Candidates

PGEC 2011 Notification for GATE / GPAT Candidates - M.Tech. M.Pharm Admissions in AP

APSCHE (Andhra Pradesh State Council of Higher Education Education (APSCHE) has issued notification for GATE / GPAT qualified candidates for admission into various PG Professional courses in Andhra Pradesh. Seats remain vacant after filling through GATE 2011 / GPAT 2011 qualified candidates will be filled through PGECET 2011 qualified candidates. Details of application process, eligibility, counseling process and important dates are given below. Interested candidates can download Offline application from www.apschepgec.net .Admission into Post Graduate Engineering , Pharmacy and other Courses for 2011-12 in University and affiliated engineering and pharmacy colleges in Andhra Pradesh will be through notification. Following are other details of PGEC 2011 notification:

PG Courses available for GATE / GPAT candidates:

1. M.E. / M.Tech.
2. M.Pharm.
3. M.Architecture.
4. M. Planning
5. Graduate level Pharm D. (P.B.) - Full Time course

There will be separate counseling for these candidates. Seats remain unfilled after allocation to GATE / GPAT qualified candidates will be filled with PGECET 2011 qualified candidates based on their ranks.

Important Dates:
1 Commencement of Downloading of Application Form: 03rd June 2011
2. Last Date for Sale and Receipt of Application Form without late fee: 24th June 2011
3. Last date with late fee of Rs. 500/- : 01st July 2011

Seats available for or GATE / GPAT qualified candidates, application procedure, eligibility requirements, Important dates for application including last date for receipt / submission of applications and other info of PG Professional Courses available at www.apschepgec.net / apsche.org .

Address: Convener, PGEC Admissions - 2011, University College of Engineering (A), Osmania University, Hyderabad - 500007. (AP). Phone :040 - 69996715 / 040 - 32444715 ; Email : pgec2011@osmania.ac.in

POWER OF PUNCTUATION

THE POWER OF PUNCTUATION MARKS

 

An english professor wrote the words:

"a woman without her man is nothing" on the chalkboard and asked his students to punctuate it correctly.

all the boys in the class wrote: "a woman, without her man, is nothing" 

all the girls in the class wrote: " a woman: without her, man is nothing"

punctuation is powerful.