Part-I
SBI PO 15th June 2014 Evening Shift Questions. ~ pas dans
- English
- Data Interpretation
- Reasoning
- General Awareness
- Descriptive
SBI PO 15th June 2014 Evening Shift Questions. ~ pas dans
SBI PO online exam held on 15 jun 14 morning
Part-I
Part-II
SBI PO 15th June 2014 Morning Shift Questions. ~ pas dans
Part-I
- English
- Data Interpretation
- Reasoning
- General Awareness
Part-II
- Descriptive
SBI PO 15th June 2014 Morning Shift Questions. ~ pas dans
Computer Science & Information Technology (CS)
PGECET-2014
Engineering Mathematics
Probability and Statistics:
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.
Linear Algebra: Algebra of matrices,
determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical Methods: LU decomposition
for systems of linear equations; numerical solutions of non-linear algebraic
equations by Secant, Bisection and Newton-Raphson Methods; Numerical
integration by trapezoidal and Simpson's rules.
Calculus: Limit, Continuity &
differentiability, Mean value Theorems, Theorems of integral calculus,
evaluation of definite & improper integrals, Partial derivatives, Total
derivatives, maxima & minima.
Computer Science and Information Technology
Graph Theory: Connectivity;
spanning trees; Cut vertices & edges; covering; matching; independent sets;
Colouring; Planarity; Isomorphism.
Mathematical Logic: Propositional
Logic; First Order Logic.
Digital Logic: Logic functions,
Minimization, Design and synthesis of combinational and sequential circuits;
Number representation and computer arithmetic (fixed and floating point).
Computer Organization and Architecture: Machine instructions and addressing modes, ALU and
data-path, CPU control design, Memory interface, I/O interface (Interrupt and
DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structures:
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding;
Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search
trees, Binary heaps.
Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis;
Design: Greedy approach, Dynamic programming, Divide-and conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NP-hard, NP-complete.
Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis;
Design: Greedy approach, Dynamic programming, Divide-and conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NP-hard, NP-complete.
Theory of Computation: Regular
languages and finite automata, Context free languages and Push-down automata,
Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design: Lexical analysis,
Parsing, Syntax directed translation, Runtime environments, Intermediate and
target code generation, Basics of code optimization.
Operating System: Processes,
Threads, Inter-process communication, Concurrency, Synchronization, Deadlock,
CPU scheduling, Memory management and virtual memory, File systems, I/O
systems, Protection and security.
Databases: ER-model, Relational model
(relational algebra, tuple calculus), Database design (integrity constraints,
normal forms), Query languages (SQL), File structures (sequential files,
indexing, B and B+ trees), Transactions and concurrency control.
Information Systems and Software Engineering: information gathering, requirement and feasibility
analysis, data flow diagrams, process specifications, input/output design,
process life cycle, planning and managing the project, design, coding, testing,
implementation, maintenance.
Computer Networks: ISO/OSI stack,
LAN technologies (Ethernet, Token ring), Flow and error control techniques,
Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4),
Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts
of hubs, switches, gateways, and routers. Network security basic concepts of
public key and private key cryptography, digital signature, firewalls.
Web technologies: HTML, XML, basic
concepts of client-server computing.
*****
Details About Book:
Title: MCQs in Computer Science
Author: Timothy J Williams
Publications: McGraw Hill
Pages: 1 - 287
To Download the Book Click HERE
(or)
http://www.ziddu.com/download/18609164/MCQ.pdf.htmlUseful for all Computer Competitive Exams , Interviews and for PGECET exam also
PGECET-2014
Post-Graduate Engineering Common Entrance Test
Post Graduate Engineering Common Entrance Test (PGECET) is a AP State Level Common Entrance Test for admission into regular PG Courses in Engineering, Technology, Architecture, Pharmacy and Planning (ME / M.Tech. / M.Pharmacy / M.Arch / Graduate level Pharm-D (Post Baccalaureate)) courses for the academic year 2014-2015 conducted by University College of Engineering, Osmania University on behalf of A.P. State Council of Higher Education (APSCHE), a statutory Body of the Government of A.P., Hyderabad.
PATTERN OF PGECET-2014 ENTRANCE TEST
- PGECET-2014 examination Question paper will be in English.
- All the question papers of PGECET-2014 will be of objective type with multiple choice questions.
- Duration of the AP PGECET will be 2 hours and Total number of questions in paper are 120,each carry 1 mark .No negative marks.
- The cut-off mark in the Common Entrance Test is 25% , in case of SC/ST there is no minimum marks.
- Candidates have to mark the correct answer by darkening the appropriate bubble against each question on an Optical Mark Reader (OMR) with Black / Blue ink ball point pen only.
- OMR Answer Sheets will be supplied along with the Question Booklet.
The Hall-Tickets are to be downloaded from the website www.appgecet.org. without Hall-Tickets the candidate will not be allowed into the test centre.
The Sample model papers reference links are available here
Model Question Link CLICK HERE
PGECET CS-2010 CLICK HERE
MASTER OF COMPUTER SCIENCE AND APPLICATION (MCA)
Course Description:
Master of Computer
Applications (MCA) is a three years course. It includes of six
semesters. 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. Though the student’s rank at
the ICET (Integrated Common Entrance Test) is the prerequisite for
admission into MCA, we also give equal importance to each student’s
background in Computing, software project/applications experience, or
any other work experience relevant to Information Technology.
Syllabus
MCA Syllabus [2009-2010]
MCA Syllabus Regulation R13
Sorting Techniques
The process of getting data elements into order is
called sorting.
There are many sorting algorithms available. But no
one algorithm for sorting is best in all cases. Ideally, one uses different algorithms
depending on whether one is sorting a small set or a large set, on whether the
individual elements of the set occupy a lot of storage (so that moving them
around in memory is time consuming), on how easy it is to the other, and so on.
That means different application requires different sorting methods.
The sorting
methods are broadly categorized into two
Internal Sorting:
In internal sorting, all the data elements to be sorted are present in
the main memory.
External Sorting: These techniques are applied to
large data sets which reside on secondary devices and cannot be complexity fit
in the main memory.
Sorting algorithms can be computational expensive, particularly on data sets become large. They can be classified into:
- Simple algorithms
- Sophisticated Algorithms
To Sort’ N’ data elements simple techniques require
the order of N2 O (N2) comparisons. Depending on the
number of swapping and moving a portion of data, sorting algorithm requires
considerable amount of processing time. Thus, minimize swapping or moving of
data.
Simple Algorithms: Bubble sort, Insertion Sort,
Selection Sort.
Sophisticated Algorithms: Quick Sort, Merge Sort,
Heap Sort etcUses of Data structures
Data structures determine the logical linkages
between data elements, and effect the physical processing of data. Data
structures knowledge is required for people who design and develop software for
either commercial or technical application. It is also required of people who
design and develop system software.
Example: Operating System, Language compiler, DBMS
packages & Communication Processors.
Classification of Data Structures
Data structures are classified into Two types:
Logical data structures:
Data structures are very important in computer
systems. In a program every variable is
of some explicitly or implicitly defined data structure, which determines the
set operations that are legal upon that variable and set of values that are
legal to it. There may be several physical representations on storage is
possible for each logical structure
Primitive & Simple data structures
Integer, character, float, double are called
primitive data structures because they are not composed of other data
structures. Data structures which are constructed from one or more primitives
are called simple data structures.
Example: Strings, Arrays, Pointers, structures etc.
Linear and Non-Linear Data Structures:
Simple data structures can be combined in various
ways to form more complex structures. The two fundamentals kinds of more
complex structures are linear and non-linear depending on the complexity of the
logical relationship they represents
Linear Data structures: A data structure is said to
be linear if the linear relationship between the elements represented by means
of sequential memory location.
Example: Stack, Queues and linear linked lists.
Non-Linear Data Structures: A data structure is said
to be non-linear if the linear between the elements represented by means of
pointers or link
Example: Trees,
Graphs
COURSE
STRUCTURE
w.e.f. 2013
MCA I SEM
Code
|
Subject
|
T
|
P
|
MCA13. 1.1
|
C PROGRAMMING AND
DATA STRUCTURES
|
4
|
-
|
MCA13. 1.2
|
DIGITAL LOGIC AND
COMPUTER ORGANIZATION
|
4
|
-
|
MCA13. 1.3
|
DISCRETE
MATHEMATICAL STRUCTURES AND GRAPHTHEORY
|
4
|
-
|
MCA13. 1.4
|
PROBABILITY AND
STATISTICAL APPLICATIONS
|
4
|
-
|
MCA13. 1.5
|
ACCOUNTING AND
FINANCIAL MANAGEMENT
|
4
|
-
|
MCA13. 1.6
|
ENGLISH LANGUAGE
COMMUNICATION SKILLS LAB
|
3
|
|
MCA13. 1.7
|
C PROGRAMMING AND
DATA STRUCTURES LAB
|
-
|
3
|
MCA13. 1.8
|
DIGITAL LOGIC AND
COMPUTER ORGANIZATION LAB
|
-
|
3
|
MCA II
SEM
Code
|
Subject
|
T
|
P
|
MCA13.2.1
|
OOPS THROUGH JAVA
|
4
|
-
|
MCA13.2.2
|
OPERATING SYSTEMS
|
4
|
-
|
MCA13.2.3
|
ORGANIZATIONAL
STRUCTURES AND HUMAN RESOURCE MANAGEMENT
|
4
|
-
|
MCA13.2.4
|
OPTIMIZATION TECHNIQUES
|
4
|
-
|
MCA13.2.5
|
BUSINESS DATA
PROCESSING
|
4
|
-
|
MCA13.2.6
|
OOPS THROUGH JAVA
LAB
|
-
|
3
|
MCA13.2.7
|
BUSINESS DATA PROCESSING LAB
|
-
|
3
|
MCA III
SEM
Code
|
Subject
|
T
|
P
|
MCA13.3.1
|
DATA BASE
MANAGEMENT SYSTEMS
|
4
|
-
|
MCA13.3.2
|
COMPUTER
COMMUNICATION
|
4
|
-
|
MCA13.3.3
|
UNIX PROGRAMMING
|
4
|
-
|
MCA13.3.4
|
MANAGEMENT
INFORMATION SYSTEM
|
4
|
-
|
MCA13.3.5
|
DESIGN AND ANALYSIS
OF ALGORITHMS
|
4
|
-
|
MCA13.3.6
|
DATA BASE
MANAGEMENT SYSTEMS LAB
|
-
|
3
|
MCA13.3.7
|
UNIX PROGRAMMING
LAB
|
-
|
3
|
MCA. IV
SEM
Code
|
Subject
|
T
|
P
|
MCA13.4.1
|
SOFTWARE
ENGINEERING
|
4
|
-
|
MCA13.4.2
|
ADVANCED JAVA &
WEB TECHNOLOGIES
|
4
|
-
|
MCA13.4.3
|
DATA WAREHOUSING
AND MINING
|
4
|
-
|
MCA13.4.4
|
ELECTIVE-I
MCA13.4.4.1 MOBILE
COMPUTING
MCA13.4.4.2 HUMAN
COMPUTER INTERACTION
MCA13.4.4.3 ERP
& SUPPLY CHAIN MANAGEMENT
|
4
|
-
|
MCA13.4.5
|
ELECTIVE-II
MCA13.4.5.1
SOFTWARE TESTING METHODOLOGIES
MCA13.4.5.2
ARTIFICIAL INTELLIGENCE
MCA13.4.5.3
COMPUTER GRAPHICS
|
4
|
-
|
MCA13.4.6
|
ADVANCED JAVA &
WEB TECHNOLOGIES LAB
|
-
|
3
|
MCA13.4.7
|
DATA WAREHOUSING AND MINING LAB
|
-
|
3
|
MCA. V
SEM
Code
|
Subject
|
T
|
P
|
MCA13.5.1
|
INFORMATION SECURITY
|
4
|
-
|
MCA13.5.2
|
NETWORK PROGRAMMING
|
4
|
-
|
MCA13.5.3
|
OBJECT ORIENTED ANALYSIS AND
DESIGN (USING UML)
|
4
|
-
|
MCA13.5.4
|
ELECTIVE-III
MCA13.5.4.1 ANIMATION &
GAMING
MCA13.5.4.2 COMPUTER FORENSICS
MCA13.5.4.3 E-COMMERCE
|
4
|
-
|
MCA13.5.5
|
ELECTIVE-IV
MCA13.5.5.1 MIDDLE WARE
TECHNOLOGIES
MCA13.5.5.2 MULTIMEDIA APPLICATION DEVELOPMENT
MCA13.5.5.3 SOFTWARE PROJECT
MANAGEMENT
|
4
|
-
|
MCA13.5.6
|
UML LAB
|
-
|
3
|
MCA13.5.7
|
NETWORK PROGRAMMING LAB
|
-
|
3
|
MCA VI SEM
CODE
|
SUBJECT
|
MCA13.6.1
|
PROJECT SEMINAR
|
MCA13.6.2
|
DISSERTATION/ THESIS
EXCELLENT / GOOD /
SATISFACTORY/ NOT SATISFACTORY
|
Subscribe to:
Posts (Atom)
