HI FRIENDS......... CAN U PLESE HELP ME IN GETTING T MODEL QUESTION PAPERS FOR PGCET MTECH CIVIL ENGINEERING .IF ANY INFORMATION IS THER THEN PLESE SEND A MAIL TO ME AT ramesh.madkatte@gmail.com

for the vtu mtech entrance exam previous question papers Hello sir,plzzzzzzzz can you mail me the previous years mtech entrance exam papers.I have completed my BE in cs and applied for the m.tech(CS).If you mail me previous years papers entrance exam papers that will going to help me. plz mail me mdenayath@yahoo.com

PG set model paper HI can anyone post me PG set model paper or the syllubus covered for IT paper.My mail id thota_priyanka@yahoo.co.in Thanks in Advance

pgcet papers :lol: hey cud u pls send the pgcet all the previous years quetion papers of MCA to my e.mail id .mY E.MAIL ID id is naini_187@yahoo.com.

hello sir, can you please send me the previous years question papers of pgcet exam of MCA My ID :- sri_ragini@yahoo.co.in

help needed hello ... can anyone send me de old question paper of Karnataka PGCET entrance exam ..... my email id gyan2k6@gmail.com

question papers Pls forward me the prevoius question papers for preparing for mca exams i,e pgcet . Email ID prakashkaur@namdharifresh.com Awaiting your earliest response. Thanks

abt pgcet q papers hey pls send pgcet that to mca papers . pls m very thankful to u if could do it. my id is sudheerbm_95@rediffmail.com,sudheer21123@rediffmail.com

pgcet papers plzzz send pgcet papers for electronics and communication 2 my email id.. shru_suma16@yahoo.co.in

pgcet question papers hi, friends,,can u send me previous years pgcet qp please....or inform me author

model question papers pls send me pgcet question papers of civil engineering. if any solved pls send that one also and my e-mail id is monu_civil@yahoo.co.in :wink: [/u]

can u please send me the previous pgcet-mca question papers and also the model q-papers.. thanks in advance, yathendra.

About Previous papers Hai dear friends plz send me all the previous mechnical science pgcet papers Thank u :lol:

requesting for pgcet model question papers hi. iam shivananda fro Bangalore, i have applied for pgcet exam which is on july 12th 2009, so im looking for model question papers, and also i need the details of the study materials.. so kindly do the need.. looking for your reply....

Hi you can find previous year papers in the PGCET section of this website. studentschillout [dot] com

pgcet-mtech plz do send me previous years question papers of pgcet-mtech . my mail id is veda_ecs@yahoo.co.in

Could u pls send me a PGCET M.tech(ELECTORNICS) model papers Could u pls send me a PGCET M.tech(ELECTORNICS) model papers

hey cud u pls send the pgcet all the previous years quetion papers of MBA to my e.mail id .mY E.MAIL ID id is bharath1a1@yahoo.co.in

HI HI can anyone post me PG set model paper or the syllubus covered for IT paper.My mail id sreelaxmi_reddy18@yahoo.co.in

pgecet 2010 question paper 1) time complexity for merge sort is 2) a fair of six dice is thrown. what is the probability that the odd number followed by even number 3)coverting run time to complole time is 4)related to tautolody some expressins 5)p_> q= pand ned q 6) six sided convex polygon cut into 4 triangles without cross in no of ways. 7)worst case sor for o(n2) 8) relatedt to osi layers 9)standard deviationof A& B is 4& 5 covariance 8. Find correlation coefficient

pgecet 2010 question paper 1. The density functions for X and Y are obtained from the joint density function In a manner analogous to the discrete case are called a) Marginal b) Covariance c) Conditional d)Correlation 2. If the total number of items is Odd and Equal to say n then, the value of Â½(n+1)th gives: a) The Mean b) The Median c)The Mode d) Harmonic Mean 3. The Harmonic Mean of 4,8,6 is a)8.853 b)8.583 c)5.853 d)6.853 4. The square of the Standard Deviation is called a)Mean b) variance c) Median d)Average Deviation 5. If the terms are clearly the successive terms in the expansion (q+p)n then the distribution is called a) Normal b)Binomial c)Poisson d)Gaussian 6. If n(A) = n, then P(A) will contain a) 2n elements b)2n-1 elements c)2p elements d)nn elements 7. If A&B are disjoint, then n(A U B) is equal to a) n(A) + n (B) b)n(A)-n(B) c)n(A).n(B) d)n(AXB) 8. Suppose f: A → B be a function such that f(x) = x, X A than f is called as a)Constant function b)Polynomial function c)Identity function d)Relationa function 9. Cn-1 + Cn is equal to a)2Cn b)Cn/2 c)Cn (n+1)/2 d)Cn (n-1)/2 10. Which one of the following algorithm design technique used in finding all pairs of sortest distances in a graph? a)Dynamic Programming b)Backtracking c)Greedy d)Divide & Conquer 11. The Time Complexity of the Merge Sort is: a) O(logn) b) O(n) c) O(nlogn) O(n2 ) 12. The best data structure to check whether an arithmetic expression has balanced parenthesis is: a) Queue b)Stack c)Tree d)List 13. The tightest lower bound on the number of comparisons in worst case for comparison based sorting is of the order of a) n b) n2 c) nlogn d)nlogn2 14. An m x n matrix A is said to be space if: a) many of its elements are non-zero b)many of its elements are zero c) many of its elements are unit d)many of its elements are negative 15. The node of the linked list contains at least two fields: a) One for structure part & one for next pointer b) One for information part & one for structure part c) One for information part & one for next pointer d) One for pointer part & one for the index of the array 16. Each operator in a postfix string referes to the: a)Next operand in the string b)Previous operand in the string c)Next two operand in the string d)Previous two operands in the string 17. Following algorithm performs: { for( i = n; i>1 ; i--) { t = a; a = a[l]; a[l] = t; adjust (a,l,-n); } } a) Merge Sort b) bubble sort c)Quick sort d) heap sort 18. If L is L(A) for some DFA A, then L is said to be: a) Transition function b)Extended Transition function c) Regular Language d)Irregular Language 19. 19) If â€˜wâ€™ is of length â€˜nâ€™, & the NFA has â€˜sâ€™ states, then the running time of this algorithm is a) O(ns2) b) O(ns) c)O(s2) d)O(s) 20. The function h given by h(0) = abb and h(1) = ba is a homomorphism, then h(1011) is equal to: a)abababab b)babababa c)abbbabaabb d)baabbbaba === Visit Back to see rest of the questions =====

