UNDERSTANDING JFET

UNDERSTANDING BJT

JFET CHARECTERISTICS

sYLLABUS FOR III DESCRIPTIVE CDS EXAM AND ONLINE CDS EXAM

SYLLABUS FOR III DESCRIPTIVE CDS EXAM
Click here to download cds april-may 2007 exam papers
The syllabus for III descriptive cds exam is follows
1) April-may 2007 exam papers ( 15marks will come)
2) 15 marks will come from the following questions
a) stack operations
b) Different types of data structures.
c) Postfix evaluation
d) Infix to postfix conversion
e) Implementation of various operations on queue and circular queue
f) Aplications of queues and stacks
g) Implementation of stacks using linked lists (pointers)
h) Circular double linked list theory and programs
i) Give a brief note about different representations of a binary tree
j) Define graph. Explain the properties of a graph.
k) Explain DFS algorithm and BFS algorithm with examples.
l) Explain inorder, preorder and postorder traversals algorithms.
SYLLABUS FOR III ONLINE CDS EXAM
A) 6th unit (searching and sorting techniques)
B) 7th unit (Stacks, queues and linked lists)
c) 8th unit (Trees and graphs)

ECE-A EXTERNAL LAB EXAM DATES

ENGLISH 17-05-08
CP LAB 19-05-08
EDC LAB 20-05-08 AND 21-04-08
ITW LAB 22-05-08

ENJOY THE SUBJECT

1)-
Protons attacked electrons(attractive forces) .A superhero came and saved them.

Electrons asked “Who are you?”.

He said”Iam bond” “chemical bond”


2)-
Capacitor and inductor were arguing about their blocking capacities of DC and AC
Resistance interfered and said”you make me high I will block you both

stacks slide show

SLIDE SHOW OF STACKS

NEW ACADEMIC BLOG

TO GET MORE LINKS
VISIT

Data structures programs

click here to view or download the following data structures programs
Infix to postfix conversion
postfix evaluation
queue
circular queue