{"id":2035,"date":"2016-09-15T08:55:24","date_gmt":"2016-09-15T08:55:24","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuk\/?p=2035"},"modified":"2016-09-15T08:55:24","modified_gmt":"2016-09-15T08:55:24","slug":"ap-pgecet-syllabus-computer-science-information-technology-cs","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuk\/ap-pgecet-syllabus-computer-science-information-technology-cs\/","title":{"rendered":"AP PGECET Syllabus for Computer Science &amp; Information Technology (CS)"},"content":{"rendered":"<p>AP PGECET Syllabus for Computer Science &amp; Information Technology (CS) gives details of AP PGECET exam syllabus. Andhra conducts PG Engineering Entrance Exams for admission into M.Tech in various private engineering colleges in Andhra. For detail about the pattern of exam and general dates follow AP PGECET details. For details about colleges and fee please visit M.Tech cut off tools at InI.<\/p><div class=\"a9916ad81d5189659b0bfae0b37c143c\" data-index=\"1\" style=\"float: none; margin:10px 0 10px 0; text-align:center;\">\n<ins class=\"adsbygoogle\"\r\n     style=\"display:block; text-align:center;\"\r\n     data-ad-layout=\"in-article\"\r\n     data-ad-format=\"fluid\"\r\n     data-ad-client=\"ca-pub-1181153414625576\"\r\n     data-ad-slot=\"9648548092\"><\/ins>\r\n<script>\r\n     (adsbygoogle = window.adsbygoogle || []).push({});\r\n<\/script>\n<\/div>\n\n<p>The Syllabus for AP PGECET Computer Science &amp; Information Technology (CS) is as follows<\/p>\n<p><strong>Engineering Mathematics<\/strong><\/p>\n<p><strong>Probability and Statistics<\/strong>: Probability, Conditional Probability; Probability Density Function, Mean, Median,\u00a0Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.<\/p>\n<p><strong>Set Theory &amp; Algebra<\/strong>: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.<\/p>\n<p><strong>Linear Algebra:<\/strong> Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.<\/p>\n<p><strong>Numerical Methods:<\/strong> LU decomposition for systems of linear equations; numerical solutions of non-linear\u00a0algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and\u00a0Simpson&#8217;s rules.<\/p>\n<p><strong>Calculus:<\/strong> Limit, Continuity &amp; differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of\u00a0definite &amp; improper integrals, Partial derivatives, Total derivatives, maxima &amp; minima.<\/p>\n<p><strong>Computer Science and Information Technology<\/strong><\/p>\n<p><strong>Combinatorics<\/strong>: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations;\u00a0asymptotic.<\/p>\n<p><strong>Graph Theory:<\/strong> Connectivity; spanning trees; Cut vertices &amp; edges; covering; matching; independent sets;\u00a0Colouring; Planarity; Isomorphism.<\/p>\n<p><strong>Mathematical Logic:<\/strong> Propositional Logic; First Order Logic.<\/p>\n<p><strong>Digital Logic<\/strong>: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits;\u00a0Number representation and computer arithmetic (fixed and floating point).<\/p>\n<p><strong>Computer Organization and Architecture:<\/strong> Machine instructions and addressing modes, ALU and data-path,\u00a0CPU control design, Memory interface, I\/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and\u00a0main memory, Secondary storage.<\/p>\n<p><strong>Programming and Data Structures:<\/strong> Programming in C; Functions, Recursion, Parameter passing, Scope,\u00a0Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.<\/p>\n<p><strong>Algorithms:<\/strong> Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case\u00a0analysis; Design: Greedy approach, Dynamic programming, Divide-and conquer; Tree and graph traversals,\u00a0Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best,\u00a0worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NPhard,\u00a0NP-complete.<\/p>\n<p><strong>Theory of Computation:<\/strong> Regular languages and finite automata, Context free languages and Push-down automata,\u00a0Recursively enumerable sets and Turing machines, Undecidability.<\/p>\n<p><strong>Compiler Design:<\/strong> Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and\u00a0target code generation, Basics of code optimization. Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock,\u00a0CPU scheduling, Memory management and virtual memory, File systems, I\/O systems, Protection and security.<\/p>\n<p><strong>Databases<\/strong>: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints,\u00a0normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions\u00a0and concurrency control.<\/p>\n<p><strong>Information Systems and Software Engineering:<\/strong> information gathering, requirement and feasibility analysis,\u00a0data flow diagrams, process specifications, input\/output design, process life cycle, planning and managing the\u00a0project, design, coding, testing, implementation, maintenance.<\/p>\n<p><strong>Computer Networks:<\/strong> ISO\/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control\u00a0techniques, Routing algorithms, Congestion control, TCP\/UDP and sockets, IP(v4), Application layer protocols\u00a0(icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security basic\u00a0concepts of public key and private key cryptography, digital signature, firewalls.<\/p>\n<p><strong>Web technologies:<\/strong> HTML, XML, basic concepts of client-server computing.<\/p>\n<p>All details and cutoffs for previous years are provided at Inspire n Ignite (InI). For all updates and please like us on Facebook and follow us on google plus.<br \/>\nDo share this with friends and in case of questions please feel free to drop the question in comments.<\/p>\n<div class=\"a9916ad81d5189659b0bfae0b37c143c\" data-index=\"2\" style=\"float: none; margin:10px 0 10px 0; text-align:center;\">\n<ins class=\"adsbygoogle\"\r\n     style=\"display:block; text-align:center;\"\r\n     data-ad-layout=\"in-article\"\r\n     data-ad-format=\"fluid\"\r\n     data-ad-client=\"ca-pub-1181153414625576\"\r\n     data-ad-slot=\"8060844699\"><\/ins>\r\n<script>\r\n     (adsbygoogle = window.adsbygoogle || []).push({});\r\n<\/script>\n<\/div>\n\n<div style=\"font-size: 0px; height: 0px; line-height: 0px; margin: 0; padding: 0; clear: both;\"><\/div>","protected":false},"excerpt":{"rendered":"<p>AP PGECET Syllabus for Computer Science &amp; Information Technology (CS) gives details of AP PGECET exam syllabus. Andhra conducts PG Engineering Entrance Exams for admission into M.Tech in various private [&hellip;]<\/p>\n","protected":false},"author":2259,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[10,2],"tags":[],"class_list":["post-2035","post","type-post","status-publish","format-standard","hentry","category-cse","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/2035","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/comments?post=2035"}],"version-history":[{"count":1,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/2035\/revisions"}],"predecessor-version":[{"id":2036,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/2035\/revisions\/2036"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/media?parent=2035"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/categories?post=2035"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/tags?post=2035"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}