Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

  • Cisco aptitute test questions (1)
  • Cisco interview questions (138)
  • Cisco placement papers (1)
  • Cisco technical test questions (15)



Cisco CCDA Interview Questions
Questions Answers Views Company eMail

What are the three commonly used methods of flow control used for handling network congestion? A. Buffering B. Source-quench messages C. Error checking D. Windowing

1 6755

Post New Cisco CCDA Interview Questions



Un-Answered Questions

Dear Sir/Mam Please send me a return under delhi vat for learning purpose Thank & Regards Sonu Kumar

804


How do cryptography-based keys ensure the validity of data transferred across the network?

3528


What are the methods in tiles flooring ? What are the methods in brick work? What are the methods in plastering ? What are the methods in wall tiling?

610


why you want this job (specially when you go for first interview and changing the industries)

1461


when & how interest on unsecured loan is calculated?

789






how do you manage the production space. what are the proactive methods you can take ?

815


State uses of different types of stsrters with different capacities of motors as below: a. up to 5HP b. above 5hp to 10hp c. above 10hp to 20hp d. above 20hp

728


what are the major componets of client server application?

916


What are the symptoms of broke piston ring?

2718


Distinguish functionalities of ASP in web design.

831


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

1953


What problems might be encountered if there were no accounting standards?

1709


4 men and 6 women can complete a work in 8 days, while 3 men and 7 women can complete it in 10 days. In how many days will 10 women complete it?

183


in the design of a rack and pinion with the pinion having a pitch of 4in and a teeth number of 45,how many teeth should a rack of length 196.850in have

1069


If a partner works as a dealer and distributor and have the same master data. How does the system identify if its a dealer or distributor function? Where is the differentiation done?

3803






Cisco CCDA Interview Questions
  • C (7)
  • Win32API (1)
  • PHP (1)
  • ASP (1)
  • CGI Perl (1)
  • Tcl (3)
  • TCP IP (7)
  • Protocols AllOther (10)
  • Networking Administration (14)
  • Networking AllOther (8)
  • Oracle General (1)
  • SQL Server (1)
  • Linux Commands (2)
  • Linux AllOther (2)
  • Unix Commands (2)
  • Unix AllOther (2)
  • Operating Systems General Concepts (1)
  • Manual Testing (5)
  • Mobile Testing (1)
  • Test Cases (1)
  • Core Java (2)
  • Business Objects (1)
  • Cognos (2)
  • SAP ABAP (2)
  • VLSI (2)
  • Client Server General (1)
  • Digital Certificates (2)
  • Cryptography General (1)
  • Electrical Engineering (8)
  • Electronics Communications (11)
  • Industrial Engineering (1)
  • Instrumentation (1)
  • Engineering AllOther (2)
  • Marketing Sales (2)
  • Accounting AllOther (6)
  • Everything Else AllOther (2)
  • Placement Papers (1)
  • CCNA (31)
  • CCDA (1)
  • UK Visa (1)
  • C Code (3)
  • Oracle Errors (1)