2023 2024 Student Forum > Management Forum > Main Forum

 
  #1  
3rd June 2015, 09:54 AM
Unregistered
Guest
 
Syllabus for PGCET for CSE

Can you tell me about the syllabus of Karnataka Examinations Authority Post Graduate Common Entrance Test (KEA PGCET) as I will be taking admission in M.Tech in Computer Science Engineering (CSE)? Provide me the syllabus for PGCET for CSE in PDF format?
Similar Threads
Thread
Karnataka PGCET Syllabus
Karnataka PGCET Syllabus For ECE
PGCET M.Tech syllabus
PGCET Karnataka Syllabus For CSE
Karnataka PGCET CSE Syllabus
PGCET Syllabus
PGCET Karnataka for MBA Syllabus
PGCET CSE Syllabus
PGCET Electrical Syllabus
Karnataka PGCET MBA Syllabus
OU PGCET Syllabus
Syllabus For PGCET MCA
Karnataka PGCET ECE Syllabus
Syllabus for PGCET ECE
Syllabus of CSE PGCET
PGCET ECE branch syllabus
Syllabus of MCA PGCET
Karnataka PGCET MCA Syllabus
PGCET Pharmacy Syllabus
Provide Syllabus for PGCET after ECE
  #2  
11th June 2018, 01:12 PM
Unregistered
Guest
 
Re: Syllabus for PGCET for CSE

Can you provide me the syllabus for the Entrance Exam - PGCET - Computer Science & Engineering conducted by KEA (Karnataka Examinations Authority)?
  #3  
11th June 2018, 01:13 PM
Super Moderator
 
Join Date: Aug 2012
Re: Syllabus for PGCET for CSE

The syllabus for the Entrance Exam - PGCET - Computer Science & Engineering conducted by KEA (Karnataka Examinations Authority) is as follow:

Engineering Mathematics: Mathematical Logic: Propositional Logic, First Order Logic.

Probability: Conditional Probability, Mean, Median, Mode and Standard Deviation, Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations, Functions; Groups; Partial Orders; Lattice; Boolean algebra.

Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotic.

Data Structures and Algorithms : Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph; Tree and graph traversals, connected components, Spanning trees, shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer);Asymptotic analysis (best, worst, average case) of time and space, Upper and Lower bounds on the complexity of specific problems, NP-completeness

Syllabus PGCET - Computer Science & Engineering Karnataka Examinations Authority





Quick Reply
Your Username: Click here to log in

Message:
Options




All times are GMT +5. The time now is 03:23 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4