#1




Master of Computer Applications (MCA) entrance exams in andhra pradesh eligibility
University Kakinada in MCA course so can you provide me details about this course ? 
#2




Re: Master of Computer Applications (MCA) entrance exams in andhra pradesh eligibilit
Here I am providing you details about MCA course of Jawaharlal Nehru Technological University Kakinada:
MCA – Master of Computer Applications Course Duration: Master of Computer Applications (MCA) is a three years course. It includes of six semesters. Eligibility: Candidate must be Graduates in Engineering, Science or Commerce with Mathematics or Statistics as one of the subject at 10+2 Level /its equivalent are eligible for the MCA Course at Jawaharlal Nehru Technological University, Kakinada. About entrance test: Though the student’s rank at the ICET (Integrated Common Entrance Test) is important for admission into MCA, but equal importance to each student’s background in Computing, software project/applications experience, or any other work experience relevant to Information Technology is given. MCA Course at JNTU Kakinada includes the study, project work and applications on major softwares and technologies like Microsoft Visual Studio 6.0 Novell Netware 5.1 Server Novell Netware 4.1 Server Windows NT Server 4.0 Oracle 9i Server Boroland Turbo C++ SCO Unix 5.0.6 Enterprise Rational Rose Enterprise Edition .NET, ASP & Java Syllabus of MCA JNTU: C PROGRAMMING AND DATA STRUCTURES UNIT I Introduction to Computers, Some novice HW and SW concepts, Algorithm / pseudo code, flowchart, program development steps, Introduction to various IDE’s and their use in C program development, structure of C program, A Simple C program, identifiers, basic data types and sizes, Constants, variables, arithmetic, relational and logical operators, increment and decrement operators, conditional operator, bitwise operators, assignment operators, expressions, type conversions, conditional expressions, precedence and order of evaluation. Control structures such as if, goto , labels, and switch statements. UNIT II Loops while, dowhile and for statements, break, continue, programming examples. Arrays  concepts, declaration, definition, accessing elements, storing elements, Strings and string manipulations, 1 D arrays other than strings, 2D character arrays – 2D arrays other than character arrays – Multidimensional arrays – Practical examples to expose Engineering problems. UNIT III Functions, basics, parameter passing, storage classes extern, auto, register, static, scope rules, block structure, user defined functions, standard library functions, recursive functions, header files, C preprocessor, example c programs. Passing 1D arrays, 2D arrays , and functions. UNIT IV Pointers concepts, initialization of pointer variables, pointers and function arguments, passing by address –dangling memory, dangling memory, address arithmetic, Character pointers and functions, pointers to pointers, pointers and multidimensional arrays, dynamic memory managements functions, command line arguments, C program examples. UNIT V Derived types structures declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to structures, self referential structures, unions, typedef, bitfields, Input and output – concept of a file, text files and binary files, Formatted I/o, file I/o operations, C program examples. UNIT VI Introduction to Data Structures – Time Complexity – Space Complexity – Pattern matching – naive method – Robin Karp Algorithm  Searching – Linear and binary search methods, sorting – Bubble sort, selection sort, Insertion sort, Quick sort, merge sort. UNIT VII Introduction to data structures, single linked lists, doubly linked lists, circular list, representing stacks and queues in C using arrays and linked lists, infix to post fix conversion, postfix expression evaluation. Adding two large integers using linked lists. UNIT VIII Trees Binary tress, terminology, representation, traversals, Graphs  terminology, representation, graph traversals (dfs & bfs) – Warshalls – Dijkstra – Kruskal – Prims Algorithms. Only Algorithms TEXT BOOKS: 1. C and Data Structures: A Snap Shot Oriented Treatise Using Live Engineering Examples, N.B. Venkateswarlu & E.V. Prasad, S Chand & Co, 2009. 2. Computer science, A structured programming approach using C, B.A. Forouzan and R.F. Gilberg, Third edition, Thomson. Contact details: JNTU Kakinada, AP 040 2315 8661 • Map:
__________________
Answered By StudyChaCha Member 
Sponsored Links 
#4




