TS PGECET Syllabus for Computer Science & Information Technology (CS) gives details of TS PGECET exam syllabus. Telangana conducts PG Engineering Entrance Exams for admission into M.Tech in various private engineering colleges in Telangana. For detail about the pattern of exam and general dates follow TSPGECET details. For details about colleges and fee please visit M.Techcutoff tools at InI.<\/p>\n
The Syllabus for TS PGECET Computer Science & Information Technology (CS) is as follows<\/p>\n
Engineering Mathematics:<\/strong><\/p>\n Discrete Mathematics:<\/strong> Propositional and first order logic. Sets, relations, functions, partial orders and lattices.\u00a0Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating\u00a0functions.<\/p>\n Linear Algebra:<\/strong> Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU\u00a0decomposition. Computer Science and Information Technology.<\/strong><\/p>\n Digital Logic:<\/strong> Boolean algebra. Combinational and sequential circuits. Minimization. Number representations\u00a0and computer arithmetic (fixed and floating point).<\/p>\n Computer Organization and Architecture:<\/strong> Machine instructions and addressing modes. ALU, data\u2010path and\u00a0control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I\/O interface\u00a0(interrupt and DMA mode).<\/p>\n Programming and Data Structures:<\/strong> Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees,\u00a0binary search trees, binary heaps, graphs.<\/p>\n Algorithms<\/strong>: Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design\u00a0techniques: greedy, dynamic programming and divide\u2010and\u2010conquer. Graph search, minimum spanning trees,\u00a0shortest paths.<\/p>\n Theory of Computation<\/strong>: Regular expressions and finite automata. Context-free grammars and push-down\u00a0automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.<\/p>\n Compiler Design<\/strong>: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code\u00a0generation.<\/p>\n Operating System<\/strong>: Processes, threads, inter\u2010process communication, concurrency and synchronization. Deadlock.\u00a0CPU scheduling. Memory management and virtual memory. File systems.<\/p>\n Databases:<\/strong> ER\u2010model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal\u00a0forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.\u00a0Computer Networks : Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,\u00a0switching. IPv4\/IPv6, routers and routing algorithms (distance vector, link state). TCP\/UDP and sockets,\u00a0congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates,\u00a0firewalls.<\/p>\n Software Engineering:<\/strong> Software process, data flow diagram, UML diagrams, life cycle, design, coding, testing,\u00a0implementation, maintenance.<\/p>\n 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.<\/p>\n Do share this with friends and in case of questions please feel free to drop the question in comments.<\/p>\n","protected":false},"excerpt":{"rendered":" TS PGECET Syllabus for Computer Science & Information Technology (CS) gives details of TS PGECET exam syllabus. Telangana conducts PG Engineering Entrance Exams for admission into M.Tech in various private […]<\/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":[62],"tags":[],"class_list":["post-2647","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/2647","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=2647"}],"version-history":[{"count":3,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/2647\/revisions"}],"predecessor-version":[{"id":2700,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/2647\/revisions\/2700"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=2647"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=2647"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=2647"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nCalculus:<\/strong> Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
\nProbability<\/strong>: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median,\u00a0mode and standard deviation. Conditional probability and Bayes theorem.<\/p>\n