pgecet que 1. The density functions for X and Y are obtained from the joint density function In a manner analogous to the discrete case are called a) Marginal b) Covariance c) Conditional d)Correlation 2. If the total number of items is Odd and Equal to say n then, the value of Â½(n+1)th gives: a) The Mean b) The Median c)The Mode d) Harmonic Mean 3. The Harmonic Mean of 4,8,6 is a)8.853 b)8.583 c)5.853 d)6.853 4. The square of the Standard Deviation is called a)Mean b) variance c) Median d)Average Deviation 5. If the terms are clearly the successive terms in the expansion (q+p)n then the distribution is called a) Normal b)Binomial c)Poisson d)Gaussian 6. If n(A) = n, then P(A) will contain a) 2n elements b)2n-1 elements c)2p elements d)nn elements 7. If A&B are disjoint, then n(A U B) is equal to a) n(A) + n (B) b)n(A)-n(B) c)n(A).n(B) d)n(AXB) 8. Suppose f: A → B be a function such that f(x) = x, X A than f is called as a)Constant function b)Polynomial function c)Identity function d)Relationa function 9. Cn-1 + Cn is equal to a)2Cn b)Cn/2 c)Cn (n+1)/2 d)Cn (n-1)/2 10. Which one of the following algorithm design technique used in finding all pairs of sortest distances in a graph? a)Dynamic Programming b)Backtracking c)Greedy d)Divide & Conquer 11. The Time Complexity of the Merge Sort is: a) O(logn) b) O(n) c) O(nlogn) O(n2 ) 12. The best data structure to check whether an arithmetic expression has balanced parenthesis is: a) Queue b)Stack c)Tree d)List 13. The tightest lower bound on the number of comparisons in worst case for comparison based sorting is of the order of a) n b) n2 c) nlogn d)nlogn2 14. An m x n matrix A is said to be space if: a) many of its elements are non-zero b)many of its elements are zero c) many of its elements are unit d)many of its elements are negative 15. The node of the linked list contains at least two fields: a) One for structure part & one for next pointer b) One for information part & one for structure part c) One for information part & one for next pointer d) One for pointer part & one for the index of the array 16. Each operator in a postfix string referes to the: a)Next operand in the string b)Previous operand in the string c)Next two operand in the string d)Previous two operands in the string 17. Following algorithm performs: { for( i = n; i>1 ; i--) { t = a; a = a[l]; a[l] = t; adjust (a,l,-n); } } a) Merge Sort b) bubble sort c)Quick sort d) heap sort 18. If L is L(A) for some DFA A, then L is said to be: a) Transition function b)Extended Transition function c) Regular Language d)Irregular Language 19. 19) If â€˜wâ€™ is of length â€˜nâ€™, & the NFA has â€˜sâ€™ states, then the running time of this algorithm is a) O(ns2) b) O(ns) c)O(s2) d)O(s) 20. The function h given by h(0) = abb and h(1) = ba is a homomorphism, then h(1011) is equal to: a)abababab b)babababa c)abbbabaabb d)baabbbaa

hi. iam shivananda fro Bangalore, i have applied for pgcet exam which is on july 12th 2009, so im looking for model question papers, and also i need the details of the study materials.. so kindly do the need.. looking for your reply...

Hello sir,plzzzzzzzz can you mail me the previous years mca entrance exam papers.I have completed my BSc in cs.If you mail me previous years papers entrance exam papers that will going to help me. plz mail me saaima_91@yahoo.co.in

Hello sir,plzzzzzzzz can you mail me the previous years mca entrance exam papers.I have completed my BSc in cs.If you mail me previous years papers entrance exam papers that will going to help me. plz mail me saaima_91@yahoo.co.in

pgcet question papers please send me the PGCET model question paper plz i need that so please send me as early as possibel. send that to my mail id k