Re: Master of Computer Applications (MCA) entrance exams in andhra pradesh eligibilit
Andhra Pradesh Integrated Common Entrance Test (APICET) for admission into M.B.A. and M.C.A. courses is conducted by Andhra University, Visakhapatnam.
Eligibility Criteria Candidates should be Indian Nationals Candidates should have passed recognized Bachelors Degree examination of minimum three years duration. Candidates must secure at least 50% marks (45% marks in case of reserved categories) in the qualifying examination with Mathematics at 10+2 level. Candidates who are appearing for the final year degree examination eligible to appear for APICET. Qualifying marks in APICET: 25% marks . No minimum marks are prescribed for SC/ST candidates. Syllabus for exam : SectionA: Analytical Ability: 75Q (75 Marks) 1. Data Sufficiency: 20Q (20 Marks) A question is given followed by data in the form of two statements labeled as i and ii. If the data given in i alone is sufficient to answer the question then choice (1) is the correct answer. If the data given in ii alone is sufficient to answer the question then choice (2) is the correct answer. If both i and ii put together are sufficient to answer the question but neither statement alone is sufficient, then choice (3) is the correct answer. If both i and ii put together are not sufficient to answer the question and additional data is needed, then choice (4) is the correct answer. 2. Problem Solving 55Q (55 Marks) a) Sequences and Series 25Q (25 Marks) Analogies of numbers and alphabet, completion of blank spaces following the pattern in a:b::c:d relationship; odd thing out: missing number in a sequence or a series. b) Data Analysis 10Q (10 Marks) The data given in a Table, Graph, Bar diagram, Pie Chart, Venn Diagram or a Passage is to be analyzed and the questions pertaining to the data are to be answered. c) Coding and Decoding Problems 10Q (10 Marks) A code pattern of English Alphabet is given. A given word or a group of letters are to be coded or decoded based on the given code or codes. d) Date, Time & Arrangement Problems 10Q (10 Marks) Calendar problems, clock problems, blood relationships, arrivals, departures and schedules, seating arrangements, symbol and notation interpretation. Section B: Mathematical Ability 75Q (75 Marks) 1. Arithmetical Ability 35Q (35 Marks) Laws of indices, ratio and proportion; surds; numbers and divisibility, l.c.m. and g.c.d; Rational numbers, Ordering.; Percentages; Profit and loss; Partnership, Pipes and cisterns, time, distance and work problems, areas and volumes, mensuration, modular arithmetic. 2. Algebraical and Geometrical Ability 30Q (30 Marks) Statements, Truth tables, implication converse and inverse, TautologiesSets, Relations and functions, applications – Equation of a line in different forms. Trigonometry – Trigonometric ratios, Trigonometric ratios of standard angles, (0°, 30°, 45°, 60°, 90°, 180°): Trigonometric identities: sample problems on heights and distances, Polynomials; Remainder theorem and consequences; Linear equations and expressions; Progressions, Binomial Theorem, Matrices, Notion of a limit and derivative; Plane geometry – lines, Triangles, Quadrilaterals, Circles, Coordinate geometrydistance between points. 3. Statistical Ability: 10Q (10 Marks) Frequency distributions, Mean, Median, Mode, Standard Deviations, Correlation, simple problems on Probability. SectionC: Communication Ability: 50Q (50 Marks) Objectives of the Test Candidates will be assessed on the ability to 1. identify vocabulary used in the daytoday communication. 2. understand the functional use of grammar in daytoday communication as well as in the business contexts. 3. identify the basic terminology and concepts in computer and business contexts (letters, reports, memoranda, agenda, minutes etc.). 4. understand written text and drawing inferences. Part 1. Vocabulary 10Q (10M) Part 2. Business and Computer terminology 10Q (10M) Part 3. Functional Grammar 15Q (15M) Part 4. Reading Comprehension (3 Passages) 15Q (15M)
__________________
Answered By StudyChaCha Member 